| 2025 | SODA | Certificates in P and Subquadratic-Time Computation of Radius, Diameter, and all Eccentricities in Graphs. | Feodor F. Dragan, Guillaume Ducoffe, Michel Habib, Laurent Viennot |
| 2023 | WG | α | Feodor F. Dragan, Guillaume Ducoffe |
| 2021 | WADS | Fast Deterministic Algorithms for Computing All Eccentricities in (Hyperbolic) Helly Graphs. | Feodor F. Dragan, Guillaume Ducoffe, Heather M. Guarnera |
| 2020 | ICS | Parallelizing pruned landmark labeling: dealing with dependencies in graph algorithms. | Ruoming Jin, Zhen Peng, Wendell Wu, Feodor F. Dragan, Gagan Agrawal, Bin Ren |
| 2018 | COCOA | Fast Approximation of Centrality and Distances in Hyperbolic Graphs. | Victor Chepoi, Feodor F. Dragan, Michel Habib, Yann Vaxs, Hend Alrasheed |
| 2017 | COCOA | Parameterized Approximation Algorithms for Some Location Problems in Graphs. | Arne Leitert, Feodor F. Dragan |
| 2017 | SODA | Core congestion is inherent in hyperbolic networks. | Victor Chepoi, Feodor F. Dragan, Yann Vaxs |
| 2016 | COCOA | On Strong Tree-Breadth. | Arne Leitert, Feodor F. Dragan |
| 2016 | WG | Eccentricity Approximating Trees - Extended Abstract. | Feodor F. Dragan, Ekkehard Khler, Hend Alrasheed |
| 2015 | WADS | On the Minimum Eccentricity Shortest Path Problem. | Feodor F. Dragan, Arne Leitert |
| 2015 | WG | Minimum Eccentricity Shortest Paths in Some Structured Graph Classes. | Feodor F. Dragan, Arne Leitert |
| 2013 | SOFSEM | Collective Additive Tree Spanners of Bounded Tree-Breadth Graphs with Generalizations and Consequences. | Feodor F. Dragan, Muad Abu-Ata |
| 2013 | WG | Tree-Like Structures in Graphs: A Metric Point of View. | Feodor F. Dragan |
| 2010 | COCOA | New Min-Max Theorems for Weakly Chordal and Dually Chordal Graphs. | Arthur H. Busch, Feodor F. Dragan, R. Sritharan |
| 2009 | MFCS | How to Use Spanning Trees to Navigate in Graphs. | Feodor F. Dragan, Yang Xiang |
| 2009 | WADS | Compact and Low Delay Routing Labeling Scheme for Unit Disk Graphs. | Chenyu Yan, Yang Xiang, Feodor F. Dragan |
| 2008 | ICALP | Spanners in Sparse Graphs. | Feodor F. Dragan, Fedor V. Fomin, Petr A. Golovach |
| 2008 | ICDM | Overlapping Matrix Pattern Visualization: A Hypergraph Approach. | Ruoming Jin, Yang Xiang, David Fuhry, Feodor F. Dragan |
| 2008 | ISAAC | Navigating in a Graph by Aid of Its Spanning Tree. | Feodor F. Dragan, Martn Matamala |
| 2008 | KDD | Succinct summarization of transactional databases: an overlapped hyperrectangle scheme. | Yang Xiang, Ruoming Jin, David Fuhry, Feodor F. Dragan |
| 2008 | LATIN | Collective Additive Tree Spanners of Homogeneously Orderable Graphs. | Feodor F. Dragan, Chenyu Yan, Yang Xiang |
| 2008 | MFCS | A PTAS for the Sparsest Spanners Problem on Apex-Minor-Free Graphs. | Feodor F. Dragan, Fedor V. Fomin, Petr A. Golovach |
| 2008 | WG | Additive Spanners for Circle Graphs and Polygonal Graphs. | Feodor F. Dragan, Derek G. Corneil, Ekkehard Khler, Yang Xiang |
| 2006 | CIAC | Distance Approximating Trees: Complexity and Algorithms. | Feodor F. Dragan, Chenyu Yan |
| 2006 | LATIN | Network Flow Spanners. | Feodor F. Dragan, Chenyu Yan |
| 2005 | ISAAC | Collective Tree Spanners in Graphs with Bounded Genus, Chordality, Tree-Width, or Clique-Width. | Feodor F. Dragan, Chenyu Yan |
| 2005 | SNPD | Distance-Based Location Update and Routing in Irregular Cellular Networks. | Victor Chepoi, Feodor F. Dragan, Yann Vaxs |
| 2005 | WG | Collective Tree 1-Spanners for Interval Graphs. | Derek G. Corneil, Feodor F. Dragan, Ekkehard Khler, Chenyu Yan |
| 2004 | ICCCN | Effective Network Monitoring. | Yuri Breitbart, Feodor F. Dragan, Hassan Gobjuka |
| 2004 | ISAAC | On Compact and Efficient Routing in Certain Graph Classes. | Feodor F. Dragan, Irina Lomonosov |
| 2004 | WG | Collective Tree Spanners and Routing in AT-free Related Graphs. | Feodor F. Dragan, Chenyu Yan, Derek G. Corneil |
| 2003 | CIAC | Additive Spanners for k-Chordal Graphs. | Victor Chepoi, Feodor F. Dragan, Chenyu Yan |
| 2003 | WG | Tree Spanners for Bipartite Graphs and Probe Interval Graphs. | Andreas Brandstdt, Feodor F. Dragan, Hong-Oanh Le, Van Bang Le, Ryuhei Uehara |
| 2002 | ISAAC | Tree Spanners on Chordal Graphs: Complexity, Algorithms, Open Problems. | Andreas Brandstdt, Feodor F. Dragan, Hong-Oanh Le, Van Bang Le |
| 2002 | LATIN | On the Power of BFS to Determine a Graphs Diameter. | Derek G. Corneil, Feodor F. Dragan, Ekkehard Khler |
| 2002 | SODA | Center and diameter problems in plane triangulations and quadrangulations. | Victor Chepoi, Feodor F. Dragan, Yann Vaxs |
| 2002 | WG | New Graph Classes of Bounded Clique-Width. | Andreas Brandstdt, Feodor F. Dragan, Hong-Oanh Le, Raffaele Mosca |
| 2001 | ASPDAC | Provably good global buffering by multi-terminal multicommodity flow approximation. | Feodor F. Dragan, Andrew B. Kahng, Ion I. Mandoiu, Sudhakar Muddu, Alexander Zelikovsky |
| 2001 | WADS | Practical Approximation Algorithms for Separable Packing Linear Programs. | Feodor F. Dragan, Andrew B. Kahng, Ion I. Mandoiu, Sudhakar Muddu, Alexander Zelikovsky |
| 2001 | WG | Estimating All Pairs Shortest Paths in Restricted Graph Families: A Unified Approach. | Feodor F. Dragan |
| 2000 | ICCAD | Provably Good Global Buffering Using an Available Buffer Block Plan. | Feodor F. Dragan, Andrew B. Kahng, Ion I. Mandoiu, Sudhakar Muddu, Alexander Zelikovsky |
| 1999 | WG | Linear Time Algorithms for Hamiltonian Problems on (Claw, Net)-Free Graphs. | Andreas Brandstdt, Feodor F. Dragan, Ekkehard Khler |
| 1998 | WG | Diameter Determination on Restricted Graph Faminlies. | Derek G. Corneil, Feodor F. Dragan, Michel Habib, Christophe Paul |
| 1997 | ESA | Distance Approximating Trees for Chordal and Dually Chordal Graphs (Extended Abstract). | Andreas Brandstdt, Victor Chepoi, Feodor F. Dragan |
| 1997 | WG | On Greedy Matching Ordering and Greedy Matchable Graphs (Extended Abstract). | Feodor F. Dragan |
| 1996 | WG | LexBFS-Orderings and Power of Graphs. | Feodor F. Dragan, Falk Nicolai, Andreas Brandstdt |
| 1995 | FCT | On Condorcet and Median Points of Simple Rectilinear Polygons (Extended Abstract). | Victor Chepoi, Feodor F. Dragan |
| 1995 | FCT | r-Domination Problems on Homogeneously Ordered Graphs (Extended Abstract). | Feodor F. Dragan, Falk Nicolai |
| 1995 | WG | Homogeneously Orderable Graphs and the Steiner Tree Problem. | Andreas Brandstdt, Feodor F. Dragan, Falk Nicolai |
| 1994 | ESA | A Linear-Time Algorithm for Finding a Central Vertex of a Chordal Graph. | Victor Chepoi, Feodor F. Dragan |
| 1994 | STACS | Dominating Cliques in Graphs with Hypertree Structures. | Feodor F. Dragan, Andreas Brandstdt |
| 1994 | WG | The Algorithmic Use of Hypertree Structure and Maximum Neighbourhood Orderings. | Andreas Brandstdt, Victor Chepoi, Feodor F. Dragan |
| 1993 | WG | Dually Chordal Graphs. | Andreas Brandstdt, Feodor F. Dragan, Victor Chepoi, Vitaly I. Voloshin |