| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | 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  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Chenyu Yan, Yang Xiang, Feodor F. Dragan |
Compact and low delay routing labeling scheme for Unit Disk Graphs. |
Comput. Geom. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Feodor F. Dragan, Fedor V. Fomin, Petr A. Golovach |
Approximation of minimum weight spanners for sparse graphs. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Yang Xiang, Ruoming Jin, David Fuhry, Feodor F. Dragan |
Summarizing transactional databases with overlapped hyperrectangles. |
Data Min. Knowl. Discov. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Feodor F. Dragan, Martín Matamala |
Navigating in a Graph by Aid of Its Spanning Tree Metric. |
SIAM J. Discrete Math. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Feodor F. Dragan, Fedor V. Fomin, Petr A. Golovach |
Spanners in sparse graphs. |
J. Comput. Syst. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Feodor F. Dragan, Chenyu Yan |
Network flow spanners. |
Networks |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Feodor F. Dragan, Chenyu Yan |
Collective Tree Spanners in Graphs with Bounded Parameters. |
Algorithmica |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
2010 |
DBLP BibTeX RDF |
|
| 1 | Arthur H. Busch, Feodor F. Dragan, R. Sritharan |
New Min-Max Theorems for Weakly Chordal and Dually Chordal Graphs. |
COCOA |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Feodor F. Dragan, Yang Xiang, Chenyu Yan |
Collective Tree Spanners for Unit Disk Graphs with Applications. |
Electronic Notes in Discrete Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuri Breitbart, Feodor F. Dragan, Hassan Gobjuka |
Effective Monitor Placement in Internet Networks. |
JNW |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Feodor F. Dragan, Yang Xiang |
How to Use Spanning Trees to Navigate in Graphs. |
MFCS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Chenyu Yan, Yang Xiang, Feodor F. Dragan |
Compact and Low Delay Routing Labeling Scheme for Unit Disk Graphs. |
WADS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Feodor F. Dragan, Derek G. Corneil, Ekkehard Köhler, Yang Xiang |
Additive Spanners for Circle Graphs and Polygonal Graphs. |
WG |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Ruoming Jin, Yang Xiang, David Fuhry, Feodor F. Dragan |
Overlapping Matrix Pattern Visualization: A Hypergraph Approach. |
ICDM |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Feodor F. Dragan, Fedor V. Fomin, Petr A. Golovach |
Spanners in Sparse Graphs. |
ICALP |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Feodor F. Dragan, Fedor V. Fomin, Petr A. Golovach |
A PTAS for the Sparsest Spanners Problem on Apex-Minor-Free Graphs. |
MFCS |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Feodor F. Dragan, Chenyu Yan, Yang Xiang |
Collective Additive Tree Spanners of Homogeneously Orderable Graphs. |
LATIN |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
delta-hyperbolic space, diameter, center, radius |
| 1 | Feodor F. Dragan, Martín Matamala |
Navigating in a Graph by Aid of Its Spanning Tree. |
ISAAC |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Yang Xiang, Ruoming Jin, David Fuhry, Feodor F. Dragan |
Succinct summarization of transactional databases: an overlapped hyperrectangle scheme. |
KDD |
2008 |
DBLP DOI BibTeX RDF |
hyperrectangle, summarization, set cover, transactional databases |
| 1 | Yon Dourisboure, Feodor F. Dragan, Cyril Gavoille, Chenyu Yan |
Spanners for bounded tree-length graphs. |
Theor. Comput. Sci. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Feodor F. Dragan, Irina Lomonosov |
On compact and efficient routing in certain graph classes. |
Discrete Applied Mathematics |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Victor Chepoi, Feodor F. Dragan, Yann Vaxès |
Addressing, distances and routing in triangular systems with applications in cellular networks. |
Wireless Networks |
2006 |
DBLP DOI BibTeX RDF |
Triangular systems, Cell identification code, Cell distance, Routing, Cellular networks, Location management |
| 1 | Victor Chepoi, Feodor F. Dragan, Yann Vaxès |
Distance and routing labeling schemes for non-positively curved plane graphs. |
J. Algorithms |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Feodor F. Dragan, Chenyu Yan, Irina Lomonosov |
Collective tree spanners of graphs. |
SIAM J. Discrete Math. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Feodor F. Dragan, Chenyu Yan, Derek G. Corneil |
Collective Tree Spanners and Routing in AT-free Related Graphs. |
J. Graph Algorithms Appl. |
2006 |
DBLP BibTeX RDF |
|
| 1 | Feodor F. Dragan, Chenyu Yan |
Network Flow Spanners. |
LATIN |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Brandstädt, Feodor F. Dragan, Yang Xiang, Chenyu Yan |
Generalized Powers of Graphs and Their Algorithmic Use. |
SWAT |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Feodor F. Dragan, Chenyu Yan |
Distance Approximating Trees: Complexity and Algorithms. |
CIAC |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Victor Chepoi, Feodor F. Dragan, Chenyu Yan |
Additive sparse spanners for graphs with bounded length of largest induced cycle. |
Theor. Comput. Sci. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Feodor F. Dragan |
Estimating all pairs shortest paths in restricted graph families: a unified approach. |
J. Algorithms |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Raffaele Mosca |
New Graph Classes of Bounded Clique-Width. |
Theory Comput. Syst. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Derek G. Corneil, Feodor F. Dragan, Ekkehard Köhler, Chenyu Yan |
Collective Tree 1-Spanners for Interval Graphs. |
WG |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Victor Chepoi, Feodor F. Dragan, Yann Vaxès |
Distance-Based Location Update and Routing in Irregular Cellular Networks. |
SNPD |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Feodor F. Dragan, Chenyu Yan |
Collective Tree Spanners in Graphs with Bounded Genus, Chordality, Tree-Width, or Clique-Width. |
ISAAC |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Van Bang Le |
Tree spanners on chordal graphs: complexity and algorithms. |
Theor. Comput. Sci. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Feodor F. Dragan, Chenyu Yan, Derek G. Corneil |
Collective Tree Spanners and Routing in AT-free Related Graphs. |
WG |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Victor Chepoi, Feodor F. Dragan, Yann Vaxès |
Addressing, Distances and Routing in Triangular Systems with Applications in Cellular and Sensor Networks. |
IPDPS |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuri Breitbart, Feodor F. Dragan, Hassan Gobjuka |
Effective Network Monitoring. |
ICCCN |
2004 |
DBLP BibTeX RDF |
|
| 1 | Feodor F. Dragan, Chenyu Yan, Irina Lomonosov |
Collective Tree Spanners of Graphs. |
SWAT |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Feodor F. Dragan, Irina Lomonosov |
On Compact and Efficient Routing in Certain Graph Classes. |
ISAAC |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Derek G. Corneil, Feodor F. Dragan, Ekkehard Köhler |
On the power of BFS to determine a graph's diameter. |
Networks |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Brandstädt, Feodor F. Dragan |
On linear and circular structure of (claw, net)-free graphs. |
Discrete Applied Mathematics |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Victor Chepoi, Feodor F. Dragan |
Finding a central vertex in an HHD-free graph. |
Discrete Applied Mathematics |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
Chordal bipartite graph, Interval bigraph, Probe interval graph, Tree spanner, NP-completeness |
| 1 | Victor Chepoi, Feodor F. Dragan, Chenyu Yan |
Additive Spanners for k-Chordal Graphs. |
CIAC |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Raffaele Mosca |
New Graph Classes of Bounded Clique-Width. |
WG |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Victor Chepoi, Feodor F. Dragan, Yann Vaxès |
Center and diameter problems in plane triangulations and quadrangulations. |
SODA |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Derek G. Corneil, Feodor F. Dragan, Ekkehard Köhler |
On the Power of BFS to Determine a Graphs Diameter. |
LATIN |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Van Bang Le |
Tree Spanners on Chordal Graphs: Complexity, Algorithms, Open Problems. |
ISAAC |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Feodor F. Dragan, Irina Lomonosov |
New Routing Schemes for Interval, Circular-Arc, and Permutation Graphs. |
IASTED PDCS |
2002 |
DBLP BibTeX RDF |
|
| 1 | Derek G. Corneil, Feodor F. Dragan, Michel Habib, Christophe Paul |
Diameter determination on restricted graph families. |
Discrete Applied Mathematics |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Feodor F. Dragan |
Estimating All Pairs Shortest Paths in Restricted Graph Families: A Unified Approach. |
WG |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Feodor F. Dragan, Andrew B. Kahng, Ion I. Mandoiu, Sudhakar Muddu, Alexander Zelikovsky |
Practical Approximation Algorithms for Separable Packing Linear Programs. |
WADS |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Victor Chepoi, Feodor F. Dragan |
A Note on Distance Approximating Trees in Graphs. |
Eur. J. Comb. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Brandstädt, Feodor F. Dragan, Van Bang Le, Thomas Szymczak |
On stable cutsets in graphs. |
Discrete Applied Mathematics |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Feodor F. Dragan |
Strongly Orderable Graphs a Common Generalization of Strongly Chordal and Chordal Bipartite Graphs. |
Discrete Applied Mathematics |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Feodor F. Dragan, Falk Nicolai |
LexBFS-orderings of Distance-hereditary Graphs with Application to the Diametral Pair Problem. |
Discrete Applied Mathematics |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Brandstädt, Feodor F. Dragan, Ekkehard Köhler |
Linear Time Algorithms for Hamiltonian Problems on (Claw, Net)-Free Graphs. |
SIAM J. Comput. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP BibTeX RDF |
|
| 1 | Victor Chepoi, Feodor F. Dragan |
A note on distance approximating trees in graphs. |
Electronic Notes in Discrete Mathematics |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Brandstädt, Victor Chepoi, Feodor F. Dragan |
Distance Approximating Trees for Chordal and Dually Chordal Graphs. |
J. Algorithms |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Feodor F. Dragan, Falk Nicolai, Andreas Brandstädt |
Convexity and HHD-Free Graphs. |
SIAM J. Discrete Math. |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Feodor F. Dragan |
Almost Diameter of a House-hole-free Graph in Linear Time Via LexBFS. |
Discrete Applied Mathematics |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Feodor F. Dragan, Falk Nicolai |
Lexbfs-orderings and powers of hhd-free graphs. |
Int. J. Comput. Math. |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Brandstädt, Feodor F. Dragan, Ekkehard Köhler |
Linear Time Algorithms for Hamiltonian Problems on (Claw, Net)-Free Graphs. |
WG |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Brandstädt, Feodor F. Dragan |
A linear-time algorithm for connected r-domination and Steiner tree on distance-hereditary graphs. |
Networks |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Brandstädt, Feodor F. Dragan, Victor Chepoi, Vitaly I. Voloshin |
Dually Chordal Graphs. |
SIAM J. Discrete Math. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Brandstädt, Victor Chepoi, Feodor F. Dragan |
The Algorithmic Use of Hypertree Structure and Maximum Neighbourhood Orderings. |
Discrete Applied Mathematics |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Derek G. Corneil, Feodor F. Dragan, Michel Habib, Christophe Paul |
Diameter Determination on Restricted Graph Faminlies. |
WG |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Brandstädt, Feodor F. Dragan, Falk Nicolai |
Homogeneously Orderable Graphs. |
Theor. Comput. Sci. |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Brandstädt, Feodor F. Dragan, Falk Nicolai |
LexBFS-orderings and powers of chordal graphs. |
Discrete Mathematics |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Feodor F. Dragan, Falk Nicolai |
r-domination problems on homogeneously orderable graphs. |
Networks |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Brandstädt, Victor Chepoi, Feodor F. Dragan |
Clique r-Domination and Clique r-Packing Problems on Dually Chordal Graphs. |
SIAM J. Discrete Math. |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Feodor F. Dragan |
On Greedy Matching Ordering and Greedy Matchable Graphs (Extended Abstract). |
WG |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Brandstädt, Victor Chepoi, Feodor F. Dragan |
Distance Approximating Trees for Chordal and Dually Chordal Graphs (Extended Abstract). |
ESA |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Feodor F. Dragan, Andreas Brandstädt |
r-Dominating cliques in graphs with hypertree structure. |
Discrete Mathematics |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Brandstädt, Victor Chepoi, Feodor F. Dragan |
Perfect elimination orderings of chordal powers of graphs. |
Discrete Mathematics |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Feodor F. Dragan, Vitaly I. Voloshin |
Incidence Graphs of Biacyclic Hypergraphs. |
Discrete Applied Mathematics |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Feodor F. Dragan, Falk Nicolai, Andreas Brandstädt |
LexBFS-Orderings and Power of Graphs. |
WG |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Brandstädt, Feodor F. Dragan, Falk Nicolai |
Homogeneously Orderable Graphs and the Steiner Tree Problem. |
WG |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Feodor F. Dragan, Falk Nicolai |
r-Domination Problems on Homogeneously Ordered Graphs (Extended Abstract). |
FCT |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Victor Chepoi, Feodor F. Dragan |
On Condorcet and Median Points of Simple Rectilinear Polygons (Extended Abstract). |
FCT |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Victor Chepoi, Feodor F. Dragan |
Computing a Median Point of a Simple Rectilinear Polygon. |
Inf. Process. Lett. |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Brandstädt, Victor Chepoi, Feodor F. Dragan |
The Algorithmic Use of Hypertree Structure and Maximum Neighbourhood Orderings. |
WG |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Victor Chepoi, Feodor F. Dragan |
A Linear-Time Algorithm for Finding a Central Vertex of a Chordal Graph. |
ESA |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Feodor F. Dragan, Andreas Brandstädt |
Dominating Cliques in Graphs with Hypertree Structures. |
STACS |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Feodor F. Dragan |
Dominating Cliques in Distance-Hereditary Graphs. |
SWAT |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Brandstädt, Feodor F. Dragan, Victor Chepoi, Vitaly I. Voloshin |
Dually Chordal Graphs. |
WG |
1993 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")