default search action
Feodor F. Dragan
Person information
- affiliation: Kent State University, Ohio, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j74]Feodor F. Dragan, Guillaume Ducoffe:
α i-Metric Graphs: Radius, Diameter and all Eccentricities. Algorithmica 86(7): 2092-2129 (2024) - [i21]Feodor F. Dragan, Guillaume Ducoffe:
ɑi-Metric Graphs: Hyperbolicity. CoRR abs/2404.14792 (2024) - 2023
- [c65]Feodor F. Dragan, Guillaume Ducoffe:
α i-Metric Graphs: Radius, Diameter and all Eccentricities. WG 2023: 276-290 - [i20]Feodor F. Dragan, Guillaume Ducoffe:
αi-Metric Graphs: Radius, Diameter and all Eccentricities. CoRR abs/2305.02545 (2023) - 2022
- [j73]Heather M. Guarnera
, Feodor F. Dragan, Arne Leitert:
Injective Hulls of Various Graph Classes. Graphs Comb. 38(4): 112 (2022) - 2021
- [j72]Jérémie Chalopin, Victor Chepoi
Fast Approximation and Exact Computation of Negative Curvature Parameters of Graphs. Discret. Comput. Geom. 65(3): 856-892 (2021) - [j71]Guillaume Ducoffe
A story of diameter, radius, and (almost) Helly property. Networks 77(3): 435-453 (2021) - [j70]Feodor F. Dragan, Heather M. Guarnera
Helly-gap of a graph and vertex eccentricities. Theor. Comput. Sci. 867: 68-84 (2021) - [c64]Abdulhakeem Othman Mohammed, Feodor F. Dragan, Heather M. Guarnera
Fellow Travelers Phenomenon Present in Real-World Networks. COMPLEX NETWORKS 2021: 194-206 - [c63]Feodor F. Dragan, Guillaume Ducoffe, Heather M. Guarnera
Fast Deterministic Algorithms for Computing All Eccentricities in (Hyperbolic) Helly Graphs. WADS 2021: 300-314 - [i19]Feodor F. Dragan, Guillaume Ducoffe, Heather M. Guarnera:
Fast deterministic algorithms for computing all eccentricities in (hyperbolic) Helly graphs. CoRR abs/2102.08349 (2021) - 2020
- [j69]Feodor F. Dragan:
An eccentricity 2-approximating spanning tree of a chordal graph is computable in linear time. Inf. Process. Lett. 154 (2020) - [j68]Feodor F. Dragan, Heather M. Guarnera
Eccentricity terrain of δ-hyperbolic graphs. J. Comput. Syst. Sci. 112: 50-65 (2020) - [j67]Feodor F. Dragan, Heather M. Guarnera
Eccentricity function in distance-hereditary graphs. Theor. Comput. Sci. 833: 26-40 (2020) - [c62]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: 11:1-11:13 - [i18]Feodor F. Dragan, Heather M. Guarnera:
Eccentricity terrain of δ-hyperbolic graphs. CoRR abs/2002.08495 (2020) - [i17]Feodor F. Dragan, Heather M. Guarnera:
Helly-gap of a graph and vertex eccentricities. CoRR abs/2005.01921 (2020) - [i16]Heather M. Guarnera, Feodor F. Dragan, Arne Leitert:
Injective hulls of various graph classes. CoRR abs/2007.14377 (2020)
2010 – 2019
- 2019
- [j66]Feodor F. Dragan, Heather M. Guarnera
Obstructions to a small hyperbolicity in Helly graphs. Discret. Math. 342(2): 326-338 (2019) - [j65]Feodor F. Dragan, Abdulhakeem Mohammed:
Slimness of graphs. Discret. Math. Theor. Comput. Sci. 21(3) (2019) - [j64]Victor Chepoi
Fast approximation of eccentricities and distances in hyperbolic graphs. J. Graph Algorithms Appl. 23(2): 393-433 (2019) - [j63]Arne Leitert, Feodor F. Dragan:
Parameterized approximation algorithms for some location problems in graphs. Theor. Comput. Sci. 755: 48-64 (2019) - [i15]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 abs/1906.12018 (2019) - [i14]Feodor F. Dragan, Heather M. Guarnera:
Eccentricity function in distance-hereditary graphs. CoRR abs/1907.05445 (2019) - [i13]Feodor F. Dragan, Guillaume Ducoffe:
A story of diameter, radius and Helly property. CoRR abs/1910.10412 (2019) - 2018
- [c61]Victor Chepoi, Feodor F. Dragan, Michel Habib, Yann Vaxès, Hend Alrasheed
Fast Approximation of Centrality and Distances in Hyperbolic Graphs. COCOA 2018: 3-18 - [c60]Jérémie Chalopin, Victor Chepoi
Fast Approximation and Exact Computation of Negative Curvature Parameters of Graphs. SoCG 2018: 22:1-22:15 - [i12]Feodor F. Dragan, Michel Habib
Revisiting Radius, Diameter, and all Eccentricity Computation in Graphs through Certificates. CoRR abs/1803.04660 (2018) - [i11]Jérémie Chalopin, Victor Chepoi
Fast approximation and exact computation of negative curvature parameters of graphs. CoRR abs/1803.06324 (2018) - [i10]Victor Chepoi, Feodor F. Dragan, Michel Habib, Yann Vaxès, Hend Al-Rasheed:
Fast approximation of centrality and distances in hyperbolic graphs. CoRR abs/1805.07232 (2018) - 2017
- [j62]Feodor F. Dragan, Ekkehard Köhler, Arne Leitert:
Line-Distortion, Bandwidth and Path-Length of a Graph. Algorithmica 77(3): 686-713 (2017) - [j61]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: 1 (2017) - [j60]Feodor F. Dragan, Ekkehard Köhler, Hend Alrasheed
Eccentricity approximating trees. Discret. Appl. Math. 232: 142-156 (2017) - [j59]Feodor F. Dragan, Arne Leitert:
On the minimum eccentricity shortest path problem. Theor. Comput. Sci. 694: 66-78 (2017) - [c59]Arne Leitert, Feodor F. Dragan:
Parameterized Approximation Algorithms for Some Location Problems in Graphs. COCOA (2) 2017: 348-361 - [c58]Victor Chepoi
Core congestion is inherent in hyperbolic networks. SODA 2017: 2264-2279 - [i9]Feodor F. Dragan, Abdulhakeem Mohammed:
Slimness of graphs. CoRR abs/1705.09797 (2017) - [i8]Arne Leitert, Feodor F. Dragan:
Parameterized Approximation Algorithms for some Location Problems in Graphs. CoRR abs/1706.07475 (2017) - [i7]Feodor F. Dragan, Heather M. Guarnera:
Obstructions to a small hyperbolicity in Helly graphs. CoRR abs/1709.02837 (2017) - 2016
- [j58]Feodor F. Dragan, Arne Leitert:
Minimum Eccentricity Shortest Paths in some Structured Graph Classes. J. Graph Algorithms Appl. 20(2): 299-322 (2016) - [j57]Muad Abu-Ata, Feodor F. Dragan:
Metric tree-like structures in real-world networks: an empirical study. Networks 67(1): 49-68 (2016) - [c57]Arne Leitert, Feodor F. Dragan:
On Strong Tree-Breadth. COCOA 2016: 62-76 - [c56]Hend Alrasheed
The Network of Genetic Admixture in Humans. CompleNet 2016: 243-256 - [c55]Feodor F. Dragan, Ekkehard Köhler, Hend Alrasheed
Eccentricity Approximating Trees - Extended Abstract. WG 2016: 145-157 - [i6]Victor Chepoi
Core congestion is inherent in hyperbolic networks. CoRR abs/1605.03059 (2016) - 2015
- [c54]Hend Alrasheed
Core-Periphery Models for Graphs Based on their δ-Hyperbolicity: An Example Using Biological Networks. CompleNet 2015: 65-77 - [c53]Feodor F. Dragan, Arne Leitert:
On the Minimum Eccentricity Shortest Path Problem. WADS 2015: 276-288 - [c52]Feodor F. Dragan, Arne Leitert:
Minimum Eccentricity Shortest Paths in Some Structured Graph Classes. WG 2015: 189-202 - [i5]Feodor F. Dragan, Arne Leitert:
Minimum Eccentricity Shortest Paths in some Structured Graph Classes. CoRR abs/1511.05109 (2015) - 2014
- [j56]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): 884-905 (2014) - [j55]Feodor F. Dragan, Muad Abu-Ata:
Collective additive tree spanners of bounded tree-breadth graphs with generalizations and consequences. Theor. Comput. Sci. 547: 1-17 (2014) - [c51]Feodor F. Dragan, Ekkehard Köhler, Arne Leitert:
Line-Distortion, Bandwidth and Path-Length of a Graph. SWAT 2014: 158-169 - [i4]Muad Abu-Ata, Feodor F. Dragan:
Metric tree-like structures in real-life networks: an empirical study. CoRR abs/1402.3364 (2014) - [i3]Feodor F. Dragan, Ekkehard Köhler, Arne Leitert:
Line-distortion, Bandwidth and Path-length of a graph. CoRR abs/1409.8389 (2014) - 2013
- [j54]Feodor F. Dragan, Yang Xiang:
How to Use Spanning Trees to Navigate in Graphs. Algorithmica 66(3): 479-511 (2013) - [c50]Feodor F. Dragan, Muad Abu-Ata:
Collective Additive Tree Spanners of Bounded Tree-Breadth Graphs with Generalizations and Consequences. SOFSEM 2013: 194-206 - [c49]Feodor F. Dragan:
Tree-Like Structures in Graphs: A Metric Point of View. WG 2013: 1-4 - 2012
- [j53]Victor Chepoi
Additive Spanners and Distance and Routing Labeling Schemes for Hyperbolic Graphs. Algorithmica 62(3-4): 713-732 (2012) - [j52]Chenyu Yan, Yang Xiang, Feodor F. Dragan:
Compact and low delay routing labeling scheme for Unit Disk Graphs. Comput. Geom. 45(7): 305-325 (2012) - [j51]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): 1717-1729 (2012) - [j50]Victor Chepoi
Constant Approximation Algorithms for Embedding Graph Metrics into Trees and Outerplanar Graphs. Discret. Comput. Geom. 47(1): 187-214 (2012) - [i2]Feodor F. Dragan, Muad Abu-Ata:
Collective Additive Tree Spanners of Bounded Tree-Breadth Graphs with Generalizations and Consequences. CoRR abs/1207.2506 (2012) - 2011
- [j49]Yang Xiang, Ruoming Jin, David Fuhry, Feodor F. Dragan:
Summarizing transactional databases with overlapped hyperrectangles. Data Min. Knowl. Discov. 23(2): 215-251 (2011) - [j48]Feodor F. Dragan, Fedor V. Fomin
Spanners in sparse graphs. J. Comput. Syst. Sci. 77(6): 1108-1119 (2011) - [j47]Feodor F. Dragan, Martín Matamala
Navigating in a Graph by Aid of Its Spanning Tree Metric. SIAM J. Discret. Math. 25(1): 306-332 (2011) - [j46]Feodor F. Dragan, Fedor V. Fomin
Approximation of minimum weight spanners for sparse graphs. Theor. Comput. Sci. 412(8-10): 846-852 (2011) - [c48]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: 171-183 - 2010
- [j45]Feodor F. Dragan, Chenyu Yan:
Collective Tree Spanners in Graphs with Bounded Parameters. Algorithmica 57(1): 22-43 (2010) - [j44]Feodor F. Dragan, Chenyu Yan:
Network flow spanners. Networks 56(3): 159-168 (2010) - [c47]Victor Chepoi
Constant Approximation Algorithms for Embedding Graph Metrics into Trees and Outerplanar Graphs. APPROX-RANDOM 2010: 95-109 - [c46]Arthur H. Busch, Feodor F. Dragan, R. Sritharan:
New Min-Max Theorems for Weakly Chordal and Dually Chordal Graphs. COCOA (2) 2010: 207-218 - [i1]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 abs/1007.0489 (2010)
2000 – 2009
- 2009
- [j43]Feodor F. Dragan, Yang Xiang, Chenyu Yan:
Collective Tree Spanners for Unit Disk Graphs with Applications. Electron. Notes Discret. Math. 32: 117-124 (2009) - [j42]Yuri Breitbart, Feodor F. Dragan, Hassan Gobjuka:
Effective Monitor Placement in Internet Networks. J. Networks 4(7): 657-666 (2009) - [c45]Feodor F. Dragan, Yang Xiang:
How to Use Spanning Trees to Navigate in Graphs. MFCS 2009: 282-294 - [c44]Chenyu Yan, Yang Xiang, Feodor F. Dragan:
Compact and Low Delay Routing Labeling Scheme for Unit Disk Graphs. WADS 2009: 566-577 - 2008
- [j41]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: 231-234 (2008) - [c43]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: 59-68 - [c42]Feodor F. Dragan, Fedor V. Fomin
Spanners in Sparse Graphs. ICALP (1) 2008: 597-608 - [c41]Ruoming Jin, Yang Xiang, David Fuhry, Feodor F. Dragan:
Overlapping Matrix Pattern Visualization: A Hypergraph Approach. ICDM 2008: 313-322 - [c40]Feodor F. Dragan, Martín Matamala
Navigating in a Graph by Aid of Its Spanning Tree. ISAAC 2008: 788-799 - [c39]Yang Xiang, Ruoming Jin, David Fuhry, Feodor F. Dragan:
Succinct summarization of transactional databases: an overlapped hyperrectangle scheme. KDD 2008: 758-766 - [c38]Feodor F. Dragan, Chenyu Yan, Yang Xiang:
Collective Additive Tree Spanners of Homogeneously Orderable Graphs. LATIN 2008: 555-567 - [c37]Feodor F. Dragan, Fedor V. Fomin
A PTAS for the Sparsest Spanners Problem on Apex-Minor-Free Graphs. MFCS 2008: 290-298 - [c36]Feodor F. Dragan, Derek G. Corneil, Ekkehard Köhler, Yang Xiang:
Additive Spanners for Circle Graphs and Polygonal Graphs. WG 2008: 110-121 - 2007
- [j40]Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le
Tree Spanners for Bipartite Graphs and Probe Interval Graphs. Algorithmica 47(1): 27-51 (2007) - [j39]Feodor F. Dragan, Irina Lomonosov:
On compact and efficient routing in certain graph classes. Discret. Appl. Math. 155(11): 1458-1470 (2007) - [j38]Yon Dourisboure, Feodor F. Dragan, Cyril Gavoille, Chenyu Yan:
Spanners for bounded tree-length graphs. Theor. Comput. Sci. 383(1): 34-44 (2007) - 2006
- [j37]Victor Chepoi, Feodor F. Dragan, Yann Vaxès:
Distance and routing labeling schemes for non-positively curved plane graphs. J. Algorithms 61(2): 60-88 (2006) - [j36]Feodor F. Dragan, Chenyu Yan, Derek G. Corneil:
Collective Tree Spanners and Routing in AT-free Related Graphs. J. Graph Algorithms Appl. 10(2): 97-122 (2006) - [j35]Feodor F. Dragan, Chenyu Yan, Irina Lomonosov:
Collective tree spanners of graphs. SIAM J. Discret. Math. 20(1): 241-260 (2006) - [j34]Victor Chepoi, Feodor F. Dragan, Yann Vaxès:
Addressing, distances and routing in triangular systems with applications in cellular networks. Wirel. Networks 12(6): 671-679 (2006) - [c35]Feodor F. Dragan, Chenyu Yan:
Distance Approximating Trees: Complexity and Algorithms. CIAC 2006: 260-271 - [c34]Feodor F. Dragan, Chenyu Yan:
Network Flow Spanners. LATIN 2006: 410-422 - [c33]Andreas Brandstädt, Feodor F. Dragan, Yang Xiang, Chenyu Yan:
Generalized Powers of Graphs and Their Algorithmic Use. SWAT 2006: 423-434 - 2005
- [j33]Feodor F. Dragan:
Estimating all pairs shortest paths in restricted graph families: a unified approach. J. Algorithms 57(1): 1-21 (2005) - [j32]Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le
New Graph Classes of Bounded Clique-Width. Theory Comput. Syst. 38(5): 623-645 (2005) - [j31]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): 54-75 (2005) - [c32]Feodor F. Dragan, Chenyu Yan:
Collective Tree Spanners in Graphs with Bounded Genus, Chordality, Tree-Width, or Clique-Width. ISAAC 2005: 583-592 - [c31]Victor Chepoi, Feodor F. Dragan, Yann Vaxès:
Distance-Based Location Update and Routing in Irregular Cellular Networks. SNPD 2005: 380-387 - [c30]Derek G. Corneil, Feodor F. Dragan, Ekkehard Köhler, Chenyu Yan:
Collective Tree 1-Spanners for Interval Graphs. WG 2005: 151-162 - 2004
- [j30]Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le
Tree spanners on chordal graphs: complexity and algorithms. Theor. Comput. Sci. 310(1-3): 329-354 (2004) - [c29]Yuri Breitbart, Feodor F. Dragan, Hassan Gobjuka:
Effective Network Monitoring. ICCCN 2004: 394-399 - [c28]Victor Chepoi, Feodor F. Dragan, Yann Vaxès:
Addressing, Distances and Routing in Triangular Systems with Applications in Cellular and Sensor Networks. IPDPS 2004 - [c27]Feodor F. Dragan, Irina Lomonosov:
On Compact and Efficient Routing in Certain Graph Classes. ISAAC 2004: 402-414 - [c26]Feodor F. Dragan, Chenyu Yan, Irina Lomonosov:
Collective Tree Spanners of Graphs. SWAT 2004: 64-76 - [c25]Feodor F. Dragan, Chenyu Yan, Derek G. Corneil:
Collective Tree Spanners and Routing in AT-free Related Graphs. WG 2004: 68-80 - 2003
- [j29]Andreas Brandstädt, Feodor F. Dragan:
On linear and circular structure of (claw, net)-free graphs. Discret. Appl. Math. 129(2-3): 285-303 (2003) - [j28]Victor Chepoi, Feodor F. Dragan:
Finding a central vertex in an HHD-free graph. Discret. Appl. Math. 131(1): 93-11 (2003) - [j27]Derek G. Corneil, Feodor F. Dragan, Ekkehard Köhler:
On the power of BFS to determine a graph's diameter. Networks 42(4): 209-222 (2003) - [c24]Victor Chepoi, Feodor F. Dragan, Chenyu Yan:
Additive Spanners for k-Chordal Graphs. CIAC 2003: 96-107 - [c23]Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le
Tree Spanners for Bipartite Graphs and Probe Interval Graphs. WG 2003: 106-118 - 2002
- [j26]Feodor F. Dragan, Andrew B. Kahng, Ion I. Mandoiu
Provably good global buffering by generalized multiterminalmulticommodity flow approximation. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 21(3): 263-274 (2002) - [c22]Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le
Tree Spanners on Chordal Graphs: Complexity, Algorithms, Open Problems. ISAAC 2002: 163-174 - [c21]Derek G. Corneil, Feodor F. Dragan, Ekkehard Köhler:
On the Power of BFS to Determine a Graphs Diameter. LATIN 2002: 209-223 - [c20]Feodor F. Dragan, Irina Lomonosov:
New Routing Schemes for Interval, Circular-Arc, and Permutation Graphs. IASTED PDCS 2002: 78-83 - [c19]Victor Chepoi, Feodor F. Dragan, Yann Vaxès:
Center and diameter problems in plane triangulations and quadrangulations. SODA 2002: 346-355 - [c18]Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le
New Graph Classes of Bounded Clique-Width. WG 2002: 57-67 - 2001
- [j25]Derek G. Corneil, Feodor F. Dragan, Michel Habib
Diameter determination on restricted graph families. Discret. Appl. Math. 113(2-3): 143-166 (2001) - [c17]Feodor F. Dragan, Andrew B. Kahng, Ion I. Mandoiu, Sudhakar Muddu, Alexander Zelikovsky
Provably good global buffering by multi-terminal multicommodity flow approximation. ASP-DAC 2001: 120-125 - [c16]Feodor F. Dragan, Andrew B. Kahng, Ion I. Mandoiu, Sudhakar Muddu, Alexander Zelikovsky
Practical Approximation Algorithms for Separable Packing Linear Programs. WADS 2001: 325-337 - [c15]Feodor F. Dragan:
Estimating All Pairs Shortest Paths in Restricted Graph Families: A Unified Approach. WG 2001: 103-116 - 2000
- [j24]Feodor F. Dragan, Falk Nicolai:
LexBFS-orderings of Distance-hereditary Graphs with Application to the Diametral Pair Problem. Discret. Appl. Math. 98(3): 191-207 (2000) - [j23]Feodor F. Dragan:
Strongly Orderable Graphs a Common Generalization of Strongly Chordal and Chordal Bipartite Graphs. Discret. Appl. Math. 99(1-3): 427-442 (2000) - [j22]Andreas Brandstädt, Feodor F. Dragan, Van Bang Le, Thomas Szymczak:
On stable cutsets in graphs. Discret. Appl. Math. 105(1-3): 39-50 (2000) - [j21]Victor Chepoi, Feodor F. Dragan:
A Note on Distance Approximating Trees in Graphs. Eur. J. Comb. 21(6): 761-766 (2000) - [j20]Andreas Brandstädt, Feodor F. Dragan, Ekkehard Köhler:
Linear Time Algorithms for Hamiltonian Problems on (Claw, Net)-Free Graphs. SIAM J. Comput. 30(5): 1662-1677 (2000) - [c14]Feodor F. Dragan, Andrew B. Kahng, Ion I. Mandoiu, Sudhakar Muddu, Alexander Zelikovsky
Provably Good Global Buffering Using an Available Buffer Block Plan. ICCAD 2000: 104-109
1990 – 1999
- 1999
- [j19]Feodor F. Dragan:
Almost Diameter of a House-hole-free Graph in Linear Time Via LexBFS. Discret. Appl. Math. 95(1-3): 223-239 (1999) - [j18]Victor Chepoi, Feodor F. Dragan:
A note on distance approximating trees in graphs. Electron. Notes Discret. Math. 3: 39 (1999) - [j17]Feodor F. Dragan, Falk Nicolai:
Lexbfs-orderings and powers of hhd-free graphs. Int. J. Comput. Math. 71(1): 35-56 (1999) - [j16]Andreas Brandstädt, Victor Chepoi, Feodor F. Dragan:
Distance Approximating Trees for Chordal and Dually Chordal Graphs. J. Algorithms 30(1): 166-184 (1999) - [j15]Feodor F. Dragan, Falk Nicolai, Andreas Brandstädt:
Convexity and HHD-Free Graphs. SIAM J. Discret. Math. 12(1): 119-135 (1999) - [c13]Andreas Brandstädt, Feodor F. Dragan, Ekkehard Köhler:
Linear Time Algorithms for Hamiltonian Problems on (Claw, Net)-Free Graphs. WG 1999: 364-376 - 1998
- [j14]Andreas Brandstädt, Victor Chepoi, Feodor F. Dragan:
The Algorithmic Use of Hypertree Structure and Maximum Neighbourhood Orderings. Discret. Appl. Math. 82(1-3): 43-77 (1998) - [j13]Feodor F. Dragan, Falk Nicolai, Andreas Brandstädt:
Powers of hhd-free graphs. Int. J. Comput. Math. 69(3-4): 217-242 (1998) - [j12]Andreas Brandstädt, Feodor F. Dragan:
A linear-time algorithm for connected r-domination and Steiner tree on distance-hereditary graphs. Networks 31(3): 177-182 (1998) - [j11]Andreas Brandstädt, Feodor F. Dragan, Victor Chepoi, Vitaly I. Voloshin:
Dually Chordal Graphs. SIAM J. Discret. Math. 11(3): 437-455 (1998) - [c12]Derek G. Corneil, Feodor F. Dragan, Michel Habib, Christophe Paul:
Diameter Determination on Restricted Graph Faminlies. WG 1998: 192-202 - 1997
- [j10]Andreas Brandstädt, Feodor F. Dragan, Falk Nicolai:
LexBFS-orderings and powers of chordal graphs. Discret. Math. 171(1-3): 27-42 (1997) - [j9]Feodor F. Dragan, Falk Nicolai:
r-domination problems on homogeneously orderable graphs. Networks 30(2): 121-131 (1997) - [j8]Andreas Brandstädt, Victor Chepoi, Feodor F. Dragan:
Clique r-Domination and Clique r-Packing Problems on Dually Chordal Graphs. SIAM J. Discret. Math. 10(1): 109-127 (1997) - [j7]Andreas Brandstädt, Feodor F. Dragan, Falk Nicolai:
Homogeneously Orderable Graphs. Theor. Comput. Sci. 172(1-2): 209-232 (1997) - [c11]Andreas Brandstädt, Victor Chepoi, Feodor F. Dragan:
Distance Approximating Trees for Chordal and Dually Chordal Graphs (Extended Abstract). ESA 1997: 78-91 - [c10]Feodor F. Dragan:
On Greedy Matching Ordering and Greedy Matchable Graphs (Extended Abstract). WG 1997: 184-198 - 1996
- [j6]Feodor F. Dragan, Vitaly I. Voloshin:
Incidence Graphs of Biacyclic Hypergraphs. Discret. Appl. Math. 68(3): 259-266 (1996) - [j5]Andreas Brandstädt, Victor Chepoi, Feodor F. Dragan:
Perfect elimination orderings of chordal powers of graphs. Discret. Math. 158(1-3): 273-278 (1996) - [j4]Feodor F. Dragan, Andreas Brandstädt:
r-Dominating cliques in graphs with hypertree structure. Discret. Math. 162(1-3): 93-108 (1996) - [c9]Feodor F. Dragan, Falk Nicolai, Andreas Brandstädt:
LexBFS-Orderings and Power of Graphs. WG 1996: 166-180 - 1995
- [c8]Victor Chepoi, Feodor F. Dragan:
On Condorcet and Median Points of Simple Rectilinear Polygons (Extended Abstract). FCT 1995: 181-190 - [c7]Feodor F. Dragan, Falk Nicolai:
r-Domination Problems on Homogeneously Ordered Graphs (Extended Abstract). FCT 1995: 201-210 - [c6]Andreas Brandstädt, Feodor F. Dragan, Falk Nicolai:
Homogeneously Orderable Graphs and the Steiner Tree Problem. WG 1995: 381-395 - 1994
- [j3]Victor Chepoi, Feodor F. Dragan:
Computing a Median Point of a Simple Rectilinear Polygon. Inf. Process. Lett. 49(6): 281-285 (1994) - [c5]Victor Chepoi, Feodor F. Dragan:
A Linear-Time Algorithm for Finding a Central Vertex of a Chordal Graph. ESA 1994: 159-170 - [c4]Feodor F. Dragan, Andreas Brandstädt:
Dominating Cliques in Graphs with Hypertree Structures. STACS 1994: 735-746 - [c3]Feodor F. Dragan:
Dominating Cliques in Distance-Hereditary Graphs. SWAT 1994: 370-381 - [c2]Andreas Brandstädt, Victor Chepoi, Feodor F. Dragan:
The Algorithmic Use of Hypertree Structure and Maximum Neighbourhood Orderings. WG 1994: 65-80 - 1993
- [j2]Feodor F. Dragan:
HT-graphs: centers, connected r-domination and Steiner trees. Comput. Sci. J. Moldova 1(2): 64-83 (1993) - [j1]Victor Chepoi, Feodor F. Dragan:
On link diameter of a simple rectilinear polygon. Comput. Sci. J. Moldova 1(3): 62-74 (1993) - [c1]Andreas Brandstädt, Feodor F. Dragan, Victor Chepoi, Vitaly I. Voloshin:
Dually Chordal Graphs. WG 1993: 237-251
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: