Keyhole symbol leads to text only Web siteKSU Department of Computer Science: Home   Kent State University: Home
Slogan: Stretching Computing Boundaries Through Research
Home   Graduate Program   Undergraduate Program   Faculty   Research   Resources   Student Life  
Dr. Baker
Dr. Bansal
Dr. Batcher
Dr. Breitbart
Dr. Dragan
Dr. Farrell
Dr. Khan
Dr. Lu
Dr. Maletic
Dr. Melton
Dr. Nesterenko
Dr. Peyravi
Dr. Potter
Dr. Rothstein
Dr. Ruttan
Dr. Volkert
Dr. Walker
Dr. Wang
     
 
Research Profile - Dr. Feodor Dragan
Feodor F. Dragan received the M.S. degree in Applied Mathematics 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 an Assistant Professor of Computer Science at Kent State University, Ohio. He has authored more than 70 refereed scientific publications. His research interests include design and analysis of algorithms, algorithmic graph and hypergraph theory, computational geometry, VLSI CAD, and combinatorial optimization. Home Page
Research areas
Design and analysis of algorithms
Algorithmic graph and hypergraph theory
Computational geometry, VLSI CAD, computational biology
Combinatorial optimization, discrete convexity and geometry of discrete metric spaces
Distance location problems and operations research, data analysis
Research projects
Efficient algorithms for problems related to distances in graphs, networks, polygons and other discrete metric spaces
Efficient compact routing and distance labeling schemes
Distance approximating trees
Domination-like problems in graphs and polygons
Tree structures in graphs and hypergraphs, graph decompositions
Probe interval graph recognition problem
Approximation algorithms for nonoverlapping local alignment problems
Funded projects
Efficient Algorithms on Graphs with Maximum Neighborhood Orderings and Related Elimination Orderings (1994-1996) - Volkswagen Foundation (VW) Project (in collaboration with A. Brandstädt (Rostock, Germany), H.-J. Bandelt (Hamburg, Germany), V. Chepoi (Marseille, France), and V. Voloshin (Kishinev, Moldova)).
Metric Optimization Problems in Discrete Structures (1996-1999) - German Research Community (DFG) Project (in collaboration with A. Brandstädt, Rostock, Germany).
Efficient algorithms for the center and diameter problems (2002 Summer Research Grant) - The Research Council of Kent State University.
 
A line
Department Research Groups
A line
A line
 
Kent State University, Department of Computer Science, Kent, Ohio, 44242-0001
Questions Email for General Questions Email for Questions about the Undergraduate Program Email for Questions about the Graduate Program Email the Webmaster Phone: 330-672-9980, Fax: 330-672-7824

Kent State University, Department of Computer Science, Kent, OH 44242-0001
Phone: 330-672-9980, Fax: 330-672-7824