The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Feodor F. Dragan: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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]
  2. Victor Chepoi, Feodor F. Dragan, Chenyu Yan
    Additive Spanners for k-Chordal Graphs. [Citation Graph (0, 0)][DBLP]
    CIAC, 2003, pp:96-107 [Conf]
  3. Feodor F. Dragan, Chenyu Yan
    Distance Approximating Trees: Complexity and Algorithms. [Citation Graph (0, 0)][DBLP]
    CIAC, 2006, pp:260-271 [Conf]
  4. 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]
  5. 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]
  6. 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]
  7. 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]
  8. 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]
  9. Yuri Breitbart, Feodor F. Dragan, Hassan Gobjuka
    Effective Network Monitoring. [Citation Graph (0, 0)][DBLP]
    ICCCN, 2004, pp:394-399 [Conf]
  10. 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]
  11. 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]
  12. 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]
  13. 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]
  14. Feodor F. Dragan, Chenyu Yan
    Network Flow Spanners. [Citation Graph (0, 0)][DBLP]
    LATIN, 2006, pp:410-422 [Conf]
  15. 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]
  16. 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]
  17. 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]
  18. 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]
  19. Feodor F. Dragan, Andreas Brandstädt
    Dominating Cliques in Graphs with Hypertree Structures. [Citation Graph (0, 0)][DBLP]
    STACS, 1994, pp:735-746 [Conf]
  20. 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]
  21. Feodor F. Dragan
    Dominating Cliques in Distance-Hereditary Graphs. [Citation Graph (0, 0)][DBLP]
    SWAT, 1994, pp:370-381 [Conf]
  22. Feodor F. Dragan, Chenyu Yan, Irina Lomonosov
    Collective Tree Spanners of Graphs. [Citation Graph (0, 0)][DBLP]
    SWAT, 2004, pp:64-76 [Conf]
  23. 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]
  24. 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]
  25. 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]
  26. 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]
  27. 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]
  28. 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]
  29. 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]
  30. 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]
  31. Feodor F. Dragan
    On Greedy Matching Ordering and Greedy Matchable Graphs (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    WG, 1997, pp:184-198 [Conf]
  32. 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]
  33. 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]
  34. 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]
  35. 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]
  36. 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]
  37. 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]
  38. 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]
  39. 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]
  40. 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]
  41. 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]
  42. 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]
  43. 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]
  44. 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]
  45. 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]
  46. 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]
  47. 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]
  48. 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]
  49. 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]
  50. 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]
  51. 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]
  52. 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]
  53. 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]
  54. 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]
  55. Andreas Brandstädt, Victor Chepoi, Feodor F. Dragan
    Clique r-Domination and Clique r-Packing Problems on Dually Chordal Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1997, v:10, n:1, pp:109-127 [Journal]
  56. 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]
  57. 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]
  58. 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]
  59. 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]
  60. 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]
  61. 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]
  62. 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]
  63. 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]
  64. 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]
  65. 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]
  66. 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]
  67. 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]
  68. 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]
  69. 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]

  70. Constant Approximation Algorithms for Embedding Graph Metrics into Trees and Outerplanar Graphs. [Citation Graph (, )][DBLP]


  71. Diameters, centers, and approximating trees of delta-hyperbolicgeodesic spaces and graphs. [Citation Graph (, )][DBLP]


  72. Spanners in Sparse Graphs. [Citation Graph (, )][DBLP]


  73. Overlapping Matrix Pattern Visualization: A Hypergraph Approach. [Citation Graph (, )][DBLP]


  74. Navigating in a Graph by Aid of Its Spanning Tree. [Citation Graph (, )][DBLP]


  75. Succinct summarization of transactional databases: an overlapped hyperrectangle scheme. [Citation Graph (, )][DBLP]


  76. Collective Additive Tree Spanners of Homogeneously Orderable Graphs. [Citation Graph (, )][DBLP]


  77. How to Use Spanning Trees to Navigate in Graphs. [Citation Graph (, )][DBLP]


  78. A PTAS for the Sparsest Spanners Problem on Apex-Minor-Free Graphs. [Citation Graph (, )][DBLP]


  79. Compact and Low Delay Routing Labeling Scheme for Unit Disk Graphs. [Citation Graph (, )][DBLP]


  80. Additive Spanners for Circle Graphs and Polygonal Graphs. [Citation Graph (, )][DBLP]


  81. Collective Tree Spanners in Graphs with Bounded Parameters. [Citation Graph (, )][DBLP]


  82. Constant approximation algorithms for embedding graph metrics into trees and outerplanar graphs [Citation Graph (, )][DBLP]


Search in 0.037secs, Finished in 0.043secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002