Feodor F. Dragan's Almost Complete List of Publications

(Complete list contains more than 120 items) 

some earlier papers on-line

more recent papers on-line

 


See also DBLP: List of publications via the DBLP site and Description: http://www.cs.kent.edu/%7Edragan/publ_files/image003.jpgLinks to publications via Google Scholar (search also for FF Dragan or F Dragan)


My h-index is 22, my i10-index is 53, my Erdős number is 3 (e.g., Feodor F. Dragan to Vitaly I. Voloshin to Zsolt Tuza, to Paul Erdős) and the total number of citations of my papers is more than 1450.


In Journals

16+ articles are published in premium journals; 26+ articles are published in leading journals; 3+ articles are published in reputable journals. Former Soviet Union journals are not ranked.

 

Algorithmica, Journal of Algorithms, SIAM Journal on Computing, Journal of Computer and System Sciences, Discrete & Computational Geometry are premium journals in Algorithms and Theory area.

Journal of Graph Algorithms and Applications, Theoretical Computer Science, Computational Geometry: Theory and Applications are leading journals in Algorithms and Theory area.

Networks, Wireless Networks are leading journals in System Technology area.

SIAM Journal on Discrete Mathematics is a premium journal in General Computer Science area.

Information Processing Letters, Discrete Applied Mathematics, Discrete Mathematics are leading journals in General Computer Science area.

IEEE Trans on CAD of Integrated Circuits & Systems is a premium journal in Software Technology area.

International Journal of Computer Mathematics is a reputable journal in Software Technology area.

Data Mining and Knowledge Discovery is a premium journal in Databases area.

  1. An Approximation Algorithm for the Tree t-Spanner Problem on Unweighted Graphs via Generalized Chordal Graphs
    Feodor F. Dragan, Ekkehard Koehler
    Algorithmica (in print 2013)
  2. How to use spanning trees to navigate in graphs
    F.F. Dragan and Y. Xiang
    Algorithmica 66(3): 479-511 (2013)
  3. Constant Approximation Algorithms for Embedding Graph Metrics into Trees and Outerplanar Graphs
    V.D. Chepoi, F.F. Dragan, I. Newman, Y. Rabinovich and Y. Vaxes
    Discrete & Computational Geometry 47(1): 187-214 (2012)
  4. Compact and Low Delay Routing Labeling Scheme for Unit Disk Graphs
    C. Yan, Y. Xiang and F.F. Dragan
    Computational Geometry: Theory and Applications 45(7): 305-325 (2012) (one of the TOP25 Hottest Articles within Computational Geometry for 2012 Full Year).
  5. Additive Spanners for Circle Graphs and Polygonal Graphs
    F.F. Dragan, D.G. Corneil, E. Koehler and Y. Xiang
    Discrete Applied Mathematics 160(12): 1717-1729 (2012)
  6. Additive Spanners and Distance and Routing Labeling Schemes for δ-Hyperbolic Graphs
    V.D. Chepoi, F.F. Dragan, B. Estellon, M. Habib, Y. Vaxes and Y. Xiang
    Algorithmica, 62(3-4): 713-732 (2012)
  7. Spanners in sparse graphs
    F.F. Dragan, F. Fomin and P. Golovach
    Journal of Computer and System Sciences, 77 (2011), 1108-1119
  8. Summarizing transactional databases with overlapped hyperrectangles: theories and algorithms
    Y. Xiang, R. Jin, D. Fuhry, F.F. Dragan
    Data Min Knowl Disc., 23(2): 215-251 (2011)
  9. Navigating in a graph by aid of its spanning tree
    F.F. Dragan and M. Matamala
    SIAM J. Discrete Math., 25(1): 306-332 (2011)
  10. Approximation of Minimum Weight Spanners for Sparse Graphs
    F.F. Dragan, F. Fomin and P. Golovach
    Theoretical Computer Science, 412(8-10): 846-852 (2011)
  11. Network Flow Spanners
    F.F. Dragan and C. Yan
    Networks 56 (2010), 159-168.
  12. Collective Tree Spanners in Graphs with Bounded Parameters.
    F.F. Dragan and C. Yan
    Algorithmica 57 (2010), 22-43.
  13. Effective Monitor Placement in Internet Networks
    Y. Breitbart , F.F. Dragan, H. Gobjuka
    Journal of Networks, 4 (2009), 657-666.
  14. Collective Tree Spanners for Unit Disk Graphs with Applications
    F.F. Dragan, Y. Xiang and C. Yan
    Electronic Notes in Discrete Mathematics 32 (2009) 117-124.
  15. Notes on diameters, centers, and approximating trees of delta-hyperbolic geodesic spaces and graphs
    V.D. Chepoi, F.F. Dragan, B. Estellon, M. Habib and Y. Vaxes
    Electronic Notes in Discrete Mathematics 31 (2008), 231-234. Special volume devoted to the International Conference on Topological and Geometric Graph Theory (TGGT 2008).
  16. On Compact and Efficient Routing in Certain Graph Classes
    F.F. Dragan, I. Lomonosov
    Discrete Applied Mathematics 155 (2007), 1458-1470.
  17. Spanners for bounded tree-length graphs
    Y. Dourisboure, F.F. Dragan, C. Gavoille, and C. Yan
    Theoretical. Computer Science 383 (2007),   34-44.
  18. Tree spanners for bipartite graphs and probe interval graphs
    A. Brandstaedt, Dragan F.F., H.-O. Le, V.B. Le and R. Uehara
    Algorithmica 47 (2007), 27-51.
  19. Collective Tree Spanners and Routing in AT-free Related Graphs
    F.F. Dragan, C. Yan and D.G. Corneil
    Journal of Graph Algorithms and Applications, Vol. 10, no. 2, 2006, 97-122.
  20. Addressing, distances and routing in triangular systems with applications in cellular networks
    V.D. Chepoi, F.F. Dragan, Y. Vaxes
    Wireless Networks 12 (2006), 671-679. The special issue "Best papers of the 4th Workshop on Algorithms for Wireless, Mobile, Ad Hoc and Sensor Networks (WMAN 2004)".
  21. Distance and routing labeling schemes for non-positively curved plane graphs
    V.D. Chepoi, F.F. Dragan, Y. Vaxes
    Journal of Algorithms 61 (2006), 60-88. (one of the TOP25 Hottest Articles within the Journal of Algorithms for Jan-Mar 2008, Jul-Sep 2007, Apr-June 2007, Jan-Mar 2007, Oct-Dec 2006)
  22. Collective tree spanners of graphs
    F.F. Dragan, C. Yan and I. Lomonosov
    SIAM J. Discrete Math. 20 (2006), 241-260.
  23. Additive Sparse Spanners for Graphs with Bounded Length of Largest Induced Cycle
    V.D. Chepoi, Dragan F.F., and Chenyu Yan
     Theoretical Computer Science 347 (2005), 54-75.
  24. Estimating All Pairs Shortest Paths in Restricted Graph Families: A Unified Approach
    Dragan F.F.
    Journal of Algorithms 57 (2005), 1-21. (one of the TOP25 Hottest Articles within the Journal of Algorithms for  Jan-Mar 2005, Jul-Sep 2005, Oct-Dec 2005, Jan-Mar 2006, Apr-Jun 2006)
  25. New Graph Classes of Bounded Clique Width
    A. Brandstaedt, Dragan F.F., Hoang-Oanh Le, Raffaele Mosca
    Theory of Computing Systems 38 (2005), 623-645.
  26. Tree Spanners on Chordal Graphs: Complexity and Algorithms
    A. Brandstaedt, Dragan F.F., H.-O. Le, and V.B. Le
    Theoretical Computer Science  310 (2004), 329-354.
  27. On the power of BFS to determine a graph's diameter
    Corneil D.G., Dragan F.F. and E. Koehler
    Networks 42 (2003), 209-222.
  28. On linear and circular structure of a (claw,net)-free graph
    A. Brandstaedt and Dragan F.F.
    Discrete Appl. Math. 129 (2003), 285-303.
  29. Finding a central vertex in HHD-free graphs
    Chepoi V.D. and Dragan F.F.
    Discrete Appl. Math. 131 (2003), 93-111.
    Editors Choice 2003, a representative collection of excellent papers published in Discrete Appl. Math. in 2003. 
  30. Provably good global buffering by generalized multiterminal multicommodity flow approximation
    Dragan F.F., A. B. Kahng, S. Muddu, I. Mandoiu and A. Zelikovsky
    IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 21 (2002), 263-274.
  31. Diameter Determination on Restricted Graph Families
    Corneil D.G., Dragan F.F., Habib M. and Paul C.
    Discrete Appl. Math. 113 (2001), 143-166.
  32. Linear time algorithms for Hamiltonian problems on (claw,net)-free graphs
    A. Brandstaedt, Dragan F.F. and E. Koehler
    SIAM J. on Computing 30 (2000), 1662-1677.
  33. On stable cutsets in graphs
    A. Brandstaedt, Dragan F.F., V.B. Le , and Th. Szymczak
    Discrete Appl. Math.  105 (2000), 39-50.
  34. A note on distance approximating trees in graphs
    Chepoi V.D. and Dragan F.F.
    European Journal of Combinatorics  21 (2000), 761-766.
  35. Strongly orderable graphs:
    A common generalization of strongly chordal and chordal bipartite graphs
    Dragan F.F.
    Discrete Appl. Math. 99 (2000), 427-442.
  36. LexBFS-orderings of distance-hereditary graphs with application to the diametral pair problem
    Dragan F.F. and Nicolai F.
    Discrete Appl. Math. 98 (2000), 191-207.
  37. Almost diameter of a House-Hole-free graph in linear time via LexBFS
    Dragan F.F.
    Discrete Appl. Math. 95 (1999), 223-239.
  38. Distance approximating trees for chordal and dually chordal graphs
    A. Brandstaedt, Chepoi V.D. and Dragan F.F.
    Journal of Algorithms. 30 (1999), 166-184.
  39. LexBFS-orderings and powers of HHD-free graphs
    Dragan F.F. and Nicolai F.
    International Journal of Computer Mathematics  71 (1999), 35-56.
  40. Convexity and HHD-free graphs
    Dragan F.F., Nicolai F. and A. Brandstaedt
    SIAM J. Discrete Math. 12 (1999), 119-135.
  41. Powers of HHD-free graphs
    F.F. Dragan, F. Nicolai and A. Brandstaedt
    International Journal of Computer Mathematics  69 (1998), 217-242.
  42. A linear-time algorithm for connected r-domination and Steiner tree on distance-hereditary graphs
    A. Brandstaedt and Dragan F.F.
    Networks  31 (1998), 177-182.
  43. Dually chordal graphs
    A. Brandstaedt, Dragan F.F., Chepoi V.D. and Voloshin V.I.
    SIAM J. Discrete Math.  11 (1998), 437-455.
  44. The algorithmic use of hypertree structure and maximum neighborhood orderings
    A. Brandstaedt, Chepoi V.D. and Dragan F.F.
    Discrete Appl. Math.  82 (1998), 43-77;
    Editors Choice 1998, a representative collection of excellent papers published in Discrete Appl. Math. in 1998. 
  45. LexBFS-orderings and powers of chordal graphs
    A. Brandstaedt, Dragan F.F. and Nicolai F.
    Discrete Math.,  171 (1997), 27-42.
  46. r -Domination Problems on Homogeneously orderable graphs
    Dragan F.F. and Nicolai F.
    Networks,  30 (1997), 121-131.
  47. Homogeneously orderable graphs
    A. Brandstaedt, Dragan F.F. and Nicolai F.
    Theoretical Computer Science, 172 (1997), 209-232.
  48. Clique r -domination and clique r -packing problems on dually chordal graphs
    A. Brandstaedt, Chepoi V.D. and Dragan F.F.
    SIAM J. Discrete Math., 10(1997), 109-127.
  49. Condorcet and median points of simple rectilinear polygons
    Chepoi V.D. and Dragan F.F.
    Location Science,  4 (1996),  21-35.
  50. Perfect elimination orderings of chordal powers of graphs
    A. Brandstaedt, Chepoi V.D. and Dragan F.F.
    Discrete Math., 158 (1996),  273-278.
  51. r -Dominating cliques in graphs with hypertree structure
    Dragan F.F. and A. Brandstaedt
    Discrete Math., 162 (1996),  93-108.
  52. Incidence graphs of biacyclic hypergraphs
    Dragan F.F. and Voloshin V.I.
    Discrete Appl. Math.,  68 (1996),  259-266.
  53. Computing a median point of a simple rectilinear polygon
    Chepoi V.D. and Dragan F.F.
    Inform. Process. Letters,  49 (1994),  281-285.
  54. Linear-time algorithm for finding a link central point of a simple rectilinear polygon
    Chepoi V.D. and Dragan F.F.
    Russian J. of Oper. Res. (Moscow), 1994.
  55. On link diameter of a simple rectilinear polygon
    Chepoi V.D. and Dragan F.F.
    Comput. Sci. J. of Moldova (Kishinev), 1993, Vol.1, N 3, 62-74.
  56. Domination in quadrangle-free Helly graphs
    Dragan F.F.
    Cybernetics and Syst. Analysis, 29, No.6, (1993), 822-829 ( English. Russian original );
    translation from Kibern. Sist. Anal., 1993, No.6, 47-57.
  57. HT-graphs: centers, connected r-domination and Steiner trees
    Dragan F.F.
    Comput. Sci. J. of Moldova (Kishinev), 1993, Vol.1, N 2, 64-83.
  58. Location problems in graphs and the Helly property
    Dragan F.F., Prisacaru Ch.F. and Chepoi V.D.
    Discrete Math. (Moscow), 1992, Vol.4, N 4, 67-73 (in Russian).
  59. Properties of pseudo-modular graphs
    Dragan F.F. and Chepoi V.D.
    Oper. Res. and Autom. Management Systems (Kiev), 1991, N 37, 47-54 (in Russian).
  60. Median problem on pseudo-median graphs
    Dragan F.F. and Chepoi V.D.
    Oper. Res. and Autom. Management Systems (Kiev), 1991, N 35, 47-56 (in Russian).
  61. Dominating and packing in triangulated graphs
    Dragan F.F.
    Meth. of Discrete Analysis (Novosibirsk), 1991, N 51, 17-36 (in Russian).
  62. Conditions for coincidence of local and global minimums for eccentricity function on graphs and the Helly property
    Dragan F.F.
    Res. in Appl. Math. and Inform. (Kishinev), 1990, 49-56 (in Russian).

 


 

In Refereed Proceedings

 

6+ articles are published in rank 1 conferences; 20+ articles are published in rank 2 conferences; 18+ articles are published in rank 3 conferences. Former Soviet Union conferences are not ranked.

 

Computer Science Conference Rankings

 

SODA and SoCG are rank 1 conferences in Algorithms and Theory area

KDD and ICDM are rank 1 conferences in Data Mining area

ICCAD is rank 1 conference in Hardware and Architecture area

ICALP, STACS, WADS, SWAT, ESA, MFCS, ISAAC and LATIN are rank 2 conferences in Algorithms and Theory area

IPDPS is rank 2 conference in System Technology area

FCT, WG and CIAC are rank 3 conferences in Algorithms and Theory area

  1. Tree-like Structures in Graphs: a Metric Point of View
    Feodor F. Dragan
    39th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2013), June 19 - 21, 2013, Luebeck, Germany, Springer, Lecture Notes in Computer Science, 2013. (Invited plenary talk)
  2. Collective Additive Tree Spanners of Bounded Tree-Breadth Graphs with Generalizations and Consequences
    F.F. Dragan and M. Abu-Ata
    SOFSEM 2013: Theory and Practice of Computer Science, Lecture Notes in Computer Science 7741, 2013, pp. 194-206
  3. An Approximation Algorithm for the Tree t-Spanner Problem on Unweighted Graphs via Generalized Chordal Graphs
    F.F. Dragan, E. Koehler
    Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - Proceedings of the 14th International Workshop, APPROX 2011, and 15th International Workshop, RANDOM 2011, Princeton, NJ, USA, August 17-19, 2011, Lecture Notes in Computer Science 6845, Springer, pp. 171-183
  4. Constant Approximation Algorithms for Embedding Graph Metrics into Trees and Outerplanar Graphs
    V.D. Chepoi, F.F. Dragan, I. Newman, Y. Rabinovich, Y. Vaxes
    13th Intl. Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX 2010),
    Barcelona, Spain, 1-3 September, 2010,  Springer, Lecture Notes in Computer Science 6302, pp. 95-109.
  5. New Min-Max Theorems for Weakly Chordal and Dually Chordal Graphs
    A.H. Busch, F.F. Dragan, R. Sritharan
    4th International Conference on Combinatorial Optimization and Applications  (COCOA 2010), Kailua-Kona, HI, USA, December 18-20, 2010,  Springer,  Lecture Notes in Computer Science 6509 (Part II), pp. 207-218.
  6. How to use spanning trees to navigate in graphs
    F.F. Dragan and Y. Xiang
    34th International Symposium on Mathematical Foundations of Computer Science (MFCS 2009), August 24 - 28, 2009, Novy Smokovec, High Tatras, Slovak Republic, Springer, Lecture Notes in Computer Science 5734, pp. 282-294.
  7. Compact and Low Delay Routing Labeling Scheme for Unit Disk Graphs
    C. Yan, Y. Xiang and F.F. Dragan
    The Algorithms And Data Structures Symposium (WADS 2009), Banff Conference Centre, Banff, Alberta, Canada, 21-23 August 2009, Springer, Lecture Notes in Computer Science, 5664, pp. 566-577.
  8. Navigating in a graph by aid of its spanning tree
    F.F. Dragan and M. Matamala
    19th International Symposium on Algorithms and Computation (ISAAC 2008), Surfers Paradise, Gold Coast, Australia, December 15-17, 2008, Springer, Lecture Notes in Computer Science 5369, pp. 789-800, 2008.
  9. Overlapping Matrix Pattern Visualization: a Hypergraph Approach
    R. Jin, Y. Xiang, D. Fuhry, F.F. Dragan
    IEEE International Conference on Data Mining (IEEE-ICDM 2008), Pisa, Italy, December 15-19, 2008, pp. 313-322.
  10. A PTAS for the sparsest spanners problem on apex-minor-free graphs
    F.F. Dragan, F. Fomin and P. Golovach
    33rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2008), Torun, Poland, August 27-31, 2008, Springer, Lecture Notes in Computer Science 5162, pp. 290-298.
  11. Succinct Summarization of  Transactional Databases: An Overlapped Hyperrectangle Scheme
    Y. Xiang, R. Jin, D. Fuhry, F.F. Dragan
    14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD 2008), Las Vegas, USA, 24-27 August, 2008, pp. 758-766.
  12. Spanners in sparse graphs
    F.F. Dragan, F. Fomin and P. Golovach
    35th International Colloquium on Automata, Languages and Programming (ICALP 2008), Reykjavik, Iceland, July 6-13, 2008, Springer, Lecture Notes in Computer Science 5125 (Part I), pp. 597-608.
  13. Additive Spanners for Circle Graphs and Polygonal Graphs
    F.F. Dragan, D.G. Corneil, E. Koehler and Y. Xiang
    34th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2008), Durham University, U.K., June 30- July 2, 2008, Springer, Lecture Notes in Computer Science 5344, pp. 110-121, 2008.
  14. Diameters, centers, and approximating trees of δ-hyperbolic geodesic spaces and graphs
    V.D. Chepoi, F.F. Dragan, B. Estellon, M. Habib and Y. Vaxes
    Proceedings of the 24th Annual ACM Symposium on Computational Geometry (SoCG 2008), June 9-11, 2008, College Park, Maryland, USA, pp. 59-68.
  15. Collective Additive Tree Spanners of Homogeneously Orderable Graphs
    F.F. Dragan, C. Yan, Y. Xiang
    8th Latin American Symposium on Theoretical Informatics (LATIN 2008), Buzios, Brazil, April 7-11, 2008, Springer, Lecture Notes in Computer Science 4957, pp. 555-567.
  16. Generalized Powers of Graphs and Their Algorithmic Use
    A. Brandstaedt, F.F. Dragan, Y. Xiang and C. Yan
    Proc. of the 10th Scandinavian Workshop on Algorithm Theory (SWAT' 06), Riga, Latvia, July 6-8, 2006,  Springer, Lecture Notes in Computer Science 4059, pp. 423-434.
  17. Distance Approximating Trees: Complexity and Algorithms
    F.F. Dragan and C. Yan
    In Proceedings of the 6th Conference on Algorithms and Complexity (CIAC' 2006), Rome, Italy, May 29-31, 2006, Springer, Lecture Notes in Computer Science 3998, pp. 260-271.
    (invited to submit to the special issue "Best papers of CIAC 2006" to be published in Journal of Discrete Algorithms).
  18. Network Flow Spanners
    F.F. Dragan and C. Yan
    In Proceedings of the 7th Latin American Symposium ''LATIN 2006: Theoretical Informatics'', Valdivia, Chile, March 20-24 2006, Springer, Lecture Notes in Computer Science 3887, pp. 410-422.
  19. Collective Tree Spanners in Graphs with Bounded Genus, Chordality, Tree-width, or Clique-width 
    F.F. Dragan and C. Yan
    In Proceedings of the 16th Annual International Symposium on Algorithms and Computation (ISAAC 2005), December 19-21, 2005, Hainan, China, Springer, Lecture Notes in Computer Science 3827, pp. 583-592.
  20. Collective tree 1-spanners for interval graphs
     D.G. Corneil, F.F. Dragan, E. Koehler and C. Yan
    In Proceedings of 31st International Workshop "Graph-Theoretic Concepts in Computer Science" (WG '05), June 23-25, 2005, Metz, France, Springer, Lecture Notes in Computer Science 3787, pp. 151-162.
  21. Distance-Based Location Update and Routing in Irregular Cellular Networks
     
    V.D. Chepoi, F.F. Dragan, Y. Vaxes
    In Proceedings of
    Sixth International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing and First ACIS International Workshop on Self-Assembling Wireless Networks (SNPD/SAWN'05), May 23-25, 2005, Towson University, Maryland, USA, IEEE Computer Society, 2005, pp. 380-387.
  22. On Compact and Efficient Routing in Certain Graph Classes
    F.F. Dragan, I. Lomonosov
    In Proceedings of the 15th Annual International Symposium on Algorithms and Computation (ISAAC 2004), December 20 - 22, 2004, HKUST, Hong Kong, Springer, Lecture Notes in Computer Science 3341, pp. 402-414.
  23. Effective Network Monitoring
    Y. Breitbart, F.F. Dragan, H. Gobjuka
    In Proc. of 13th International Conference on Computer Communications and Networks (ICCCN 2004), October 11-13, 2004 Chicago, IL USA, pp. 394-399. (nominated for the best paper award)
  24. Collective Tree Spanners and Routing in AT-free Related Graphs
    F.F. Dragan, C. Yan and D.G. Corneil
    In Proceedings of 30th International Workshop "Graph-Theoretic Concepts in Computer Science" (WG '04), June 2004, Hoelterhoff House at Bad Honnef, close to Bonn, Germany, Springer, Lecture Notes in Computer Science 3353, pp. 68-80.
  25. Collective tree spanners of graphs
    F.F. Dragan, C. Yan and I. Lomonosov
    Proc. of the 9th Scandinavian Workshop on Algorithm Theory (SWAT'04), 8-10 July, 2004, Humlebaek, Denmark, Springer, Lecture Notes in Computer Science 3111, pp. 64-76.
  26. Addressing, distances and routing in triangular systems with applications in cellular and sensor networks
    V.D. Chepoi, F.F. Dragan, Y. Vaxes
    Proc. of the 18th International Parallel & Distributed Processing Symposium (IPDPS 2004), April 26 - 30, Santa Fe, New Mexico (4th International Workshop on Algorithms for Wireless, Mobile, Ad Hoc and Sensor Networks, WMAN'04) (on CD)
    (invited to submit to the special issue "Best papers of the 4th Workshop on Algorithms for Wireless, Mobile, Ad Hoc and Sensor Networks (WMAN 2004)" to be published in Wireless Networks (WINET - Kluwer)).
  27. Tree spanners for bipartite graphs and probe interval graphs
    A. Brandstaedt, Dragan F.F., H.-O. Le, V.B. Le and R. Uehara
    In Proceedings of 29th International Workshop "Graph-Theoretic Concepts in Computer Science" (WG '03), June 2003, Elspeet, the Netherlands, Springer, Lecture Notes in Computer Science 2880, pp. 106-118.
  28. Additive Spanners for k-Chordal Graphs
    V.D. Chepoi, Dragan F.F., and Chenyu Yan
    In Proceedings of 5th Conference on Algorithms and Complexity (CIAC 2003), May 28-30, 2003, Rome, Italy, Springer, Lecture Notes in Computer Science 2653, pp.96-107.
  29. Tree Spanners on Chordal Graphs: Complexity, Algorithms, Open Problems
    A. Brandstaedt, Dragan F.F., H.-O. Le, and V.B. Le
    In proceedings of The 13th Annual International Symposium on Algorithms and Computation (ISAAC 2002),  November 20-23, 2002, Vancouver, Canada, Springer, Lecture Notes in Computer Science 2518, pp. 163-174.
  30. New Routing Schemes for Interval Graphs, Circular-Arc Graphs and Permutation Graphs
    Feodor F. Dragan and Irina Lomonosov
    In proceedings of Fourteenth IASTED International Conference on Parallel and Distributed Computing and Systems (PDCS 2002),  November 4-6, 2002, Cambridge, USA, pp. 78-83.
  31. New Graph Classes of Bounded Clique Width
    A. Brandstaedt, Dragan F.F., Hoang-Oanh Le, Raffaele Mosca
    Proceedings of 28th International Workshop "Graph-Theoretic Concepts in Computer Science" (WG '02), June 2002, Cesky Krumlov, Czech Republic, Springer, Lecture Notes in Computer Science 2573, pp. 57-67.
  32. On the Power of BFS to Determine a Graph's Diameter (extended abstract)
    Corneil D.G., Dragan F.F., and E. Koehler
    Proceedings of the 5th Latin American Symposium ''LATIN 2002: Theoretical Informatics'', Cancun, Mexico, April 2002, Springer, Lecture Notes in Computer Science 2286, pp. 209-223.
  33. Center and diameter problems in plane triangulations and quadrangulations
    Chepoi V.D., Dragan F.F., Y. Vaxes
    Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'02), San Francisco, CA, January 2002, pp. 346-355.
  34. Estimating All Pairs Shortest Paths in Restricted Graph Families: A Unified Approach (extended abstract)
    Dragan F.F.
    Proc. 27th International Workshop ''Graph-Theoretic Concepts in Computer Science''(WG'01), June 2001, Springer, Lecture Notes in Computer Science 2204, pp. 103-116.
  35. Practical Approximation Algorithms for Separable Packing Linear Programs
    Dragan F.F., A. B. Kahng, S. Muddu, I. Mandoiu and A. Zelikovsky
    Proceedings of the 7th International Workshop on Algorithms and Data Structures (WADS'01), August, 2001, Springer, Lecture Notes in Computer Science 2125, pages 325-337.
  36. Provably good global buffering by multiterminal multicommodity flow approximation
    Dragan F.F., A. B. Kahng, S. Muddu, I. Mandoiu and A. Zelikovsky
    Proceedings of Asia and South Pacific Design Automation Conference (ASP-DAC'01), January/February, 2001, pages 139-144.
  37. Provably Good Global Buffering Using an Available Buffer Block Plan
    Dragan F.F., A. B. Kahng, S. Muddu, I. Mandoiu and A. Zelikovsky
    Proc. of IEEE/ACM Intl. Conference on Computer-Aided Design (ICCAD'00), November, 2000, pages 104-109.
  38. Linear time algorithms for Hamiltonian problems on (claw,net)-free graphs
    A. Brandstaedt, Dragan F.F. and E. Koehler
    Proc. 25th International Workshop ''Graph-Theoretic Concepts in Computer Science''(WG'99) 1999, Springer, Lecture Notes in Computer Science 1665, 364-376.
  39. Distance approximating trees in graphs
    Chepoi V.D. and Dragan F.F.
    In 6th Twente Workshop on graphs and combinatorial optimization, Enschede, H.J. Broersma and U. Faigle and others Ed., Electronic Notes in Discrete Mathematics, vol. 3., Elsevier, The Netherlands, 1999, pp.39-42.
  40. Diameter Determination on Restricted Graph Families
    Corneil D.G., Dragan F.F., Habib M. and Paul C.
    24th International Workshop ''Graph-Theoretic Concepts in Computer Science''(WG'98), Smolenice Castle, Slovak Republic, 1998, Springer, LNCS 1517 (J. Hromkovic and O. Sykora, Eds.), 192-202, 1998.
  41. Distance approximating trees for chordal and dually chordal graphs
    A. Brandstaedt, Chepoi V.D. and Dragan F.F.
    ''Algorithms - ESA'97''  5th Annual European Symposium, Graz, Austria, September 1997,
    Springer, LNCS  1284 (R. Burkard and G. Woeginger , eds.), 78-91, 1997.
  42. On greedy matching ordering and greedy matchable graphs
    Dragan F.F.
    23nd International Workshop ''Graph-Theoretic Concepts in Computer Science''(WG'97), Berlin, Germany, 1997, Springer, LNCS 1335 (Rolf H. Moehring, Ed.), 184-198, 1997.
  43. On strong and simple elimination orderings of graphs
    Dragan F.F.
    Abstracts of the ''5th Twente Workshop on Graphs and Combinatorial Optimization'', University of Twente, 20-22 May, 1997, 67-70.
  44. LexBFS-ordering and powers of graphs
    Dragan F.F., Nicolai F. and A. Brandstaedt
    22nd International Workshop ''Graph-Theoretic Concepts in Computer Science''(WG'96), Cadenabbia, Italy, 1996, Springer, LNCS 1197 (Fabrizio d'Amore, Paolo G. Franciosa,  Alberto Marchetti-Spaccamela, eds.), 166-180, 1997.
  45. r -Domination Problems on Homogeneously orderable graphs
    Dragan F.F. and Nicolai F.
    ''Fundamentals of Computation Theory - FCT'95 '' Dresden, Germany, August 1995, Springer, LNCS 965 (Horst Reichel, ed.), 201-210, 1995.
  46. Condorcet and median points of simple rectilinear polygons
    Chepoi V.D. and Dragan F.F.
    ''Fundamentals of Computation Theory - FCT'95 '' Dresden, Germany, August 1995, Springer, LNCS 965 (Horst Reichel, ed.), 181-190, 1995.
  47. Homogeneously orderable graphs
    A. Brandstaedt, Dragan F.F. and Nicolai F.
    21th International Workshop ''Graph-Theoretic Concepts in Computer Science''(WG'95) Aachen, Germany, Springer, LNCS 1017 (Manfred Nagl ed.), 381-395, 1995.
  48. A central vertex of a distance-hereditary graph in linear time
    Dragan F.F.
    Abstracts of the 8th Meeting of the EURO Working Group on Locational Analysis , Lambrecht (Pfalz), 24-28 September 1995, p.11.
  49. LexBFS-orderings and powers of chordal graphs
    A. Brandstaedt, Dragan F.F. and Nicolai F.
    Abstracts of the ''4th Twente Workshop on Graphs and Combinatorial Optimization'', University of Twente, 7-9 June, 1995, 56-59.
  50. Linear-time algorithm for finding a central vertex of a chordal graph
    Chepoi V.D. and Dragan F.F.
    ''Algorithms - ESA'94 '' Second Annual European Symposium, Utrecht, The Netherlands, September 1994, Springer, LNCS 855 (Jan van Leeuwen, ed.), 159-170, 1994.
  51. The algorithmic use of hypertree structure and maximum neighbourhood orderings
    A. Brandstaedt, Chepoi V.D. and Dragan F.F.
    20th International Workshop ''Graph-Theoretic Concepts in Computer Science''(WG'94) Herrsching, Germany, 1994, Springer, LNCS 903 (E.W. Mayr, G. Schmidt and G. Tinhofer eds.), 65-80, 1995.
  52. Dominating Cliques in Distance-Hereditary Graphs
    Dragan F.F.
    ''Algorithm Theory - SWAT'94 '' 4th Scandinavian Workshop on Algorithm Theory, Aarhus, Denmark, July 1994, Springer, LNCS 824 (Erik M.Schmidt and Sven Skyum, eds.), 370-381, 1994.
  53. r -Dominating cliques in graphs with hypertree structure
    Dragan F.F. and A. Brandstaedt
    Proc. of the 11th STACS, Caen, France, Springer, LNCS 775, 735 - 746, 1994.
  54. Dually chordal graphs
    A. Brandstaedt, Dragan F.F., Chepoi V.D. and Voloshin V.I.
    19th International Workshop ''Graph-Theoretic Concepts in Computer Science''(WG'93) Utrecht, The Netherlands, 1993, Springer, LNCS 790 (Jan van Leeuwen ed.), 237-251, 1994.
  55. Gallai numbers for connected subgraphs of planar graphs
    Dragan F.F. and Malkevich E.
    VI Symp. on general topology and its applications. Kishinev, 1991, p.74.
  56. r-Domination problem in chordal graphs
    Dragan F.F.
    Abstracts of the Int.Conf. on "Sets, graphs and numbers", Janos Bolyai Math. Society, Budapest, Jan. 21-26, 1991, p.9.
  57. Location problems on graphs and the Helly property
    Dragan F.F., Prisacaru Ch.F. and Chepoi V.D.
    Methods and Programs for solving optimization problems on graphs and networks. Part 2: Theory and Algorithms. Theses of reports of the 4th All-Union Conference, 17-19 October 1989, Novosibirsk, 1989, 25-27 (in Russian).
  58. Geometric properties of centers in graphs
    Dragan F.F.
    Proc. of IX All-union Conference on Geometry, Kishinev, Sept. 20-22, 1988, p.103 (in Russian).


 

Preprints, Technical Reports, Manuscripts

  1. Collective Additive Tree Spanners of Bounded Tree-Breadth Graphs with Generalizations and Consequences
    F.F. Dragan and M. Abu-Ata
    CoRR abs/1207.2506: (2012)
  2. Constant Approximation Algorithms for Embedding Graph Metrics into Trees and Outerplanar Graphs
    V.D. Chepoi, F.F. Dragan, I. Newman, Y. Rabinovich, Y. Vaxes
    CoRR abs/1007.0489 (2010)
  3. Diameters, centers, and approximating trees of δ-hyperbolic geodesic spaces and graphs
    V.D. Chepoi, F.F. Dragan, B. Estellon, M. Habib and Y. Vaxes
    Manuscript, 2008
  4. Collective Additive Tree Spanners of Homogeneously Orderable Graphs
    F.F. Dragan, C. Yan, Y. Xiang
    Manuscript, 2008
  5. Generalized Powers of Graphs and Their Algorithmic Use
    A. Brandstaedt, F.F. Dragan, Y. Xiang and C. Yan
    Manuscript, 2006
  6. Distance Approximating Trees: Complexity and Algorithms
    F.F. Dragan and C. Yan
    Manuscript, 2005
  7. On Compact and Efficient Routing in Certain Graph Classes
    F.F. Dragan, I. Lomonosov
    Technical Report TR-KSU-CS-2004-03, Department of Computer Science, Kent State University, May 2004.
  8. Routing schemes for interval graphs, circular-arc graphs, and permutation graphs
    Dragan F.F. and I. Lomonosov
    Manuscript, 2002
  9. Center and diameter problems in plane triangulations and quadrangulations
    Chepoi V.D., Dragan F.F. and Y. Vaxes
    Manuscript, 2002
  10. Induced cycles and odd powers of graphs
    A. Brandstaedt, Dragan F.F. and Van Bang Le
    Preprint CS-09-95, University of Rostock 1995.

 

Back to Feodor F. Dragan's Home Page


Last updated: April, 2013

Free counter and web stats