Feodor F. Dragan

Publication Activity (10 Years)

Years Active: 1993-2024
Publications (10 Years): 45

Top Venues

CoRR

Theor. Comput. Sci.

Algorithmica

Publications

Feodor F. Dragan, Guillaume Ducoffe
-Metric Graphs: Radius, Diameter and all Eccentricities. Algorithmica 86 (7) (2024)
Feodor F. Dragan, Guillaume Ducoffe
-Metric Graphs: Hyperbolicity. CoRR (2024)
Feodor F. Dragan, Guillaume Ducoffe
-Metric Graphs: Radius, Diameter and all Eccentricities. CoRR (2023)
Feodor F. Dragan, Guillaume Ducoffe
-Metric Graphs: Radius, Diameter and all Eccentricities. WG (2023)
Heather M. Guarnera, Feodor F. Dragan, Arne Leitert
Injective Hulls of Various Graph Classes. Graphs Comb. 38 (4) (2022)
Guillaume Ducoffe, Feodor F. Dragan
A story of diameter, radius, and (almost) Helly property. Networks 77 (3) (2021)
Jérémie Chalopin, Victor Chepoi, Feodor F. Dragan, Guillaume Ducoffe, Abdulhakeem Mohammed, Yann Vaxès
Fast Approximation and Exact Computation of Negative Curvature Parameters of Graphs. Discret. Comput. Geom. 65 (3) (2021)
Feodor F. Dragan, Heather M. Guarnera
Helly-gap of a graph and vertex eccentricities. Theor. Comput. Sci. 867 (2021)
Abdulhakeem Othman Mohammed, Feodor F. Dragan, Heather M. Guarnera
Fellow Travelers Phenomenon Present in Real-World Networks. COMPLEX NETWORKS (2021)
Feodor F. Dragan, Guillaume Ducoffe, Heather M. Guarnera
Fast Deterministic Algorithms for Computing All Eccentricities in (Hyperbolic) Helly Graphs. WADS (2021)
Feodor F. Dragan, Guillaume Ducoffe, Heather M. Guarnera
Fast deterministic algorithms for computing all eccentricities in (hyperbolic) Helly graphs. CoRR (2021)
Heather M. Guarnera, Feodor F. Dragan, Arne Leitert
Injective hulls of various graph classes. CoRR (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)
Feodor F. Dragan, Heather M. Guarnera
Helly-gap of a graph and vertex eccentricities. CoRR (2020)
Feodor F. Dragan, Heather M. Guarnera
Eccentricity function in distance-hereditary graphs. Theor. Comput. Sci. 833 (2020)
Feodor F. Dragan, Heather M. Guarnera
-hyperbolic graphs. J. Comput. Syst. Sci. 112 (2020)
Feodor F. Dragan, Heather M. Guarnera
Eccentricity terrain of δ-hyperbolic graphs. CoRR (2020)
Feodor F. Dragan
An eccentricity 2-approximating spanning tree of a chordal graph is computable in linear time. Inf. Process. Lett. 154 (2020)
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 (2019)
Arne Leitert, Feodor F. Dragan
Parameterized approximation algorithms for some location problems in graphs. Theor. Comput. Sci. 755 (2019)
Victor Chepoi, Feodor F. Dragan, Michel Habib, Yann Vaxès, Hend Alrasheed
Fast approximation of eccentricities and distances in hyperbolic graphs. J. Graph Algorithms Appl. 23 (2) (2019)
Feodor F. Dragan, Heather M. Guarnera
Obstructions to a small hyperbolicity in Helly graphs. Discret. Math. 342 (2) (2019)
Feodor F. Dragan, Guillaume Ducoffe
A story of diameter, radius and Helly property. CoRR (2019)
Feodor F. Dragan, Heather M. Guarnera
Eccentricity function in distance-hereditary graphs. CoRR (2019)
Feodor F. Dragan, Abdulhakeem Mohammed
Slimness of graphs. Discret. Math. Theor. Comput. Sci. 21 (3) (2019)
Jérémie Chalopin, Victor Chepoi, Feodor F. Dragan, Guillaume Ducoffe, Abdulhakeem Mohammed, Yann Vaxès
Fast approximation and exact computation of negative curvature parameters of graphs. CoRR (2018)
Jérémie Chalopin, Victor Chepoi, Feodor F. Dragan, Guillaume Ducoffe, Abdulhakeem Mohammed, Yann Vaxès
Fast Approximation and Exact Computation of Negative Curvature Parameters of Graphs. SoCG (2018)
Victor Chepoi, Feodor F. Dragan, Michel Habib, Yann Vaxès, Hend Al-Rasheed
Fast approximation of centrality and distances in hyperbolic graphs. CoRR (2018)
Victor Chepoi, Feodor F. Dragan, Michel Habib, Yann Vaxès, Hend Alrasheed
Fast Approximation of Centrality and Distances in Hyperbolic Graphs. COCOA (2018)
Feodor F. Dragan, Michel Habib, Laurent Viennot
Revisiting Radius, Diameter, and all Eccentricity Computation in Graphs through Certificates. CoRR (2018)
Arne Leitert, Feodor F. Dragan
Parameterized Approximation Algorithms for Some Location Problems in Graphs. COCOA (2) (2017)
Feodor F. Dragan, Dieter Kratsch, Van Bang Le
Preface: Special graph classes and algorithms-in honor of Professor Andreas Brandstädt on the occasion of his 65th birthday. Discret. Appl. Math. 216 (2017)
Feodor F. Dragan, Abdulhakeem Mohammed
Slimness of graphs. CoRR (2017)
Victor Chepoi, Feodor F. Dragan, Yann Vaxès
Core congestion is inherent in hyperbolic networks. SODA (2017)
Arne Leitert, Feodor F. Dragan
Parameterized Approximation Algorithms for some Location Problems in Graphs. CoRR (2017)
Feodor F. Dragan, Arne Leitert
On the minimum eccentricity shortest path problem. Theor. Comput. Sci. 694 (2017)
Feodor F. Dragan, Ekkehard Köhler, Hend Alrasheed
Eccentricity approximating trees. Discret. Appl. Math. 232 (2017)
Feodor F. Dragan, Ekkehard Köhler, Arne Leitert
Line-Distortion, Bandwidth and Path-Length of a Graph. Algorithmica 77 (3) (2017)
Feodor F. Dragan, Heather M. Guarnera
Obstructions to a small hyperbolicity in Helly graphs. CoRR (2017)
Arne Leitert, Feodor F. Dragan
On Strong Tree-Breadth. COCOA (2016)
Hend Alrasheed, Feodor F. Dragan
The Network of Genetic Admixture in Humans. CompleNet (2016)
Victor Chepoi, Feodor F. Dragan, Yann Vaxès
Core congestion is inherent in hyperbolic networks. CoRR (2016)
Feodor F. Dragan, Arne Leitert
Minimum Eccentricity Shortest Paths in some Structured Graph Classes. J. Graph Algorithms Appl. 20 (2) (2016)
Feodor F. Dragan, Ekkehard Köhler, Hend Alrasheed
Eccentricity Approximating Trees - Extended Abstract. WG (2016)
Muad Abu-Ata, Feodor F. Dragan
Metric tree-like structures in real-world networks: an empirical study. Networks 67 (1) (2016)
Feodor F. Dragan, Arne Leitert
Minimum Eccentricity Shortest Paths in Some Structured Graph Classes. WG (2015)
Feodor F. Dragan, Arne Leitert
On the Minimum Eccentricity Shortest Path Problem. WADS (2015)
Feodor F. Dragan, Arne Leitert
Minimum Eccentricity Shortest Paths in some Structured Graph Classes. CoRR (2015)
Hend Alrasheed, Feodor F. Dragan
Core-Periphery Models for Graphs Based on their δ-Hyperbolicity: An Example Using Biological Networks. CompleNet (2015)
Feodor F. Dragan, Ekkehard Köhler, Arne Leitert
Line-Distortion, Bandwidth and Path-Length of a Graph. SWAT (2014)
Muad Abu-Ata, Feodor F. Dragan
Metric tree-like structures in real-life networks: an empirical study. CoRR (2014)
Feodor F. Dragan, Ekkehard Köhler
An Approximation Algorithm for the Tree t-Spanner Problem on Unweighted Graphs via Generalized Chordal Graphs. Algorithmica 69 (4) (2014)
Feodor F. Dragan, Ekkehard Köhler, Arne Leitert
Line-distortion, Bandwidth and Path-length of a graph. CoRR (2014)
Feodor F. Dragan, Muad Abu-Ata
Collective additive tree spanners of bounded tree-breadth graphs with generalizations and consequences. Theor. Comput. Sci. 547 (2014)
Feodor F. Dragan, Yang Xiang
How to Use Spanning Trees to Navigate in Graphs. Algorithmica 66 (3) (2013)
Feodor F. Dragan
Tree-Like Structures in Graphs: A Metric Point of View. WG (2013)
Feodor F. Dragan, Muad Abu-Ata
Collective Additive Tree Spanners of Bounded Tree-Breadth Graphs with Generalizations and Consequences. SOFSEM (2013)
Chenyu Yan, Yang Xiang, Feodor F. Dragan
Compact and low delay routing labeling scheme for Unit Disk Graphs. Comput. Geom. 45 (7) (2012)
Feodor F. Dragan, Derek G. Corneil, Ekkehard Köhler, Yang Xiang
Collective additive tree spanners for circle graphs and polygonal graphs. Discret. Appl. Math. 160 (12) (2012)
Feodor F. Dragan, Muad Abu-Ata
Collective Additive Tree Spanners of Bounded Tree-Breadth Graphs with Generalizations and Consequences CoRR (2012)
Victor Chepoi, Feodor F. Dragan, Ilan Newman, Yuri Rabinovich, Yann Vaxès
Constant Approximation Algorithms for Embedding Graph Metrics into Trees and Outerplanar Graphs. Discret. Comput. Geom. 47 (1) (2012)
Victor Chepoi, Feodor F. Dragan, Bertrand Estellon, Michel Habib, Yann Vaxès, Yang Xiang
Additive Spanners and Distance and Routing Labeling Schemes for Hyperbolic Graphs. Algorithmica 62 (3-4) (2012)
Feodor F. Dragan, Martín Matamala
Navigating in a Graph by Aid of Its Spanning Tree Metric. SIAM J. Discret. Math. 25 (1) (2011)
Feodor F. Dragan, Fedor V. Fomin, Petr A. Golovach
Approximation of minimum weight spanners for sparse graphs. Theor. Comput. Sci. 412 (8-10) (2011)
Feodor F. Dragan, Fedor V. Fomin, Petr A. Golovach
Spanners in sparse graphs. J. Comput. Syst. Sci. 77 (6) (2011)
Feodor F. Dragan, Ekkehard Köhler
An Approximation Algorithm for the Tree t-Spanner Problem on Unweighted Graphs via Generalized Chordal Graphs. APPROX-RANDOM (2011)
Yang Xiang, Ruoming Jin, David Fuhry, Feodor F. Dragan
Summarizing transactional databases with overlapped hyperrectangles. Data Min. Knowl. Discov. 23 (2) (2011)
Feodor F. Dragan, Chenyu Yan
Collective Tree Spanners in Graphs with Bounded Parameters. Algorithmica 57 (1) (2010)
Arthur H. Busch, Feodor F. Dragan, R. Sritharan
New Min-Max Theorems for Weakly Chordal and Dually Chordal Graphs. COCOA (2) (2010)
Victor Chepoi, Feodor F. Dragan, Ilan Newman, Yuri Rabinovich, Yann Vaxès
Constant approximation algorithms for embedding graph metrics into trees and outerplanar graphs CoRR (2010)
Feodor F. Dragan, Chenyu Yan
Network flow spanners. Networks 56 (3) (2010)
Victor Chepoi, Feodor F. Dragan, Ilan Newman, Yuri Rabinovich, Yann Vaxès
Constant Approximation Algorithms for Embedding Graph Metrics into Trees and Outerplanar Graphs. APPROX-RANDOM (2010)
Feodor F. Dragan, Yang Xiang, Chenyu Yan
Collective Tree Spanners for Unit Disk Graphs with Applications. Electron. Notes Discret. Math. 32 (2009)
Chenyu Yan, Yang Xiang, Feodor F. Dragan
Compact and Low Delay Routing Labeling Scheme for Unit Disk Graphs. WADS (2009)
Yuri Breitbart, Feodor F. Dragan, Hassan Gobjuka
Effective Monitor Placement in Internet Networks. J. Networks 4 (7) (2009)
Feodor F. Dragan, Yang Xiang
How to Use Spanning Trees to Navigate in Graphs. MFCS (2009)
Feodor F. Dragan, Chenyu Yan, Yang Xiang
Collective Additive Tree Spanners of Homogeneously Orderable Graphs. LATIN (2008)
Feodor F. Dragan, Fedor V. Fomin, Petr A. Golovach
Spanners in Sparse Graphs. ICALP (1) (2008)
Feodor F. Dragan, Fedor V. Fomin, Petr A. Golovach
A PTAS for the Sparsest Spanners Problem on Apex-Minor-Free Graphs. MFCS (2008)
Yang Xiang, Ruoming Jin, David Fuhry, Feodor F. Dragan
Succinct summarization of transactional databases: an overlapped hyperrectangle scheme. KDD (2008)
Feodor F. Dragan, Martín Matamala
Navigating in a Graph by Aid of Its Spanning Tree. ISAAC (2008)
Feodor F. Dragan, Derek G. Corneil, Ekkehard Köhler, Yang Xiang
Additive Spanners for Circle Graphs and Polygonal Graphs. WG (2008)
Victor Chepoi, Feodor F. Dragan, Bertrand Estellon, Michel Habib, Yann Vaxès
Notes on diameters, centers, and approximating trees of delta-hyperbolic geodesic spaces and graphs. Electron. Notes Discret. Math. 31 (2008)
Ruoming Jin, Yang Xiang, David Fuhry, Feodor F. Dragan
Overlapping Matrix Pattern Visualization: A Hypergraph Approach. ICDM (2008)
Victor Chepoi, Feodor F. Dragan, Bertrand Estellon, Michel Habib, Yann Vaxès
Diameters, centers, and approximating trees of delta-hyperbolicgeodesic spaces and graphs. SCG (2008)
Yon Dourisboure, Feodor F. Dragan, Cyril Gavoille, Chenyu Yan
Spanners for bounded tree-length graphs. Theor. Comput. Sci. 383 (1) (2007)
Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Van Bang Le, Ryuhei Uehara
Tree Spanners for Bipartite Graphs and Probe Interval Graphs. Algorithmica 47 (1) (2007)
Feodor F. Dragan, Irina Lomonosov
On compact and efficient routing in certain graph classes. Discret. Appl. Math. 155 (11) (2007)
Feodor F. Dragan, Chenyu Yan
Distance Approximating Trees: Complexity and Algorithms. CIAC (2006)
Victor Chepoi, Feodor F. Dragan, Yann Vaxès
Distance and routing labeling schemes for non-positively curved plane graphs. J. Algorithms 61 (2) (2006)
Feodor F. Dragan, Chenyu Yan, Irina Lomonosov
Collective tree spanners of graphs. SIAM J. Discret. Math. 20 (1) (2006)
Feodor F. Dragan, Chenyu Yan
Network Flow Spanners. LATIN (2006)
Victor Chepoi, Feodor F. Dragan, Yann Vaxès
Addressing, distances and routing in triangular systems with applications in cellular networks. Wirel. Networks 12 (6) (2006)
Andreas Brandstädt, Feodor F. Dragan, Yang Xiang, Chenyu Yan
Generalized Powers of Graphs and Their Algorithmic Use. SWAT (2006)
Feodor F. Dragan, Chenyu Yan, Derek G. Corneil
Collective Tree Spanners and Routing in AT-free Related Graphs. J. Graph Algorithms Appl. 10 (2) (2006)
Derek G. Corneil, Feodor F. Dragan, Ekkehard Köhler, Chenyu Yan
Collective Tree 1-Spanners for Interval Graphs. WG (2005)
Victor Chepoi, Feodor F. Dragan, Yann Vaxès
Distance-Based Location Update and Routing in Irregular Cellular Networks. SNPD (2005)
Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Raffaele Mosca
New Graph Classes of Bounded Clique-Width. Theory Comput. Syst. 38 (5) (2005)
Feodor F. Dragan
Estimating all pairs shortest paths in restricted graph families: a unified approach. J. Algorithms 57 (1) (2005)
Victor Chepoi, Feodor F. Dragan, Chenyu Yan
Additive sparse spanners for graphs with bounded length of largest induced cycle. Theor. Comput. Sci. 347 (1-2) (2005)

Feodor F. Dragan.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Feodor F. Dragan