scHolar index |
| 63 references between 1994 and 2009 63 references cited (835 citations) 13.25 citations per reference (median=9.00) 13.25 citations per cited reference (median=9.00) |
h-index: 17 (a=2.89, m=1.13) g-index: 25 |
| 75 | Dually chordal graphs A BrandstEdt, FF Dragan, VD Chepoi, VI Voloshin - Springer |
|
| 48 | The algorithmic use of hypertree structure and maximum neighbourhood orderings … Brandstadti, VD Chepoi, FF Dragan - Graph-theoretic concepts …, 1995 - books.google.com |
|
| 45 | Provably good global buffering using an available buffer block plan FF Dragan, AB Kahng, I Măndoiu, S Muddu, … - Proceedings of the …, 2000 - portal.acm.org |
|
| 44 | A linear-time algorithm for connected r-domination and Steiner tree on … A Brandstaedt, FF Dragan - Networks, 1998 - Citeseer |
|
| 41 | Distance approximating trees for chordal and dually chordal graphs A Brandstädt, V Chepoi, F Dragan - Journal of Algorithms, 1999 - Elsevier |
|
| 39 | Dominating cliques in distance-hereditary graphs FF Dragan - Lecture Notes in Computer Science, 1994 - Springer |
|
| 26 | A note on distance approximating trees in graphs V Chepoi, F Dragan - Electronic Notes in Discrete Mathematics, 1999 - Citeseer |
|
| 25 | Clique r-domination and clique r-packing problems on dually chordal graphs A Brandstädt, VD Chepoi, FF Dragan - SIAM Journal on Discrete …, 1997 - Citeseer |
|
| 22 | Provably good global buffering by multi-terminal multicommodity flow … FF Dragan, AB Kahng, I Mandoiu, S Muddu, … - Proceedings of the …, 2001 - portal.acm.org |
|
| 22 | Linear time algorithms for Hamiltonian problems on (claw, net)-free graphs A Brandstadt, FF Dragan, E Kohler - SIAM Journal on Computing, 2001 - Springer |
|
| 22 | Convexity and HHD-free graphs FF Dragan, F Nicolai, A Brandstädt - SIAM Journal on Discrete …, 1999 - Citeseer |
|
| 21 | New graph classes of bounded clique-width A Brandstädt, FF Dragan, HO Le, R Mosca - Theory of Computing …, 2005 - Springer |
|
| 21 | Tree spanners on chordal graphs: complexity and algorithms A Brandstädt, FF Dragan, HO Le, VB Le - Theoretical Computer Science, 2004 - Elsevier |
|
| 20 | On stable cutsets in graphs A Brandstädt, FF Dragan, VB Le, T Szymczak - Discrete Applied …, 2000 - Elsevier |
|
| 18 | Collective tree spanners of graphs FF Dragan, C Yan, I Lomonosov - SIAM Journal on Discrete Mathematics, 2007 - Springer |
|
| 18 | LexBFS-orderings and powers of chordal graphs A Brandstädt, FF Dragan, F Nicolai - Discrete Math, 1997 - cs.kent.edu |
|
| 17 | Additive spanners for k-chordal graphs VD Chepoi, FF Dragan, C Yan - Lecture notes in computer science, 2003 - Springer |
|
| 17 | Diameter determination on restricted graph families DG Corneil, FF Dragan, M Habib, C Paul - Discrete applied mathematics, 2001 - Elsevier |
|
| 16 | Collective tree spanners and routing in AT-free related graphs FF Dragan, C Yan, DG Corneil - … of the 30th International Workshop Graph …, 2004 - Springer |
|
| 16 | On the power of BFS to determine a graph's diameter DG Corneil, FF Dragan, E Köhler - Networks, 2003 - Springer |
|
| 16 | Homogeneously orderable graphs A Brandstädt, FF Dragan, F Nicolai - Theoretical Computer Science, 1997 - Elsevier |
|
| 15 | Effective network monitoring Y Breitbart, F Dragan, H Gobjuka - Proc. of the IEEE ICCCN, 2004 - Citeseer |
|
| 14 | Distance and routing labeling schemes for non-positively curved plane graphs V Chepoi, FF Dragan, Y Vaxès - Journal of Algorithms, 2006 - Elsevier |
|
| 14 | Estimating all pairs shortest paths in restricted graph families: a unified approach FF Dragan - Journal of Algorithms, 2005 - Elsevier |
|
| 14 | LexBFS-orderings and powers of graphs FF Dragan, F Nicolai, A Brandstädt - Proceedings of the WG'96, Lecture …, 1997 - Citeseer |
|
| 12 | On linear and circular structure of (claw, net)-free graphs A Brandstädt, FF Dragan - Discrete Applied Mathematics, 2003 - Elsevier |
|
| 11 | Center and diameter problems in plane triangulations and quadrangulations V Chepoi, F Dragan, Y Vaxès - … of the thirteenth annual ACM-SIAM …, 2002 - portal.acm.org |
|
| 11 | Perfect elimination orderings of chordal powers of graphs A Brandstadt, VD Chepoi, FF Dragan - Discrete Mathematics, 1996 - mcs.kent.edu |
|
| 10 | Dominating cliques in graphs with hypertree structure FF Dragan, A Brandstadt - Lecture Notes in Computer Science, 1994 - Springer |
|
| 9 | Diameters, centers, and approximating trees of delta-hyperbolicgeodesic spaces … V Chepoi, F Dragan, B Estellon, M Habib, … - Proceedings of the …, 2008 - portal.acm.org |
|
| 9 | Almost diameter of a house-hole-free graph in linear time via LexBFS FF Dragan - Discrete Applied Mathematics, 1999 - Citeseer |
|
| 9 | A linear-time algorithm for finding a central vertex of a chordal graph V Chepoi, F Dragan - Lecture Notes in Computer Science, 1994 - Springer |
|
| 8 | Tree spanners for bipartite graphs and probe interval graphs A Brandstadt, FF Dragan, HO Le, VB Le, R Uehara - Algorithmica, 2007 - Springer |
|
| 8 | On compact and efficient routing in certain graph classes FF Dragan, I Lomonosov - Discrete Applied Mathematics, 2007 - Elsevier |
|
| 8 | Collective tree 1-spanners for interval graphs DG Corneil, FF Dragan, E Kohler, C Yan - Lecture notes in computer …, 2005 - Springer |
|
| 8 | Incidence graphs of biacyclic hypergraphs FF Dragan, VI Voloshin - Discrete Applied Mathematics, 1996 - cs.kent.edu |
|
| 7 | Collective tree spanners in graphs with bounded genus, chordality, tree-width, or … FF Dragan, C Yan - Lecture notes in computer science, 2005 - Springer |
|
| 7 | New Routing Schemes for Interval., Circular-Arc? and Permutation Graphs FF Dragan, I Lomonosov - PDCS, 2002 - cs.kent.edu |
|
| 7 | LexBFS-orderings of distance-hereditary graphs with application to the diametral … FF Dragan, F Nicolai - Discrete Applied Mathematics, 2000 - Elsevier |
|
| 7 | Strongly orderable graphs A common generalization of strongly chordal and … FF Dragan - Discrete Applied Mathematics, 2000 - Elsevier |
|
| 6 | Succinct summarization of transactional databases: an overlapped hyperrectangle … Y Xiang, R Jin, D Fuhry, FF Dragan - Proceeding of the 14th ACM …, 2008 - portal.acm.org |
|
| 5 | Provably good global buffering by generalized multiterminal multicommodity … FF Dragan, AB Kahng, II Mandoiu, S Muddu, A … - IEEE Transactions on …, 2002 - Citeseer |
|
| 5 | On greedy matching ordering and greedy matchable graphs FF Dragan - Graph-theoretic concepts in computer science: 23rd …, 1997 - books.google.com |
|
| 4 | Spanners for bounded tree-length graphs Y Dourisboure, FF Dragan, C Gavoille, C … - Theoretical Computer …, 2007 - Elsevier |
|
| 4 | Additive sparse spanners for graphs with bounded length of largest induced cycle VD Chepoi, FF Dragan, C Yan - Theoretical Computer Science, 2005 - Elsevier |
|
| 4 | Finding a central vertex in an HHD-free graph V Chepoi, F Dragan - Discrete Applied Mathematics, 2003 - Elsevier |
|
| 4 | r-Donaination Problems on Homogeneously Orderable Graphs FF Dragan, F Nicolai - Springer |
|
| 3 | Navigating in a graph by aid of its spanning tree FF Dragan, M Matamala - ISAAC, 2008 - Springer |
|
| 3 | Practical approximation algorithms for separable packing linear programs FF Dragan, AB Kahng, II Mandoiu, S Muddu, A … - Lecture notes in …, 2001 - Springer |
|
| 2 | How to use spanning trees to navigate in graphs FF Dragan, Y Xiang - Lecture Notes in Computer Science, 2009 - Springer |
|
| 2 | Addressing, distances and routing in triangular systems with applications in cellular … V Chepoi, FF Dragan, Y Vaxes - Wireless Networks, 2006 - Springer |
|
| 2 | Distance approximating trees: Complexity and algorithms FF Dragan, C Yan - Lecture Notes in Computer Science, 2006 - Springer |
|
| 2 | Homogeneously orderable graphs and the Steiner Tree problem A Brandstädt, FF Dragan, F Nicolai - Proceedings of the 21st …, 1995 - portal.acm.org |
|
| 2 | Improved spanners for bounded tree-length graphs, 2004 Y Dourisboure, FF Dragan, C Gavoille, C Yan - preparation |
|
| 2 | Distance-based location update and routing in irregular cellular networks V Chepoi, FF Dragan, Y Vaxes - Proceedings of the 1st ACIS International … - Citeseer |
|
| 1 | Compact and Low Delay Routing Labeling Scheme for Unit Disk Graphs C Yan, Y Xiang, FF Dragan - … of the 11th International Symposium on …, 2009 - Springer |
|
| 1 | Additive Spanners for Circle Graphs and Polygonal Graphs FF Dragan, DG Corneil, E Köhler, Y Xiang - Graph-Theoretic Concepts in …, 2008 - Springer |
|
| 1 | Overlapping Matrix Pattern Visualization: a Hypergraph Approach … , Y Xiang, D Fuhry, FF Dragan - Proceedings of the …, 2008 - doi.ieeecomputersociety.org |
|
| 1 | Notes on diameters, centers, and approximating trees of δ-hyperbolic geodesic … V Chepoi, FF Dragan, B Estellon, M Habib, Y … - Electronic Notes in …, 2008 - Elsevier |
|
| 1 | Spanners in sparse graphs FF Dragan, FV Fomin, PA Golovach - ICALP, 2008 - Springer |
|
| 1 | Network Flow Spanners FF Dragan, C Yan - Lecture Notes in Computer Science, 2006 - Springer |
|
| 1 | Generalized Powers of Graphs and Their Algorithmic Use A Brandstadt, FF Dragan, Y Xiang, C Yan - Lecture Notes in Computer …, 2006 - Springer |
|
| 1 | Collective Additive Tree Spanners of Homogeneously Orderable Graphs FF Dragan, C Yan, Y Xiang - Springer |