**Dr. Feodor F. Dragan**

Professor of Computer Science

Feodor F.
Dragan received the M.S. degree in Applied Mathematics and Computer Science from
Moldova State University, in 1985, and the PhD degree in Theoretical Computer
Science from the Belorussian Academy of Sciences, in 1990. He was an Assistant
and then an Associate Professor at the Mathematics and Computer Science
Department of Moldova State University from 1988 to 1999. From 1994 to 1999, he
was on leave of absence and worked in Germany as a Research Associate on a
Volkswagen Foundation (VW) project and on a German Research Community (DFG)
project. He was also awarded a DAAD Research Fellowship (Germany) from 1994 to
1995. During 1999 to 2000, he was a Research Associate
at the Computer Science Department of University of California, Los Angeles.
Since August 2000 he has been with Kent State University
and he is currently a Professor of Computer Science. He held visiting
positions in Germany (Technische Universitaet Berlin), in France (Universite de la Mediterranee, Marseille and
Universite Paris Diderot - Paris 7), in Norway (Universitetet i
Bergen), and in Chile (Universidad de Chile, Santiago).
He has authored more than 150 refereed scientific
publications. His research interests include design and analysis of network
algorithms, algorithmic graph and hypergraph theory, computational geometry,
computational biology, VLSI CAD, combinatorial optimization, discrete convexity
and geometry of discrete metric spaces, distance location problems and
operations research, data analysis.

My h-index is 36, my i10-index is 87, my Erdős number is 2 (e.g., Feodor F. Dragan to Dieter Kratsch to Paul Erdős) and the total number of citations of my papers is more than 3550.

v o
2009, Reachability, Routing and Distance Labeling Schemes in Graphs
with Applications in Networks and Graph Databases.
Tree-Like Structure in Graphs and Embedability to Trees.
Tree-Breadth of
Graphs with Variants and Applications
Slimness,
thinness and other negative curvature parameters of graphs
o
Addressing, Distance and Routing in Cubic Systems with Applications in
3D Cellular Networks.
Implementation of Addressing, Distance and Routing Labeling Schemes for
Triangular Systems.
Routing in wireless networks without geometry.
Frequency assignment in radio
networks: L(3,1,1)-labeling.
Maximum cliques and minimum colorings of chordal graphs via minimum
degree orderings.
Finding a
Minimum-Width Trounulus Covering a Set of Points on the Plane
Routing Among
Planetary Bodies o
v
v |