Feodor F. Dragan

	2012
98		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): 713-732 (2012)
97		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)
96		Victor Chepoi, Feodor F. Dragan, Ilan Newman, Yuri Rabinovich, Yann Vaxès: Constant Approximation Algorithms for Embedding Graph Metrics into Trees and Outerplanar Graphs. Discrete & Computational Geometry 47(1): 187-214 (2012)
	2011
95		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
94		Yang Xiang, Ruoming Jin, David Fuhry, Feodor F. Dragan: Summarizing transactional databases with overlapped hyperrectangles. Data Min. Knowl. Discov. 23(2): 215-251 (2011)
93		Feodor F. Dragan, Fedor V. Fomin, Petr A. Golovach: Spanners in sparse graphs. J. Comput. Syst. Sci. 77(6): 1108-1119 (2011)
92		Feodor F. Dragan, Martín Matamala: Navigating in a Graph by Aid of Its Spanning Tree Metric. SIAM J. Discrete Math. 25(1): 306-332 (2011)
91		Feodor F. Dragan, Fedor V. Fomin, Petr A. Golovach: Approximation of minimum weight spanners for sparse graphs. Theor. Comput. Sci. 412(8-10): 846-852 (2011)
	2010
90		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: 95-109
89		Arthur H. Busch, Feodor F. Dragan, R. Sritharan: New Min-Max Theorems for Weakly Chordal and Dually Chordal Graphs. COCOA (2) 2010: 207-218
88		Feodor F. Dragan, Chenyu Yan: Collective Tree Spanners in Graphs with Bounded Parameters. Algorithmica 57(1): 22-43 (2010)
87		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)
86		Feodor F. Dragan, Chenyu Yan: Network flow spanners. Networks 56(3): 159-168 (2010)
	2009
85		Feodor F. Dragan, Yang Xiang: How to Use Spanning Trees to Navigate in Graphs. MFCS 2009: 282-294
84		Chenyu Yan, Yang Xiang, Feodor F. Dragan: Compact and Low Delay Routing Labeling Scheme for Unit Disk Graphs. WADS 2009: 566-577
83		Feodor F. Dragan, Yang Xiang, Chenyu Yan: Collective Tree Spanners for Unit Disk Graphs with Applications. Electronic Notes in Discrete Mathematics 32: 117-124 (2009)
82		Yuri Breitbart, Feodor F. Dragan, Hassan Gobjuka: Effective Monitor Placement in Internet Networks. JNW 4(7): 657-666 (2009)
	2008
81		Feodor F. Dragan, Fedor V. Fomin, Petr A. Golovach: Spanners in Sparse Graphs. ICALP (1) 2008: 597-608
80		Ruoming Jin, Yang Xiang, David Fuhry, Feodor F. Dragan: Overlapping Matrix Pattern Visualization: A Hypergraph Approach. ICDM 2008: 313-322
79		Feodor F. Dragan, Martín Matamala: Navigating in a Graph by Aid of Its Spanning Tree. ISAAC 2008: 788-799
78		Yang Xiang, Ruoming Jin, David Fuhry, Feodor F. Dragan: Succinct summarization of transactional databases: an overlapped hyperrectangle scheme. KDD 2008: 758-766
77		Feodor F. Dragan, Chenyu Yan, Yang Xiang: Collective Additive Tree Spanners of Homogeneously Orderable Graphs. LATIN 2008: 555-567
76		Feodor F. Dragan, Fedor V. Fomin, Petr A. Golovach: A PTAS for the Sparsest Spanners Problem on Apex-Minor-Free Graphs. MFCS 2008: 290-298
75		Victor Chepoi, Feodor F. Dragan, Bertrand Estellon, Michel Habib, Yann Vaxès: Diameters, centers, and approximating trees of delta-hyperbolicgeodesic spaces and graphs. Symposium on Computational Geometry 2008: 59-68
74		Feodor F. Dragan, Derek G. Corneil, Ekkehard Köhler, Yang Xiang: Additive Spanners for Circle Graphs and Polygonal Graphs. WG 2008: 110-121
73		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. Electronic Notes in Discrete Mathematics 31: 231-234 (2008)
	2007
72		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): 27-51 (2007)
71		Feodor F. Dragan, Irina Lomonosov: On compact and efficient routing in certain graph classes. Discrete Applied Mathematics 155(11): 1458-1470 (2007)
70		Yon Dourisboure, Feodor F. Dragan, Cyril Gavoille, Chenyu Yan: Spanners for bounded tree-length graphs. Theor. Comput. Sci. 383(1): 34-44 (2007)
	2006
69		Feodor F. Dragan, Chenyu Yan: Distance Approximating Trees: Complexity and Algorithms. CIAC 2006: 260-271
68		Feodor F. Dragan, Chenyu Yan: Network Flow Spanners. LATIN 2006: 410-422
67		Andreas Brandstädt, Feodor F. Dragan, Yang Xiang, Chenyu Yan: Generalized Powers of Graphs and Their Algorithmic Use. SWAT 2006: 423-434
66		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)
65		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)
64		Feodor F. Dragan, Chenyu Yan, Irina Lomonosov: Collective tree spanners of graphs. SIAM J. Discrete Math. 20(1): 241-260 (2006)
63		Victor Chepoi, Feodor F. Dragan, Yann Vaxès: Addressing, distances and routing in triangular systems with applications in cellular networks. Wireless Networks 12(6): 671-679 (2006)
	2005
62		Feodor F. Dragan, Chenyu Yan: Collective Tree Spanners in Graphs with Bounded Genus, Chordality, Tree-Width, or Clique-Width. ISAAC 2005: 583-592
61		Victor Chepoi, Feodor F. Dragan, Yann Vaxès: Distance-Based Location Update and Routing in Irregular Cellular Networks. SNPD 2005: 380-387
60		Derek G. Corneil, Feodor F. Dragan, Ekkehard Köhler, Chenyu Yan: Collective Tree 1-Spanners for Interval Graphs. WG 2005: 151-162
59		Feodor F. Dragan: Estimating all pairs shortest paths in restricted graph families: a unified approach. J. Algorithms 57(1): 1-21 (2005)
58		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)
57		Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Raffaele Mosca: New Graph Classes of Bounded Clique-Width. Theory Comput. Syst. 38(5): 623-645 (2005)
	2004
56		Yuri Breitbart, Feodor F. Dragan, Hassan Gobjuka: Effective Network Monitoring. ICCCN 2004: 394-399
55		Victor Chepoi, Feodor F. Dragan, Yann Vaxès: Addressing, Distances and Routing in Triangular Systems with Applications in Cellular and Sensor Networks. IPDPS 2004
54		Feodor F. Dragan, Irina Lomonosov: On Compact and Efficient Routing in Certain Graph Classes. ISAAC 2004: 402-414
53		Feodor F. Dragan, Chenyu Yan, Irina Lomonosov: Collective Tree Spanners of Graphs. SWAT 2004: 64-76
52		Feodor F. Dragan, Chenyu Yan, Derek G. Corneil: Collective Tree Spanners and Routing in AT-free Related Graphs. WG 2004: 68-80
51		Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Van Bang Le: Tree spanners on chordal graphs: complexity and algorithms. Theor. Comput. Sci. 310(1-3): 329-354 (2004)
	2003
50		Victor Chepoi, Feodor F. Dragan, Chenyu Yan: Additive Spanners for k-Chordal Graphs. CIAC 2003: 96-107
49		Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Van Bang Le, Ryuhei Uehara: Tree Spanners for Bipartite Graphs and Probe Interval Graphs. WG 2003: 106-118
48		Andreas Brandstädt, Feodor F. Dragan: On linear and circular structure of (claw, net)-free graphs. Discrete Applied Mathematics 129(2-3): 285-303 (2003)
47		Victor Chepoi, Feodor F. Dragan: Finding a central vertex in an HHD-free graph. Discrete Applied Mathematics 131(1): 93-11 (2003)
46		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)
	2002
45		Feodor F. Dragan, Irina Lomonosov: New Routing Schemes for Interval, Circular-Arc, and Permutation Graphs. IASTED PDCS 2002: 78-83
44		Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Van Bang Le: Tree Spanners on Chordal Graphs: Complexity, Algorithms, Open Problems. ISAAC 2002: 163-174
43		Derek G. Corneil, Feodor F. Dragan, Ekkehard Köhler: On the Power of BFS to Determine a Graphs Diameter. LATIN 2002: 209-223
42		Victor Chepoi, Feodor F. Dragan, Yann Vaxès: Center and diameter problems in plane triangulations and quadrangulations. SODA 2002: 346-355
41		Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Raffaele Mosca: New Graph Classes of Bounded Clique-Width. WG 2002: 57-67
40		Feodor F. Dragan, Andrew B. Kahng, Ion I. Mandoiu, Sudhakar Muddu, Alexander Zelikovsky: Provably good global buffering by generalized multiterminalmulticommodity flow approximation. IEEE Trans. on CAD of Integrated Circuits and Systems 21(3): 263-274 (2002)
	2001
39		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
38		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
37		Feodor F. Dragan: Estimating All Pairs Shortest Paths in Restricted Graph Families: A Unified Approach. WG 2001: 103-116
36		Derek G. Corneil, Feodor F. Dragan, Michel Habib, Christophe Paul: Diameter determination on restricted graph families. Discrete Applied Mathematics 113(2-3): 143-166 (2001)
	2000
35		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
34		Andreas Brandstädt, Feodor F. Dragan, Van Bang Le, Thomas Szymczak: On stable cutsets in graphs. Discrete Applied Mathematics 105(1-3): 39-50 (2000)
33		Feodor F. Dragan, Falk Nicolai: LexBFS-orderings of Distance-hereditary Graphs with Application to the Diametral Pair Problem. Discrete Applied Mathematics 98(3): 191-207 (2000)
32		Feodor F. Dragan: Strongly Orderable Graphs a Common Generalization of Strongly Chordal and Chordal Bipartite Graphs. Discrete Applied Mathematics 99(1-3): 427-442 (2000)
31		Victor Chepoi, Feodor F. Dragan: A Note on Distance Approximating Trees in Graphs. Eur. J. Comb. 21(6): 761-766 (2000)
30		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)
	1999
29		Andreas Brandstädt, Feodor F. Dragan, Ekkehard Köhler: Linear Time Algorithms for Hamiltonian Problems on (Claw, Net)-Free Graphs. WG 1999: 364-376
28		Feodor F. Dragan: Almost Diameter of a House-hole-free Graph in Linear Time Via LexBFS. Discrete Applied Mathematics 95(1-3): 223-239 (1999)
27		Victor Chepoi, Feodor F. Dragan: A note on distance approximating trees in graphs. Electronic Notes in Discrete Mathematics 3: 39 (1999)
26		Feodor F. Dragan, Falk Nicolai: Lexbfs-orderings and powers of hhd-free graphs. Int. J. Comput. Math. 71(1): 35-56 (1999)
25		Andreas Brandstädt, Victor Chepoi, Feodor F. Dragan: Distance Approximating Trees for Chordal and Dually Chordal Graphs. J. Algorithms 30(1): 166-184 (1999)
24		Feodor F. Dragan, Falk Nicolai, Andreas Brandstädt: Convexity and HHD-Free Graphs. SIAM J. Discrete Math. 12(1): 119-135 (1999)
	1998
23		Derek G. Corneil, Feodor F. Dragan, Michel Habib, Christophe Paul: Diameter Determination on Restricted Graph Faminlies. WG 1998: 192-202
22		Andreas Brandstädt, Victor Chepoi, Feodor F. Dragan: The Algorithmic Use of Hypertree Structure and Maximum Neighbourhood Orderings. Discrete Applied Mathematics 82(1-3): 43-77 (1998)
21		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)
20		Andreas Brandstädt, Feodor F. Dragan, Victor Chepoi, Vitaly I. Voloshin: Dually Chordal Graphs. SIAM J. Discrete Math. 11(3): 437-455 (1998)
	1997
19		Andreas Brandstädt, Victor Chepoi, Feodor F. Dragan: Distance Approximating Trees for Chordal and Dually Chordal Graphs (Extended Abstract). ESA 1997: 78-91
18		Feodor F. Dragan: On Greedy Matching Ordering and Greedy Matchable Graphs (Extended Abstract). WG 1997: 184-198
17		Andreas Brandstädt, Feodor F. Dragan, Falk Nicolai: LexBFS-orderings and powers of chordal graphs. Discrete Mathematics 171(1-3): 27-42 (1997)
16		Feodor F. Dragan, Falk Nicolai: r-domination problems on homogeneously orderable graphs. Networks 30(2): 121-131 (1997)
15		Andreas Brandstädt, Victor Chepoi, Feodor F. Dragan: Clique r-Domination and Clique r-Packing Problems on Dually Chordal Graphs. SIAM J. Discrete Math. 10(1): 109-127 (1997)
14		Andreas Brandstädt, Feodor F. Dragan, Falk Nicolai: Homogeneously Orderable Graphs. Theor. Comput. Sci. 172(1-2): 209-232 (1997)
	1996
13		Feodor F. Dragan, Falk Nicolai, Andreas Brandstädt: LexBFS-Orderings and Power of Graphs. WG 1996: 166-180
12		Feodor F. Dragan, Vitaly I. Voloshin: Incidence Graphs of Biacyclic Hypergraphs. Discrete Applied Mathematics 68(3): 259-266 (1996)
11		Andreas Brandstädt, Victor Chepoi, Feodor F. Dragan: Perfect elimination orderings of chordal powers of graphs. Discrete Mathematics 158(1-3): 273-278 (1996)
10		Feodor F. Dragan, Andreas Brandstädt: r-Dominating cliques in graphs with hypertree structure. Discrete Mathematics 162(1-3): 93-108 (1996)
	1995
9		Victor Chepoi, Feodor F. Dragan: On Condorcet and Median Points of Simple Rectilinear Polygons (Extended Abstract). FCT 1995: 181-190
8		Feodor F. Dragan, Falk Nicolai: r-Domination Problems on Homogeneously Ordered Graphs (Extended Abstract). FCT 1995: 201-210
7		Andreas Brandstädt, Feodor F. Dragan, Falk Nicolai: Homogeneously Orderable Graphs and the Steiner Tree Problem. WG 1995: 381-395
	1994
6		Victor Chepoi, Feodor F. Dragan: A Linear-Time Algorithm for Finding a Central Vertex of a Chordal Graph. ESA 1994: 159-170
5		Feodor F. Dragan, Andreas Brandstädt: Dominating Cliques in Graphs with Hypertree Structures. STACS 1994: 735-746
4		Feodor F. Dragan: Dominating Cliques in Distance-Hereditary Graphs. SWAT 1994: 370-381
3		Andreas Brandstädt, Victor Chepoi, Feodor F. Dragan: The Algorithmic Use of Hypertree Structure and Maximum Neighbourhood Orderings. WG 1994: 65-80
2		Victor Chepoi, Feodor F. Dragan: Computing a Median Point of a Simple Rectilinear Polygon. Inf. Process. Lett. 49(6): 281-285 (1994)
	1993
1		Andreas Brandstädt, Feodor F. Dragan, Victor Chepoi, Vitaly I. Voloshin: Dually Chordal Graphs. WG 1993: 237-251

Coauthor Index

1	Andreas Brandstädt	[1] [3] [5] [7] [10] [11] [13] [14] [15] [17] [19] [20] [21] [22] [24] [25] [29] [30] [34] [41] [44] [48] [49] [51] [57] [67] [72]
2	Yuri Breitbart	[56] [82]
3	Arthur H. Busch	[89]
4	Victor Chepoi	[1] [2] [3] [6] [9] [11] [15] [19] [20] [22] [25] [27] [31] [42] [47] [50] [55] [58] [61] [63] [66] [73] [75] [87] [90] [96] [98]
5	Derek G. Corneil	[23] [36] [43] [46] [52] [60] [65] [74]
6	Yon Dourisboure	[70]
7	Bertrand Estellon	[73] [75] [98]
8	Fedor V. Fomin	[76] [81] [91] [93]
9	David Fuhry	[78] [80] [94]
10	Cyril Gavoille	[70]
11	Hassan Gobjuka	[56] [82]
12	Petr A. Golovach	[76] [81] [91] [93]
13	Michel Habib	[23] [36] [73] [75] [98]
14	Ruoming Jin	[78] [80] [94]
15	Andrew B. Kahng	[35] [38] [39] [40]
16	Ekkehard Köhler	[29] [30] [43] [46] [60] [74] [95]
17	Hoàng-Oanh Le	[41] [44] [49] [51] [57] [72]
18	Van Bang Le	[34] [44] [49] [51] [72]
19	Irina Lomonosov	[45] [53] [54] [64] [71]
20	Ion I. Mandoiu	[35] [38] [39] [40]
21	Martín Matamala	[79] [92]
22	Raffaele Mosca	[41] [57]
23	Sudhakar Muddu	[35] [38] [39] [40]
24	Ilan Newman	[87] [90] [96]
25	Falk Nicolai	[7] [8] [13] [14] [16] [17] [24] [26] [33]
26	Christophe Paul	[23] [36]
27	Yuri Rabinovich	[87] [90] [96]
28	R. Sritharan	[89]
29	Thomas Szymczak	[34]
30	Ryuhei Uehara	[49] [72]
31	Yann Vaxès	[42] [55] [61] [63] [66] [73] [75] [87] [90] [96] [98]
32	Vitaly I. Voloshin	[1] [12] [20]
33	Yang Xiang	[67] [74] [77] [78] [80] [83] [84] [85] [94] [97] [98]
34	Chenyu Yan	[50] [52] [53] [58] [60] [62] [64] [65] [67] [68] [69] [70] [77] [83] [84] [86] [88] [97]
35	Alexander Zelikovsky	[35] [38] [39] [40]

Colors in the list of coauthors

Last update Tue May 29 20:41:18 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page