Feodor F. Dragan
Scholar

Feodor F. Dragan

Google Scholar ID: U74_kMcAAAAJ
Kent State University
AlgorithmsTheoryGraphs
Citations & Impact
All-time
Citations
1,216
 
H-index
19
 
i10-index
45
 
Publications
20
 
Co-authors
19
list available
Contact
No contact links provided.
Publications
20 items
Browse publications on Google Scholar (top-right) ↗
Resume (English only)
Academic Achievements
  • Authored more than 150 refereed scientific publications. His h-index is 37, his i10-index is 91, his Erdős number is 2 (e.g., Feodor F. Dragan to Dieter Kratsch to Paul Erdős) and the total number of citations of his papers is more than 3930.
Research Experience
  • 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 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).
Education
  • 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.
Background
  • Research interests include the 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.