The SCEAS System
| |||||||

## Search the dblp DataBase
Feodor F. Dragan:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Feodor F. Dragan, Andrew B. Kahng, Ion I. Mandoiu, Sudhakar Muddu, Alexander Zelikovsky
**Provably good global buffering by multi-terminal multicommodity flow approximation.**[Citation Graph (0, 0)][DBLP] ASP-DAC, 2001, pp:120-125 [Conf] - Victor Chepoi, Feodor F. Dragan, Chenyu Yan
**Additive Spanners for k-Chordal Graphs.**[Citation Graph (0, 0)][DBLP] CIAC, 2003, pp:96-107 [Conf] - Feodor F. Dragan, Chenyu Yan
**Distance Approximating Trees: Complexity and Algorithms.**[Citation Graph (0, 0)][DBLP] CIAC, 2006, pp:260-271 [Conf] - Andreas Brandstädt, Victor Chepoi, Feodor F. Dragan
**Distance Approximating Trees for Chordal and Dually Chordal Graphs (Extended Abstract).**[Citation Graph (0, 0)][DBLP] ESA, 1997, pp:78-91 [Conf] - Victor Chepoi, Feodor F. Dragan
**A Linear-Time Algorithm for Finding a Central Vertex of a Chordal Graph.**[Citation Graph (0, 0)][DBLP] ESA, 1994, pp:159-170 [Conf] - Victor Chepoi, Feodor F. Dragan
**On Condorcet and Median Points of Simple Rectilinear Polygons (Extended Abstract).**[Citation Graph (0, 0)][DBLP] FCT, 1995, pp:181-190 [Conf] - Feodor F. Dragan, Falk Nicolai
**r-Domination Problems on Homogeneously Ordered Graphs (Extended Abstract).**[Citation Graph (0, 0)][DBLP] FCT, 1995, pp:201-210 [Conf] - Feodor F. Dragan, Andrew B. Kahng, Ion I. Mandoiu, Sudhakar Muddu, Alexander Zelikovsky
**Provably Good Global Buffering Using an Available Buffer Block Plan.**[Citation Graph (0, 0)][DBLP] ICCAD, 2000, pp:104-109 [Conf] - Yuri Breitbart, Feodor F. Dragan, Hassan Gobjuka
**Effective Network Monitoring.**[Citation Graph (0, 0)][DBLP] ICCCN, 2004, pp:394-399 [Conf] - Victor Chepoi, Feodor F. Dragan, Yann Vaxès
**Addressing, Distances and Routing in Triangular Systems with Applications in Cellular and Sensor Networks.**[Citation Graph (0, 0)][DBLP] IPDPS, 2004, pp:- [Conf] - Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Van Bang Le
**Tree Spanners on Chordal Graphs: Complexity, Algorithms, Open Problems.**[Citation Graph (0, 0)][DBLP] ISAAC, 2002, pp:163-174 [Conf] - Feodor F. Dragan, Irina Lomonosov
**On Compact and Efficient Routing in Certain Graph Classes.**[Citation Graph (0, 0)][DBLP] ISAAC, 2004, pp:402-414 [Conf] - Feodor F. Dragan, Chenyu Yan
**Collective Tree Spanners in Graphs with Bounded Genus, Chordality, Tree-Width, or Clique-Width.**[Citation Graph (0, 0)][DBLP] ISAAC, 2005, pp:583-592 [Conf] - Feodor F. Dragan, Chenyu Yan
**Network Flow Spanners.**[Citation Graph (0, 0)][DBLP] LATIN, 2006, pp:410-422 [Conf] - Derek G. Corneil, Feodor F. Dragan, Ekkehard Köhler
**On the Power of BFS to Determine a Graphs Diameter.**[Citation Graph (0, 0)][DBLP] LATIN, 2002, pp:209-223 [Conf] - Feodor F. Dragan, Irina Lomonosov
**New Routing Schemes for Interval, Circular-Arc, and Permutation Graphs.**[Citation Graph (0, 0)][DBLP] IASTED PDCS, 2002, pp:78-83 [Conf] - Victor Chepoi, Feodor F. Dragan, Yann Vaxès
**Distance-Based Location Update and Routing in Irregular Cellular Networks.**[Citation Graph (0, 0)][DBLP] SNPD, 2005, pp:380-387 [Conf] - Victor Chepoi, Feodor F. Dragan, Yann Vaxès
**Center and diameter problems in plane triangulations and quadrangulations.**[Citation Graph (0, 0)][DBLP] SODA, 2002, pp:346-355 [Conf] - Feodor F. Dragan, Andreas Brandstädt
**Dominating Cliques in Graphs with Hypertree Structures.**[Citation Graph (0, 0)][DBLP] STACS, 1994, pp:735-746 [Conf] - Andreas Brandstädt, Feodor F. Dragan, Yang Xiang, Chenyu Yan
**Generalized Powers of Graphs and Their Algorithmic Use.**[Citation Graph (0, 0)][DBLP] SWAT, 2006, pp:423-434 [Conf] - Feodor F. Dragan
**Dominating Cliques in Distance-Hereditary Graphs.**[Citation Graph (0, 0)][DBLP] SWAT, 1994, pp:370-381 [Conf] - Feodor F. Dragan, Chenyu Yan, Irina Lomonosov
**Collective Tree Spanners of Graphs.**[Citation Graph (0, 0)][DBLP] SWAT, 2004, pp:64-76 [Conf] - Feodor F. Dragan, Andrew B. Kahng, Ion I. Mandoiu, Sudhakar Muddu, Alexander Zelikovsky
**Practical Approximation Algorithms for Separable Packing Linear Programs.**[Citation Graph (0, 0)][DBLP] WADS, 2001, pp:325-337 [Conf] - Andreas Brandstädt, Feodor F. Dragan, Victor Chepoi, Vitaly I. Voloshin
**Dually Chordal Graphs.**[Citation Graph (0, 0)][DBLP] WG, 1993, pp:237-251 [Conf] - Andreas Brandstädt, Victor Chepoi, Feodor F. Dragan
**The Algorithmic Use of Hypertree Structure and Maximum Neighbourhood Orderings.**[Citation Graph (0, 0)][DBLP] WG, 1994, pp:65-80 [Conf] - Andreas Brandstädt, Feodor F. Dragan, Ekkehard Köhler
**Linear Time Algorithms for Hamiltonian Problems on (Claw, Net)-Free Graphs.**[Citation Graph (0, 0)][DBLP] WG, 1999, pp:364-376 [Conf] - Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Van Bang Le, Ryuhei Uehara
**Tree Spanners for Bipartite Graphs and Probe Interval Graphs.**[Citation Graph (0, 0)][DBLP] WG, 2003, pp:106-118 [Conf] - Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Raffaele Mosca
**New Graph Classes of Bounded Clique-Width.**[Citation Graph (0, 0)][DBLP] WG, 2002, pp:57-67 [Conf] - Andreas Brandstädt, Feodor F. Dragan, Falk Nicolai
**Homogeneously Orderable Graphs and the Steiner Tree Problem.**[Citation Graph (0, 0)][DBLP] WG, 1995, pp:381-395 [Conf] - Feodor F. Dragan
**Estimating All Pairs Shortest Paths in Restricted Graph Families: A Unified Approach.**[Citation Graph (0, 0)][DBLP] WG, 2001, pp:103-116 [Conf] - Feodor F. Dragan
**On Greedy Matching Ordering and Greedy Matchable Graphs (Extended Abstract).**[Citation Graph (0, 0)][DBLP] WG, 1997, pp:184-198 [Conf] - Feodor F. Dragan, Falk Nicolai, Andreas Brandstädt
**LexBFS-Orderings and Power of Graphs.**[Citation Graph (0, 0)][DBLP] WG, 1996, pp:166-180 [Conf] - Feodor F. Dragan, Chenyu Yan, Derek G. Corneil
**Collective Tree Spanners and Routing in AT-free Related Graphs.**[Citation Graph (0, 0)][DBLP] WG, 2004, pp:68-80 [Conf] - Derek G. Corneil, Feodor F. Dragan, Michel Habib, Christophe Paul
**Diameter Determination on Restricted Graph Faminlies.**[Citation Graph (0, 0)][DBLP] WG, 1998, pp:192-202 [Conf] - Derek G. Corneil, Feodor F. Dragan, Ekkehard Köhler, Chenyu Yan
**Collective Tree 1-Spanners for Interval Graphs.**[Citation Graph (0, 0)][DBLP] WG, 2005, pp:151-162 [Conf] - Andreas Brandstädt, Victor Chepoi, Feodor F. Dragan
**The Algorithmic Use of Hypertree Structure and Maximum Neighbourhood Orderings.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1998, v:82, n:1-3, pp:43-77 [Journal] - Andreas Brandstädt, Feodor F. Dragan
**On linear and circular structure of (claw, net)-free graphs.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2003, v:129, n:2-3, pp:285-303 [Journal] - Andreas Brandstädt, Feodor F. Dragan, Van Bang Le, Thomas Szymczak
**On stable cutsets in graphs.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2000, v:105, n:1-3, pp:39-50 [Journal] - Victor Chepoi, Feodor F. Dragan
**Finding a central vertex in an HHD-free graph.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2003, v:131, n:1, pp:93-11 [Journal] - Derek G. Corneil, Feodor F. Dragan, Michel Habib, Christophe Paul
**Diameter determination on restricted graph families.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2001, v:113, n:2-3, pp:143-166 [Journal] - Feodor F. Dragan
**Strongly Orderable Graphs a Common Generalization of Strongly Chordal and Chordal Bipartite Graphs.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2000, v:99, n:1-3, pp:427-442 [Journal] - Feodor F. Dragan
**Almost Diameter of a House-hole-free Graph in Linear Time Via LexBFS.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1999, v:95, n:1-3, pp:223-239 [Journal] - Feodor F. Dragan, Falk Nicolai
**LexBFS-orderings of Distance-hereditary Graphs with Application to the Diametral Pair Problem.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2000, v:98, n:3, pp:191-207 [Journal] - Feodor F. Dragan, Vitaly I. Voloshin
**Incidence Graphs of Biacyclic Hypergraphs.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1996, v:68, n:3, pp:259-266 [Journal] - Victor Chepoi, Feodor F. Dragan
**A Note on Distance Approximating Trees in Graphs.**[Citation Graph (0, 0)][DBLP] Eur. J. Comb., 2000, v:21, n:6, pp:761-766 [Journal] - Victor Chepoi, Feodor F. Dragan
**Computing a Median Point of a Simple Rectilinear Polygon.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1994, v:49, n:6, pp:281-285 [Journal] - Andreas Brandstädt, Victor Chepoi, Feodor F. Dragan
**Distance Approximating Trees for Chordal and Dually Chordal Graphs.**[Citation Graph (0, 0)][DBLP] J. Algorithms, 1999, v:30, n:1, pp:166-184 [Journal] - Feodor F. Dragan
**Estimating all pairs shortest paths in restricted graph families: a unified approach.**[Citation Graph (0, 0)][DBLP] J. Algorithms, 2005, v:57, n:1, pp:1-21 [Journal] - Victor Chepoi, Feodor F. Dragan, Yann Vaxès
**Distance and routing labeling schemes for non-positively curved plane graphs.**[Citation Graph (0, 0)][DBLP] J. Algorithms, 2006, v:61, n:2, pp:60-88 [Journal] - Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Raffaele Mosca
**New Graph Classes of Bounded Clique-Width.**[Citation Graph (0, 0)][DBLP] Theory Comput. Syst., 2005, v:38, n:5, pp:623-645 [Journal] - Andreas Brandstädt, Feodor F. Dragan
**A linear-time algorithm for connected r-domination and Steiner tree on distance-hereditary graphs.**[Citation Graph (0, 0)][DBLP] Networks, 1998, v:31, n:3, pp:177-182 [Journal] - Derek G. Corneil, Feodor F. Dragan, Ekkehard Köhler
**On the power of BFS to determine a graph's diameter.**[Citation Graph (0, 0)][DBLP] Networks, 2003, v:42, n:4, pp:209-222 [Journal] - Feodor F. Dragan, Falk Nicolai
**r-domination problems on homogeneously orderable graphs.**[Citation Graph (0, 0)][DBLP] Networks, 1997, v:30, n:2, pp:121-131 [Journal] - Andreas Brandstädt, Feodor F. Dragan, Ekkehard Köhler
**Linear Time Algorithms for Hamiltonian Problems on (Claw, Net)-Free Graphs.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2000, v:30, n:5, pp:1662-1677 [Journal] - Andreas Brandstädt, Victor Chepoi, Feodor F. Dragan
**Clique**[Citation Graph (0, 0)][DBLP]*r*-Domination and Clique*r*-Packing Problems on Dually Chordal Graphs. SIAM J. Discrete Math., 1997, v:10, n:1, pp:109-127 [Journal] - Andreas Brandstädt, Feodor F. Dragan, Victor Chepoi, Vitaly I. Voloshin
**Dually Chordal Graphs.**[Citation Graph (0, 0)][DBLP] SIAM J. Discrete Math., 1998, v:11, n:3, pp:437-455 [Journal] - Feodor F. Dragan, Falk Nicolai, Andreas Brandstädt
**Convexity and HHD-Free Graphs.**[Citation Graph (0, 0)][DBLP] SIAM J. Discrete Math., 1999, v:12, n:1, pp:119-135 [Journal] - Feodor F. Dragan, Chenyu Yan, Irina Lomonosov
**Collective tree spanners of graphs.**[Citation Graph (0, 0)][DBLP] SIAM J. Discrete Math., 2006, v:20, n:1, pp:241-260 [Journal] - Feodor F. Dragan, Andrew B. Kahng, Ion I. Mandoiu, Sudhakar Muddu, Alexander Zelikovsky
**Provably good global buffering by generalized multiterminalmulticommodity flow approximation.**[Citation Graph (0, 0)][DBLP] IEEE Trans. on CAD of Integrated Circuits and Systems, 2002, v:21, n:3, pp:263-274 [Journal] - Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Van Bang Le
**Tree spanners on chordal graphs: complexity and algorithms.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2004, v:310, n:1-3, pp:329-354 [Journal] - Andreas Brandstädt, Feodor F. Dragan, Falk Nicolai
**Homogeneously Orderable Graphs.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1997, v:172, n:1-2, pp:209-232 [Journal] - Victor Chepoi, Feodor F. Dragan, Chenyu Yan
**Additive sparse spanners for graphs with bounded length of largest induced cycle.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2005, v:347, n:1-2, pp:54-75 [Journal] - Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Van Bang Le, Ryuhei Uehara
**Tree Spanners for Bipartite Graphs and Probe Interval Graphs.**[Citation Graph (0, 0)][DBLP] Algorithmica, 2007, v:47, n:1, pp:27-51 [Journal] - Feodor F. Dragan, Irina Lomonosov
**On compact and efficient routing in certain graph classes.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2007, v:155, n:11, pp:1458-1470 [Journal] - Andreas Brandstädt, Feodor F. Dragan, Falk Nicolai
**LexBFS-orderings and powers of chordal graphs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1997, v:171, n:1-3, pp:27-42 [Journal] - Feodor F. Dragan, Andreas Brandstädt
**r-Dominating cliques in graphs with hypertree structure.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1996, v:162, n:1-3, pp:93-108 [Journal] - Andreas Brandstädt, Victor Chepoi, Feodor F. Dragan
**Perfect elimination orderings of chordal powers of graphs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1996, v:158, n:1-3, pp:273-278 [Journal] - Yon Dourisboure, Feodor F. Dragan, Cyril Gavoille, Chenyu Yan
**Spanners for bounded tree-length graphs.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2007, v:383, n:1, pp:34-44 [Journal] - Victor Chepoi, Feodor F. Dragan, Yann Vaxès
**Addressing, distances and routing in triangular systems with applications in cellular networks.**[Citation Graph (0, 0)][DBLP] Wireless Networks, 2006, v:12, n:6, pp:671-679 [Journal] **Constant Approximation Algorithms for Embedding Graph Metrics into Trees and Outerplanar Graphs.**[Citation Graph (, )][DBLP]**Diameters, centers, and approximating trees of delta-hyperbolicgeodesic spaces and graphs.**[Citation Graph (, )][DBLP]**Spanners in Sparse Graphs.**[Citation Graph (, )][DBLP]**Overlapping Matrix Pattern Visualization: A Hypergraph Approach.**[Citation Graph (, )][DBLP]**Navigating in a Graph by Aid of Its Spanning Tree.**[Citation Graph (, )][DBLP]**Succinct summarization of transactional databases: an overlapped hyperrectangle scheme.**[Citation Graph (, )][DBLP]**Collective Additive Tree Spanners of Homogeneously Orderable Graphs.**[Citation Graph (, )][DBLP]**How to Use Spanning Trees to Navigate in Graphs.**[Citation Graph (, )][DBLP]**A PTAS for the Sparsest Spanners Problem on Apex-Minor-Free Graphs.**[Citation Graph (, )][DBLP]**Compact and Low Delay Routing Labeling Scheme for Unit Disk Graphs.**[Citation Graph (, )][DBLP]**Additive Spanners for Circle Graphs and Polygonal Graphs.**[Citation Graph (, )][DBLP]**Collective Tree Spanners in Graphs with Bounded Parameters.**[Citation Graph (, )][DBLP]**Constant approximation algorithms for embedding graph metrics into trees and outerplanar graphs**[Citation Graph (, )][DBLP]
Search in 0.037secs, Finished in 0.043secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |