Dr. Feodor F. Dragan

 Associate 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 an Associate Professor of Computer Science. He has authored more than 100 refereed scientific publications. His research interests include design and analysis of network algorithms, algorithmic graph and hypergraph theory, computational geometry, computational biology, VLSI CAD, and combinatorial optimization.

o  Address

o  Curriculum Vitae

o  Publications

o  Teaching 

         oo Previous years                         

         oo   Spring 2008

 
 DESIGN & ANALYSIS OF ALGORITHMS
ST: ALGORITHMICS OF WIRELESS AD HOC NETWORKS
Syllabus
Syllabus

 

o Graduates

         oo PhD

1.      Irina Lomonosov, 2005, “Routing Schemes for Special Graph Classes”.

2.      Chenyu Yan, 2007, “Approximating Distances in Complicated Graphs by Distances in Simple Graphs With Applications”.

 

         oo MS

1.             Rashid Muhammad, 2003, “Parallel Voronoi Diagram” (co-advised).

2.             Chenyu Yan, 2004, “Additive Sparse Spanners for k-Chordal Graphs”.

3.             Sudha Elavarti, 2005, “Addressing, Distance and Routing in Cubic Systems with Applications in 3D Cellular Networks”.

4.             Mutasem Najdawi, 2005, “Implementation of Addressing, Distance and Routing Labeling Schemes for Triangular Systems”.

5.             Amit Borwankar, 2005,  “Nearest Neighbor Embracing Graph (NNEG) as a New Topology for Wireless Ad-hoc Networks “.

6.             George Powell, 2005, “Improvement algorithms for an industrial routing problem“.

7.             Tran Anh Tuan, 2006, “Analysis of two approximation algorithms for the Tree Flow Spanner Problem”.

8.             Raina Siddharth, 2006, “Finding a Spanning Tree Minimizing the Maximum Edge Load”.

9.         Rajesh Jadhav, 2007, “Routing in wireless networks without geometry”.

10.    Bafna, Nitin, 2007, “Labeling schemes for some location problems on trees”.

11.    Viyyure, Udaykiran V, 2008, “Frequency assignment in radio networks: L(3,1,1)-labeling”.

12.    Bhaduri, Sudipta, 2008, “Maximum cliques and minimum colorings of chordal graphs via minimum degree orderings”.

 

          oo MA

1.      Dwarakanath Raghunathan, 2005, “Connected Dominating Set as Backbone for Ad Hoc Wireless Networks”.

2.      Pankaj, Amitabh, 2007, “Heuristics for routing in internet-like graphs”.

 

o Current Students

 

1.            Xiang Yang, PhD Student, “Some algorithmic issues in wireless ad hoc networks” (Past Candidacy).

2.            Jitendra Mansharamani, MS Student, “Distributed and localized algorithms for some class of static sensor networks”.

3.            Rab Harbart, MS Student, “Dealing with cellular networks having holes”.

4.            Rahul Sehgal, MS Student, “Making greedy routing work”.

5.            Khasawneh, Samer, PhD Student, Area to be chosen.  

o  Links

           oo CS-COLLOQUIUM
Feodor F. Dragan
Last updated: May, 2008