CURRICULUM VITÆ of Feodor Dragan

Education

3/90	Ph.D. in Theoretical Computer Science,  Institute of Mathematics of the Belorussian Academy of Sciences, Minsk, Belarus  (prepared at Moldova State University, Kishinev, Moldova)
6/85	M.S. (with honors) in Applied Mathematics, Moldova State University, Dept. of Mathematics and Cybernetics,  Kishinev, Moldova
5/83	B.A. (with honors) in Applied Mathematics, Moldova State University, Dept. of Mathematics and Cybernetics,  Kishinev, Moldova

Professional background

08/04 -	Associate Professor of Computer Science, Department of Computer Science Kent State University
08/00 - 07/04	Assistant Professor of Computer Science, Department of Computer Science Kent State University
10/99 - 08/00	Research associate, University of California at Los Angeles  Computer Science Department  UCLA VLSI CAD Lab - ABKGROUP  / UCSD VLSI CAD Lab - ABKGROUP
12/96 - 9/99	Research associate, University of Rostock, Germany:  Research supported by the German Research Community (DFG)
10/96 - 11/96	Research associate, University of Rostock, Germany:  Research supported by the Volkswagen Foundation (VW)
10/94 - 7/95, 10/95 - 12/95	Research associate, University of Duisburg, Germany:  DAAD Research Fellowship, Host professor: Andreas Brandstädt
3/94, 6/94, 8/95 - 9/95	Research associate, University of Duisburg, Germany:  Research supported by the Volkswagen Foundation (VW)
7/95 - 9/99	Associate professor, Dept. of Mathematics and Cybernetics, Moldova State University
1/88 - 9/96	Research associate, Discrete Optimization Laboratory, Moldova State University
12/88 - 6/95	Assistant professor,  Dept. of Mathematics and Cybernetics, Moldova State University
2/82 - 7/85	Software engineer, Computer Center, Moldavian Academy of Sciences

Recent Visits and Visiting Positions

05/26/07 – 06/20/07	Algorithms Research Group, Department of Informatics, University of Bergen, Norway
06/25/07 – 09/30/07	Combinatorial Optimization & Graph Algorithms Group at the Technische Universität Berlin, Germany
10/01/07 – 12/20/07	Research Group on Algorithms and Combinatorics, Department of Computer Science at University Paris Diderot – Paris 7
10/18/07 – 10/24/07	Laboratoire d’Informatique Fondamentale de Marseille, Université de la Mediterranée, Marseille, France
05/10/08 – 07/10/08	Discrete Maths and Theoretical Computer Science group (DMTCS), University of Chile, Santiago, Chile
06/01/09 – 06/30/09	Laboratoire d’Informatique Fondamentale de Marseille, Université de la Mediterranée, Marseille, France

Research Interests
Design and analysis of algorithms, algorithmic graph and hypergraph theory, computational geometry, computational biology, network algorithms, VLSI CAD, combinatorial optimization, discrete convexity and geometry of discrete metric spaces, distance location problems and operations research, data analysis.

Recent Publications    (while at Kent State University; extended list is available at http://www.cs.kent.edu/~dragan/publ.html)

(see also DBLP: List of publications via the DBLP site , Links to publications via Google Scholar (search also for FF Dragan or F Dragan))

In Total: 11+ articles are published in premium journals; 24+ articles are published in leading journals; 3+ articles are published in reputable journals; 5+ articles are published in rank 1 conferences; 18+ articles are published in rank 2 conferences; 17+ articles are published in rank 3 conferences. Former Soviet Union journals and conferences are not ranked.

My H-index is 16, my G-index is 25, my Erdős number is 3 (e.g., Feodor F. Dragan to Vitaly I. Voloshin to Zsolt Tuza, to Paul Erdös) and the total number of citations of my papers is 778, as of August 2009 (click here for the current situation).

2009

• Network Flow Spanners
  F.F. Dragan and C. Yan
  Networks, in print, 2009. (available on-line at DOI 10.1002/net.20357)
• Effective Monitor Placement in Internet Networks
  Y. Breitbart , F.F. Dragan, H. Gobjuka
  Journal of Networks 4 (2009), 657-666.
• Collective Tree Spanners in Graphs with Bounded Genus, Chordality, Tree-width, or Clique-width
  F.F. Dragan and C. Yan
  Algorithmica, in print, 2009 (available on-line at DOI    10.1007/s00453-008-9194-y)
• 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), Banff Conference Centre, Banff, Alberta, Canada, 21-23 August 2009, Springer, Lecture Notes in Computer Science, 5664, pp. 566–577.
• Collective Tree Spanners for Unit Disk Graphs with Applications
  F.F. Dragan, Y. Xiang and C. Yan
  Electronic Notes in Discrete Mathematics 32 (2009) 117–124.
• How to use spanning trees to navigate in graphs
  F.F. Dragan and Y. Xiang
  34th International Symposium on Mathematical Foundations of Computer Science (MFCS 2009), August 24 - 28, 2009, Novy Smokovec, High Tatras, Slovak Republic, Springer, Lecture Notes in Computer Science 5734, pp. 282–294.

2008

• Navigating in a graph by aid of its spanning tree
  F.F. Dragan and M. Matamala
  19th International Symposium on Algorithms and Computation (ISAAC 2008), Surfers Paradise, Gold Coast, Australia, December 15-17, 2008, Springer, Lecture Notes in Computer Science 5369, pp. 789–800, 2008.
• Overlapping Matrix Pattern Visualization: a Hypergraph Approach
  R. Jin, Y. Xiang, D. Fuhry, F.F. Dragan
  IEEE International Conference on Data Mining (IEEE-ICDM’08), Pisa, Italy, December 15-19, 2008, pp. 313-322.
• A PTAS for the sparsest spanners problem on apex-minor-free graphs
  F.F. Dragan, F. Fomin and P. Golovach
  33rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2008), Torun, Poland, August 27-31, 2008, Springer, Lecture Notes in Computer Science 5162, pp. 290-298.
• Succinct Summarization of  Transactional Databases: An Overlapped Hyperrectangle Scheme
  Y. Xiang, R. Jin, D. Fuhry, F.F. Dragan
  14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD 2008), Las Vegas, USA, 24-27 August, 2008, pp. 758-766.
• Spanners in sparse graphs
  F.F. Dragan, F. Fomin and P. Golovach
  35th International Colloquium on Automata, Languages and Programming (ICALP 2008), Reykjavik, Iceland, July 6-13, 2008, Springer, Lecture Notes in Computer Science 5125 (Part I), pp. 597-608.
• Additive Spanners for Circle Graphs and Polygonal Graphs
  F.F. Dragan, D.G. Corneil, E. Köhler and Y. Xiang
  34th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2008), Durham University, U.K., June 30- July 2, 2008, Springer, Lecture Notes in Computer Science 5344, pp. 110–121, 2008.
• 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.
• Notes on diameters, centers, and approximating trees of delta-hyperbolic geodesic spaces and graphs
  V.D. Chepoi, F.F. Dragan, B. Estellon, M. Habib and Y. Vaxes
  International Conference on Topological and Geometric Graph Theory (TGGT 2008), Electronic Notes in Discrete Mathematics 31 (2008), 231-234.
• Collective Additive Tree Spanners of Homogeneously Orderable Graphs
  F.F. Dragan, C. Yan, Y. Xiang
  8th Latin American Symposium on Theoretical Informatics (LATIN 2008), Búzios, Brazil, April 7-11, 2008, Springer, Lecture Notes in Computer Science 4957, pp.555-567.

2007

• Tree spanners for bipartite graphs and probe interval graphs
  A. Brandstädt, Dragan F.F., H.-O. Le, V.B. Le and R. Uehara
  Algorithmica 47 (2007), 27–51.
• On compact and efficient routing in certain graph classes
  Dragan F.F. and I. Lomonosov
  Discrete Applied Mathematics 155 (2007), 1458-1470.
• Spanners for bounded tree-length graphs
  Y. Dourisboure, Dragan F.F., C. Gavoille, and C. Yan
  Theoretical. Computer Science 383 (2007), 34-44.

2006

• Distance and routing labeling schemes for non-positively curved plane graphs
  V.D. Chepoi, F.F. Dragan, Y. Vaxès
  Journal of Algorithms 61 (2006), 60-88. (one of the TOP25 Hottest Articles within the Journal of Algorithms for Jan-Mar 2008, Jul-Sep 2007, Apr-June 2007, Jan-Mar 2007, Oct-Dec 2006).
• Addressing, distances and routing in triangular systems with applications in cellular networks
  V.D. Chepoi, F.F. Dragan, Y. Vaxès
  Wireless Networks 12 (2006), 671-679. The special issue "Best papers of the 4th Workshop on Algorithms for Wireless, Mobile, Ad Hoc and Sensor Networks (WMAN 2004)".
• Collective Tree Spanners and Routing in AT-free Related Graphs
  F.F. Dragan, C. Yan and D.G. Corneil
  Journal of Graph Algorithms and Applications, Vol. 10, no. 2, 2006, 97-122.
• Generalized Powers of Graphs and Their Algorithmic Use
  A. Brandstädt, F.F. Dragan, Y. Xiang and C. Yan
  In Proc. of the 10th Scandinavian Workshop on Algorithm Theory (SWAT' 06), Riga, Latvia, July 6-8, 2006,  Springer, Lecture Notes in Computer Science 4059, pp. 423-434. 
• Distance Approximating Trees: Complexity and Algorithms
  F.F. Dragan and C. Yan
  In Proceedings of the 6th Conference on Algorithms and Complexity (CIAC' 2006), Rome, Italy, May 29-31, 2006, Springer, Lecture Notes in Computer Science 3998, pp. 260-271. (invited to submit to the special issue "Best papers of CIAC’ 2006" to be published in Journal of Discrete Algorithms).
• Network Flow Spanners
  F.F. Dragan and C. Yan
  In Proceedings of the 7th Latin American Symposium ''LATIN 2006: Theoretical Informatics'', Valdivia, Chile, March 20-24, Springer, Lecture Notes in Computer Science 3887, pp. 410-422.
• Collective tree spanners of graphs
  F.F. Dragan, C. Yan and I. Lomonosov
  SIAM J. Discrete Math. 20 (2006),  241-260.

2005

• Collective Tree Spanners in Graphs with Bounded Genus, Chordality, Tree-width, or Clique-width
  F.F. Dragan and C. Yan
  In Proceedings of the 16th Annual International Symposium on Algorithms and Computation (ISAAC 2005), December 19-21, 2005, Hainan, China, Springer, Lecture Notes in Computer Science 3827, pp. 583–592.
• Additive Sparse Spanners for Graphs with Bounded Length of Largest Induced Cycle
  V.D. Chepoi, Dragan F.F., and Chenyu Yan
  Theoretical Computer Science 347 (2005), 54-75.
• Estimating All Pairs Shortest Paths in Restricted Graph Families: A Unified Approach
  Dragan F.F.
  Journal of Algorithms 57 (2005), 1-21. (one of the TOP25 Hottest Articles within the Journal of Algorithms for   Jan-Mar 2005, Jul-Sep 2005, Oct-Dec 2005, Jan-Mar 2006, Apr-Jun 2006)
• New Graph Classes of Bounded Clique Width
  A. Brandstädt, Dragan F.F., Hoang-Oanh Le, Raffaele Mosca
  Theory of Computing Systems 38 (2005), 623-645.
• Collective tree 1-spanners for interval graphs
  D.G. Corneil, F.F. Dragan, E. Köhler and C. Yan
  In Proceedings of 31st International Workshop "Graph-Theoretic Concepts in Computer Science" (WG '05), June 23-25, 2005, Metz, France, Springer, Lecture Notes in Computer Science 3787, pp. 151-162.
• Distance-Based Location Update and Routing in Irregular Cellular Networks
  V.D. Chepoi, F.F. Dragan, Y. Vaxès
  In Proceedings of Sixth International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing and First ACIS International Workshop on Self-Assembling Wireless Networks (SNPD/SAWN'05), May 23-25, 2005, Towson University, Maryland, USA, IEEE Computer Society, 2005, pp. 380-387.

2004

• On Compact and Efficient Routing in Certain Graph Classes
  F.F. Dragan, I. Lomonosov
  In Proceedings of the 15th Annual International Symposium on Algorithms and Computation (ISAAC 2004), December 20 - 22, 2004, HKUST, Hong Kong, Springer, Lecture Notes in Computer Science 3341, pp. 402-414.
• Effective Network Monitoring
  Y. Breitbart, F.F. Dragan, H. Gobjuka
  In Proc. of 13th International Conference on Computer Communications and Networks (ICCCN 2004), October 11-13, 2004 Chicago, IL USA, pp. 394-399. (nominated for the best paper award)
• Tree Spanners on Chordal Graphs: Complexity and Algorithms
  A. Brandstädt, Dragan F.F., H.-O. Le, and V.B. Le
  Theoretical Computer Science  310 (2004), 329-354.
• Collective tree spanners of graphs
  F.F. Dragan, C. Yan and I. Lomonosov
  Proc. of the 9th Scandinavian Workshop on Algorithm Theory (SWAT'04), 8-10 July, 2004, Humlebæk, Denmark, Springer, Lecture Notes in Computer Science 3111, pp. 64-76.
• Collective Tree Spanners and Routing in AT-free Related Graphs
  F.F. Dragan, C. Yan and D.G. Corneil
  In Proceedings of 30th International Workshop "Graph-Theoretic Concepts in Computer Science" (WG '04), June 2004, Hölterhoff House at Bad Honnef, close to Bonn, Germany, Springer, Lecture Notes in Computer Science 3353, pp. 68-80.
• Addressing, distances and routing in triangular systems with applications in cellular and sensor networks
  V.D. Chepoi, F.F. Dragan, Y. Vaxès
  Proc. of the 18th International Parallel & Distributed Processing Symposium, April 26 - 30, Santa Fe, New Mexico (4th International Workshop on Algorithms for Wireless, Mobile, Ad Hoc and Sensor Networks, WMAN'04) (on CD) (invited to submit to the special issue "Best papers of the 4th Workshop on Algorithms for Wireless, Mobile, Ad Hoc and Sensor Networks (WMAN 2004)" to be published in Wireless Networks (WINET -Kluwer)).

2003

• On the power of BFS to determine a graph's diameter
  Corneil D.G., Dragan F.F. and E. Köhler
  Networks 42 (2003), 209-222.
• On linear and circular structure of a (claw,net)-free graph
  A. Brandstädt and Dragan F.F.
  Discrete Appl. Math. 129 (2003), 285-303.
• Finding a central vertex in HHD-free graphs
  Chepoi V.D. and Dragan F.F.
  Discrete Appl. Math. 131 (2003), 93-111.
  Editors Choice 2003, a representative collection of excellent papers published in Discrete Appl. Math. in 2003.
• Tree spanners for bipartite graphs and probe interval graphs
  A. Brandstädt, Dragan F.F., H.-O. Le, V.B. Le and R. Uehara
  In Proceedings of 29th International Workshop "Graph-Theoretic Concepts in Computer Science" (WG '03), June 2003, Elspeet, the Netherlands, Springer, Lecture Notes in Computer Science 2880, pp. 106-118.
• Additive Spanners for k-Chordal Graphs
  V.D. Chepoi, Dragan F.F., and Chenyu Yan
  In Proceedings of 5th Conference on Algorithms and Complexity (CIAC 2003), May 28-30, 2003, Rome, Italy, Springer, Lecture Notes in Computer Science 2653, pp.96-107.

2002

• Provably good global buffering by generalized multiterminal multicommodity flow approximation
  Dragan F.F., A. B. Kahng, S. Muddu, I. Mandoiu and A. Zelikovsky
  IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 21 (2002), 263-274.
• Tree Spanners on Chordal Graphs: Complexity, Algorithms, Open Problems
  A. Brandstädt, Dragan F.F., H.-O. Le, and V.B. Le
  In proceedings of The 13th Annual International Symposium on Algorithms and Computation (ISAAC 2002),  November 20-23, 2002, Vancouver, Canada, Springer, Lecture Notes in Computer Science 2518, pp. 163-174.
• New Routing Schemes for Interval Graphs, Circular-Arc Graphs and Permutation Graphs
  Feodor F. Dragan and Irina Lomonosov
  In proceedings of Fourteenth IASTED International Conference on Parallel and Distributed Computing and Systems (PDCS 2002),  November 4-6, 2002, Cambridge, USA, pp. 78-83.
• New Graph Classes of Bounded Clique Width
  A. Brandstädt, Dragan F.F., Hoang-Oanh Le, Raffaele Mosca
  Proceedings of 28th International Workshop "Graph-Theoretic Concepts in Computer Science" (WG '02), June 2002, Cesky Krumlov, Czech Republic, Springer, Lecture Notes in Computer Science 2573, pp. 57-67.
• On the Power of BFS to Determine a Graph's Diameter (extended abstract)
  Corneil D.G., Dragan F.F., and E. Köhler
  Proceedings of the 5th Latin American Symposium ''LATIN 2002: Theoretical Informatics'', Cancun, Mexico, April 2002, Springer, Lecture Notes in Computer Science 2286, pp. 209-223.
• Center and diameter problems in plane triangulations and quadrangulations
  Chepoi V.D., Dragan F.F., Y. Vaxes
  Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'02), San Francisco, CA, January 2002, pp. 346-355.

2001

• Diameter Determination on Restricted Graph Families
  Corneil D.G., Dragan F.F., Habib M. and Paul C.
  Discrete Appl. Math. 113 (2001), 143-166.
• Estimating All Pairs Shortest Paths in Restricted Graph Families: A Unified Approach (extended abstract)
  Dragan F.F.
  Proc. 27th International Workshop ''Graph-Theoretic Concepts in Computer Science''(WG'01), June 2001, Springer, Lecture Notes in Computer Science 2204, pp. 103-116.
• Practical Approximation Algorithms for Separable Packing Linear Programs
  Dragan F.F., A. B. Kahng, S. Muddu, I. Mandoiu and A. Zelikovsky
  Proceedings of the 7th International Workshop on Algorithms and Data Structures (WADS'01), August, 2001, Springer, Lecture Notes in Computer Science 2125, pp. 325-337.
• Provably good global buffering by multiterminal multicommodity flow approximation
  Dragan F.F., A. B. Kahng, S. Muddu, I. Mandoiu and A. Zelikovsky
  Proceedings of Asia and South Pacific Design Automation Conference (ASP-DAC'01), January/February, 2001, pages 139-144.

2000

• Linear time algorithms for Hamiltonian problems on (claw,net)-free graphs
  A. Brandstädt, Dragan F.F. and E. Köhler
  SIAM J. on Computing 30 (2000), 1662-1677.
• On stable cutsets in graphs
  A. Brandstädt, Dragan F.F., V.B. Le , and Th. Szymczak
  Discrete Appl. Math.  105 (2000), 39-50.
• A note on distance approximating trees in graphs
  Chepoi V.D. and Dragan F.F.
  European Journal of Combinatorics  21 (2000), 761-766.
• Strongly orderable graphs:
  A common generalization of strongly chordal and chordal bipartite graphs
  Dragan F.F.
  Discrete Appl. Math. 99 (2000), 427-442.
• LexBFS-orderings of distance-hereditary graphs with application to the diametral pair problem
  Dragan F.F. and Nicolai F.
  Discrete Appl. Math. 98 (2000), 191-207.
• Provably Good Global Buffering Using an Available Buffer Block Plan
  Dragan F.F., A. B. Kahng, S. Muddu, I. Mandoiu and A. Zelikovsky
  Proc. of IEEE/ACM Intl. Conference on Computer-Aided Design (ICCAD'00), November, 2000, pages 104-109.

Recent Selected Conference Presentations and Invited Lectures

06/09	Laboratoire d’Informatique Fondamentale de Marseille, Université de la Mediterranée, Marseille, France
03/09	Computer Science Department, University of Rostock, Germany (invited by Prof. Andreas Brandstädt)
03/09	"Algorithmic Graph Theory"- AGT 2009 conference, University of Warwick, UK
06/08	Discrete Maths and Theoretical Computer Science Group (DMTCS), University of Chile, Santiago, Chile
04/08	8th Latin American Symposium on Theoretical Informatics (LATIN 2008), Búzios, Brazil
10/07	Laboratoire d’Informatique Fondamentale de Marseille, Université de la Mediterranée, Marseille, France
10/07	Research Group on Algorithms and Combinatorics, Department of Computer Science at University Paris Diderot – Paris 7
09/07	Combinatorial Optimization & Graph Algorithms Group at the Technische Universität Berlin, Germany
07/07	Combinatorial Optimization & Graph Algorithms Group at the Technische Universität Berlin, Germany
06/07	Algorithms Research Group, Department of Informatics, University of Bergen, Norway
06/07	33rd International Conference on Graph-Theoretic Concepts in Computer Science (WG’07), Dornburg near Jena, Germany
05/07	Dagstuhl-Seminar on "Exact, Approximate, Robust and Certifying Algorithms on Particular Graph Classes", Dagstuhl, Germany
07/06	10th Scandinavian Workshop on Algorithm Theory (SWAT' 06), Riga, Latvia
06/06	SIAM Conference on Discrete Mathematics, Victoria, BC, Canada
05/06	6th Conference on Algorithms and Complexity (CIAC' 2006), Rome, Italy
03/06	7th Latin American Symposium ''LATIN 2006: Theoretical Informatics'', Valdivia, Chile
12/05	16th Annual International Symposium on Algorithms and Computation (ISAAC 2005), Sanya, Hainan, China
06/05	31st International Workshop "Graph-Theoretic Concepts in Computer Science" (WG '05),  Metz, France
05/05	First ACIS International Workshop on Self-Assembling Wireless Networks (SNPD/SAWN'05), Towson University, Maryland, USA
12/04	15th Annual International Symposium on Algorithms and Computation (ISAAC 2004), HKUST, Hong Kong
12/04	RUTCOR Colloquia - Rutgers University, Piscataway, NJ
10/04	13th International Conference on Computer Communications and Networks (ICCCN 2004), Chicago, IL, USA
07/04	9th Scandinavian Workshop on Algorithm Theory (SWAT'04), Humlebæk, Denmark
06/04	SIAM Conference on Discrete Mathematics, Nashville, TN, USA
06/04	30th International Workshop "Graph-Theoretic Concepts in Computer Science"(WG '04), Hölterhoff House at Bad Honnef, close to Bonn, Germany
04/04	4th International Workshop on Algorithms for Wireless, Mobile, Ad Hoc and Sensor Networks (WMAN'04), Santa Fe, New Mexico
2/03	Department of Electrical Engineering and Computer Science, Case Western Reserve University, Cleveland, Ohio, USA
06/03	29th International Workshop "Graph-Theoretic Concepts in Computer Science"(WG '03), Elspeet, the Netherlands
06/03	Faculte des Sciences de Luminy, Universite de la Mediterranee, Marseille, FRANCE (invited by Prof. Victor Chepoi)
05/03	5th Conference on Algorithms and Complexity (CIAC 2003), Rome, Italy
11/02	13th Annual International Symposium on Algorithms and Computation (ISAAC 2002), Vancouver, Canada
11/02	Fourteenth IASTED International Conference on Parallel and Distributed Computing and Systems (PDCS 2002), Cambridge, USA
06/02	28th International Workshop "Graph-Theoretic Concepts in Computer Science" (WG '02), Cesky Krumlov, Czech Republic
04/02	5th Latin American Symposium ''LATIN 2002: Theoretical Informatics'', Cancun, Mexico
01/02	Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'02), San Francisco, CA, USA
08/01	Seventh International Workshop on "Algorithms and Data Structures" (WADS'01), Brown University Providence, Rhode Island, USA
07/01	Computer Science Department, University of Rostock, Germany (invited by Prof. Andreas Brandstädt)
06/01	Second Dagstuhl-Seminar on "Graph Decompositions and Algorithmic Applications", Dagstuhl, Germany
06/01	27th International Workshop on "Graph-Theoretic Concepts in Computer Science"(WG'01), Boltenhagen near Rostock, Germany
03/01	Computer Science Department, University of Toronto, Canada (invited by Prof. Derek G. Corneil)
02/01	6th Asia and South Pacific Design Automation Conference (ASP-DAC 2001), Pacifico Yokohama, Japan
11/00	IEEE/ACM Intl. Conference on Computer-Aided Design (ICCAD-2000), San Jose, California
10/00	MIGHTY XXXIII, Wright State University, Dayton, Ohio
6/99	25th Internat. Workshop "Graph-Theoretic Concepts in Computer Science"(WG '99), Ascona, Switzerland
6/99	Dagstuhl-Seminar on "Graph Decompositions and Algorithmic Applications", Dagstuhl, Germany
5/99	6th Twente Workshop on Graphs and Combinatorial Optimization, Enschede, The Netherlands
9/98	Internat. Conference on Discrete Metric Spaces, Marseille, France
7/98	Ninth SIAM Conference on Discrete Mathematics, Toronto, Canada
6/98	24th Internat. Workshop "Graph-Theoretic Concepts in Computer Science"(WG '98), Smolenice Castle, Slovak Republic
12/97	Oberseminar Kombinatorik, Universität Bielefeld, Germany
9/97	"Algorithms - ESA '97" 5th Annual European Symposium, Graz, Austria
9/97	"Optimal Discrete Structures and Algorithms"(ODSA '97), Rostock, Germany
6/97	23rd Internat. Workshop "Graph-Theoretic Concepts in Computer Science"(WG '97), Berlin, Germany
9/95	8th Meeting of the EURO Working Group on Locational Analysis, Lambrecht(Pfalz), Germany
9/95	5th Internat. Coll. on "Graphs and Combinatorics", Marseille Luminy, France
8/95	"Fundamentals of Computation Theory - FCT '95", Dresden, Germany
9/94	"Algorithms - ESA '94" 2nd Annual European Symposium, Utrecht, The Netherlands
7/94	"Algorithm Theory - SWAT '94" 4th Scandinavian Workshop on Algorithm Theory, Aarhus, Denmark
2/94	11th STACS '94, Caen, France

Grants

· Efficient Algorithms on Graphs with Maximum Neighborhood Orderings and Related Elimination Orderings - Volkswagen Foundation (VW) Project (with V. Chepoi and V. Voloshin, 60 000,- DM) (in collaboration with A. Brandstädt, Rostock and H.-J. Bandelt, Hamburg).

· Metric Optimization Problems in Discrete Structures - German Research Community (DFG) Project (300 000,- DM) (in collaboration with A. Brandstädt, Rostock).

· 2002 Summer Research Grant - The Research Council of Kent State University ($ 6,500).

Other Research Funding

· ~$ 5,000 from Laboratoire d’Informatique Fondamentale de Marseille, Université de la Mediterranée, Marseille, France for research visit from 05/20/03 to 06/19/03.

· ~$ 5,000 from Algorithms Research Group, Department of Informatics, University of Bergen, Norway for research visit from 05/26/07 to 06/20/07.

· ~$ 22,000 from Combinatorial Optimization & Graph Algorithms Group at the Technische Universität Berlin, Germany for research visit from 06/25/07 to 09/30/07.         

· ~$ 25,000 from Research Group on Algorithms and Combinatorics, Department of Computer Science at University Paris Diderot – Paris 7 for research visit from 10/01/07 to 12/20/07.          

· ~$ 1,000 from Laboratoire d’Informatique Fondamentale de Marseille, Université de la Mediterranée, Marseille, France for research visit from 10/18/07 to 10/24/07.        

· ~$ 6,000 from Discrete Maths and Theoretical Computer Science group (DMTCS), University of Chile, Santiago, Chile for research visit from 05/10/08 to 07/10/08.

· ~$ 6,200 from Laboratoire d’Informatique Fondamentale de Marseille, Université de la Mediterranée, Marseille, France for research visit from 06/01/09 to 06/30/09.         

Grant Proposals (not funded)

· Efficient algorithms for problems related to distances in well-structured families of graphs- NSF, CCR-Theory of Computing, $230,970, 3 years (2002-2005).

· CAREER: Efficient algorithms for problems related to distances in large structured graphs and networks - NSF, CCR-Theory of Computing, $427,546, 5 years (2003-2008).

· Message routing in structured large scale distributed networks -Ohio Board of Regents Research Challenge Funds, $ 114,507, 2 years (2003-2004).

· Issues and Challenges in Wireless Mesh (Grid) Networks - Ohio Board of Regents Research Challenge Funds, $ 58,401, 1 year (2006) (with Dr. Peyravi).

· CIF:AF:Small: New Algorithmic Developments for Wireless Ad-Hoc, Sensor and Cellular Networks – NSF, CCF - COMM & INFORMATION FOUNDATIONS, $ 182,931, 2 years (2009-2011).

Awards and Honors

1994 - 1995	DAAD Research Fellowship, Germany
1985	M.Sc. degree with honors in Applied Mathematics
1980 - 1985	University Merit Scholarship
1980	High School Gold Medal

Other Professional Activities

• Member of Program Committee for
• WG 2009: 35th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2009), June 24-26, 2009, Montpellier, France
• SAWN 2006:  2nd ACIS International Workshop on Self-Assembling Wireless Networks, June 19 - 20, 2006, Excalibur Hotel, Las Vegas, Nevada, USA
• SAWN 2005:  1st ACIS International Workshop on Self-Assembling Wireless Networks, May 24, 2005, Towson University, Maryland, USA
• MASS 2004: The 1st IEEE International Conference on Mobile Ad-hoc and Sensor Systems, October 24-27, 2004, Fort Lauderdale, Florida, USA
• The International Seminar on Discrete Geometry, dedicated to the 75th birthday of Professor A. M. Zamorzaev, August 28-29, 2002, Chisinau, Republic of Moldova
• Referee for
• Journal of Algorithms
• Computational Geometry: Theory and Applications
• IEEE Transactions on Computers
• IEEE Transactions on Parallel and Distributed Systems
• Information Processing Letters
• Parallel Processing Letters
• SIAM Journal on Computing
• SIAM Journal on Discrete Mathematics
• Discrete Mathematics
• Discrete Applied Mathematics
• Journal of Information Science and Engineering
• Journal of Graph Algorithms and Applications
• Journal of Parallel and Distributed Computing
• Ars Combinatorica
• External reviewer for
• 4th Twente Workshop on Graphs and Combinatorial Optimization, Enschede, The Netherlands, 1995: special volume of Discrete Applied Mathematics
• 8th Meeting of the EURO Working Group on Locational Analysis, Lambrecht (Pfalz), Germany, 1995
• 5th Twente Workshop on Graphs and Combinatorial Optimization, Enschede, The Netherlands, 1997: special volume of Discrete Applied Mathematics
• Optimal Discrete Structures and Algorithms (ODSA '97), Rostock, Germany, 1997: special volume of Discrete Applied Mathematics
• Optimal Discrete Structures and Algorithms (ODSA '00), Rostock, Germany, 2000: special volume of Discrete Applied Mathematics
• 24th International Workshop "Graph-Theoretic Concepts in Computer Science" (WG '98), Smolenice Castle, Slovak Republic
• 25th International Workshop "Graph-Theoretic Concepts in Computer Science" (WG '99), Ascona, Switzerland
• 26th International Workshop "Graph-Theoretic Concepts in Computer Science" (WG '00), Konstanz, Germany
• 27th International Workshop "Graph-Theoretic Concepts in Computer Science" (WG '01), Boltenhagen near Rostock, Germany
• 28th International Workshop "Graph-Theoretic Concepts in Computer Science" (WG '02), Cesky Krumlov, Czech Republic
• 29th International Workshop "Graph-Theoretic Concepts in Computer Science" (WG '03), Elspeet, the Netherlands.
• 30th International Workshop "Graph-Theoretic Concepts in Computer Science" (WG '04), Hölterhoff House at Bad Honnef, close to Bonn, Germany.
• 31st International Workshop "Graph-Theoretic Concepts in Computer Science" (WG '05), Metz, France.
• 32nd International Workshop "Graph-Theoretic Concepts in Computer Science" (WG '06), Bergen, Norway.
• 33rd International Workshop "Graph-Theoretic Concepts in Computer Science” (WG’07), Dornburg near Jena, Germany
• 35th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2009), June 24-26, 2009, Montpellier, France
• 20th International Symposium on Theoretical Aspects of Computer Science (STACS 2003), Berlin, Germany.
• Journées de l'Informatique Messine (JIM'2000)-GRAPH ALGORITHMS, Metz, France, 2000:  special volume of Discrete Applied Mathematics.
• Fourth IEEE Symposium on Bioinformatics and Bioengineering (BIBE'04).
• The 1st IEEE International Conference on Mobile Ad-hoc and Sensor Systems (MASS 2004), 2004, Fort Lauderdale, Florida, USA.
• 4th International Workshop on Algorithms for Wireless, Mobile, Ad Hoc and Sensor Networks (WMAN'04), Santa Fe, New Mexico, 2004. 
• 19th International Symposium on Distributed Computing (DISC 2005), Cracow, Poland
• 20th International Symposium on Distributed Computing (DISC 2006), Stockholm, Sweden.
• ACM-SIAM Symposium on Discrete Algorithms (SODA 2006), Miami, Florida.
• ACM-SIAM Symposium on Discrete Algorithms (SODA 2007), New Orleans, Louisiana.
• ACM-SIAM Symposium on Discrete Algorithms (SODA 2008), San Francisco, California
• 36th International Colloquium on Automata, Languages and Programming, (ICALP 2009), Rhodes - Greece
• 17th International Symposium on Algorithms and Computation (ISAAC 2006), Kolkata, India
• American Mathematical Society: evaluation of research proposals submitted to the National Security Agency (Mathematical Science Program)