CURRICULUM VITAE 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/10 -
|
|
Professor of
Computer Science,
Department of Computer Science
Kent State University
|
|
08/04 -08/10
|
|
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 - 09/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 - 07/95,
10/95 - 12/95
|
|
Research
associate,
University of Duisburg, Germany:
DAAD Research
Fellowship, Host professor: Andreas
Brandstaedt
|
|
03/94, 06/94,
08/95 - 09/95
|
|
Research
associate,
University of Duisburg, Germany:
Research supported by the Volkswagen
Foundation (VW)
|
|
07/95 - 09/99
|
|
Associate
professor,
Dept. of Mathematics and Cybernetics,
Moldova State
University
|
|
01/88 - 09/96
|
|
Research
associate,
Discrete Optimization Laboratory, Moldova
State University
|
|
12/88 - 06/95
|
|
Assistant
professor,
Dept. of Mathematics and Cybernetics, Moldova State
University
|
|
02/82 - 07/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
Universitaet 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, Universite de la Mediterranee, 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, Universite de la Mediterranee, Marseille, France
|
|
|
11/01/10 - 11/12/10
|
|
Discrete
Maths and Theoretical Computer Science group
(DMTCS), University of Chile, Santiago,
Chile
|
|
|
05/06/11 - 05/14/11
|
|
Lehrstuhl fuer Diskrete Mathematik und Grundlagen der Informatik, Brandenburgische
Technische Universitaet
Cottbus, Germany
|
|
|
06/20/15 - 06/30/15
|
|
Lehrstuhl fuer Diskrete Mathematik und Grundlagen der Informatik, Brandenburgische
Technische Universitaet
Cottbus, Germany
|
|
|
09/15/15 - 12/15/15
|
|
Laboratoire d'Informatique Fondamentale,
Faculte des Sciences, site de Luminy,
Aix-Marseille Universite, Marseille
|
|
|
05/15/16 - 06/15/16
|
|
Research
Group on Algorithms and Combinatorics, Department of Computer Science at
University Paris Diderot - Paris 7
|
|
|
03/23/19 - 03/30/19
|
|
Research
Group on Algorithms and Combinatorics, Department of Computer Science at
University Paris Diderot - Paris 7
|
|
|
03/08/20 - 03/14/20
|
|
Lehrstuhl fuer Diskrete Mathematik und Grundlagen der Informatik, Brandenburgische
Technische Universitaet
Cottbus, Germany
|
|
|
01/05/22 - 01/11/22
|
|
Laboratoire d`Informatique
Fondamentale de Marseille, Universite de la Mediterranee, Marseille, France
|
|
|
06/01/23 - 07/15/23
|
|
Laboratoire
d'Informatique et Systemes,
Faculte des Sciences, site de Luminy, Aix Marseille Universite,
Marseille, France
|
|
|
09/01/23 - 09/30/23
|
|
Research Group on
Algorithms and Discrete Structures of Institute De Recherche en Informatique Fondamentale
(IRIF), Universite Paris Cite, France
|
|
|
09/07/24 - 09/14/24
|
|
Lehrstuhl
fuer Diskrete Mathematik und Grundlagen der
Informatik, Brandenburgische Technische Universitaet
Cottbus, Germany
|
|
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 and
mining.
Recent
Publications (while at
Kent State University; extended list of previous work 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), ResearchGate)
In Total: 39+ articles are published in premium journals; 36+ articles are published in leading journals; 9+ articles are published in reputable journals; 18+ articles are published in rank 1 conferences; 32+ articles are published in rank 2 conferences; 21+ articles are published in rank 3 conferences. Former Soviet Union
journals and conferences are not ranked.
My h-index
is 38,
my i10-index
is 91,
my Erdős number
is 3 (e.g., Feodor
F. Dragan to Dieter
Kratsch to Paul
Erdős) and the total number of citations of my papers is more than 4000.
2026
- Feodor F. Dragan, Guillaume Ducoffe, Michel Habib, Laurent
Viennot: Certificates in P and Subquadratic-Time
Computation of Radius, Diameter, and all Eccentricities in Graphs. Algorithmica
88(1): 13
(2026)
2025
- Feodor F.
Dragan and Guillaume Ducoffe, Heather M. Guarnera: Fast deterministic algorithms for
computing all eccentricities in (hyperbolic) Helly graphs. J. Comput.
Syst. Sci. 149: 103606 (2025)
- Feodor F. Dragan, Guillaume Ducoffe, Michel
Habib, Laurent Viennot: Certificates in P and Subquadratic-Time Computation of Radius, Diameter, and all
Eccentricities in Graphs. SODA 2025: 2157-2193 (invited to a special issue
of Algorithmica devoted to selected papers from
SODA 2025)
- Guillaume
Aubian, Filippo Brunelli, Feodor F. Dragan, Guillaume Ducoffe, Michel Habib, Allen Ibiapina, Laurent Viennot:
On the
Complexity of Computing a Fastest Temporal Path in Interval Temporal Graphs. CoRR
abs/2501.11380 (2025)
- Feodor F. Dragan:
Graph parameters that are coarsely
equivalent to tree-length.
CoRR
abs/2502.00951 (2025)
- Feodor F.
Dragan, Ekkehard Koehler:
Graph
parameters that are coarsely equivalent to path-length.
CoRR abs/2503.05661 (2025)
2024
- Feodor F.
Dragan and Guillaume Ducoffe: ɑi-Metric Graphs: Radius, Diameter and all Eccentricities. Algorithmica (2024). https://doi.org/10.1007/s00453-024-01223-6.
- Feodor F.
Dragan, Guillaume Ducoffe: ɑi-Metric
Graphs: Hyperbolicity. CoRR
abs/2404.14792 (2024), 21 pages
- Feodor F.
Dragan, Guillaume Ducoffe, Michel Habib, Laurent
Viennot: Bow
Metrics and Hyperbolicity.
CoRR
abs/2411.16548 (2024),
23 pages
- Feodor F. Dragan, Graph
parameters that are coarsely equivalent to tree-length, manuscript (2024), 30 pages
2023
2022
- Heather M.
Guarnera, Feodor F. Dragan, Arne Leitert: Injective Hulls of Various
Graph Classes. Graphs Comb. 38(4): 112 (2022),
28 pages
2021
- Jeremie
Chalopin, Victor Chepoi, Feodor F. Dragan, Guillaume Ducoffe, Abdulhakeem
Mohammed, Yann Vaxes:
Fast Approximation and Exact Computation of Negative Curvature
Parameters of Graphs. Discret. Comput. Geom. 65(3): 856-892 (2021)
- Guillaume
Ducoffe, Feodor F. Dragan:
A story of diameter, radius, and (almost) Helly property. Networks 77(3):
435-453 (2021)
- Feodor F.
Dragan, Heather M. Guarnera:
Helly-gap of a graph and vertex eccentricities. Theor. Comput. Sci. 867: 68-84 (2021)
- Feodor F.
Dragan, Guillaume Ducoffe, Heather M. Guarnera:
Fast Deterministic Algorithms for Computing All Eccentricities in
(Hyperbolic) Helly Graphs. WADS 2021:
300-314
- Abdulhakeem Othman Mohammed, Feodor F. Dragan, Heather M.
Guarnera: Fellow Travelers Phenomenon Present in Real-World Networks.
COMPLEX NETWORKS 2021: 194-206
- Feodor F.
Dragan, Guillaume Ducoffe, Heather M. Guarnera:
Fast deterministic algorithms for computing all
eccentricities in (hyperbolic) Helly graphs. CoRR abs/2102.08349 (2021)
2020
- Feodor F. Dragan:
An eccentricity 2-approximating
spanning tree of a chordal graph is computable in linear time. Inf. Process. Lett. 154 (2020)
- Feodor F.
Dragan, Heather M. Guarnera:
Eccentricity terrain of
δ-hyperbolic graphs. J. Comput. Syst. Sci. 112: 50-65 (2020)
- Feodor F.
Dragan, Heather M. Guarnera:
Eccentricity function in
distance-hereditary graphs. Theor. Comput. Sci. 833: 26-40 (2020)
- Ruoming Jin,
Zhen Peng, Wendell Wu, Feodor F. Dragan, Gagan Agrawal, Bin Ren:
Parallelizing pruned landmark
labeling: dealing with dependencies in graph algorithms. ICS 2020: 11:1-11:13
- Feodor F.
Dragan, Heather M. Guarnera:
Eccentricity terrain of δ-hyperbolic graphs. CoRR abs/2002.08495 (2020)
- Feodor F.
Dragan, Heather M. Guarnera:
Helly-gap of a graph and vertex eccentricities. CoRR abs/2005.01921 (2020)
- Heather M.
Guarnera, Feodor F. Dragan, Arne Leitert:
Injective hulls of various graph classes. CoRR abs/2007.14377 (2020)
2019
- Feodor F.
Dragan, Heather
M. Guarnera:
Obstructions to a
small hyperbolicity in Helly graphs. Discrete Mathematics 342(2):
326-338 (2019)
- Feodor F. Dragan, Abdulhakeem
Mohammed:
Slimness
of graphs. Discrete Mathematics
& Theoretical Computer Science 21(3) (2019)
- Arne Leitert, Feodor F.
Dragan:
Parameterized
approximation algorithms for some location problems in graphs.
Theor.
Comput. Sci. 755: 48-64 (2019)
- Victor Chepoi, Feodor F. Dragan, Michel Habib, Yann Vaxes,
Hend Alrasheed:
Fast
approximation of eccentricities and distances in hyperbolic graphs. J. Graph Algorithms
Appl. 23(2): 393-433 (2019)
- Ruoming Jin, Zhen Peng, Wendell Wu, Feodor F. Dragan, Gagan
Agrawal, Bin Ren:
Pruned Landmark
Labeling Meets Vertex Centric Computation: A Surprisingly Happy Marriage! CoRR
abs/1906.12018 (2019)
- Feodor F. Dragan, Heather
M. Guarnera:
Eccentricity
function in distance-hereditary graphs. CoRR
abs/1907.05445 (2019)
- Feodor F. Dragan, Guillaume Ducoffe:
A story of diameter,
radius and Helly property.
CoRR
abs/1910.10412 (2019)
2018
- Fast
Approximation of Centrality and Distances in Hyperbolic Graphs,
Victor Chepoi, Feodor F. Dragan, Michel Habib, Yann Vaxes, Hend
Alrasheed,
COCOA 2018: 3-18
- Fast
approximation and exact computation of negative curvature parameters of
graphs,
Jeremie Chalopin, Victor Chepoi, Feodor F. Dragan, Guillaume Ducoffe,
Abdulhakeem Mohammed, Yann Vaxes,
Symposium on
Computational Geometry 2018: 22:1-22:15
- Revisiting
Radius, Diameter, and all Eccentricity Computation in Graphs through
Certificates,
Feodor F. Dragan, Michel Habib, Laurent Viennot,
CoRR
abs/1803.04660 (2018)
- Fast
approximation and exact computation of negative curvature parameters of
graphs,
Jeremie Chalopin, Victor Chepoi, Feodor F. Dragan, Guillaume Ducoffe, Abdulhakeem Mohammed, Yann Vaxes,
CoRR
abs/1803.06324 (2018)
- Fast
approximation of centrality and distances in hyperbolic graphs,
Victor Chepoi, Feodor F. Dragan, Michel Habib, Yann Vaxes, Hend
Al-Rasheed,
CoRR
abs/1805.07232 (2018)
2017
- Line-distortion,
Bandwidth and Path-length of a graph,
F.F. Dragan, Ekkehard Koehler and Arne Leitert,
Algorithmica
77(3): 686-713 (2017)
- Preface:
Special graph classes and algorithms-in honor of Professor Andreas
Brandstaedt on the occasion of his 65th birthday,
Feodor F. Dragan, Dieter Kratsch, Van Bang Le,
Discrete Applied
Mathematics 216: 1 (2017)
- Eccentricity
approximating trees,
F.F. Dragan, Ekkehard Koehler and Hend Alrasheed,
Discrete Applied
Mathematics 232: 142-156 (2017)
- On
the minimum eccentricity shortest path problem,
Feodor F. Dragan, Arne Leitert,
Theor.
Comput. Sci. 694: 66-78 (2017)
- Core-Periphery
Models for Graphs Based on their δ-Hyperbolicity: An Example Using
Biological Networks
Hend Alrasheed, Feodor F. Dragan
Journal of Algorithms and Computational
Technology, 11 (2017), 40-57.
- Parameterized
Approximation Algorithms for some Location Problems in Graphs,
Arne Leitert and Feodor F. Dragan,
COCOA 2017: 348-361
- Core
congestion is inherent in hyperbolic networks,
Victor Chepoi, Feodor F. Dragan, Yann Vaxes,
SODA 2017: 2264-2279
- Slimness
of graphs,
F.F. Dragan and Abdulhakeem Mohammed,
CoRR
abs/1705.09797 (2017)
- Parameterized
Approximation Algorithms for some Location Problems in Graphs,
Arne Leitert and Feodor F. Dragan,
CoRR
abs/1706.07475 (2017)
- Obstructions
to a small hyperbolicity in Helly graphs,
F.F. Dragan and Heather M. Guarnera,
CoRR
abs/1709.02837 (2017)
2016
- Lower
bounds on collective additive spanners
Derek G. Corneil, Feodor F. Dragan, Ekkehard Koehler, Yang Xiang
Manuscript, 2016
- Minimum
Eccentricity Shortest Paths in some Structured Graph Classes
F.F. Dragan and A. Leitert
J. Graph Algorithms
Appl. 20(2): pp. 299 - 322 (2016)
- Metric
tree-like structures in real-life networks: an empirical study
M. Abu-Ata and F.F. Dragan
Networks
67(1): 49-68 (2016).
- On
Strong Tree-Breadth,
Arne Leitert and F.F. Dragan,
COCOA 2016: 62-76
- The
Network of Genetic Admixture in Humans
Hend Alrasheed, Feodor F. Dragan
CompleNet
2016: 243-256 (2016).
- Eccentricity
Approximating Trees: Extended Abstract
Feodor Dragan, Ekkehard Koehler and Hend Alrasheed
WG 2016: 145-157
- Core
congestion is inherent in hyperbolic networks
Victor Chepoi, Feodor F. Dragan, and Yann Vaxes
CoRR
abs/1605.03059 (2016)
2015
2014
- An
Approximation Algorithm for the Tree t-Spanner Problem on Unweighted
Graphs via Generalized Chordal Graphs
Feodor F. Dragan, Ekkehard Koehler
Algorithmica 69(4): 884-905 (2014)
- Line-distortion,
Bandwidth and Path-length of a graph,
F.F. Dragan, Ekkehard Koehler and Arne Leitert,
SWAT 2014: 14th Scandinavian Symposium and Workshops on Algorithm
Theory, July 2-4 2014. Copenhagen, Denmark,
Lecture Notes in Computer Science 8503, 2014, pp. 146-257
- Collective
Additive Tree Spanners of Bounded Tree-Breadth Graphs with Generalizations
and Consequences
F.F. Dragan and M. Abu-Ata
Theoretical Computer Science, 547: 1-17 (2014)
- Metric
tree-like structures in real-life networks: an empirical study
M. Abu-Ata and F.F. Dragan
CoRR abs/1402.3364 (2014) 25 pages. http://arxiv.org/abs/1402.3364
- Line-distortion,
Bandwidth and Path-length of a graph
F.F. Dragan, E. Koehler, A. Leitert
CoRR abs/1409.8389 (2014) 24 pages. http://arxiv.org/pdf/1409.8389v1.pdf
2013
- Tree-like
Structures in Graphs: a Metric Point of View
Feodor F. Dragan
39th International Workshop on Graph-Theoretic Concepts
in Computer Science (WG 2013),
June 19 - 21, 2013, Luebeck, Germany, Springer, Lecture Notes in
Computer Science, 2013. (Invited
plenary talk)
- How
to use spanning trees to navigate in graphs
F.F. Dragan and Y. Xiang
Algorithmica 66(3): 479-511 (2013)
(available on-line at DOI:10.1007/s00453-012-9647-1)
- Collective
Additive Tree Spanners of Bounded Tree-Breadth Graphs with Generalizations
and Consequences
F.F. Dragan and M. Abu-Ata
SOFSEM 2013: Theory and Practice of Computer Science, Lecture Notes in
Computer Science 7741, 2013, pp. 194-206 (available on-line at DOI: 10.1007/978-3-642-35843-2_18)
2012
- Collective
Additive Tree Spanners of Bounded Tree-Breadth Graphs with Generalizations
and Consequences
F.F. Dragan and M. Abu-Ata
CoRR abs/1207.2506: (2012)
- Compact
and Low Delay Routing Labeling Scheme for Unit Disk Graphs
C. Yan, Y. Xiang and F.F. Dragan
Computational Geometry: Theory and Applications 45(7): 305-325
(2012) (available on-line at DOI:10.1016/j.comgeo.2012.01.015) (one of the TOP25
Hottest Articles within Computational Geometry for 2012
Full Year).
- Constant
Approximation Algorithms for Embedding Graph Metrics into Trees and
Outerplanar Graphs
V.D. Chepoi,
F.F. Dragan, I. Newman, Y. Rabinovich and Y. Vaxes
Discrete & Computational Geometry 47(1): 187-214 (2012) (available on-line at DOI:
10.1007/s00454-011-9386-0)
- 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
Algorithmica 62(3-4): 713-732 (2012) (available on-line at
DOI:10.1007/s00453-010-9478-x
)
- Additive
Spanners for Circle Graphs and Polygonal Graphs
F.F. Dragan, D.G.
Corneil, E. Koehler and Y. Xiang
Discrete Applied Mathematics 160(12):
1717-1729 (2012) (available on-line at DOI:10.1016/j.dam.2012.03.036)
2011
- Spanners
in sparse graphs
F.F. Dragan, F. Fomin
and P. Golovach
Journal of Computer and System Sciences, 77 (2011), 1108-1119 (available
on-line at DOI:10.1016/j.jcss.2010.10.002)
- An
Approximation Algorithm for the Tree t-Spanner Problem on Unweighted
Graphs via Generalized Chordal Graphs
F.F. Dragan, E.
Koehler
Approximation, Randomization, and Combinatorial Optimization.
Algorithms and Techniques - Proceedings of the 14th International
Workshop, APPROX 2011, and 15th International Workshop, RANDOM 2011,
Princeton, NJ, USA, August 17-19, 2011, Lecture Notes in Computer Science
6845, Springer, pp. 171-183 (available on-line at DOI:
10.1007/978-3-642-22935-0_15)
- Navigating
in a graph by aid of its spanning tree metric
F.F. Dragan and M. Matamala
SIAM J. Discrete Math., 25(1): 306-332 (2011) (available on-line
at DOI.org/10.1137/090761549)
- 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) (available on-line
at DOI:10.1007/s10618-010-0203-9)
- 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) (available
on-line at DOI:10.1016/j.tcs.2010.11.034)
2010
- Network Flow Spanners
F.F. Dragan and C. Yan
Networks 56 (2010), 159-168. (available on-line at DOI:10.1002/net.20357)
- Collective
Tree Spanners in Graphs with Bounded Parameters
F.F. Dragan and C. Yan
Algorithmica 57 (2010), 22-43. (available on-line at DOI:10.1007/s00453-008-9194-y)
- Constant
Approximation Algorithms for Embedding Graph Metrics into Trees and
Outerplanar Graphs
V.D. Chepoi, F.F.
Dragan, I. Newman, Y. Rabinovich, Y. Vaxes
13th Intl. Workshop on Approximation
Algorithms for Combinatorial Optimization Problems (APPROX 2010),
Barcelona, Spain, 1-3 September, 2010, Springer,
Lecture Notes in Computer Science 6302, pp. 95-109.
- New
Min-Max Theorems for Weakly Chordal and Dually Chordal Graphs
A.H. Busch, F.F. Dragan, R. Sritharan
4th International Conference on
Combinatorial Optimization and Applications (COCOA
2010), Kailua-Kona, HI, USA, December 18-20, 2010, Springer,
Lecture Notes in Computer Science 6509
(Part II), pp. 207-218.
- Constant
Approximation Algorithms for Embedding Graph Metrics into Trees and
Outerplanar Graphs
V.D. Chepoi, F.F.
Dragan, I. Newman, Y. Rabinovich, Y. Vaxes
CoRR abs/1007.0489 (2010) (available on-line at arXiv:1007.0489v1).
2009
- Effective Monitor Placement in
Internet Networks
Y. Breitbart , F.F. Dragan, H. Gobjuka
Journal of Networks 4
(2009), 657-666.
- 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. Koehler 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), Buzios, Brazil, April 7-11,
2008, Springer, Lecture Notes in Computer Science 4957, pp.555-567.
2007
2006
- Distance and routing labeling
schemes for non-positively curved plane graphs
V.D. Chepoi, F.F. Dragan, Y. Vaxes
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. Vaxes
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. Brandstaedt, 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. Brandstaedt, 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. Koehler 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. Vaxes
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. Brandstaedt, 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, Humlebaek, 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, Hoelterhoff
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. Vaxes
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. Koehler
Networks 42 (2003), 209-222.
- On linear and circular structure of
a (claw,net)-free graph
A.
Brandstaedt 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. Brandstaedt, 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. Brandstaedt, 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. Brandstaedt, 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. Koehler
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. Brandstaedt, Dragan F.F. and E. Koehler
SIAM J. on Computing 30 (2000), 1662-1677.
- On stable cutsets
in graphs
A. Brandstaedt, 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
|
01/25
|
|
36th ACM-SIAM
Symposium on Discrete Algorithms, SODA 2025: New Orleans, LA, USA
|
|
09/24
|
|
The GROW Conference
(Graph Classes, Optimization, and Width Parameters) 2024. Discrete
Mathematics and Theoretical Computer Science,
Brandenburg University of Technology Cottbus-Senftenberg (BTU) (invited)
|
|
09/23
|
|
Research Group on Algorithms and Discrete
Structures of Institute De Recherche en
Informatique Fondamentale (IRIF), Universite Paris
Cite, France (invited)
|
|
06/23
|
|
WG 2023: 49th International Workshop on Graph-Theoretic
Concepts in Computer Science, Fribourg, Switzerland
|
|
06/23
|
|
Laboratoire
d'Informatique et Systemes,
Faculte des Sciences, site de Luminy,
Aix Marseille Universite, Marseille, France (invited)
|
|
12/21
|
|
MGT 2021: Metric Graph Theory and related topics,
Marseille,
France, 6-10 December 2021 (invited)
|
|
11/21
|
|
COMPLEX
NETWORKS 2021: The 10th International Conference on Complex Networks and their
Applications, November 30 - December 2,
2021,
Madrid, Spain
|
|
08/21
|
|
WADS 2021: Algorithms and Data Structures - 17th International
Symposium, August 9-11, 2021, Halifax, NS, Canada
|
|
06/20
|
|
ICS '20: 2020 International Conference on
Supercomputing, Barcelona Spain, June, 2020. ACM
2020
|
|
04/19
|
|
Meeting ANR-Distancia in Paris (IRIF - Paris VII
University), March 27-29 2019 (invited)
|
|
12/18
|
|
Combinatorial Optimization and Applications - 12th
International Conference, COCOA 2018, Atlanta, GA, USA, December 15-17, 2018
|
|
06/18
|
|
SoCG 2018: 34th International
Symposium on Computational Geometry, June 11-14, 2018, Budapest, Hungary
|
|
12/17
|
|
COCOA 2017: Combinatorial
Optimization and Applications - 11th International Conference, Shanghai,
China, December 16-18, 2017
|
|
01/17
|
|
SODA 2017: Twenty-Eighth Annual
ACM-SIAM Symposium on Discrete Algorithms, Barcelona, Spain, Hotel Porta
Fira, January 16-19, 2017
|
|
12/16
|
|
COCOA 2016: Combinatorial
Optimization and Applications - 10th International Conference, Hong Kong,
China, December 16-18, 2016
|
|
06/16
|
|
WG 2016: Graph-Theoretic
Concepts in Computer Science - 42nd International Workshop, WG 2016,
Istanbul, Turkey, June 22-24, 2016
|
|
06/16
|
|
Research Group on Algorithms and Combinatorics,
Department of Computer Science at University Paris Diderot - Paris 7
|
|
03/16
|
|
7th Workshop on Complex Networks, CompleNet 2016,
Dijon, France, March 23-25, 2016
|
|
11/15
|
|
Journees Combinatoire et Algorithmes du Littoral
Mediterraneen, Universite de la
Mediterranee, Marseille, France
|
|
10/15
|
|
Laboratoire d`Informatique Fondamentale
de Marseille, Universite de la Mediterranee, Marseille, France
|
|
10/15
|
|
GROW 2015: 7th workshop on Graph Classes,
Optimization, and Width Parameters, 11-15 Oct 2015 Aussois (France)
|
|
08/15
|
|
14th International Symposium,
WADS 2015, Victoria, BC, Canada, August 5-7, 2015.
|
|
06/15
|
|
Fachgebiet Diskrete Mathematik
und Grundlagen der Informatik, Brandenburgische Technische Universitaet
Cottbus-Senftenberg, Germany
|
|
06/15
|
|
WG 2015: 41st International
Workshop on Graph-Theoretic Concepts in Computer Science, Garching near
Munich, Germany, June 17-19, 2015
|
|
03/15
|
|
6th Workshop on Complex Networks, CompleNet 2015,
New York City, USA, March 25-27, 2015
|
|
05/14
|
|
Workshop on Graphs and Algorithms, Fields Institute,
Toronto, Canada (Invited plenary talk)
|
|
06/13
|
|
WG 2013: 39th International Workshop on
Graph-Theoretic Concepts in Computer Science, Luebeck, Germany (Invited
plenary talk)
|
|
01/13
|
|
SOFSEM 2013: Theory and Practice of Computer
Science, 39th International Conference on Current Trends in Theory and
Practice of Computer Science, Spindleruv Mlyn, Czech Republic
|
|
10/12
|
|
Session on Extremal Graph Theory; Special Session at
the AMS Central Section Meeting held at the University of Akron, OH, USA
|
|
05/11
|
|
Dagstuhl Seminar 11182, Dagstuhl, Germany
|
|
12/10
|
|
Combinatorial Optimization and Applications - 4th
International Conference, COCOA 2010, Kailua-Kona, HI
|
|
09/10
|
|
Approximation, Randomization, and Combinatorial
Optimization. Algorithms and Techniques, 13th International Workshop, APPROX
2010, and 14th International Workshop, RANDOM 2010, Barcelona, Spain
|
|
04/10
|
|
Lane Department of Computer Science and Electrical
Engineering, West Virginia University, Morgantown, WV
|
|
04/10
|
|
Combinatorics and Discrete Mathematics group, West
Virginia University, Morgantown, WV
|
|
06/09
|
|
Laboratoire d`Informatique
Fondamentale de Marseille, Universite de la Mediterranee, Marseille, France
|
|
03/09
|
|
Computer Science Department, University of Rostock,
Germany (invited by Prof. Andreas Brandstaedt)
|
|
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), Buzios, Brazil
|
|
10/07
|
|
Laboratoire d`Informatique
Fondamentale de Marseille, Universite de la Mediterranee, 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 Universitaet Berlin, Germany
|
|
07/07
|
|
Combinatorial Optimization & Graph Algorithms
Group at the Technische Universitaet 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 2007), 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), Humlebaek, Denmark
|
|
06/04
|
|
SIAM Conference on Discrete Mathematics, Nashville,
TN, USA
|
|
06/04
|
|
30th International Workshop "Graph-Theoretic Concepts
in Computer Science"(WG '04), Hoelterhoff 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 Brandstaedt)
|
|
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,
Universitaet 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
o
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. Brandstaedt, Rostock
and H.-J. Bandelt, Hamburg).
o
Metric Optimization Problems in Discrete
Structures - German Research Community (DFG)
Project (300 000,- DM) (in collaboration with A. Brandstaedt, Rostock).
o
2002 Summer Research Grant - The Research
Council of Kent State University
($ 6,500).
o
Industrial
Assistantship Program - GraphSQL, Inc. ($33,690) (award period: 08/27/2012
- 05/31/2013).
o Industrial Assistantship Program -
GraphSQL, Inc. ($7,472) (award period: 08/27/2013 - 12/31/2013).
o
$213,693 (05/01/2013 through 02/28/2017);
Understanding the Mechanism of Social Network Influence in Health Outcomes
through Multidimensional and Semantic Data Mining Approaches, NIH (replacing Ruoming Jin as PI, Ruoming was on
leave of absence during that period)
Other Research Funding
o
~$ 5,000 from Laboratoire d`Informatique
Fondamentale de Marseille, Universite de la Mediterranee, Marseille, France for
research visit from 05/20/03 to 06/19/03.
o
~$
5,000 from Algorithms Research Group, Department of Informatics, University of Bergen, Norway for research visit from 05/26/07 to 06/20/07.
o
~$ 22,000 from Combinatorial Optimization &
Graph Algorithms Group at the Technische Universitaet Berlin, Germany for
research visit from 06/25/07 to 09/30/07.
o
~$ 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.
o
~$ 1,000 from Laboratoire d`Informatique
Fondamentale de Marseille, Universite de la Mediterranee, Marseille, France for
research visit from 10/18/07 to 10/24/07.
o
~$ 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.
o
~$ 6,200 from Laboratoire d`Informatique
Fondamentale de Marseille, Universite de la Mediterranee, Marseille, France for
research visit from 06/01/09 to 06/30/09.
o
~$ 2,500 from Discrete Maths and Theoretical
Computer Science group (DMTCS), University
of Chile, Santiago, Chile
for research visit from 11/01/10 to 11/12/10.
o
~$ 1,500 from Lehrstuhl fuer Diskrete Mathematik
und Grundlagen der Informatik, Brandenburgische Technische Universitaet
Cottbus, Germany for research visit from 05/06/11 to 05/14/11.
o ~$
1,000 from Fields Institute, Toronto, Canada for visit from 05/05/14 to
05/07/14.
o ~$
2,200 from Lehrstuhl fuer Diskrete Mathematik und Grundlagen der Informatik,
Brandenburgische Technische Universitaet Cottbus-Senftenberg,
Germany for research visit from 06/20/15 to 06/30/15.
o ~$15,000
support from ARCHIMEDE LabEx (ANR-11-LABX- 0033) for 3 months visit of the
Laboratoire d'Informatique Fondamentale, Aix-Marseille Universite (09/15/15 -
12/15/15)
o ~$
5,500 from Research Group on Algorithms and Combinatorics, Department of
Computer Science at University Paris Diderot - Paris 7 for research visit from
05/15/16 to 06/15/16.
o
~$ 3,000 from Research Group on Algorithms
and Combinatorics, Department of Computer Science at University Paris Diderot -
Paris 7 for research visit from 03/23/19 to
03/30/19.
o
~$ 3,200 from Lehrstuhl fuer Diskrete Mathematik
und Grundlagen der Informatik, Brandenburgische Technische Universitaet
Cottbus, Germany for
research visit from 03/08/20
to 03/14/20.
o ~$
3,500 from Laboratoire d`Informatique Fondamentale de Marseille, Universite de
la Mediterranee, Marseille, France for research visit from 01/05/22 to 01/11/22 and giving
an invited plenary talk at MGT 2021.
o ~$
8,500 from Laboratoire d`Informatique
Fondamentale de Marseille, Universite de la Mediterranee, Marseille, France for research visit from 06/01/23 to 07/13/23 and giving an invited talk.
o ~$
6,000 from Research Group on Algorithms and Combinatorics, Department of
Computer Science at University Paris Cite for research visit from 09/01/23 to
09/30/23 and giving an invited talk.
o ~$
2,700 from Lehrstuhl fuer Diskrete Mathematik und Grundlagen der Informatik, Brandenburgische
Technische Universitaet
Cottbus, Germany for research visit from 09/07/24
to 09/14/24.
o $ 1,000 from Ohio Supercomputer
Center for research use of the supercomputer in 2025-2026.
Grant Proposals (not funded)
o
Efficient
algorithms for problems related to distances in well-structured families of
graphs- NSF, CCR-Theory of Computing,
$230,970, 3 years (2002-2005).
o
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).
o
Message routing in
structured large scale distributed networks -Ohio Board of Regents Research Challenge Funds, $ 114,507, 2 years
(2003-2004).
o
Issues and Challenges in Wireless Mesh (Grid)
Networks - Ohio Board of
Regents Research Challenge Funds, $ 58,401, 1 year (2006) (with Dr. Peyravi).
o
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).
o
Distance
and Routing Labeling Schemes on Graphs and Other Graph Theoretic Problems with
Applications in Wireless Ad-Hoc, Sensor and Cellular Networks - NSA
Mathematical Sciences Grants Program, $70,921
(2011-2012).
o
AF:CIF:Small: New
Approaches for Algorithmic Problems in Wireless Ad-Hoc, Sensor and Cellular
Networks - NSF, CCF - ALGORITHMIC FOUNDATIONS, $194,270, 2 years (2011-2013).
o
New Graph
Theoretic and Algorithmic Problems in Wireless Ad-Hoc, Sensor and Cellular
Networks - NSA, $67,542, 2
years (2013-2014).
o
AF:Small:
Approximation algorithms for low-distortion embeddings of graph metrics into
partial k-tree metrics and beyond - NSF, CCF - ALGORITHMIC FOUNDATIONS, $298,261, 3 years (07/2012-06/2015).
o
Embeddings of Graph Metrics into Partial, k-Tree
Metrics and Beyond - NSA, $69,480, 2 years (2014-2015) (PI).
o
DMREF: Characterization of Structures and
Properties of Liquid Crystal Materials by Computer-Assisted 2D and 3D Imaging -
NSF, $1,587,268, 4 years (2013-2017) (coPI)
o
AF: Small: Novel Algorithms for Low-Distortion
Embeddings of Graph Metrics into Partial K-Tree Metrics and Beyond - NSF, CCF -
ALGORITHMIC FOUNDATIONS, $283,131, 3 years (2013 - 2016) (PI).
o
Advances
in Embedding Graph Metric into Sparse Tree-Like Metrics - NSA, $37,677, 1
year (2015) (PI).
o
DMREF:
Characterization of Structures and Properties of Liquid Crystal Materials by
Computer Assisted 2D and 3D Imaging - NSF, $1,252,131, 4 years (2014-2018)
(coPI)
o
AF: Small:
Novel Algorithms for Embedding Graph Metrics into Sparse Tree-Like Metrics -
NSF, CCF - ALGORITHMIC FOUNDATIONS, $281,547, 3 years (2015 - 2017) (PI).
o
AF:Small: Embedding
graph metrics into sparse tree-like metrics: novel approaches and new
approximation algorithms - NSF, CCF - ALGORITHMIC FOUNDATIONS, $279,434, 3
years (2016 - 2018) (PI).
o
AF: Small:
Negative curvature and other metric tree-like structures in networks: theory
and algorithms - NSF, CCF - ALGORITHMIC FOUNDATIONS, $255,503, 3 years
(2017-2019) (PI).
o
AF: Small:
Embedding graph metrics into sparse tree-like metrics: novel approaches and new
approximation algorithms - NSF, CCF - ALGORITHMIC FOUNDATIONS, $255,503, 3
years (2017-2019) (PI).
o
CIF21
DIBBs: PD: A Privacy and Utility Recommendation System Over Big Web Data -
NSF, OAC - DATANET, $500,000, 3 years (2018-2020) (coPI)
o SaTC: CORE: Small: A Privacy and Utility
Recommendation System Over Big Web Data - NSF, CNS - Secure &
Trustworthy Cyberspace, $495,836, 3 years (2019-2021) (coPI)
o SPX: Collaborative Research: Addressing
Heterogeneity with Core and Peripheral Model: Algorithms, Runtime Support, and
Programming API, NSF, CCF - SPX: Scalable Parallelism, $400.000, 3 years
(2019-2021), coPI
o SPX: Collaborative Research: Addressing
Heterogeneity with Core and Peripheral Model: Algorithms, Programming Model,
and Runtime Support, NSF, $330K, 3 years (2020-2022), co-PI
o CICI:
SIVD: A Privacy and Utility Recommendation System Over Social Networks, NSF,
$500,000, (Xian, PI; Dragan, co-PI; Ghazinour, co-PI), 3 years, 2021.
Grant Proposals (pending) None
Early Life Awards and Honors
|
2017
|
|
Faculty
Recognition Award, Kent State University Teaching Council
|
|
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
|
Departmental and University Service
- Committees Chaired
(CS Department)
- Committee
Member (CS Department)
- Chair Search Committee (2011)
- Faculty Advising Committee (2001 -
till now)
- Colloquium Committee (2003 - 2005,
2008 - 2009)
- Graduate Study Committee (2004 - 2006,
2008 - 2015)
- Curriculum Committee (2005 -2007,
2017-2018, 2023-2024)
- Subcommittee of the Curriculum
Committee (2008)
- Chair Evaluation Committee (2005)
(2019)
- Merit Committee (2008, 2010, 2014)
- Qualifying Exam Committee (2003 -
2005)
- Prelim. Exam Committee (2006 - 2007,
2008 - 2015, 2017- till now)
- Committee
Member (University level)
- ORSA selection committee (2024)
- College Curriculum Committee
(2006/2007) (2019 - 2023) (2024 - now)
- College Graduate Council (2010 - 2015)
- College Advisory Council (2016 - 2019,
2024-2025)
- Representing Kent State on CS issues
at ODHE (2021-till now)
- University-wide curricular committee
on Data Science (2021 - till now)
- University-wide curricular committee
on Cybersecurity (2021 - till now)
- I am/was a member of
Dissertation/Thesis committees for: Srikanth Tadisetty
(PhD, CS, KSU), Amanda Matson (PhD, Math, KSU), Joseph
Oglio (PhD, CS, KSU), Dylan Langharst (PhD,
Math, KSU), Rafael Chiclana (PhD, Math, KSU), Asaad Althoubi (PhD, CS, KSU), Jooyoung Shin (PhD, Math, KSU),
Lee, Kyu Sang (PhD, Math, KSU), Robert Schefer (PhD dissertation
defense, Brandenburgische Technische
Universitaet Cottbus, Germany), Dong Li (PhD
dissertation defense, CS, KSU), Shishir Rai (PhD dissertation defense, CS,
KSU), Jesse Beisegel (PhD, CS, Brandenburgische Technische Universitaet Cottbus-Senftenberg,
Germany), Salwa Aljehane (PhD, CS, KSU), Oscar Zatarain-Vera (PhD, Math,
KSU), Emily Hoopes-Boyd (PhD, Math, KSU), Qingsong Liu (PhD,,
Geography, KSU), Michael Roysdon (PhD, Math, KSU),
Abdulrahman Alajmi (PhD, Math, KSU), Naser Al Madi (PhD, CS, KSU),
Betis Baheri (MS, CS, KSU), Heather Guarnera (PhD, CS, KSU), Abdulhakeem Mohammed (PhD, CS,
KSU), Louisa Catalano (PhD, Math, KSU), Farah
Shleemon Kamw (PhD, CS, KSU), Fatema Nafa (PhD, CS, KSU), Michael Romeo
(MS, CS, KSU), Maciej Rzeszut (PhD, Math, KSU), Pablo Jimenez-Rodriguez
(PhD, Math, KSU), Anthony Harrison (PhD, Math, KSU), Hend Al-Rasheed (PhD,
CS, KSU), Salem Othman (PhD, CS, KSU), Arne Leitert (PhD, CS, KSU), Matt
Alexander (PhD, Math, KSU), Christian Newman (PhD, CS, KSU), Micheal
Decker (PhD, CS, KSU), Sergii Myroshnychenko (PhD, Math, KSU), Mark
Bissler PhD, (Math, KSU), Ian Hogan (PhD, Math, KSU), Laura Dykes (PhD,
Math, KSU), Abrar AlAbed-AlHaq (PhD, CS, KSU), Galyna Livshyts (PhD, Math,
KSU), Michelle Cordier (PhD, Math, KSU), Dianne Foreback (PhD, CS, KSU),
Fatema Nafa (PhD, CS, KSU), David Sheets (PhD, CS, KSU), Yelong Shen (PhD,
CS, KSU), Salem Othman (PhD, CS, KSU), Fan Chen (PhD, CS, KSU), Olena
Kozhushkina (PhD, Math, KSU), Amin Assareh (PhD, CS, KSU), Omar Meqdadi
(PhD, CS, KSU), Nouh Alhindawi (PhD, CS, KSU), Jalaa Hoblos (PhD, CS,
KSU), Jaegil Kim (PhD, Math, KSU), Liu Lin (PhD, CS, KSU), Ning Ruan (PhD,
CS, KSU), Hakam Alomari (PhD, CS, KSU), ABDULKAREEM Alali (PhD, CS, KSU),
Muad Abu-Ata (PhD, CS, KSU), Nouman Bantan (PhD, CS, KSU), Asrar Haque
(PhD, CS, KSU), Mohammed Jirari (PhD, CS, KSU), Oleg Komogortsev (PhD, CS,
KSU), Raid Zaghal (PhD, CS, KSU), Rashid bin Muhammad (PhD, CS, KSU),
Yasir Drabu (PhD, CS, KSU), Chenyu Yan (PhD, CS, KSU), Irina Lomonosov
(PhD, CS, KSU), Yang Xiang (PhD, CS, KSU), Hassan Gobjuka (PhD, CS, KSU),
Rodica Boliac (PhD, Rutgers University, Piscataway, NJ, 2004), Thomas
Szymczak (PhD, University of Rostock, Germany), David Selinger (MS, CS,
KSU), Michael Romeo (MS, CS, KSU), Aisha Aljohani (MS, CS, KSU), Kovan
Mohammed Ali (MS, CS, KSU), Muslem Al-Saidi (MS, CS, KSU), Al Thoubi,
Asaad Y. (MS, CS, KSU), AL-Baghdadi (MS, CS, KSU), Ahmed H., Alwabsi (MS,
CS, KSU), Nowayer A. (MS, CS, KSU), Alzaidi, Esraa R. (MS, CS, KSU), Guan
Wang (MS, CS, KSU), Rong Li (MS, CS, KSU), Zoltan Karaszi (MS, CS, KSU),
Hassan Al-Maksousy (MS, CS, KSU), David Zach (MS, Math, KSU), David Fuhry
(MS, CS, KSU), Pradeep Kumar Punnam (MS, CS, KSU), Vibha Tripathi (MS, CS,
KSU), Sudha Elavarti (MS, CS, KSU), Mutasem Najdawi (MS, CS,
KSU), Amit Borwankar (MS, CS, KSU), George Powell (MS, CS,
KSU), Tran Anh Tuan (MS, CS, KSU), Raina Siddharth (MS, CS,
KSU), Rajesh Jadhav (MS, CS, KSU), Nitin Bafna (MS, CS,
KSU), Udaykiran V. Viyyure (MS, CS, KSU), Sudipta Bhaduri (MS,
CS, KSU), Rahul Sehgal (MS, CS, KSU), Rab Harbart (MS,
CS, KSU), Mayank Ladoia (MS, CS, KSU), etc.
- Recent undergraduate students advising:
Eddie Lampert, COF scholarship (2021), Gino Chiudioni, COF scholarship
(2021)
Other Professional Activities
- Member of Program/Organizing Committee for
- MGT 2021: Metric Graph Theory and related
topics, Marseille,
France, 6-10 December 2021
- WADS
2019: Algorithms
and Data Structures Symposium,
August 5 - August 7, 2019, University of Alberta, Edmonton, Canada
- WG
2018: 44th
International Workshop on Graph-Theoretic Concepts in Computer Science, June 27-29 2018, Schloss Luebbenau (near Cottbus), Germany.
- WG
2009: 35th International Workshop on
Graph-Theoretic Concepts in Computer Science, 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
- NSF Algorithmic Foundations panel, 2018 (invited by program
director Rahul Shah)
- Reviewer for
the Computing Reviews (ACM)
- Referee for
- ACM
Transactions on Algorithms
- Algorithmica
- 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 Graph Theory
- Journal of Information Science and
Engineering
- Journal of Graph Algorithms and
Applications
- Journal of Parallel and Distributed
Computing
- Journal of Combinatorial
Optimization
- 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), Hoelterhoff 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
- 36th
International Workshop on Graph Theoretic Concepts in Computer
Science (WG 2010), Zaros, Crete, Greece
- 39th
International Workshop on Graph-Theoretic Concepts in Computer Science
(WG 2013), Luebeck, Germany
- 43rd
International Workshop on Graph-Theoretic Concepts in Computer Science
(WG 2017), Eindhoven, The Netherlands
- 44th International Workshop on
Graph-Theoretic Concepts in Computer Science (WG 2018), June 27-29 2018,
Schloss Luebbenau (near Cottbus), Germany
- 47th International Workshop on
Graph-Theoretic Concepts in Computer Science (WG 2021), University of
Warsaw, June 23-25, 2021, Poland
- 50th
International Workshop on Graph-Theoretic Concepts in Computer Science
(WG 2024), 19-21 June 2024, Spik, Alpine Resort, Gozd
Martuljek, Slovenia
- European
Symposium on Algorithms (ESA 2024), 2-4 September 2024, Royal Holloway,
University of London in Egham, United Kingdom
- 20th International Symposium on
Theoretical Aspects of Computer Science (STACS 2003), Berlin, Germany
- 29th International Symposium on
Theoretical Aspects of Computer Science (STACS 2012), Paris, France
- 37th
International Symposium on Theoretical Aspects of Computer Science (STACS
2020), Montpellier, March 10 - 13, 2020
- Journees
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
- ACM-SIAM Symposium on Discrete
Algorithms (SODA 2012), Kyoto, Japan
- 36th
International Colloquium on Automata, Languages and Programming, (ICALP
2009), Rhodes, Greece
- 38th
International Colloquium on Automata, Languages and Programming, (ICALP 2011), Zuerich,
Switzerland
- 14th
International Workshop on Approximation Algorithms for Combinatorial
Optimization Problems (APPROX'2011), Princeton University, USA
- 17th
International Symposium on Algorithms and Computation (ISAAC 2006), Kolkata,
India
- 28th
International Symposium on Algorithms and Computation, (ISAAC 2017),
Phuket, Thailand
- 12th
Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2010), Bergen, Norway
- 13th
Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2012),
Helsinki, Finland
- 16th
Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2018),
Malmo, June 18-20, 2018 Malmo, Sweden
- The
Algorithms and Data Structures Symposium (WADS 2013), London, Ontario,
Canada
- The
Algorithms and Data Structures Symposium (WADS 2017), Memorial University
of Newfoundland, St. John's, Canada
- Algorithms and Data Structures
Symposium (WADS 2019), August 5 - August 7, 2019, University of Alberta,
Edmonton, Canada
- Algorithms
and Data Structures Symposium (WADS 2021), August 9-11, 2021, Halifax,
Nova Scotia, Canada
- 5th
International Computer Science Symposium in Russia (CSR 2010), Kazan, Russia
- VI
Latin-American Algorithms, Graphs, and Optimization Symposium (LAGOS'11), Bariloche,
Argentina
- American Mathematical Society: evaluation of research proposals
submitted to the National
Security Agency (Mathematical Science Program)
- Evaluation
Committee of the Blanc SIMI 2
2013
program of the French National Research Agency.
Last
updated: January 2026