Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="Dragan, Feodor"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Collective additive tree spanners of bounded tree-breadth graphs with generalizations and consequences
Feodor F. Dragan
,
Muad Abu-Ata
Theoretical Computer Science
547
, 2014, pp. 1-17
Line-distortion, bandwidth and path-length of a graph
Feodor F. Dragan
,
Ekkehard Köhler
,
Arne Leitert
Lecture Notes in Computer Science
8503
, 2014, pp. 158-169
An approximation algorithm for the tree
t
-spanner problem on unweighted graphs via generalized chordal graphs
Feodor F. Dragan
,
Ekkehard Köhler
Algorithmica
69
(4), 2014, pp. 884-905
How to use spanning trees to navigate in graphs
Feodor F. Dragan
,
Yang Xiang
Algorithmica
66
(3), 2013, pp. 479-511
Tree-like structures in graphs: A metric point of view
Feodor F. Dragan
Lecture Notes in Computer Science
8165
, 2013, pp. 1-4
Additive spanners and distance and routing labeling schemes for hyperbolic graphs
Victor Chepoi
,
Feodor F. Dragan
,
Bertrand Estellon
,
Michel Habib
,
Yann Vax`es
,
Yang Xiang
Algorithmica
62
(3-4), 2012, pp. 713-732
Spanners in sparse graphs
Feodor F. Dragan
,
Fedor V. Fomin
,
Petr A. Golovach
Journal of Computer and System Sciences
77
(6), 2011, pp. 1108-1119
Approximation of minimum weight spanners for sparse graphs
Feodor F. Dragan
,
Fedor V. Fomin
,
Petr A. Golovach
Theoretical Computer Science
412
(8-10), 2011, pp. 846-852
Collective tree spanners in graphs with bounded parameters
Feodor F. Dragan
,
Chenyu Yan
Algorithmica
57
(1), 2010, pp. 22-43
Network flow spanners
Feodor F. Dragan
,
Chenyu Yan
Networks
56
(3), 2010, pp. 159-168
How to use spanning trees to navigate in graphs
Feodor F. Dragan
,
Yang Xiang
Lecture Notes in Computer Science
5734
, 2009, pp. 282-294
Compact and low delay routing labeling scheme for unit disk graphs
Chenyu Yan
,
Yang Xiang
,
Feodor F. Dragan
Lecture Notes in Computer Science
5664
, 2009, pp. 566-577
Additive spanners for circle graphs and polygonal graphs
Feodor F. Dragan
,
Derek G. Corneil
,
Ekkehard Köhler
,
Yang Xiang
Lecture Notes in Computer Science
5344
, 2008, pp. 110-121
Spanners in sparse graphs
Feodor F. Dragan
,
Fedor V. Fomin
,
Petr A. Golovach
Lecture Notes in Computer Science
5125
, 2008, pp. 597-608
A PTAS for the Sparsest Spanners problem on apex-minor-free graphs
Feodor F. Dragan
,
Fedor V. Fomin
,
Petr A. Golovach
Lecture Notes in Computer Science
5162
, 2008, pp. 290-298
Navigating in a graph by aid of its spanning tree
Feodor F. Dragan
,
Martin Matamala
Lecture Notes in Computer Science
5369
, 2008, pp. 788-799
Tree spanners for bipartite graphs and probe interval graphs
Andreas Brandstädt
,
Feodor F. Dragan
,
Hoang-Oanh Le
,
Van Bang Le
,
Ryuhei Uehara
Algorithmica
47
(1), 2007, pp. 27-51
Spanners for bounded tree-length graphs
Yon Dourisboure
,
Feodor F. Dragan
,
Cyril Gavoille
,
Chenyu Yan
Theoretical Computer Science
383
(1), 2007, pp. 34-44
Generalized powers of graphs and their algorithmic use
Andreas Brandstädt
,
Feodor F. Dragan
,
Yang Xiang
,
Chenyu Yan
Lecture Notes in Computer Science
4059
, 2006, pp. 423-434
Distance and routing labeling schemes for non-positively curved plane graphs
Victor Chepoi
,
Feodor F. Dragan
,
Yann Vaxès
Journal of Algorithms
61
(2), 2006, pp. 60-88
Collective tree spanners of graphs
Feodor F. Dragan
,
Chenyu Yan
,
Irina Lomonosov
SIAM Journal on Discrete Mathematics
20
(1), 2006, pp. 240-260
Distance approximating trees: Complexity and algorithms
Feodor F. Dragan
,
Chenyu Yan
Lecture Notes in Computer Science
3998
, 2006, pp. 260-271
New graph classes of bounded clique-width
Andreas Brandstädt
,
Feodor F. Dragan
,
Hoàng-Oanh Le
,
Raffaele Mosca
Theory of Computing Systems
38
(5), 2005, pp. 623-645
Additive sparse spanners for graphs with bounded length of largest induced cycle
Victor D. Chepoi
,
Feodor F. Dragan
,
Chenyu Yan
Theoretical Computer Science
347
(1-2), 2005, pp. 54-75
Collective tree 1-spanners for interval graphs
Derek G. Corneil
,
Feodor F. Dragan
,
Ekkehard Köhler
,
Chenyu Yan
Lecture Notes in Computer Science
3787
, 2005, pp. 151-162
Seiten 1
2
3
>