Feodor F. Dragan's Selected List of Publications

In Journals

---

• A note on distance approximating trees in graphs
  Chepoi V.D. and Dragan F.F.
  to appear in European Journal of Combinatorics .
  
  
• Almost diameter of a House-Hole-free graph in linear time via LexBFS
  Dragan F.F.
  Discrete Appl. Math. 95 (1999), 223-239. .
  
  
• Distance approximating trees for chordal and dually chordal graphs
  A. Brandstädt, 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.
  Journal of Algorithms. 30 (1999), 166-184. .
  
  
• Strongly orderable graphs:
  A common generalization of strongly chordal and chordal bipartite graphs
  Dragan F.F.
  Preprint CS-05-98 , University of Rostock 1998.
  Discrete Appl. Math. 99 (2000), 427-442. .
  
  
• LexBFS-orderings of distance-hereditary graphs with application to the diametral pair problem
  Dragan F.F. and Nicolai F.
  Technical Report SM-DU-303 , University of Duisburg 1995.
  Discrete Appl. Math. 98 (2000), 191-207. .
  
  
• LexBFS-orderings and powers of HHD-free graphs
  Dragan F.F. and Nicolai F.
  International Journal of Computer Mathematics  71 (1999), 35-56.
  
  
• Convexity and HHD-free graphs
  Dragan F.F., Nicolai F. and A. Brandstädt
  SIAM J. Discrete Math. 12 (1999), 119-135. . .
  
  
• Powers of HHD-free graphs
  F.F. Dragan, F. Nicolai and A. Brandstädt
  International Journal of Computer Mathematics  69 (1998), 217-242.
  
  
• A linear-time algorithm for connected r-domination and Steiner tree on distance-hereditary graphs
  A. Brandstädt and Dragan F.F.
  Networks  31 (1998), 177-182. .
  
  
• Dually chordal graphs
  A. Brandstädt, 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,  SIAM J. Discrete Math.  11 (1998), 437-455. . .
  
  
• The algorithmic use of hypertree structure and maximum neighbourhood orderings
  A. Brandstädt, 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,   Discrete Appl. Math.  82 (1998), 43-77; Editors Choice 1998, a representative collection of excellent papers published in Discrete Appl. Math. in 1998. .
  
  
• LexBFS-orderings and powers of chordal graphs
  A. Brandstädt, 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,
  Discrete Math.,  171 (1997), 27-42. .
  
  
• 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,
  Networks,  30 (1997), 121-131. .
  
  
• Homogeneously orderable graphs
  A. Brandstädt, 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,
  Theoretical Computer Science, 172 (1997), 209-232. .
  
  
• Clique r -domination and clique r -packing problems on dually chordal graphs
  A. Brandstädt, Chepoi V.D. and Dragan F.F.
  SIAM J. Discrete Math., 10(1997), 109-127. . .
  
  
• 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,
  Location Science,  4 (1996),  21-35. .
  
  
• Perfect elimination orderings of chordal powers of graphs
  A. Brandstädt, Chepoi V.D. and Dragan F.F.
  Discrete Math., 158 (1996),  273-278. .
  
  
• r -Dominating cliques in graphs with hypertree structure
  Dragan F.F. and A. Brandstädt
  Proc. of the 11th STACS, Caen, France, Springer, LNCS 775, 735 - 746, 1994,
  Discrete Math., 162 (1996),  93-108. .
  
  
• Incidence graphs of biacyclic hypergraphs
  Dragan F.F. and Voloshin V.I.
  Discrete Appl. Math.,  68 (1996),  259-266. .
  
  
• Computing a median point of a simple rectilinear polygon
  Chepoi V.D. and Dragan F.F.
  Inform. Process. Letters,  49 (1994),  281-285.
  
  
• 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.
  
  
• 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.
  
  
• 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.
  
  
• 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.
  
  
• 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).
  
  
• 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).
  
  
• 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).
  
  
• Dominating and packing in triangulated graphs
  Dragan F.F.
  Meth. of Discrete Analysis (Novosibirsk), 1991, N 51, 17-36 (in Russian).
  
  
• 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

---

• Linear time algorithms for Hamiltonian problems on (claw,net)-free graphs
  A. Brandstädt, Dragan F.F. and E. Köhler
  to appear in Proc. 25th International Workshop ''Graph-Theoretic Concepts in Computer Science''(WG'99).
  
  
• Distance approximating trees in graphs
  Chepoi V.D. and Dragan F.F.
  In 6th Twente Workshop on graphs and combinatorial optimization, H.J. Broersma and U. Faigle and others Ed., Discrete Mathematics, vol. 3., Elsevier, Enschede, The Netherlands, 1999, pp.39-42.
  
  
• 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.
  
  
• 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. Möhring, Ed.), 184-198, 1997.
  
  
• LexBFS-ordering and powers of graphs
  Dragan F.F., Nicolai F. and A. Brandstädt
  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.
  
  
• 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
  
  
• 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.
  
  
• 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.
  
  
• 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.
  
  
• 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.
  
  
• 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.
  
  
• Location problems on graphs and the Helly property
  Dragan F.F., Prisacaru Ch.F. and Chepoi V.D.
  Methods and Programs of resolving of 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).
  
  
• Geometrical properties of centers in graphs
  Dragan F.F.
  Proc. of IX All-union Geometrical Conference , Kishinev, Sept.20-22, 1988, p.103 (in Russian).
  
  

There are also conributions to WG'93, STACS'94, WG'94, FCT'95, WG'95, ESA'97, ODSA '97. The journal versions of these Extended Abstracts are published.


---

Preprints, Technical Reports

---

• On linear and circular structure of a (claw,net)-free graph
  A. Brandstädt and Dragan F.F.
  Manuscript, 1999.
  
  
• Linear time algorithms for Hamiltonian problems on (claw,net)-free graphs
  A. Brandstädt, Dragan F.F. and E. Köhler
  Manuscript, 1999.
  
  
• Finding a central vertex in HHD-free graphs
  Chepoi V.D. and Dragan F.F.
  Preprint, University of Rostock 1998.
  
  
• On stable cutsets in graphs
  A. Brandstädt, Dragan F.F., V.B. Le , and Th. Szymczak
  Preprint, University of Rostock 1998.
  
  
• Induced cycles and odd powers of graphs
  A. Brandstädt, Dragan F.F. and Van Bang Le
  Preprint CS-09-95 , University of Rostock 1995.
  
  

Last updated: October 14, 1999