Feodor F. Dragan

Cited by

	All	Since 2020
Citations	3717	995
h-index	37	17
i10-index	92	39

240

120

180

1994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202516 25 14 55 55 72 33 46 49 103 84 94 115 105 115 143 91 110 126 127 167 146 218 181 162 200 208 221 159 110 205 86

Public access

View all

6 articles

0 articles

available

not available

Based on funding mandates

Co-authors

Victor ChepoiLIS, Aix-Marseille UniversitéVerified email at lis-lab.fr
Andreas BrandstädtProfessor of Computer Science, University of Rostock, Germany Verified email at uni-rostock.de
Michel HabibComputer Science, Université Paris CitéVerified email at irif.fr
Yang XiangGraphSQL, Inc.Verified email at graphsql.com
Guillaume DucoffeUniversity of Bucharest - Faculty of Mathematics and Informatics, and ICIVerified email at ici.ro
Ruoming JinProfessor of Computer Science, Kent State UniversityVerified email at cs.kent.edu
Vitaly I. VoloshinTroy University, USAVerified email at troy.edu
Heather GuarneraThe College of WoosterVerified email at wooster.edu
Van Bang LeUniversity of Rostock, GermanyVerified email at uni-rostock.de
Fedor V. FominProfessor of Computer Science, University of BergenVerified email at uib.no
David FuhryPhD Student, The Ohio State UniversityVerified email at cse.ohio-state.edu
Alexander ZelikovskyDistinguished University Professor at Georgia State UniversityVerified email at gsu.edu
Andrew B. KahngProfessor of CSE and ECE, UC San DiegoVerified email at eng.ucsd.edu
Ion MandoiuUniversity of ConnecticutVerified email at engr.uconn.edu
Hend AlrasheedMassachusetts Institue of Technology, King Saud UniversityVerified email at ksu.edu.sa
Petr GolovachUniversity of BergenVerified email at ii.uib.no
Muad Abu-AtaKent State University, Ryerson UniversityVerified email at cs.kent.edu
Christophe PaulCNRS LIRMMVerified email at lirmm.fr
Ilan NewmanProfessor of Computer Science, University of HaifaVerified email at cs.haifa.ac.il

Feodor F. Dragan

Kent State University

Verified email at CS.KENT.EDU - Homepage

Algorithms Theory Graphs


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
Dually chordal graphs A Brandstädt, F Dragan, V Chepoi, V Voloshin SIAM Journal on Discrete Mathematics 11 (3), 437-455, 1998	195	1998
Diameters, centers, and approximating trees of delta-hyperbolicgeodesic spaces and graphs V Chepoi, F Dragan, B Estellon, M Habib, Y Vaxès Proceedings of the twenty-fourth annual symposium on Computational geometry …, 2008	155	2008
The algorithmic use of hypertree structure and maximum neighbourhood orderings A Brandstädt, VD Chepoi, FF Dragan Discrete Applied Mathematics 82 (1-3), 43-77, 1998	151	1998
Metric tree‐like structures in real‐world networks: an empirical study M Abu‐Ata, FF Dragan Networks 67 (1), 49-68, 2016	107	2016
Distance approximating trees for chordal and dually chordal graphs A Brandstädt, V Chepoi, F Dragan Journal of Algorithms 30 (1), 166-184, 1999	94	1999
Convexity and HHD-free graphs FF Dragan, F Nicolai, A Brandstädt SIAM Journal on Discrete Mathematics 12 (1), 119-135, 1999	92	1999
Summarizing transactional databases with overlapped hyperrectangles Y Xiang, R Jin, D Fuhry, FF Dragan Data Mining and Knowledge Discovery 23, 215-251, 2011	83	2011
Diameter determination on restricted graph families DG Corneil, FF Dragan, M Habib, C Paul Discrete Applied Mathematics 113 (2-3), 143-166, 2001	82	2001
New graph classes of bounded clique-width A Brandstädt, FF Dragan, HO Le, R Mosca Theory of Computing Systems 38 (5), 623-645, 2005	81	2005
Additive spanners and distance and routing labeling schemes for hyperbolic graphs V Chepoi, FF Dragan, B Estellon, M Habib, Y Vaxes, Y Xiang Algorithmica 62, 713-732, 2012	76	2012
LexBFS-orderings and powers of chordal graphs A Brandstädt, FF Dragan, F Nicolai Discrete Mathematics 171 (1-3), 27-42, 1997	71	1997
Centers of graphs and the Helly property FF Dragan Ph. D. Thesis, Moldova State University, 1989	70	1989
Tree spanners on chordal graphs: complexity and algorithms A Brandstädt, FF Dragan, HO Le Theoretical Computer Science 310 (1-3), 329-354, 2004	64	2004
Dominating cliques in distance-hereditary graphs FF Dragan Scandinavian Workshop on Algorithm Theory, 370-381, 1994	64	1994
On the power of BFS to determine a graph's diameter DG Corneil, FF Dragan, E Köhler Networks: An International Journal 42 (4), 209-222, 2003	62	2003
A note on distance approximating trees in graphs V Chepoi, F Dragan European Journal of Combinatorics 21 (6), 761-766, 2000	61	2000
Notes on diameters, centers, and approximating trees of δ-hyperbolic geodesic spaces and graphs V Chepoi, FF Dragan, B Estellon, M Habib, Y Vaxès Electronic Notes in Discrete Mathematics 31, 231-234, 2008	60	2008
Center and diameter problems in plane triangulations and quadrangulations V Chepoi, F Dragan, Y Vaxes SODA 2, 346-355, 2002	60	2002
A linear‐time algorithm for connected r‐domination and Steiner tree on distance‐hereditary graphs A Brandstädt, FF Dragan Networks: An International Journal 31 (3), 177-182, 1998	58	1998
On stable cutsets in graphs A Brandstädt, FF Dragan, T Szymczak Discrete Applied Mathematics 105 (1-3), 39-50, 2000	57	2000

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors