Faculty & Staff


Our Department

  • 19 faculty (18 at Kent State University, 1 at Kent State University at Stark)

  • 291 undergraduate majors

  • 54 Masters students

  • 42 Doctoral students

  • 2 ACM Fellows (Batcher, Breitbart)

  • 1 ACM Distinguished Member (Walker)

  • Winner of IEEE Seymour Cray Award (Batcher)

In the past academic year our faculty have published ...

  • 31 conference papers

  • 8 journal papers

  • 1 textbook

The Department of Computer Science Administration, Faculty, and Staff invite your questions by email or phone. Questions regarding our undergraduate program should be emailed to ugradinfo@cs.kent.edu, and questions regarding our graduate program should be emailed to cs-gradinfo@cs.kent.edu.

Meet our Faculty and Staff
Feodor F. Dragan Professor and Graduate Coordinator fdragan@kent.edu
Phone: 330-672-9058
Department of Computer Science
Ph.D., Institute of Mathematics of the Belorussian Academy of Sciences, 1990.  Research interests include Design and analysis of algorithms, Algorithmic graph and hypergraph theory, Network design algorithms, Computational geometry, VLSI CAD, Computational biology, Combinatorial optimization, Discrete convexity and geometry of discrete metric space, Distance location problems and operations research, Data analysis

 

Some Recent Publications 

(extended list is available at http://www.cs.kent.edu/~dragan/publ.html)

  • Spanners in sparse graphs
    F.F. Dragan, F. Fomin and P. Golovach
    Journal of Computer and System Sciences, 77(6): 1108-1119 (2011)
  • Navigating in a graph by aid of its spanning tree
     F.F. Dragan and M. Matamala
    SIAM J. Discrete Math., 25(1): 306-332 (2011)
  • Summarizing transactional databases with overlapped hyperrectangles: theories and algorithms
    Y. Xiang, R. Jin, D. Fuhry, F.F. Dragan
    Data Min Knowl Disc., 23(2): 215-251 (2011)
  • Approximation of Minimum Weight Spanners for Sparse Graphs
    F.F. Dragan, F. Fomin and P. Golovach
    Theoretical Computer Science, 412(8-10): 846-852 (2011)
  • Network Flow Spanners
    F.F. Dragan and C. Yan
    Networks 56 (2010), 159-168.
  • Collective Tree Spanners in Graphs with Bounded Parameters
    F.F. Dragan and C. Yan
    Algorithmica 57 (2010), 22-43.
  • Constant Approximation Algorithms for Embedding Graph Metrics into Trees and Outerplanar Graphs
    V.D. Chepoi, F.F. Dragan, I. Newman, Y. Rabinovich, Y. Vaxès
    13th Intl. Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX 2010), Springer, 2010,  Lecture Notes in Computer Science 6302, pp. 95-109.
  • Compact and Low Delay Routing Labeling Scheme for Unit Disk Graphs
    C. Yan, Y. Xiang and  F.F. Dragan
    The Algorithms And Data Structures Symposium (WADS 2009), Springer, 2009, Lecture Notes in Computer Science, 5664, pp. 566–577.
  • Diameters, centers, and approximating trees of δ-hyperbolic geodesic spaces and graphs
    V.D. Chepoi, F.F. Dragan, B. Estellon, M. Habib and Y. Vaxes
    Proceedings of the 24th Annual ACM Symposium on Computational Geometry (SoCG 2008), June 9–11, 2008, College Park, Maryland, USA, pp. 59-68.
Room 254 MSB
tag line