On link diameter of a simple rectilinear polygon. - Victor Chepoi; Feodor F. Dragan (Comput. Sci. J. Moldova, 1993)

HT-graphs: centers, connected r-domination and Steiner trees. - Feodor F. Dragan (Comput. Sci. J. Moldova, 1993)

A Linear-Time Algorithm for Finding a Central Vertex of a Chordal Graph. - Victor Chepoi; Feodor F. Dragan (ESA, 1994)

Dominating Cliques in Graphs with Hypertree Structures. - Feodor F. Dragan; Andreas Brandstädt (STACS, 1994)

Dominating Cliques in Distance-Hereditary Graphs. - Feodor F. Dragan (SWAT, 1994)

Computing a Median Point of a Simple Rectilinear Polygon. - Victor Chepoi; Feodor F. Dragan (Inf. Process. Lett., 1994)

On Condorcet and Median Points of Simple Rectilinear Polygons (Extended Abstract). - Victor Chepoi; Feodor F. Dragan (FCT, 1995)

r-Domination Problems on Homogeneously Ordered Graphs (Extended Abstract). - Feodor F. Dragan; Falk Nicolai (FCT, 1995)

Homogeneously Orderable Graphs and the Steiner Tree Problem. - Andreas Brandstädt; Feodor F. Dragan; Falk Nicolai (WG, 1995)

LexBFS-Orderings and Power of Graphs. - Feodor F. Dragan; Falk Nicolai; Andreas Brandstädt (WG, 1996)

Incidence Graphs of Biacyclic Hypergraphs. - Feodor F. Dragan; Vitaly I. Voloshin (Discret. Appl. Math., 1996)

Perfect elimination orderings of chordal powers of graphs. - Andreas Brandstädt; Victor Chepoi; Feodor F. Dragan (Discret. Math., 1996)

r-Dominating cliques in graphs with hypertree structure. - Feodor F. Dragan; Andreas Brandstädt (Discret. Math., 1996)

Distance Approximating Trees for Chordal and Dually Chordal Graphs (Extended Abstract). - Andreas Brandstädt; Victor Chepoi; Feodor F. Dragan (ESA, 1997)

On Greedy Matching Ordering and Greedy Matchable Graphs (Extended Abstract). - Feodor F. Dragan (WG, 1997)

LexBFS-orderings and powers of chordal graphs. - Andreas Brandstädt; Feodor F. Dragan; Falk Nicolai (Discret. Math., 1997)

r-domination problems on homogeneously orderable graphs. - Feodor F. Dragan; Falk Nicolai (Networks, 1997)

Clique r-Domination and Clique r-Packing Problems on Dually Chordal Graphs. - Andreas Brandstädt; Victor Chepoi; Feodor F. Dragan (SIAM J. Discret. Math., 1997)

Homogeneously Orderable Graphs. - Andreas Brandstädt; Feodor F. Dragan; Falk Nicolai (Theor. Comput. Sci., 1997)

Diameter Determination on Restricted Graph Faminlies. - Derek G. Corneil; Feodor F. Dragan; Michel Habib; Christophe Paul (WG, 1998)

The Algorithmic Use of Hypertree Structure and Maximum Neighbourhood Orderings. - Andreas Brandstädt; Victor Chepoi; Feodor F. Dragan (Discret. Appl. Math., 1998)

Powers of hhd-free graphs. - Feodor F. Dragan; Falk Nicolai; Andreas Brandstädt (Int. J. Comput. Math., 1998)

A linear-time algorithm for connected r-domination and Steiner tree on distance-hereditary graphs. - Andreas Brandstädt; Feodor F. Dragan (Networks, 1998)

Dually Chordal Graphs. - Andreas Brandstädt; Feodor F. Dragan; Victor Chepoi; Vitaly I. Voloshin (SIAM J. Discret. Math., 1998)

Almost Diameter of a House-hole-free Graph in Linear Time Via LexBFS. - Feodor F. Dragan (Discret. Appl. Math., 1999)

A note on distance approximating trees in graphs. - Victor Chepoi; Feodor F. Dragan (Electron. Notes Discret. Math., 1999)

Lexbfs-orderings and powers of hhd-free graphs. - Feodor F. Dragan; Falk Nicolai (Int. J. Comput. Math., 1999)

Distance Approximating Trees for Chordal and Dually Chordal Graphs. - Andreas Brandstädt; Victor Chepoi; Feodor F. Dragan (J. Algorithms, 1999)

Convexity and HHD-Free Graphs. - Feodor F. Dragan; Falk Nicolai; Andreas Brandstädt (SIAM J. Discret. Math., 1999)

Provably Good Global Buffering Using an Available Buffer Block Plan. - Feodor F. Dragan; Andrew B. Kahng; Ion I. Mandoiu; Sudhakar Muddu; Alexander Zelikovsky (ICCAD, 2000)

On stable cutsets in graphs. - Andreas Brandstädt; Feodor F. Dragan; Van Bang Le; Thomas Szymczak (Discret. Appl. Math., 2000)

Strongly Orderable Graphs a Common Generalization of Strongly Chordal and Chordal Bipartite Graphs. - Feodor F. Dragan (Discret. Appl. Math., 2000)

LexBFS-orderings of Distance-hereditary Graphs with Application to the Diametral Pair Problem. - Feodor F. Dragan; Falk Nicolai (Discret. Appl. Math., 2000)

Linear Time Algorithms for Hamiltonian Problems on (Claw, Net)-Free Graphs. - Andreas Brandstädt; Feodor F. Dragan; Ekkehard Köhler (SIAM J. Comput., 2000)

Provably good global buffering by multi-terminal multicommodity flow approximation. - Feodor F. Dragan; Andrew B. Kahng; Ion I. Mandoiu; Sudhakar Muddu; Alexander Zelikovsky (ASP-DAC, 2001)

Practical Approximation Algorithms for Separable Packing Linear Programs. - Feodor F. Dragan; Andrew B. Kahng; Ion I. Mandoiu; Sudhakar Muddu; Alexander Zelikovsky (WADS, 2001)

Diameter determination on restricted graph families. - Derek G. Corneil; Feodor F. Dragan; Michel Habib; Christophe Paul (Discret. Appl. Math., 2001)

Tree Spanners on Chordal Graphs: Complexity, Algorithms, Open Problems. - Andreas Brandstädt; Feodor F. Dragan; Hoàng-Oanh Le; Van Bang Le (ISAAC, 2002)

On the Power of BFS to Determine a Graphs Diameter. - Derek G. Corneil; Feodor F. Dragan; Ekkehard Köhler (LATIN, 2002)

New Routing Schemes for Interval, Circular-Arc, and Permutation Graphs. - Feodor F. Dragan; Irina Lomonosov (IASTED PDCS, 2002)

Center and diameter problems in plane triangulations and quadrangulations. - Victor Chepoi; Feodor F. Dragan; Yann Vaxès (SODA, 2002)

Provably good global buffering by generalized multiterminalmulticommodity flow approximation. - Feodor F. Dragan; Andrew B. Kahng; Ion I. Mandoiu; Sudhakar Muddu; Alexander Zelikovsky (IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2002)

Additive Spanners for k-Chordal Graphs. - Victor Chepoi; Feodor F. Dragan; Chenyu Yan (CIAC, 2003)

On linear and circular structure of (claw, net)-free graphs. - Andreas Brandstädt; Feodor F. Dragan (Discret. Appl. Math., 2003)

Finding a central vertex in an HHD-free graph. - Victor Chepoi; Feodor F. Dragan (Discret. Appl. Math., 2003)

On the power of BFS to determine a graph's diameter. - Derek G. Corneil; Feodor F. Dragan; Ekkehard Köhler (Networks, 2003)

Effective Network Monitoring. - Yuri Breitbart; Feodor F. Dragan; Hassan Gobjuka (ICCCN, 2004)

Addressing, Distances and Routing in Triangular Systems with Applications in Cellular and Sensor Networks. - Victor Chepoi; Feodor F. Dragan; Yann Vaxès (IPDPS, 2004)

Tree spanners on chordal graphs: complexity and algorithms. - Andreas Brandstädt; Feodor F. Dragan; Hoàng-Oanh Le; Van Bang Le (Theor. Comput. Sci., 2004)

Collective Tree Spanners in Graphs with Bounded Genus, Chordality, Tree-Width, or Clique-Width. - Feodor F. Dragan; Chenyu Yan (ISAAC, 2005)

Distance-Based Location Update and Routing in Irregular Cellular Networks. - Victor Chepoi; Feodor F. Dragan; Yann Vaxès (SNPD, 2005)

Collective Tree 1-Spanners for Interval Graphs. - Derek G. Corneil; Feodor F. Dragan; Ekkehard Köhler; Chenyu Yan (WG, 2005)

Estimating all pairs shortest paths in restricted graph families: a unified approach. - Feodor F. Dragan (J. Algorithms, 2005)

New Graph Classes of Bounded Clique-Width. - Andreas Brandstädt; Feodor F. Dragan; Hoàng-Oanh Le; Raffaele Mosca (Theory Comput. Syst., 2005)

Additive sparse spanners for graphs with bounded length of largest induced cycle. - Victor Chepoi; Feodor F. Dragan; Chenyu Yan (Theor. Comput. Sci., 2005)

Distance Approximating Trees: Complexity and Algorithms. - Feodor F. Dragan; Chenyu Yan (CIAC, 2006)

Generalized Powers of Graphs and Their Algorithmic Use. - Andreas Brandstädt; Feodor F. Dragan; Yang Xiang; Chenyu Yan (SWAT, 2006)

Distance and routing labeling schemes for non-positively curved plane graphs. - Victor Chepoi; Feodor F. Dragan; Yann Vaxès (J. Algorithms, 2006)

Collective Tree Spanners and Routing in AT-free Related Graphs. - Feodor F. Dragan; Chenyu Yan; Derek G. Corneil (J. Graph Algorithms Appl., 2006)

Collective tree spanners of graphs. - Feodor F. Dragan; Chenyu Yan; Irina Lomonosov (SIAM J. Discret. Math., 2006)

Addressing, distances and routing in triangular systems with applications in cellular networks. - Victor Chepoi; Feodor F. Dragan; Yann Vaxès (Wirel. Networks, 2006)

Tree Spanners for Bipartite Graphs and Probe Interval Graphs. - Andreas Brandstädt; Feodor F. Dragan; Hoàng-Oanh Le; Van Bang Le; Ryuhei Uehara (Algorithmica, 2007)

On compact and efficient routing in certain graph classes. - Feodor F. Dragan; Irina Lomonosov (Discret. Appl. Math., 2007)

Spanners for bounded tree-length graphs. - Yon Dourisboure; Feodor F. Dragan; Cyril Gavoille; Chenyu Yan (Theor. Comput. Sci., 2007)

Diameters, centers, and approximating trees of delta-hyperbolicgeodesic spaces and graphs. - Victor Chepoi; Feodor F. Dragan; Bertrand Estellon; Michel Habib; Yann Vaxès (SCG, 2008)

Overlapping Matrix Pattern Visualization: A Hypergraph Approach. - Ruoming Jin; Yang Xiang; David Fuhry; Feodor F. Dragan (ICDM, 2008)

Navigating in a Graph by Aid of Its Spanning Tree. - Feodor F. Dragan; Martín Matamala (ISAAC, 2008)

Succinct summarization of transactional databases: an overlapped hyperrectangle scheme. - Yang Xiang; Ruoming Jin; David Fuhry; Feodor F. Dragan (KDD, 2008)

Collective Additive Tree Spanners of Homogeneously Orderable Graphs. - Feodor F. Dragan; Chenyu Yan; Yang Xiang (LATIN, 2008)

A PTAS for the Sparsest Spanners Problem on Apex-Minor-Free Graphs. - Feodor F. Dragan; Fedor V. Fomin; Petr A. Golovach (MFCS, 2008)

Additive Spanners for Circle Graphs and Polygonal Graphs. - Feodor F. Dragan; Derek G. Corneil; Ekkehard Köhler; Yang Xiang (WG, 2008)

Notes on diameters, centers, and approximating trees of delta-hyperbolic geodesic spaces and graphs. - Victor Chepoi; Feodor F. Dragan; Bertrand Estellon; Michel Habib; Yann Vaxès (Electron. Notes Discret. Math., 2008)

Collective Tree Spanners for Unit Disk Graphs with Applications. - Feodor F. Dragan; Yang Xiang; Chenyu Yan (Electron. Notes Discret. Math., 2009)

Effective Monitor Placement in Internet Networks. - Yuri Breitbart; Feodor F. Dragan; Hassan Gobjuka (J. Networks, 2009)

New Min-Max Theorems for Weakly Chordal and Dually Chordal Graphs. - Arthur H. Busch; Feodor F. Dragan; R. Sritharan (COCOA (2), 2010)

Collective Tree Spanners in Graphs with Bounded Parameters. - Feodor F. Dragan; Chenyu Yan (Algorithmica, 2010)

Network flow spanners. - Feodor F. Dragan; Chenyu Yan (Networks, 2010)

Summarizing transactional databases with overlapped hyperrectangles. - Yang Xiang; Ruoming Jin; David Fuhry; Feodor F. Dragan (Data Min. Knowl. Discov., 2011)

Spanners in sparse graphs. - Feodor F. Dragan; Fedor V. Fomin; Petr A. Golovach (J. Comput. Syst. Sci., 2011)

Navigating in a Graph by Aid of Its Spanning Tree Metric. - Feodor F. Dragan; Martín Matamala (SIAM J. Discret. Math., 2011)

Approximation of minimum weight spanners for sparse graphs. - Feodor F. Dragan; Fedor V. Fomin; Petr A. Golovach (Theor. Comput. Sci., 2011)

Additive Spanners and Distance and Routing Labeling Schemes for Hyperbolic Graphs. - Victor Chepoi; Feodor F. Dragan; Bertrand Estellon; Michel Habib; Yann Vaxès; Yang Xiang (Algorithmica, 2012)

Compact and low delay routing labeling scheme for Unit Disk Graphs. - Chenyu Yan; Yang Xiang; Feodor F. Dragan (Comput. Geom., 2012)

Collective additive tree spanners for circle graphs and polygonal graphs. - Feodor F. Dragan; Derek G. Corneil; Ekkehard Köhler; Yang Xiang (Discret. Appl. Math., 2012)

Constant Approximation Algorithms for Embedding Graph Metrics into Trees and Outerplanar Graphs. - Victor Chepoi; Feodor F. Dragan; Ilan Newman; Yuri Rabinovich; Yann Vaxès (Discret. Comput. Geom., 2012)

Tree-Like Structures in Graphs: A Metric Point of View. - Feodor F. Dragan (WG, 2013)

How to Use Spanning Trees to Navigate in Graphs. - Feodor F. Dragan; Yang Xiang (Algorithmica, 2013)

An Approximation Algorithm for the Tree t-Spanner Problem on Unweighted Graphs via Generalized Chordal Graphs. - Feodor F. Dragan; Ekkehard Köhler (Algorithmica, 2014)

Metric tree-like structures in real-life networks: an empirical study. - Muad Abu-Ata; Feodor F. Dragan (CoRR, 2014)

Collective additive tree spanners of bounded tree-breadth graphs with generalizations and consequences. - Feodor F. Dragan; Muad Abu-Ata (Theor. Comput. Sci., 2014)

Core-Periphery Models for Graphs Based on their δ-Hyperbolicity: An Example Using Biological Networks. - Hend Alrasheed; Feodor F. Dragan (CompleNet, 2015)

On Strong Tree-Breadth. - Arne Leitert; Feodor F. Dragan (COCOA, 2016)

The Network of Genetic Admixture in Humans. - Hend Alrasheed; Feodor F. Dragan (CompleNet, 2016)

Eccentricity Approximating Trees - Extended Abstract. - Feodor F. Dragan; Ekkehard Köhler; Hend Alrasheed (WG, 2016)

Minimum Eccentricity Shortest Paths in some Structured Graph Classes. - Feodor F. Dragan; Arne Leitert (J. Graph Algorithms Appl., 2016)

Metric tree-like structures in real-world networks: an empirical study. - Muad Abu-Ata; Feodor F. Dragan (Networks, 2016)

Core congestion is inherent in hyperbolic networks. - Victor Chepoi; Feodor F. Dragan; Yann Vaxès (SODA, 2017)

Line-Distortion, Bandwidth and Path-Length of a Graph. - Feodor F. Dragan; Ekkehard Köhler; Arne Leitert (Algorithmica, 2017)

Eccentricity approximating trees. - Feodor F. Dragan; Ekkehard Köhler; Hend Alrasheed (Discret. Appl. Math., 2017)

Preface: Special graph classes and algorithms-in honor of Professor Andreas Brandstädt on the occasion of his 65th birthday. - Feodor F. Dragan; Dieter Kratsch; Van Bang Le (Discret. Appl. Math., 2017)

On the minimum eccentricity shortest path problem. - Feodor F. Dragan; Arne Leitert (Theor. Comput. Sci., 2017)

Fast Approximation of Centrality and Distances in Hyperbolic Graphs. - Victor Chepoi; Feodor F. Dragan; Michel Habib; Yann Vaxès; Hend Alrasheed (COCOA, 2018)

Revisiting Radius, Diameter, and all Eccentricity Computation in Graphs through Certificates. - Feodor F. Dragan; Michel Habib; Laurent Viennot (CoRR, 2018)

Pruned Landmark Labeling Meets Vertex Centric Computation: A Surprisingly Happy Marriage! - Ruoming Jin; Zhen Peng; Wendell Wu; Feodor F. Dragan; Gagan Agrawal; Bin Ren (CoRR, 2019)

A story of diameter, radius and Helly property. - Feodor F. Dragan; Guillaume Ducoffe (CoRR, 2019)

Obstructions to a small hyperbolicity in Helly graphs. - Feodor F. Dragan; Heather M. Guarnera (Discret. Math., 2019)

Slimness of graphs. - Feodor F. Dragan; Abdulhakeem Mohammed (Discret. Math. Theor. Comput. Sci., 2019)

Fast approximation of eccentricities and distances in hyperbolic graphs. - Victor Chepoi; Feodor F. Dragan; Michel Habib; Yann Vaxès; Hend Alrasheed (J. Graph Algorithms Appl., 2019)

Parameterized approximation algorithms for some location problems in graphs. - Arne Leitert; Feodor F. Dragan (Theor. Comput. Sci., 2019)

Parallelizing pruned landmark labeling: dealing with dependencies in graph algorithms. - Ruoming Jin; Zhen Peng; Wendell Wu; Feodor F. Dragan; Gagan Agrawal; Bin Ren (ICS, 2020)

Eccentricity terrain of δ-hyperbolic graphs. - Feodor F. Dragan; Heather M. Guarnera (CoRR, 2020)

An eccentricity 2-approximating spanning tree of a chordal graph is computable in linear time. - Feodor F. Dragan (Inf. Process. Lett., 2020)

Eccentricity terrain of δ-hyperbolic graphs. - Feodor F. Dragan; Heather M. Guarnera (J. Comput. Syst. Sci., 2020)

Eccentricity function in distance-hereditary graphs. - Feodor F. Dragan; Heather M. Guarnera (Theor. Comput. Sci., 2020)

Fellow Travelers Phenomenon Present in Real-World Networks. - Abdulhakeem Othman Mohammed; Feodor F. Dragan; Heather M. Guarnera (COMPLEX NETWORKS, 2021)

Fast Approximation and Exact Computation of Negative Curvature Parameters of Graphs. - Jérémie Chalopin; Victor Chepoi; Feodor F. Dragan; Guillaume Ducoffe; Abdulhakeem Mohammed; Yann Vaxès (Discret. Comput. Geom., 2021)

A story of diameter, radius, and (almost) Helly property. - Guillaume Ducoffe; Feodor F. Dragan (Networks, 2021)

Helly-gap of a graph and vertex eccentricities. - Feodor F. Dragan; Heather M. Guarnera (Theor. Comput. Sci., 2021)

Injective Hulls of Various Graph Classes. - Heather M. Guarnera; Feodor F. Dragan; Arne Leitert (Graphs Comb., 2022)

ɑi-Metric Graphs: Hyperbolicity. - Feodor F. Dragan; Guillaume Ducoffe (CoRR, 2024)

Bow Metrics and Hyperbolicity. - Feodor F. Dragan; Guillaume Ducoffe; Michel Habib; Laurent Viennot (CoRR, 2024)

α i-Metric Graphs: Radius, Diameter and all Eccentricities. - Feodor F. Dragan; Guillaume Ducoffe (Algorithmica, 2024)

Certificates in P and Subquadratic-Time Computation of Radius, Diameter, and all Eccentricities in Graphs. - Feodor F. Dragan; Guillaume Ducoffe; Michel Habib; Laurent Viennot (SODA, 2025)

Fast deterministic algorithms for computing all eccentricities in (hyperbolic) Helly graphs. - Feodor F. Dragan; Guillaume Ducoffe; Heather M. Guarnera (J. Comput. Syst. Sci., 2025)

On the Complexity of Computing a Fastest Temporal Path in Interval Temporal Graphs. - Guillaume Aubian; Filippo Brunelli; Feodor F. Dragan; Guillaume Ducoffe; Michel Habib; Allen Ibiapina; Laurent Viennot (CoRR, 2025)

Graph parameters that are coarsely equivalent to tree-length. - Feodor F. Dragan (CoRR, 2025)

Graph parameters that are coarsely equivalent to path-length. - Feodor F. Dragan; Ekkehard Köhler (CoRR, 2025)

On Gp-unimodality of radius functions in graphs: structure and algorithms. - Jérémie Chalopin; Victor Chepoi; Feodor F. Dragan; Guillaume Ducoffe; Yann Vaxès (CoRR, 2025)

Lower bounds on collective additive spanners. - Derek G. Corneil; Feodor F. Dragan; Ekkehard Köhler; Yang Xiang (CoRR, 2025)