My accomplishments since my last review for promotion

Feodor F. Dragan

Associate Professor

Department of Computer Science

Kent State University

Period: September, 2003 thru August, 2009

Teaching & Advising ……………..…………….……. 4 pages Research/Discovery/Integration/Application …... 12 pages

Service & Citizenship ………………………………… 3 pages

Feodor F. Dragan

Teaching & Advising

(Period: September, 2003 thru August, 2009)

Teaching & Course Development

I have taught the following courses:

o CS 23022 - DISCRETE STRUCTURES FOR CS

o CS 4/56201 - AUTOMATA & FORMAL LANGUAGES

o CS 4/56101 - DESIGN & ANALYSIS OF ALGORITHMS

o CS 6/76101 - ADVANCED ALGORITHMS

o CS 6/76110 - COMPUTATIONAL GEOMETRY

o CS 6/79995 - ST: ALGORITHMICS OF WIRELESS AD HOC NETWORKS

o CS 6/79995 - ST: ADV. ALGORITHMS FOR GRAPHS AND NETWORKS

o CS 6/79995 - MASTER’S and DOCTORAL SEMINAR

I have updated the syllabi, handouts and course materials for

o CS 6/76110 - COMPUTATIONAL GEOMETRY

see a sample of lecture slides here

o CS 6/76101 - ADVANCED ALGORITHMS

see samples of lecture slides here and here

o CS 4/56201 - AUTOMATA & FORMAL LANGUAGES

see a sample of lecture slides here

I have taught for the first time and hence developed (slides, homeworks, exams, etc),

significantly changed the style and sometimes the course content for

o CS 4/56101 - DESIGN & ANALYSIS OF ALGORITHMS

see samples of lecture slides here and here

o CS 23022 - DISCRETE STRUCTURES FOR CS

I have developed two new ST courses:

o CS 6/79995 - ST: ADVANCED ALGORITHMS FOR GRAPHS AND NETWORKS

o CS 6/79995 - ST: ALGORITHMICS OF WIRELESS AD HOC NETWORKS

Web-sites and syllabi of all courses can be found on-line here. I have created web-pages for all

courses, where students could download slides for each lecture, homework assignments, results

and solutions for previous homework, and the examination results.

Few samples of tests and pre-test-info can be found on-line here: AdvAlgMT, AdvAlgFE,

AlgMT, AlgFE, AlgInfoMT, AlgInfoFE, DiStMT, DiStFE, ST-FE, PrelimExamAlgo

Organized and run weekly research seminars

o With my PhD and MS students each semester from 2003 to 2009.

o With Dr. Breitbart, his and my students in Spring/Fall 2005.

o With Dr. Jin, his and my students in Summer/Fall 2006, in Spring 2007, in Spring/Fall

2008, in Spring 2009.

Almost all student evaluations were very good.

o the summary of classes taught, along with enrollments and student evaluations can

be found here

o copies of original student evaluations can be found here

o some comments from student evaluations can be found here

My Teaching Statement is here.

Current enrolments for my two FALL 2009 classes are 29 and 18 students.

Advising & Mentoring

I advised the following students (dates are approximate up to a semester or so)

PhD

1. Irina Lomonosov, 2001 – 2005

2. Chenyu Yan, 2002 – 2007

3. Hassan Gobjuka, 2004 – 2007

4. Xiang Yang, 2004 – to date

5. Khasawneh, Samer, 2007 - to date

6. Dean Zeller, 2006 – 2007

7. Muad Abu Ata, 2008 – to date

MS

1. Sudha Elavarti, 2004 – 2005

2. Mutasem Najdawi, 2004 – 2005

3. Shashikant Shinde, 2004 – 2004

4. Jyotsna Duvvuri, 2005 – 2006

5. Roger Kurian, 2004 – 2004

6. Amit Borwankar, 2004 – 2005

7. George Powell, 2004 – 2005

8. Tran Anh Tuan, 2005 – 2006

9. Luke Hodgkinson, 2005 – 2005 (finished MS at Columbia University and is currently doing

PhD at UC Berkeley)

10. Raina Siddharth, 2005 – 2006

11. Jitendra Mansharamani 2005 – 2006

12. Rajesh Jadhav, 2006 – 2007

13. Bafna, Nitin, 2006 – 2007

14. Viyyure, Udaykiran V, 2007 – 2008

15. Bhaduri, Sudipta, 2007 – 2008

16. Rab Harbart, 2007 – 2009

17. Rahul Sehgal, 2007 – 2009

18. Rizwan Malik, 2009 – to date

19. Suvarna, Amogh P., 2009 – to date

MA

1. Dwarakanath Raghunathan, 2003 – 2005

2. Pankaj, Amitabh, 2006 – 2007

BS Honor

1. Anton Yakymenko, 2009 – to date.

I was a member of Dissertation/Thesis committees for:

1. David Fuhry (CS, KSU)

2. Nouman Bantan (CS, KSU)

3. Asrar Haque (CS, KSU)

4. Mohammed Jirari (CS, KSU)

5. Oleg Komogortsev (CS, KSU)

6. Raid Zaghal (CS, KSU)

7. Rashid bin Muhammad (CS, KSU)

8. Pradeep Kumar Punnam (CS, KSU)

9. YURIY KOLOMYETS (MATH, KSU, 2006)

10. Yasir Drabu (CS, KSU)

11. Vibha Tripathi (CS, KSU)

12. Rodica Boliac (Rutgers University, Piscataway, NJ, 2004)

13. Chenyu Yan (CS, KSU)

14. Irina Lomonosov (CS, KSU)

15. Yang Xiang (CS, KSU)

16. Hassan Gobjuka (CS, KSU)

17. Etc…

I graduated the following PhD students:

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”.

One more PhD student (Yang Xiang; 12 published papers) is graduating this Fall 2009.

I graduated the following MS students:

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

2. Sudha Elavarti, 2005, “Addressing, Distance and Routing in Cubic Systems with

Applications in 3D Cellular Networks”.

3. Mutasem Najdawi, 2005, “Implementation of Addressing, Distance and Routing Labeling

Schemes for Triangular Systems”.

4. Amit Borwankar, 2005, “Nearest Neighbor Embracing Graph (NNEG) as a New Topology

for Wireless Ad-hoc Networks “.

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

6. Tran Anh Tuan, 2006, “Analysis of two approximation algorithms for the Tree Flow

Spanner Problem”.

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

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

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

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

11. Bhaduri, Sudipta, 2008, “Maximum cliques and minimum colorings of chordal graphs via

minimum degree orderings”.

12. Rahul Sehgal, 2009, “Greedy routing in a graph by aid of its spanning tree: experimental

results and analysis”.

13. Rab Harbart, 2009, “Addressing and Distances for Cellular Networks with Holes”.

I graduated the following MA students (with research projects):

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”.

My current students:

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

Candidacy).

2. Muad Abu Ata, PhD Student, Area to be finalized (co-advising with Dr. Jin).

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

4. Jitendra Mansharamani, MS Student, “Distributed and localized algorithms for some class

of static sensor networks”.

5. Rizwan Malik, MS Student, Hyperbolicity in networks”.

6. Anton Yakymenko, MS Student, TBD.

7. Suvarna, Amogh P., MS Student, TBD.

Used Links to:

Web pages of classes

Representative course syllabi

Samples of lecture notes, lecture slides

Representative course examinations

Student evaluations

Comments from student evaluations

My teaching statement

My PhD Student’s web site (Yang Xiang)

My former student Luke Hodgkinson’s CV

Feodor F. Dragan http://www.cs.kent.edu/~dragan/

Research/Discovery/Integration/Application

(Period: September, 2003 thru August, 2009)

Accomplishments, recognition of my research and its impact on discipline.

My CV (http://www.cs.kent.edu/~dragan/CV-Dragan.html) lists my recent publications (while at Kent State

University) in chronological order. My List of Publications (http://www.cs.kent.edu/~dragan/publ.html) gives an

extended list in chronological order.

(see also DBLP: List of publications via the DBLP site , Links to publications via Google Scholar (search

also for FF Dragan or F Dragan) and Feodor F Dragan - ACM author profile page)

My research interests are primarily in Algorithms and Theory (Theoretical Computer Science), namely, in

design and analysis of algorithms for optimization problems with applications in networks, computational

geometry, computational biology, distance location problems and operations research, data mining and analysis.

In total, I have more that 110 refereed publications: 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. Estimated impact of publication venues in

Computer Science (higher is better) can be found here. The highest impact in Algorithms and Theory (Theoretical

Computer Science) has STOC conference, with impact 1.69 (less than 5.97% CS venues have higher impact).

Among other publications, I published: 1 paper in a venue with impact 1.68/top 6.14% (KDD); 1 paper in a

venue with impact 1.64/top 6.38% (SIAM J. on Computing); 1 paper in a venue with impact 1.51/top 8.76%

(SoCG); 1 paper in a venue with impact 1.51/top 9% (SODA); 3 papers in a venue with impact 1.42/top 10.31%

(J. of Algorithms); 2 papers in a venue with impact 1.31/top 12.20% (Algorithmica); 1 paper in a venue with

impact 1.05/top 21.29% (Wireless Networks); 1 paper in a venue with impact 1.02/top 22.44% (Theory of

Computing Systems); 1 paper in a venue with impact 0.97/top 24.65% (ICALP); 4 papers in a venue with impact

0.92/top 27.27% (SIAM J. on Discrete Math.); 4 papers in a venue with impact 0.91/top 27.68% (Theoretical

Computer Science); etc….

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 (see current

info here). Note that Google Scholar does not exclude self-citations and may miss some citations from books,

etc…. Some citations of my results in monographs and textbooks can be found here: Text Book: Graph Classes,

Monograph: Graph Repr., Monograph: Spanners, Monograph: Intersection Graphs, Monograph: Coloring,

Handbook: Graphs. Some use of my papers in course materials by other researchers can be found here: France,

Taiwan (search for “dragan”).

I collaborate with many top international researchers in my field from different countries, including USA,

CANADA, FRANCE, GERMANY, NORWAY, CHILE, etc…. I held a number of visiting professor /

visiting researcher positions in many universities around the world. I gave a number of invited colloquium

talks and conference presentations. I have served on the program committee of several international

conferences. I wrote a number of referee reports on papers submitted for possible publication to different

scientific journals or conference proceedings.

During the period of September 2003 thru August 2009:

I published 19 journal articles in prestigious top level and with high impact Computer Science

international journals. Among them, 5 papers in premium and 10 papers in leading journals.

I published 21 refereed conference articles (from 9 to 13 pages each) in proceedings of

prestigious top level and with high impact Computer Science refereed international conferences.

Among them, 3 papers in Rank 1, 12 papers in Rank 2, and 4 papers in Rank 3 conferences.

Among other papers, during this period, I published: 1 paper in a venue with impact 1.68/top 6.14%

(KDD); 1 paper in a venue with impact 1.51/top 8.76% (SoCG); 2 papers in a venue with impact

1.42/top 10.31% (J. of Algorithms); 2 papers in a venue with impact 1.31/top 12.20% (Algorithmica); 1

paper in a venue with impact 1.05/top 21.29% (Wireless Networks); 1 paper in a venue with impact

1.02/top 22.44% (Theory of Computing Systems); 1 paper in a venue with impact 0.97/top 24.65%

(ICALP); 1 paper in a venue with impact 0.92/top 27.27% (SIAM J. on Discrete Math.); 3 papers in a

venue with impact 0.91/top 27.68% (Theoretical Computer Science); etc….

7 new journal articles are submitted for possible publication to prestigious top level and with

high impact Computer Science international journals. Among them, 6 papers to premium journals

and 1 paper to a leading journal. 5 more papers are under preparation.

The total number of citations of my papers is 778, as of August 2009 (see current info here).

2 papers presented at conferences (WMAN’2004, CIAC’2006) were invited to submit to the

special issues "Best papers of …." to be published in prestigious journals.

1 paper submitted to the ICCCN’2004 conference was nominated for the best paper award.

1 paper published in Discrete Applied Mathematics in 2003 was included in the prestigious volume

“Editors Choice 2003, a representative collection of excellent papers published in Discrete

Applied Mathematics in 2003”. (DAM is a leading journal in General Computer Science area.)

My paper Estimating All Pairs Shortest Paths in Restricted Graph Families: A Unified Approach

published in Journal of Algorithms in 2005 made few times the list “One of the TOP25 Hottest Articles

within the Journal of Algorithms” (in Jan-Mar 2005 list, in Jul-Sep 2005 list, in Oct-Dec 2005 list, in

Jan-Mar 2006 list, and in Apr-Jun 2006 list). (Journal of Algorithms is a premium journal in Algorithms

and Theory area, impact: 1.42.)

Paper Distance and routing labeling schemes for non-positively curved plane graphs (by

V.D. Chepoi, F.F. Dragan, Y. Vaxès) published in Journal of Algorithms in 2006 made few times the list

“One of the TOP25 Hottest Articles within the Journal of Algorithms” (in Jan-Mar 2008 list, in Jul-

Sep 2007 list, in Apr-June 2007 list, in Jan-Mar 2007 list, and in Oct-Dec 2006 list). (Journal of

Algorithms is a premium journal in Algorithms and Theory area, impact: 1.42.)

Summer and Fall of 2007 I was on Faculty Professional Improvement Leave. Here is my report.

In recognition of my research work, recently, I was offered (and I held) visiting professor / visiting

researcher positions at several universities around the world: University of Bergen, Norway; Technische

Universität Berlin, Germany; University Paris Diderot – Paris 7; Université de la Mediterranée, Marseille,

France; University of Chile, Santiago, Chile.

I gave 15 invited conference & colloquia talks, and 20 contributed conference talks.

During this period, I have graduated 2 PhD students (one more to graduate this FALL 2009), 13 MS

students and 2 MA (with research project) students.

I submitted 3 grant proposals: 1 to NSF and 2 to the Ohio Board of Regents Research Challenge Funds

(unfortunately, they were not funded). Three more proposals: one to NSF and two to FAA (with my

colleagues) are currently under preparation.

I received a number of financial supports to visit several universities around the world.

I have served on the program committee of several international conferences and I wrote a number of

referee reports on papers submitted for possible publication to different scientific journals or conference

proceedings (more than 100 items).

Here is an overview of my current research.

Publications (refereed)

(Estimated impact of publication venues in Computer Science (higher is better); the highest impact in

Theoretical Computer Science has STOC conference, with impact 1.69)

In Journals (Computer Science Journal Rankings)

1. Network Flow Spanners F.F. Dragan and C. Yan

Networks, accepted, 2009. (Networks is a leading journal in System Technology area.)

2. Effective Monitor Placement in Internet Networks Y. Breitbart , F.F. Dragan, H. Gobjuka

Journal of Networks, in print, 2009. (Relatively new journal, not ranked yet.)

3. Collective Tree Spanners in Graphs with Bounded Genus, Chordality, Tree-width, or Clique-width

F.F. Dragan and C. Yan

Algorithmica, in print, 2009. (Algorithmica is a premium journal in Algorithms and Theory area,

impact: 1.31.)

4. 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. (Relatively new journal, not ranked yet.)

5. 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. (Algorithmica is a premium journal in Algorithms and Theory area,

impact: 1.31.)

6. 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

Electronic Notes in Discrete Mathematics 31 (2008), 231-234. (Relatively new journal, not ranked

yet.)

7. On compact and efficient routing in certain graph classes Dragan F.F. and I. Lomonosov

Discrete Applied Mathematics 155 (2007), 1458-1470. (Discrete Applied Mathematics is a leading

journal in General Computer Science area, impact: 0.5.)

8. Spanners for bounded tree-length graphs Y. Dourisboure, Dragan F.F., C. Gavoille, and C. Yan

Theoretical. Computer Science 383 (2007), 34-44. (Theoretical Computer Science is a leading

journal in Algorithms and Theory area, impact: 0.91.)

9. 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).

(Journal of Algorithms is a premium journal in Algorithms and Theory area, impact: 1.42.)

10. 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)". (Wireless

Networks is a leading journal in System Technology area, impact: 1.05.)

11. 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. (Journal of Graph

Algorithms and Applications is a leading journal in Algorithms and Theory area.)

12. Collective tree spanners of graphs F.F. Dragan, C. Yan and I. Lomonosov

SIAM J. Discrete Math. 20 (2006), 241-260. (SIAM Journal on Discrete Mathematics is a premium

journal in General Computer Science area, impact: 0.92.)

13. 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. (Theoretical Computer Science is a leading journal

in Algorithms and Theory area, impact: 0.91.)

14. 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)

(Journal of Algorithms is a premium journal in Algorithms and Theory area, impact: 1.42.)

15. 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. (High impact journal, however, not ranked yet,

impact: 1.02.)

16. 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. (Theoretical Computer Science is a leading

journal in Algorithms and Theory area, impact: 0.91.)

17. 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. (Networks is a leading journal in System Technology area.)

18. 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. (Discrete Applied Mathematics is a leading journal in

General Computer Science area, impact: 0.5.)

19. 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. (Discrete Applied Mathematics is a leading journal in General Computer Science

area, impact: 0.5.)

In Refereed Proceedings (Computer Science Conference Rankings) (each paper has from 9 to 13 pages)

1. 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. Rank 2

conference in Algorithms and Theory area, impact: 0.82.

2. 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. Rank 2 conference in Algorithms and Theory area, impact: 0.48.

3. 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. Rank 2 conference in Algorithms and Theory area, impact: 0.51.

4. 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. Rank 1 conference in Data Mining area, impact: 0.35.

5. 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. Rank 2

conference in Algorithms and Theory area, impact: 0.48.

6. 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. Rank 1 conference in Data Mining area, impact:

1.68.

7. 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. Rank

2 conference in Algorithms and Theory area, impact: 0.97.

8. 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. Rank 3 conference in Algorithms and Theory area, impact: 0.58.

9. 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. Rank 1 conference in Algorithms and Theory area,

impact: 1.51.

10. 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. Rank 2 conference in

Algorithms and Theory area, impact: 0.42.

11. 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. Rank 2 conference in

Algorithms and Theory area, impact: 0.8.

12. 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). Rank

3 conference in Algorithms and Theory area, impact: 0.56.

13. 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. Rank 2

conference in Algorithms and Theory area, impact: 0.42.

14. 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. Rank 2 conference in Algorithms and Theory area, impact: 0.51.

15. 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.

Rank 3 conference in Algorithms and Theory area, impact: 0.58.

16. 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. (Relatively new, not ranked yet.)

17. 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. Rank 2 conference in Algorithms and Theory area, impact: 0.51.

18. 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)

19. 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. Rank 2 conference in

Algorithms and Theory area, impact: 0.8.

20. 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. Rank 3 conference in Algorithms and Theory area, impact: 0.58.

21. 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)). Rank 2 conference in System Technology area, impact: 0.2.

Manuscripts Submitted to Journals

1. How to use spanning trees to navigate in graphs

F.F. Dragan and Y. Xiang

Manuscript, 2009 (submitted to Algorithmica, 2009) (Algorithmica is a premium journal in

Algorithms and Theory area, impact: 1.31.)

2. Summarizing transactional databases with overlapped hyperrectangles: theories and algorithms

Y. Xiang, R. Jin, D. Fuhry, F.F. Dragan

Manuscript, 2009 (submitted to journal Data Mining and Knowledge Discovery, 2009) (Data Mining

and Knowledge Discovery is a premium journal in Data Mining area, impact: 2.08.)

3. Compact and Low Delay Routing Labeling Scheme for Unit Disk Graphs

C. Yan, Y. Xiang and F.F. Dragan

Manuscript, 2008 (submitted to journal Computational Geometry: Theory and

Applications, 2009) (Computational Geometry: Theory and Applications is a leading journal in

Software Technology area, impact: 1.18.)

4. Navigating in a graph by aid of its spanning tree

F.F. Dragan and M. Matamala

Manuscript, 2008 (submitted to SIAM J. on Discrete Mathematics, 2009) (SIAM Journal on Discrete

Mathematics is a premium journal in General Computer Science area, impact: 0.92.)

5. Spanners in sparse graphs

F.F. Dragan, F. Fomin and P. Golovach

Manuscript, 2008 (submitted to SIAM J. on Computing, 2008) (SIAM Journal on Computing is a

premium journal in Algorithms and Theory area, impact: 1.64.)

6. Additive Spanners for Circle Graphs and Polygonal Graphs

F.F. Dragan, D.G. Corneil, E. Köhler and Y. Xiang

Manuscript, 2008 (submitted to ACM Trans. on Algorithms, 2009) (New journal, replaced Journal of

Algorithms, a premium journal in Algorithms and Theory area, impact: 1.42.)

7. Additive Spanners and Distance and Routing Labeling Schemes for δ-Hyperbolic Graphs

V.D. Chepoi, F.F. Dragan, B. Estellon, M. Habib, Y. Vaxes and Y. Xiang

Manuscript, 2008 (submitted to Algorithmica, 2008) (Algorithmica is a premium journal in

Algorithms and Theory area, impact: 1.31.)

Recent Visits and Visiting Positions

1. 05/26/07 – 06/20/07 Algorithms Research Group, Department of Informatics, University of

Bergen, Norway (Visiting Researcher) link

2. 06/25/07 – 09/30/07 Combinatorial Optimization & Graph Algorithms Group at the Technische

Universität Berlin, Germany (Visiting Researcher) link

3. 10/01/07 – 12/20/07 Research Group on Algorithms and Combinatorics, Department of Computer

Science at University Paris Diderot – Paris 7 (Visiting Professor) link

4. 10/18/07 – 10/24/07 Laboratoire d’Informatique Fondamentale de Marseille, Université de la

Mediterranée, Marseille, France (Visiting Researcher)

5. 05/10/08 – 07/10/08 Discrete Maths and Theoretical Computer Science group (DMTCS),

University of Chile, Santiago, Chile (Visiting Researcher) link

6. 06/01/09 – 06/30/09 Laboratoire d’Informatique Fondamentale de Marseille, Université de la

Mediterranée, Marseille, France (Visiting Professor) link

Presentations

Invited conference & colloquia Talks 1. 06/09 Laboratoire d’Informatique Fondamentale de Marseille, Université de la Mediterranée, Marseille,

France

2. 03/09 Computer Science Department, University of Rostock, Germany (invited by Prof. Andreas

Brandstädt) link

3. 05/09 2nd Canadian Discrete and Algorithmic Mathematics Conference, Montréal, Canada

4. 03/09 "Algorithmic Graph Theory"- AGT 2009 conference, University of Warwick, UK

5. 06/08 Discrete Maths and Theoretical Computer Science Group (DMTCS), University of Chile,

Santiago, Chile link

6. 10/07 Laboratoire d’Informatique Fondamentale de Marseille, Université de la Mediterranée, Marseille,

France

7. 10/07 Research Group on Algorithms and Combinatorics, Department of Computer Science at University

Paris Diderot – Paris 7 link

8. 09/07 Combinatorial Optimization & Graph Algorithms Group at the Technische Universität Berlin,

Germany

9. 07/07 Combinatorial Optimization & Graph Algorithms Group at the Technische Universität Berlin,

Germany

10. 06/07 Algorithms Research Group, Department of Informatics, University of Bergen, Norway link

11. 05/07 Dagstuhl-Seminar on "Exact, Approximate, Robust and Certifying Algorithms on Particular Graph

Classes", Dagstuhl, Germany link

12. 06/06 SIAM Conference on Discrete Mathematics, Victoria, BC, Canada

13. 05/05 First ACIS International Workshop on Self-Assembling Wireless Networks (SNPD/SAWN'05),

Towson University, Maryland, USA

14. 12/04 RUTCOR Colloquia - Rutgers University, Piscataway, NJ link

15. 06/04 SIAM Conference on Discrete Mathematics, Nashville, TN, USA

Contributed conference talks 1. 08/09 The Algorithms And Data Structures Symposium (WADS 2009), Banff Conference Centre, Banff,

Alberta, Canada

2. 08/09 34th International Symposium on Mathematical Foundations of Computer Science (MFCS 2009),

Novy Smokovec, High Tatras, Slovak Republic

3. 12/08 19th International Symposium on Algorithms and Computation (ISAAC 2008), Surfers Paradise,

Gold Coast, Australia

4. 08/08 33rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2008),

Torun, Poland

5. 07/08 35th International Colloquium on Automata, Languages and Programming (ICALP 2008),

Reykjavik, Iceland

6. 07/08 34th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2008),

Durham University, U.K.

7. 06/08 24th Annual ACM Symposium on Computational Geometry (SoCG 2008), College Park,

Maryland, USA

8. 05/08 International Conference on Topological and Geometric Graph Theory (TGGT 2008), Paris,

France

9. 04/08 8th Latin American Symposium on Theoretical Informatics (LATIN 2008), Búzios, Brazil

10. 06/07 33rd International Conference on Graph-Theoretic Concepts in Computer Science (WG’07),

Dornburg near Jena, Germany

11. 07/06 10th Scandinavian Workshop on Algorithm Theory (SWAT' 06), Riga, Latvia

12. 05/06 6th Conference on Algorithms and Complexity (CIAC' 2006), Rome, Italy

13. 03/06 7th Latin American Symposium ''LATIN 2006: Theoretical Informatics'', Valdivia, Chile

14. 12/05 16th Annual International Symposium on Algorithms and Computation (ISAAC 2005), Sanya,

Hainan, China

15. 06/05 31st International Workshop "Graph-Theoretic Concepts in Computer Science" (WG '05), Metz,

France

16. 12/04 15th Annual International Symposium on Algorithms and Computation (ISAAC 2004), HKUST,

Hong Kong

17. 10/04 13th International Conference on Computer Communications and Networks (ICCCN 2004),

Chicago, IL, USA

18. 07/04 9th Scandinavian Workshop on Algorithm Theory (SWAT'04), Humlebæk, Denmark

19. 06/04 30th International Workshop "Graph-Theoretic Concepts in Computer Science"(WG '04),

Hölterhoff House at Bad Honnef, close to Bonn, Germany

20. 04/04 4th International Workshop on Algorithms for Wireless, Mobile, Ad Hoc and Sensor Networks

(WMAN'04), Santa Fe, New Mexico

Here are some power-point presentations: WMAN’2004, SWAT'2004, SAWN'2005,

ISAAC'2005, LATIN'2006, CIAC'2006, ICALP'2008, MFCS'2008, AGT'2009, MFCS'2009

Directed Dissertations & Theses

I graduated the following PhD students:

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”.

One more PhD student (Yang Xiang; 12 published papers) is graduating this Fall 2009.

I graduated the following MS students:

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

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

Cellular Networks”.

3. Mutasem Najdawi, 2005, “Implementation of Addressing, Distance and Routing Labeling Schemes

for Triangular Systems”.

4. Amit Borwankar, 2005, “Nearest Neighbor Embracing Graph (NNEG) as a New Topology for

Wireless Ad-hoc Networks “.

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

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

Problem”.

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

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

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

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

11. Bhaduri, Sudipta, 2008, “Maximum cliques and minimum colorings of chordal graphs via minimum

degree orderings”.

12. Rahul Sehgal, 2009, “Greedy routing in a graph by aid of its spanning tree: experimental results and

analysis”.

13. Rab Harbart, August 2009, “Dealing with cellular networks having holes”.

I graduated the following MA students (with research projects):

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”.

Research Proposals, Financial Supports

Extramural 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), not funded. Ratings from NSF (good, very good, very good)

Issues and Challenges in Wireless Mesh (Grid) Networks - Ohio Board of Regents Research

Challenge Funds, $ 58,401, 1 year (2006) (with Dr. Peyravi as co-PI), not funded.

Message routing in structured large scale distributed networks -Ohio Board of Regents Research

Challenge Funds, $ 114,507, 2 years (2003-2004), not funded.

I work in Theoretical Computer Science where very little money is available for support. Recently, I

collaborated with other faculty in preparation of more application oriented grant proposals. Two FAA

proposals are under preparation: one with Dr. Breitbart, Dr. Jin and Dr. Zhao on Data Mining and

Visualization of Flight Data Flow; another with Dr. Khan and Dr. Peyravi on New Generation Network

Solutions. I plan also to submit a proposal “New Methods for Scalable Navigation in Networks” to NSF

CCF (AF) in December 2009.

Other Research Funding ~$ 5,000 from Algorithms Research Group, Department of Informatics, University of Bergen, Norway for

research visit from 05/26/07 to 06/20/07 (4 weeks).

~$ 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 (3+ months).

~$ 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 (3 months).

~$ 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 (one week).

~$ 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 (2 months).

~$ 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 (one month).

Integrative Activities

Recent Collaborators: A. Brandstädt (U Rostock, Germany), Y. Breitbart (Kent, OH), V.D.

Chepoi (U Marseille, France), D.G. Corneil (U Toronto, Canada), Y. Dourisboure (U. Bordeaux,

France), B. Estellon (U. Marseille, France), F.V. Fomin (U. Bergen, Norway), D. Fuhry (Kent,

OH), C. Gavoille (U. Bordeaux, France), P.A. Golovach (U. Bergen, Norway), M. Habib (U

Montpellier, France), R. Jin (Kent, OH), E. Köhler (TU Berlin, Germany), V.B. Le (U Rostock,

Germany), Y. Vaxes (U Marseille, France).

Member of Program Committee for

o WG 2009: 35th International Workshop on Graph-Theoretic Concepts in Computer Science (WG

2009), June 24-26, 2009, Montpellier, France

o SAWN 2006: 2nd ACIS International Workshop on Self-Assembling Wireless Networks, June 19

- 20, 2006, Excalibur Hotel, Las Vegas, Nevada, USA

o SAWN 2005: 1st ACIS International Workshop on Self-Assembling Wireless Networks, May 24,

2005, Towson University, Maryland, USA

o MASS 2004: The 1st IEEE International Conference on Mobile Ad-hoc and Sensor Systems,

October 24-27, 2004, Fort Lauderdale, Florida, USA o Dagstuhl-Seminar on "Exact, Approximate, Robust and Certifying Algorithms on Particular

Graph Classes", Dagstuhl, Germany (one week, May 2007)

Reviewer for Computing Reviews (6 reviews)

Reviewer for the Chilean Science Foundation (3 proposals)

Referee for

1. Journal of Algorithms (5 papers)

2. Computational Geometry: Theory and Applications (2 papers)

3. IEEE Transactions on Computers (2 papers)

4. IEEE Transactions on Parallel and Distributed Systems (2 papers)

5. Information Processing Letters (5 paper)

6. Parallel Processing Letters (1 paper)

7. SIAM Journal on Computing (4 papers)

8. SIAM Journal on Discrete Mathematics (8 papers)

9. Discrete Mathematics (10 papers)

10. Discrete Applied Mathematics (16 papers)

11. Journal of Information Science and Engineering (2 papers)

12. Journal of Graph Algorithms and Applications (5 papers)

13. Journal of Parallel and Distributed Computing (1 paper)

14. Ars Combinatorica (4 papers)

External reviewer for

1. 30th International Workshop "Graph-Theoretic Concepts in Computer Science" (WG '04), Hölterhoff

House at Bad Honnef, close to Bonn, Germany.

2. 31st International Workshop "Graph-Theoretic Concepts in Computer Science" (WG '05), Metz,

France.

3. 32nd International Workshop "Graph-Theoretic Concepts in Computer Science" (WG '06), Bergen,

Norway.

4. 33rd International Workshop "Graph-Theoretic Concepts in Computer Science” (WG’07), Dornburg

near Jena, Germany

5. 35th International Workshop “Graph-Theoretic Concepts in Computer Science” (WG’09),

Montpellier, France

6. 36th International Colloquium on Automata, Languages and Programming (ICALP’09), Rhodes -

Greece

7. 20th International Symposium on Theoretical Aspects of Computer Science (STACS 2003), Berlin,

Germany.

8. Fourth IEEE Symposium on Bioinformatics and Bioengineering (BIBE'04).

9. The 1st IEEE International Conference on Mobile Ad-hoc and Sensor Systems (MASS 2004), 2004,

Fort Lauderdale, Florida, USA.

10. 4th International Workshop on Algorithms for Wireless, Mobile, Ad Hoc and Sensor Networks

(WMAN'04), Santa Fe, New Mexico, 2004.

11. 19th International Symposium on Distributed Computing (DISC 2005), Cracow, Poland

12. 20th International Symposium on Distributed Computing (DISC 2006), Stockholm, Sweden.

13. ACM-SIAM Symposium on Discrete Algorithms (SODA 2006), Miami, Florida.

14. ACM-SIAM Symposium on Discrete Algorithms (SODA 2007), New Orleans, Louisiana.

15. ACM-SIAM Symposium on Discrete Algorithms (SODA 2008), San Francisco, California

16. 17th International Symposium on Algorithms and Computation (ISAAC 2006), Kolkata, India

Used Links to:

My CV and List of Publications

My lists of publications from the DBLP Bibliography Server, Google Scholar and ACM Digital

Library

Computer Science Journal Rankings

Computer Science Conference Rankings

Estimated impact of publication venues in Computer Science

Citations of my papers in other scientific papers, textbooks, monographs and course materials: my

H-index and G-index

Documentation on my publications honored with: “Editors Choice 2003", "TOP25 Hottest

Articles", "Best papers of …."

My report on my "Faculty Professional Improvement Leave"

All my papers published and submitted for publication during this period (with level of venues and

their impact to the discipline)

Home pages of all journals where I publish

Documentation of Recent Visits and Visiting Positions, Recent Invited Conference & Colloquia

Talks

Samples of my conference presentations (10 talks).

A copy of my grant proposal submitted to NSF-CCF (CIF:AF) with ratings from NSF.

Documentation on international conferences where I served as a Member of Program Committee

An overview of my current research.

Feodor F. Dragan

Service & Citizenship (Period: September, 2003 thru August, 2009)

Departmental Service Committee Member

o Colloquium Committee (2003 – 2005, 2008 – till now) o Graduate Study Committee (2004 – 2006, 2008 – till now) o Curriculum Committee (2005 – 2007) o Subcommittee of the Curriculum Committee (2008) o Chair Evaluation Committee (2005) o Merit Committee (2008) o Qualifying Exam Committee (2003 – 2005) o Prelim. Exam Committee (2006 – 2007, 2008 – till now)

Committees chaired o Curriculum Committee (2006/2007) o Colloquium Committee (2003 – 2005, 2008 – till now) As the Curriculum Committee chair I participated in the open door events organized by the admission office to attract potential majors to CS.

I hosted a number of short-term visitors (from 2 days to 2 weeks) to our department from universities of USA, CANADA, GERMANY, FRANCE, CHILE, etc…. All visitors gave lectures in our computer science colloquium series and worked with me and several other faculty members on some scientific problems of common interests.

I am/was a member of Dissertation/Thesis committees for: David Fuhry (CS, KSU); Nouman Bantan (CS, KSU); Asrar Haque (CS, KSU); Mohammed Jirari (CS, KSU); Oleg Komogortsev (CS, KSU); Raid Zaghal (CS, KSU); Rashid bin Muhammad (CS, KSU); Pradeep Kumar Punnam (CS, KSU); Yasir Drabu (CS, KSU); Vibha Tripathi (CS, KSU); Chenyu Yan (CS, KSU); Irina Lomonosov (CS, KSU); Yang Xiang (CS, KSU); Hassan Gobjuka (CS, KSU); etc…

I wrote a number of recommendation letters for students applying to PhD programs or for Financial Aid (to different universities).

During this period I organized and run weekly research seminars o With my PhD and MS students each semester from 2003 to 2009. o With Dr. Breitbart, his and my students in Spring/Fall 2005. o With Dr. Jin, his and my students in Summer/Fall 2006, in Spring 2007, in Spring/Fall

2008, in Spring 2009.

University & College Service

o I was a member of College Curriculum Committee (2006/2007) o I was a member of Dissertation Committee for Yuriy Kolomyets (MATH, KSU, 2006)

External Service I was a Member of Dissertation Defense Committee for Rodica Boliac (Rutgers University,

Piscataway, NJ, 2004). I served as an external reviewer for Tenure and Promotion Committee of the Computer Science

Department, Colorado State University (for Dr. Ross McConnell). I served as an external reviewer for Tenure and Promotion Committee of the Computer Science

and Electrical Engineering Department, West Virginia University (for Dr. Elaine M. Eschen). I serve as a reviewer for the Computing Reviews (ACM) I served as a Member of Program Committee for

o WG 2009: 35th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2009), June 24-26, 2009, Montpellier, France

o SAWN 2006: 2nd ACIS International Workshop on Self-Assembling Wireless Networks, June 19 - 20, 2006, Excalibur Hotel, Las Vegas, Nevada, USA

o SAWN 2005: 1st ACIS International Workshop on Self-Assembling Wireless Networks, May 24, 2005, Towson University, Maryland, USA

o MASS 2004: The 1st IEEE International Conference on Mobile Ad-hoc and Sensor Systems, October 24-27, 2004, Fort Lauderdale, Florida, USA

o Dagstuhl-Seminar on "Exact, Approximate, Robust and Certifying Algorithms on Particular Graph Classes", Dagstuhl, Germany (one week, May 2007)

Other Professional Activities

I serve as a referee for the following journals: 1. Journal of Algorithms 2. Computational Geometry: Theory and Applications 3. IEEE Transactions on Computers 4. IEEE Transactions on Parallel and Distributed Systems 5. Information Processing Letters 6. Parallel Processing Letters 7. SIAM Journal on Computing 8. SIAM Journal on Discrete Mathematics 9. Discrete Mathematics 10. Discrete Applied Mathematics) 11. Journal of Information Science and Engineering 12. Journal of Graph Algorithms and Applications 13. Journal of Parallel and Distributed Computing 14. Ars Combinatorica

I served as an external reviewer for the following conferences: 1. 30th International Workshop "Graph-Theoretic Concepts in Computer Science" (WG '04), Hölterhoff

House at Bad Honnef, close to Bonn, Germany. 2. 31st International Workshop "Graph-Theoretic Concepts in Computer Science" (WG '05), Metz,

France. 3. 32nd International Workshop "Graph-Theoretic Concepts in Computer Science" (WG '06), Bergen,

Norway. 4. 33rd International Workshop "Graph-Theoretic Concepts in Computer Science” (WG’07), Dornburg

near Jena, Germany 5. 35th International Workshop “Graph-Theoretic Concepts in Computer Science” (WG’09),

Montpellier, France 6. 36th International Colloquium on Automata, Languages and Programming (ICALP’09), Rhodes -

Greece 7. 20th International Symposium on Theoretical Aspects of Computer Science (STACS 2003), Berlin,

Germany. 8. Fourth IEEE Symposium on Bioinformatics and Bioengineering (BIBE'04). 9. The 1st IEEE International Conference on Mobile Ad-hoc and Sensor Systems (MASS 2004), 2004,

Fort Lauderdale, Florida, USA. 10. 4th International Workshop on Algorithms for Wireless, Mobile, Ad Hoc and Sensor Networks

(WMAN'04), Santa Fe, New Mexico, 2004. 11. 19th International Symposium on Distributed Computing (DISC 2005), Cracow, Poland 12. 20th International Symposium on Distributed Computing (DISC 2006), Stockholm, Sweden. 13. ACM-SIAM Symposium on Discrete Algorithms (SODA 2006), Miami, Florida. 14. ACM-SIAM Symposium on Discrete Algorithms (SODA 2007), New Orleans, Louisiana. 15. ACM-SIAM Symposium on Discrete Algorithms (SODA 2008), San Francisco, California 16. 17th International Symposium on Algorithms and Computation (ISAAC 2006), Kolkata, India