Feodor F. Dragan's List of Publications

Feodor F. Dragan's Selected List of Publications

(complete list contains more than 100 items)
on-line papers

Algorithmica, Journal of Algorithms, SIAM Journal on Computing are premium journals in Algorithms and Theory area.

Journal of Graph Algorithms and Applications, Theoretical Computer Science 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.

In Journals

Collective Tree Spanners in Graphs with Bounded Genus, Chordality, Tree-width, or Clique-width
F.F. Dragan and C. Yan
Algorithmica, to appear, 2008
On Compact and Efficient Routing in Certain Graph Classes
F.F. Dragan, I. Lomonosov
Discrete Applied Mathematics 155 (2007), 1458-1470.
Spanners for bounded tree-length graphs
Y. Dourisboure, F.F. Dragan, C. Gavoille, and C. Yan
Theoretical. Computer Science 383 (2007), 34-44.
Tree spanners for bipartite graphs and probe interval graphs
A. Brandstädt, Dragan F.F., H.-O. Le, V.B. Le and R. Uehara
Algorithmica 47 (2007), 27–51.
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.
Addressing, distances and routing in triangular systems with applications in cellular networks
V.D. Chepoi, F.F. Dragan, Y. Vaxès
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)".
Distance and routing labeling schemes for non-positively curved plane graphs
V.D. Chepoi, F.F. Dragan, Y. Vaxès
Journal of Algorithms 61 (2006), 60-88.
Collective tree spanners of graphs
F.F. Dragan, C. Yan and I. Lomonosov
SIAM J. Discrete Math. 20 (2006), 241-260.
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.
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)
New Graph Classes of Bounded Clique Width
A. Brandstädt, Dragan F.F., Hoang-Oanh Le, Raffaele Mosca
Theory of Computing Systems 38 (2005), 623-645.
Tree Spanners on Chordal Graphs: Complexity and Algorithms
A. Brandstädt, Dragan F.F., H.-O. Le, and V.B. Le
Theoretical Computer Science 310 (2004), 329-354.
On the power of BFS to determine a graph's diameter
Corneil D.G., Dragan F.F. and E. Köhler
Networks 42 (2003), 209-222.
On linear and circular structure of a (claw,net)-free graph
A. Brandstädt and Dragan F.F.
Discrete Appl. Math. 129 (2003), 285-303.
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.
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.
Diameter Determination on Restricted Graph Families
Corneil D.G., Dragan F.F., Habib M. and Paul C.
Discrete Appl. Math. 113 (2001), 143-166.
Linear time algorithms for Hamiltonian problems on (claw,net)-free graphs
A. Brandstädt, Dragan F.F. and E. Köhler
SIAM J. on Computing 30 (2000), 1662-1677.
On stable cutsets in graphs
A. Brandstädt, Dragan F.F., V.B. Le , and Th. Szymczak
Discrete Appl. Math. 105 (2000), 39-50.
A note on distance approximating trees in graphs
Chepoi V.D. and Dragan F.F.
European Journal of Combinatorics 21 (2000), 761-766.
Strongly orderable graphs:
A common generalization of strongly chordal and chordal bipartite graphs
Dragan F.F.
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.
Discrete Appl. Math. 98 (2000), 191-207.
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.
Journal of Algorithms. 30 (1999), 166-184.
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.
SIAM J. Discrete Math. 11 (1998), 437-455.
The algorithmic use of hypertree structure and maximum neighborhood orderings
A. Brandstädt, 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.
LexBFS-orderings and powers of chordal graphs
A. Brandstädt, Dragan F.F. and Nicolai F.
Discrete Math., 171 (1997), 27-42.
r -Domination Problems on Homogeneously orderable graphs
Dragan F.F. and Nicolai F.
Networks, 30 (1997), 121-131.
Homogeneously orderable graphs
A. Brandstädt, Dragan F.F. and Nicolai F.
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.
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
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

Computer Science Conference Rankings

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

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

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

ICCAD is rank 1 conference in Hardware and Architecture area

IPDPS is rank 2 conference in System Technology area

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.
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, to appear
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.
Additive Spanners for Circle Graphs and Polygonal Graphs
F.F. Dragan, D.G. Corneil, E. Köhler 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, to appear
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.
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
International Conference on Topological and Geometric Graph Theory (TGGT 2008), to appear.
Collective Additive Tree Spanners of Homogeneously Orderable Graphs
F.F. Dragan, C. Yan, Y. Xiang
8th Latin American Symposium on Theoretical Informatics (LATIN 2008), Búzios, Brazil, April 7-11, 2008, Springer, Lecture Notes in Computer Science 4957, pp.555-567.
Generalized Powers of Graphs and Their Algorithmic Use
A. Brandstädt, 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.
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.
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.
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.
Collective tree 1-spanners for interval graphs
D.G. Corneil, F.F. Dragan, E. Köhler 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.
Distance-Based Location Update and Routing in Irregular Cellular Networks
V.D. Chepoi, F.F. Dragan, Y. Vaxès
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.
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.
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)
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, Hölterhoff House at Bad Honnef, close to Bonn, Germany, Springer, Lecture Notes in Computer Science 3353, pp. 68-80.
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, Humlebæk, Denmark, Springer, Lecture Notes in Computer Science 3111, pp. 64-76.
Addressing, distances and routing in triangular systems with applications in cellular and sensor networks
V.D. Chepoi, F.F. Dragan, Y. Vaxès
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)).
Tree spanners for bipartite graphs and probe interval graphs
A. Brandstädt, 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.
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.
Tree Spanners on Chordal Graphs: Complexity, Algorithms, Open Problems
A. Brandstädt, 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.
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.
New Graph Classes of Bounded Clique Width
A. Brandstädt, 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.
On the Power of BFS to Determine a Graph's Diameter (extended abstract)
Corneil D.G., Dragan F.F., and E. Köhler
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.
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.
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.
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.
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.
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.
Linear time algorithms for Hamiltonian problems on (claw,net)-free graphs
A. Brandstädt, Dragan F.F. and E. Köhler
Proc. 25th International Workshop ''Graph-Theoretic Concepts in Computer Science''(WG'99) 1999, Springer, Lecture Notes in Computer Science 1665, 364-376.
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.
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.
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.
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.
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.
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.
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.
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.
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.
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.
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.
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.
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.
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.
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.
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.
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 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).
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

Generalized Powers of Graphs and Their Algorithmic Use
A. Brandstädt, F.F. Dragan, Y. Xiang and C. Yan
Manuscript, 2006
Distance Approximating Trees: Complexity and Algorithms
F.F. Dragan and C. Yan
Manuscript, 2005
Network Flow Spanners
F.F. Dragan and C. Yan
Manuscript, 2005
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.
Effective Network Monitoring
Y. Breitbart , F.F. Dragan, H. Gobjuka
Manuscript, 2004
Routing schemes for interval graphs, circular-arc graphs, and permutation graphs
Dragan F.F. and I. Lomonosov
Manuscript, 2002
Center and diameter problems in plane triangulations and quadrangulations
Chepoi V.D., Dragan F.F. and Y. Vaxes
Manuscript, 2002
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.

Back to Feodor F. Dragan 's Home Page

Last updated: April, 2008