Feodor F. Dragan

170 papers A* 6A 6B 34C 5Journal 104Unranked 15

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Certificates in P and Subquadratic-Time Computation of Radius, Diameter, and all Eccentricities in Graphs. Algorithmica Feodor F. Dragan, Guillaume Ducoffe, Michel Habib, Laurent Viennot
2026	J	`jnl`	Correction: Certificates in P and Subquadratic-Time Computation of Radius, Diameter, and all Eccentricities in Graphs. Algorithmica Feodor F. Dragan, Guillaume Ducoffe, Michel Habib, Laurent Viennot
2025	A*	`conf`	Certificates in P and Subquadratic-Time Computation of Radius, Diameter, and all Eccentricities in Graphs. SODA Feodor F. Dragan, Guillaume Ducoffe, Michel Habib, Laurent Viennot
2025	J	`jnl`	Fast deterministic algorithms for computing all eccentricities in (hyperbolic) Helly graphs. J. Comput. Syst. Sci. Feodor F. Dragan, Guillaume Ducoffe, Heather M. Guarnera
2025	J	`jnl`	Graph parameters that are coarsely equivalent to path-length. CoRR Feodor F. Dragan, Ekkehard Köhler
2025	J	`jnl`	Graph parameters that are coarsely equivalent to tree-length. CoRR Feodor F. Dragan
2025	J	`jnl`	Lower bounds on collective additive spanners. CoRR Derek G. Corneil, Feodor F. Dragan, Ekkehard Köhler, Yang Xiang
2025	J	`jnl`	On G CoRR Jérémie Chalopin, Victor Chepoi, Feodor F. Dragan, Guillaume Ducoffe, Yann Vaxès
2025	J	`jnl`	On the Complexity of Computing a Fastest Temporal Path in Interval Temporal Graphs. CoRR Guillaume Aubian, Filippo Brunelli, Feodor F. Dragan, Guillaume Ducoffe, Michel Habib, Allen Ibiapina, Laurent Viennot
2024	J	`jnl`	Bow Metrics and Hyperbolicity. CoRR Feodor F. Dragan, Guillaume Ducoffe, Michel Habib, Laurent Viennot
2024	J	`jnl`	ɑ CoRR Feodor F. Dragan, Guillaume Ducoffe
2024	J	`jnl`	α Algorithmica Feodor F. Dragan, Guillaume Ducoffe
2023	B	`conf`	α WG Feodor F. Dragan, Guillaume Ducoffe
2023	J	`jnl`	α CoRR Feodor F. Dragan, Guillaume Ducoffe
2022	J	`jnl`	Injective Hulls of Various Graph Classes. Graphs Comb. Heather M. Guarnera, Feodor F. Dragan, Arne Leitert
2021	J	`jnl`	A story of diameter, radius, and (almost) Helly property. Networks Guillaume Ducoffe, Feodor F. Dragan
2021	J	`jnl`	Fast Approximation and Exact Computation of Negative Curvature Parameters of Graphs. Discret. Comput. Geom. Jérémie Chalopin, Victor Chepoi, Feodor F. Dragan, Guillaume Ducoffe, Abdulhakeem Mohammed, Yann Vaxès
2021	B	`conf`	Fast Deterministic Algorithms for Computing All Eccentricities in (Hyperbolic) Helly Graphs. WADS Feodor F. Dragan, Guillaume Ducoffe, Heather M. Guarnera
2021	J	`jnl`	Fast deterministic algorithms for computing all eccentricities in (hyperbolic) Helly graphs. CoRR Feodor F. Dragan, Guillaume Ducoffe, Heather M. Guarnera
2021	—	`conf`	Fellow Travelers Phenomenon Present in Real-World Networks. COMPLEX NETWORKS Abdulhakeem Othman Mohammed, Feodor F. Dragan, Heather M. Guarnera
2021	J	`jnl`	Helly-gap of a graph and vertex eccentricities. Theor. Comput. Sci. Feodor F. Dragan, Heather M. Guarnera
2020	J	`jnl`	An eccentricity 2-approximating spanning tree of a chordal graph is computable in linear time. Inf. Process. Lett. Feodor F. Dragan
2020	J	`jnl`	Eccentricity function in distance-hereditary graphs. Theor. Comput. Sci. Feodor F. Dragan, Heather M. Guarnera
2020	J	`jnl`	Eccentricity terrain of J. Comput. Syst. Sci. Feodor F. Dragan, Heather M. Guarnera
2020	J	`jnl`	Eccentricity terrain of δ-hyperbolic graphs. CoRR Feodor F. Dragan, Heather M. Guarnera
2020	J	`jnl`	Helly-gap of a graph and vertex eccentricities. CoRR Feodor F. Dragan, Heather M. Guarnera
2020	J	`jnl`	Injective hulls of various graph classes. CoRR Heather M. Guarnera, Feodor F. Dragan, Arne Leitert
2020	A	`conf`	Parallelizing pruned landmark labeling: dealing with dependencies in graph algorithms. ICS Ruoming Jin, Zhen Peng, Wendell Wu, Feodor F. Dragan, Gagan Agrawal, Bin Ren
2019	J	`jnl`	A story of diameter, radius and Helly property. CoRR Feodor F. Dragan, Guillaume Ducoffe
2019	J	`jnl`	Eccentricity function in distance-hereditary graphs. CoRR Feodor F. Dragan, Heather M. Guarnera
2019	J	`jnl`	Fast approximation of eccentricities and distances in hyperbolic graphs. J. Graph Algorithms Appl. Victor Chepoi, Feodor F. Dragan, Michel Habib, Yann Vaxès, Hend Alrasheed
2019	J	`jnl`	Obstructions to a small hyperbolicity in Helly graphs. Discret. Math. Feodor F. Dragan, Heather M. Guarnera
2019	J	`jnl`	Parameterized approximation algorithms for some location problems in graphs. Theor. Comput. Sci. Arne Leitert, Feodor F. Dragan
2019	J	`jnl`	Pruned Landmark Labeling Meets Vertex Centric Computation: A Surprisingly Happy Marriage! CoRR Ruoming Jin, Zhen Peng, Wendell Wu, Feodor F. Dragan, Gagan Agrawal, Bin Ren
2019	J	`jnl`	Slimness of graphs. Discret. Math. Theor. Comput. Sci. Feodor F. Dragan, Abdulhakeem Mohammed
2018	A*	`conf`	Fast Approximation and Exact Computation of Negative Curvature Parameters of Graphs. SoCG Jérémie Chalopin, Victor Chepoi, Feodor F. Dragan, Guillaume Ducoffe, Abdulhakeem Mohammed, Yann Vaxès
2018	C	`conf`	Fast Approximation of Centrality and Distances in Hyperbolic Graphs. COCOA Victor Chepoi, Feodor F. Dragan, Michel Habib, Yann Vaxès, Hend Alrasheed
2018	J	`jnl`	Fast approximation and exact computation of negative curvature parameters of graphs. CoRR Jérémie Chalopin, Victor Chepoi, Feodor F. Dragan, Guillaume Ducoffe, Abdulhakeem Mohammed, Yann Vaxès
2018	J	`jnl`	Fast approximation of centrality and distances in hyperbolic graphs. CoRR Victor Chepoi, Feodor F. Dragan, Michel Habib, Yann Vaxès, Hend Al-Rasheed
2018	J	`jnl`	Revisiting Radius, Diameter, and all Eccentricity Computation in Graphs through Certificates. CoRR Feodor F. Dragan, Michel Habib, Laurent Viennot
2017	A*	`conf`	Core congestion is inherent in hyperbolic networks. SODA Victor Chepoi, Feodor F. Dragan, Yann Vaxès
2017	J	`jnl`	Eccentricity approximating trees. Discret. Appl. Math. Feodor F. Dragan, Ekkehard Köhler, Hend Alrasheed
2017	J	`jnl`	Line-Distortion, Bandwidth and Path-Length of a Graph. Algorithmica Feodor F. Dragan, Ekkehard Köhler, Arne Leitert
2017	J	`jnl`	Obstructions to a small hyperbolicity in Helly graphs. CoRR Feodor F. Dragan, Heather M. Guarnera
2017	J	`jnl`	On the minimum eccentricity shortest path problem. Theor. Comput. Sci. Feodor F. Dragan, Arne Leitert
2017	—	`conf`	Parameterized Approximation Algorithms for Some Location Problems in Graphs. COCOA (2) Arne Leitert, Feodor F. Dragan
2017	J	`jnl`	Parameterized Approximation Algorithms for some Location Problems in Graphs. CoRR Arne Leitert, Feodor F. Dragan
2017	J	`jnl`	Preface: Special graph classes and algorithms-in honor of Professor Andreas Brandstädt on the occasion of his 65th birthday. Discret. Appl. Math. Feodor F. Dragan, Dieter Kratsch, Van Bang Le
2017	J	`jnl`	Slimness of graphs. CoRR Feodor F. Dragan, Abdulhakeem Mohammed
2016	J	`jnl`	Core congestion is inherent in hyperbolic networks. CoRR Victor Chepoi, Feodor F. Dragan, Yann Vaxès
2016	B	`conf`	Eccentricity Approximating Trees - Extended Abstract. WG Feodor F. Dragan, Ekkehard Köhler, Hend Alrasheed
2016	J	`jnl`	Metric tree-like structures in real-world networks: an empirical study. Networks Muad Abu-Ata, Feodor F. Dragan
2016	J	`jnl`	Minimum Eccentricity Shortest Paths in some Structured Graph Classes. J. Graph Algorithms Appl. Feodor F. Dragan, Arne Leitert
2016	C	`conf`	On Strong Tree-Breadth. COCOA Arne Leitert, Feodor F. Dragan
2016	—	`conf`	The Network of Genetic Admixture in Humans. CompleNet Hend Alrasheed, Feodor F. Dragan
2015	—	`conf`	Core-Periphery Models for Graphs Based on their δ-Hyperbolicity: An Example Using Biological Networks. CompleNet Hend Alrasheed, Feodor F. Dragan
2015	B	`conf`	Minimum Eccentricity Shortest Paths in Some Structured Graph Classes. WG Feodor F. Dragan, Arne Leitert
2015	J	`jnl`	Minimum Eccentricity Shortest Paths in some Structured Graph Classes. CoRR Feodor F. Dragan, Arne Leitert
2015	B	`conf`	On the Minimum Eccentricity Shortest Path Problem. WADS Feodor F. Dragan, Arne Leitert
2014	J	`jnl`	An Approximation Algorithm for the Tree t-Spanner Problem on Unweighted Graphs via Generalized Chordal Graphs. Algorithmica Feodor F. Dragan, Ekkehard Köhler
2014	J	`jnl`	Collective additive tree spanners of bounded tree-breadth graphs with generalizations and consequences. Theor. Comput. Sci. Feodor F. Dragan, Muad Abu-Ata
2014	—	`conf`	Line-Distortion, Bandwidth and Path-Length of a Graph. SWAT Feodor F. Dragan, Ekkehard Köhler, Arne Leitert
2014	J	`jnl`	Line-distortion, Bandwidth and Path-length of a graph. CoRR Feodor F. Dragan, Ekkehard Köhler, Arne Leitert
2014	J	`jnl`	Metric tree-like structures in real-life networks: an empirical study. CoRR Muad Abu-Ata, Feodor F. Dragan
2013	B	`conf`	Collective Additive Tree Spanners of Bounded Tree-Breadth Graphs with Generalizations and Consequences. SOFSEM Feodor F. Dragan, Muad Abu-Ata
2013	J	`jnl`	How to Use Spanning Trees to Navigate in Graphs. Algorithmica Feodor F. Dragan, Yang Xiang
2013	B	`conf`	Tree-Like Structures in Graphs: A Metric Point of View. WG Feodor F. Dragan
2012	J	`jnl`	Additive Spanners and Distance and Routing Labeling Schemes for Hyperbolic Graphs. Algorithmica Victor Chepoi, Feodor F. Dragan, Bertrand Estellon, Michel Habib, Yann Vaxès, Yang Xiang
2012	J	`jnl`	Collective Additive Tree Spanners of Bounded Tree-Breadth Graphs with Generalizations and Consequences CoRR Feodor F. Dragan, Muad Abu-Ata
2012	J	`jnl`	Collective additive tree spanners for circle graphs and polygonal graphs. Discret. Appl. Math. Feodor F. Dragan, Derek G. Corneil, Ekkehard Köhler, Yang Xiang
2012	J	`jnl`	Compact and low delay routing labeling scheme for Unit Disk Graphs. Comput. Geom. Chenyu Yan, Yang Xiang, Feodor F. Dragan
2012	J	`jnl`	Constant Approximation Algorithms for Embedding Graph Metrics into Trees and Outerplanar Graphs. Discret. Comput. Geom. Victor Chepoi, Feodor F. Dragan, Ilan Newman, Yuri Rabinovich, Yann Vaxès
2011	—	`conf`	An Approximation Algorithm for the Tree t-Spanner Problem on Unweighted Graphs via Generalized Chordal Graphs. APPROX-RANDOM Feodor F. Dragan, Ekkehard Köhler
2011	J	`jnl`	Approximation of minimum weight spanners for sparse graphs. Theor. Comput. Sci. Feodor F. Dragan, Fedor V. Fomin, Petr A. Golovach
2011	J	`jnl`	Navigating in a Graph by Aid of Its Spanning Tree Metric. SIAM J. Discret. Math. Feodor F. Dragan, Martín Matamala
2011	J	`jnl`	Spanners in sparse graphs. J. Comput. Syst. Sci. Feodor F. Dragan, Fedor V. Fomin, Petr A. Golovach
2011	J	`jnl`	Summarizing transactional databases with overlapped hyperrectangles. Data Min. Knowl. Discov. Yang Xiang, Ruoming Jin, David Fuhry, Feodor F. Dragan
2010	J	`jnl`	Collective Tree Spanners in Graphs with Bounded Parameters. Algorithmica Feodor F. Dragan, Chenyu Yan
2010	—	`conf`	Constant Approximation Algorithms for Embedding Graph Metrics into Trees and Outerplanar Graphs. APPROX-RANDOM Victor Chepoi, Feodor F. Dragan, Ilan Newman, Yuri Rabinovich, Yann Vaxès
2010	J	`jnl`	Constant approximation algorithms for embedding graph metrics into trees and outerplanar graphs CoRR Victor Chepoi, Feodor F. Dragan, Ilan Newman, Yuri Rabinovich, Yann Vaxès
2010	J	`jnl`	Network flow spanners. Networks Feodor F. Dragan, Chenyu Yan
2010	—	`conf`	New Min-Max Theorems for Weakly Chordal and Dually Chordal Graphs. COCOA (2) Arthur H. Busch, Feodor F. Dragan, R. Sritharan
2009	J	`jnl`	Collective Tree Spanners for Unit Disk Graphs with Applications. Electron. Notes Discret. Math. Feodor F. Dragan, Yang Xiang, Chenyu Yan
2009	B	`conf`	Compact and Low Delay Routing Labeling Scheme for Unit Disk Graphs. WADS Chenyu Yan, Yang Xiang, Feodor F. Dragan
2009	J	`jnl`	Effective Monitor Placement in Internet Networks. J. Networks Yuri Breitbart, Feodor F. Dragan, Hassan Gobjuka
2009	B	`conf`	How to Use Spanning Trees to Navigate in Graphs. MFCS Feodor F. Dragan, Yang Xiang
2008	B	`conf`	A PTAS for the Sparsest Spanners Problem on Apex-Minor-Free Graphs. MFCS Feodor F. Dragan, Fedor V. Fomin, Petr A. Golovach
2008	B	`conf`	Additive Spanners for Circle Graphs and Polygonal Graphs. WG Feodor F. Dragan, Derek G. Corneil, Ekkehard Köhler, Yang Xiang
2008	B	`conf`	Collective Additive Tree Spanners of Homogeneously Orderable Graphs. LATIN Feodor F. Dragan, Chenyu Yan, Yang Xiang
2008	—	`conf`	Diameters, centers, and approximating trees of delta-hyperbolicgeodesic spaces and graphs. SCG Victor Chepoi, Feodor F. Dragan, Bertrand Estellon, Michel Habib, Yann Vaxès
2008	B	`conf`	Navigating in a Graph by Aid of Its Spanning Tree. ISAAC Feodor F. Dragan, Martín Matamala
2008	J	`jnl`	Notes on diameters, centers, and approximating trees of delta-hyperbolic geodesic spaces and graphs. Electron. Notes Discret. Math. Victor Chepoi, Feodor F. Dragan, Bertrand Estellon, Michel Habib, Yann Vaxès
2008	A*	`conf`	Overlapping Matrix Pattern Visualization: A Hypergraph Approach. ICDM Ruoming Jin, Yang Xiang, David Fuhry, Feodor F. Dragan
2008	—	`conf`	Spanners in Sparse Graphs. ICALP (1) Feodor F. Dragan, Fedor V. Fomin, Petr A. Golovach
2008	A*	`conf`	Succinct summarization of transactional databases: an overlapped hyperrectangle scheme. KDD Yang Xiang, Ruoming Jin, David Fuhry, Feodor F. Dragan
2007	J	`jnl`	On compact and efficient routing in certain graph classes. Discret. Appl. Math. Feodor F. Dragan, Irina Lomonosov
2007	J	`jnl`	Spanners for bounded tree-length graphs. Theor. Comput. Sci. Yon Dourisboure, Feodor F. Dragan, Cyril Gavoille, Chenyu Yan
2007	J	`jnl`	Tree Spanners for Bipartite Graphs and Probe Interval Graphs. Algorithmica Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Van Bang Le, Ryuhei Uehara
2006	J	`jnl`	Addressing, distances and routing in triangular systems with applications in cellular networks. Wirel. Networks Victor Chepoi, Feodor F. Dragan, Yann Vaxès
2006	J	`jnl`	Collective Tree Spanners and Routing in AT-free Related Graphs. J. Graph Algorithms Appl. Feodor F. Dragan, Chenyu Yan, Derek G. Corneil
2006	J	`jnl`	Collective tree spanners of graphs. SIAM J. Discret. Math. Feodor F. Dragan, Chenyu Yan, Irina Lomonosov
2006	C	`conf`	Distance Approximating Trees: Complexity and Algorithms. CIAC Feodor F. Dragan, Chenyu Yan
2006	J	`jnl`	Distance and routing labeling schemes for non-positively curved plane graphs. J. Algorithms Victor Chepoi, Feodor F. Dragan, Yann Vaxès
2006	—	`conf`	Generalized Powers of Graphs and Their Algorithmic Use. SWAT Andreas Brandstädt, Feodor F. Dragan, Yang Xiang, Chenyu Yan
2006	B	`conf`	Network Flow Spanners. LATIN Feodor F. Dragan, Chenyu Yan
2005	J	`jnl`	Additive sparse spanners for graphs with bounded length of largest induced cycle. Theor. Comput. Sci. Victor Chepoi, Feodor F. Dragan, Chenyu Yan
2005	B	`conf`	Collective Tree 1-Spanners for Interval Graphs. WG Derek G. Corneil, Feodor F. Dragan, Ekkehard Köhler, Chenyu Yan
2005	B	`conf`	Collective Tree Spanners in Graphs with Bounded Genus, Chordality, Tree-Width, or Clique-Width. ISAAC Feodor F. Dragan, Chenyu Yan
2005	C	`conf`	Distance-Based Location Update and Routing in Irregular Cellular Networks. SNPD Victor Chepoi, Feodor F. Dragan, Yann Vaxès
2005	J	`jnl`	Estimating all pairs shortest paths in restricted graph families: a unified approach. J. Algorithms Feodor F. Dragan
2005	J	`jnl`	New Graph Classes of Bounded Clique-Width. Theory Comput. Syst. Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Raffaele Mosca
2004	A	`conf`	Addressing, Distances and Routing in Triangular Systems with Applications in Cellular and Sensor Networks. IPDPS Victor Chepoi, Feodor F. Dragan, Yann Vaxès
2004	B	`conf`	Collective Tree Spanners and Routing in AT-free Related Graphs. WG Feodor F. Dragan, Chenyu Yan, Derek G. Corneil
2004	—	`conf`	Collective Tree Spanners of Graphs. SWAT Feodor F. Dragan, Chenyu Yan, Irina Lomonosov
2004	B	`conf`	Effective Network Monitoring. ICCCN Yuri Breitbart, Feodor F. Dragan, Hassan Gobjuka
2004	B	`conf`	On Compact and Efficient Routing in Certain Graph Classes. ISAAC Feodor F. Dragan, Irina Lomonosov
2004	J	`jnl`	Tree spanners on chordal graphs: complexity and algorithms. Theor. Comput. Sci. Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Van Bang Le
2003	C	`conf`	Additive Spanners for k-Chordal Graphs. CIAC Victor Chepoi, Feodor F. Dragan, Chenyu Yan
2003	J	`jnl`	Finding a central vertex in an HHD-free graph. Discret. Appl. Math. Victor Chepoi, Feodor F. Dragan
2003	J	`jnl`	On linear and circular structure of (claw, net)-free graphs. Discret. Appl. Math. Andreas Brandstädt, Feodor F. Dragan
2003	J	`jnl`	On the power of BFS to determine a graph's diameter. Networks Derek G. Corneil, Feodor F. Dragan, Ekkehard Köhler
2003	B	`conf`	Tree Spanners for Bipartite Graphs and Probe Interval Graphs. WG Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Van Bang Le, Ryuhei Uehara
2002	A*	`conf`	Center and diameter problems in plane triangulations and quadrangulations. SODA Victor Chepoi, Feodor F. Dragan, Yann Vaxès
2002	B	`conf`	New Graph Classes of Bounded Clique-Width. WG Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Raffaele Mosca
2002	—	`conf`	New Routing Schemes for Interval, Circular-Arc, and Permutation Graphs. IASTED PDCS Feodor F. Dragan, Irina Lomonosov
2002	B	`conf`	On the Power of BFS to Determine a Graphs Diameter. LATIN Derek G. Corneil, Feodor F. Dragan, Ekkehard Köhler
2002	J	`jnl`	Provably good global buffering by generalized multiterminalmulticommodity flow approximation. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. Feodor F. Dragan, Andrew B. Kahng, Ion I. Mandoiu, Sudhakar Muddu, Alexander Zelikovsky
2002	B	`conf`	Tree Spanners on Chordal Graphs: Complexity, Algorithms, Open Problems. ISAAC Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Van Bang Le
2001	J	`jnl`	Diameter determination on restricted graph families. Discret. Appl. Math. Derek G. Corneil, Feodor F. Dragan, Michel Habib, Christophe Paul
2001	B	`conf`	Estimating All Pairs Shortest Paths in Restricted Graph Families: A Unified Approach. WG Feodor F. Dragan
2001	B	`conf`	Practical Approximation Algorithms for Separable Packing Linear Programs. WADS Feodor F. Dragan, Andrew B. Kahng, Ion I. Mandoiu, Sudhakar Muddu, Alexander Zelikovsky
2001	—	`conf`	Provably good global buffering by multi-terminal multicommodity flow approximation. ASP-DAC Feodor F. Dragan, Andrew B. Kahng, Ion I. Mandoiu, Sudhakar Muddu, Alexander Zelikovsky
2000	J	`jnl`	A Note on Distance Approximating Trees in Graphs. Eur. J. Comb. Victor Chepoi, Feodor F. Dragan
2000	J	`jnl`	LexBFS-orderings of Distance-hereditary Graphs with Application to the Diametral Pair Problem. Discret. Appl. Math. Feodor F. Dragan, Falk Nicolai
2000	J	`jnl`	Linear Time Algorithms for Hamiltonian Problems on (Claw, Net)-Free Graphs. SIAM J. Comput. Andreas Brandstädt, Feodor F. Dragan, Ekkehard Köhler
2000	J	`jnl`	On stable cutsets in graphs. Discret. Appl. Math. Andreas Brandstädt, Feodor F. Dragan, Van Bang Le, Thomas Szymczak
2000	A	`conf`	Provably Good Global Buffering Using an Available Buffer Block Plan. ICCAD Feodor F. Dragan, Andrew B. Kahng, Ion I. Mandoiu, Sudhakar Muddu, Alexander Zelikovsky
2000	J	`jnl`	Strongly Orderable Graphs a Common Generalization of Strongly Chordal and Chordal Bipartite Graphs. Discret. Appl. Math. Feodor F. Dragan
1999	J	`jnl`	A note on distance approximating trees in graphs. Electron. Notes Discret. Math. Victor Chepoi, Feodor F. Dragan
1999	J	`jnl`	Almost Diameter of a House-hole-free Graph in Linear Time Via LexBFS. Discret. Appl. Math. Feodor F. Dragan
1999	J	`jnl`	Convexity and HHD-Free Graphs. SIAM J. Discret. Math. Feodor F. Dragan, Falk Nicolai, Andreas Brandstädt
1999	J	`jnl`	Distance Approximating Trees for Chordal and Dually Chordal Graphs. J. Algorithms Andreas Brandstädt, Victor Chepoi, Feodor F. Dragan
1999	J	`jnl`	Lexbfs-orderings and powers of hhd-free graphs. Int. J. Comput. Math. Feodor F. Dragan, Falk Nicolai
1999	B	`conf`	Linear Time Algorithms for Hamiltonian Problems on (Claw, Net)-Free Graphs. WG Andreas Brandstädt, Feodor F. Dragan, Ekkehard Köhler
1998	J	`jnl`	A linear-time algorithm for connected r-domination and Steiner tree on distance-hereditary graphs. Networks Andreas Brandstädt, Feodor F. Dragan
1998	B	`conf`	Diameter Determination on Restricted Graph Faminlies. WG Derek G. Corneil, Feodor F. Dragan, Michel Habib, Christophe Paul
1998	J	`jnl`	Dually Chordal Graphs. SIAM J. Discret. Math. Andreas Brandstädt, Feodor F. Dragan, Victor Chepoi, Vitaly I. Voloshin
1998	J	`jnl`	Powers of hhd-free graphs. Int. J. Comput. Math. Feodor F. Dragan, Falk Nicolai, Andreas Brandstädt
1998	J	`jnl`	The Algorithmic Use of Hypertree Structure and Maximum Neighbourhood Orderings. Discret. Appl. Math. Andreas Brandstädt, Victor Chepoi, Feodor F. Dragan
1997	J	`jnl`	Clique SIAM J. Discret. Math. Andreas Brandstädt, Victor Chepoi, Feodor F. Dragan
1997	A	`conf`	Distance Approximating Trees for Chordal and Dually Chordal Graphs (Extended Abstract). ESA Andreas Brandstädt, Victor Chepoi, Feodor F. Dragan
1997	J	`jnl`	Homogeneously Orderable Graphs. Theor. Comput. Sci. Andreas Brandstädt, Feodor F. Dragan, Falk Nicolai
1997	J	`jnl`	LexBFS-orderings and powers of chordal graphs. Discret. Math. Andreas Brandstädt, Feodor F. Dragan, Falk Nicolai
1997	B	`conf`	On Greedy Matching Ordering and Greedy Matchable Graphs (Extended Abstract). WG Feodor F. Dragan
1997	J	`jnl`	r-domination problems on homogeneously orderable graphs. Networks Feodor F. Dragan, Falk Nicolai
1996	J	`jnl`	Incidence Graphs of Biacyclic Hypergraphs. Discret. Appl. Math. Feodor F. Dragan, Vitaly I. Voloshin
1996	B	`conf`	LexBFS-Orderings and Power of Graphs. WG Feodor F. Dragan, Falk Nicolai, Andreas Brandstädt
1996	J	`jnl`	Perfect elimination orderings of chordal powers of graphs. Discret. Math. Andreas Brandstädt, Victor Chepoi, Feodor F. Dragan
1996	J	`jnl`	r-Dominating cliques in graphs with hypertree structure. Discret. Math. Feodor F. Dragan, Andreas Brandstädt
1995	B	`conf`	Homogeneously Orderable Graphs and the Steiner Tree Problem. WG Andreas Brandstädt, Feodor F. Dragan, Falk Nicolai
1995	B	`conf`	On Condorcet and Median Points of Simple Rectilinear Polygons (Extended Abstract). FCT Victor Chepoi, Feodor F. Dragan
1995	B	`conf`	r-Domination Problems on Homogeneously Ordered Graphs (Extended Abstract). FCT Feodor F. Dragan, Falk Nicolai
1994	A	`conf`	A Linear-Time Algorithm for Finding a Central Vertex of a Chordal Graph. ESA Victor Chepoi, Feodor F. Dragan
1994	J	`jnl`	Computing a Median Point of a Simple Rectilinear Polygon. Inf. Process. Lett. Victor Chepoi, Feodor F. Dragan
1994	—	`conf`	Dominating Cliques in Distance-Hereditary Graphs. SWAT Feodor F. Dragan
1994	A	`conf`	Dominating Cliques in Graphs with Hypertree Structures. STACS Feodor F. Dragan, Andreas Brandstädt
1994	B	`conf`	The Algorithmic Use of Hypertree Structure and Maximum Neighbourhood Orderings. WG Andreas Brandstädt, Victor Chepoi, Feodor F. Dragan
1993	B	`conf`	Dually Chordal Graphs. WG Andreas Brandstädt, Feodor F. Dragan, Victor Chepoi, Vitaly I. Voloshin
1993	J	`jnl`	HT-graphs: centers, connected r-domination and Steiner trees. Comput. Sci. J. Moldova Feodor F. Dragan
1993	J	`jnl`	On link diameter of a simple rectilinear polygon. Comput. Sci. J. Moldova Victor Chepoi, Feodor F. Dragan