Guarnera, Heather M.; Dragan, Feodor F.; Leitert, Arne Injective hulls of various graph classes. (English) Zbl 1493.05083 Graphs Comb. 38, No. 4, Paper No. 112, 28 p. (2022). MSC: 05C12 05C75 PDFBibTeX XMLCite \textit{H. M. Guarnera} et al., Graphs Comb. 38, No. 4, Paper No. 112, 28 p. (2022; Zbl 1493.05083) Full Text: DOI arXiv
Ducoffe, Guillaume; Dragan, Feodor F. A story of diameter, radius, and (almost) Helly property. (English) Zbl 1528.05016 Networks 77, No. 3, 435-453 (2021). MSC: 05C12 05C85 PDFBibTeX XMLCite \textit{G. Ducoffe} and \textit{F. F. Dragan}, Networks 77, No. 3, 435--453 (2021; Zbl 1528.05016) Full Text: DOI
Dragan, Feodor F.; Ducoffe, Guillaume; Guarnera, Heather M. Fast deterministic algorithms for computing all eccentricities in (hyperbolic) Helly graphs. (English) Zbl 07498685 Lubiw, Anna (ed.) et al., Algorithms and data structures. 17th international symposium, WADS 2021, virtual event, August 9–11, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12808, 300-314 (2021). MSC: 68P05 68Wxx PDFBibTeX XMLCite \textit{F. F. Dragan} et al., Lect. Notes Comput. Sci. 12808, 300--314 (2021; Zbl 07498685) Full Text: DOI arXiv
Dragan, Feodor F.; Guarnera, Heather M. Helly-gap of a graph and vertex eccentricities. (English) Zbl 1465.05053 Theor. Comput. Sci. 867, 68-84 (2021). MSC: 05C12 PDFBibTeX XMLCite \textit{F. F. Dragan} and \textit{H. M. Guarnera}, Theor. Comput. Sci. 867, 68--84 (2021; Zbl 1465.05053) Full Text: DOI arXiv
Dragan, Feodor F.; Guarnera, Heather M. Eccentricity function in distance-hereditary graphs. (English) Zbl 1453.05026 Theor. Comput. Sci. 833, 26-40 (2020). MSC: 05C12 05C85 PDFBibTeX XMLCite \textit{F. F. Dragan} and \textit{H. M. Guarnera}, Theor. Comput. Sci. 833, 26--40 (2020; Zbl 1453.05026) Full Text: DOI arXiv
Dragan, Feodor F.; Guarnera, Heather M. Eccentricity terrain of \(\delta\)-hyperbolic graphs. (English) Zbl 1450.05017 J. Comput. Syst. Sci. 112, 50-65 (2020). MSC: 05C12 05C10 PDFBibTeX XMLCite \textit{F. F. Dragan} and \textit{H. M. Guarnera}, J. Comput. Syst. Sci. 112, 50--65 (2020; Zbl 1450.05017) Full Text: DOI arXiv
Dragan, Feodor F. An eccentricity 2-approximating spanning tree of a chordal graph is computable in linear time. (English) Zbl 1481.05029 Inf. Process. Lett. 154, Article ID 105873, 4 p. (2020). MSC: 05C05 05C85 68Q25 05C12 PDFBibTeX XMLCite \textit{F. F. Dragan}, Inf. Process. Lett. 154, Article ID 105873, 4 p. (2020; Zbl 1481.05029) Full Text: DOI
Chepoi, Victor; Dragan, Feodor F.; Habib, Michel; Vaxès, Yann; Alrasheed, Hend Fast approximation of eccentricities and distances in hyperbolic graphs. (English) Zbl 1416.05266 J. Graph Algorithms Appl. 23, No. 2, 393-433 (2019). MSC: 05C85 68W25 PDFBibTeX XMLCite \textit{V. Chepoi} et al., J. Graph Algorithms Appl. 23, No. 2, 393--433 (2019; Zbl 1416.05266) Full Text: DOI
Leitert, Arne; Dragan, Feodor F. Parameterized approximation algorithms for some location problems in graphs. (English) Zbl 1416.05270 Theor. Comput. Sci. 755, 48-64 (2019). MSC: 05C85 05C69 68W25 05C82 05C90 90B10 PDFBibTeX XMLCite \textit{A. Leitert} and \textit{F. F. Dragan}, Theor. Comput. Sci. 755, 48--64 (2019; Zbl 1416.05270) Full Text: DOI arXiv
Dragan, Feodor F.; Guarnera, Heather M. Obstructions to a small hyperbolicity in Helly graphs. (English) Zbl 1400.05069 Discrete Math. 342, No. 2, 326-338 (2019). MSC: 05C12 05C10 PDFBibTeX XMLCite \textit{F. F. Dragan} and \textit{H. M. Guarnera}, Discrete Math. 342, No. 2, 326--338 (2019; Zbl 1400.05069) Full Text: DOI arXiv
Dragan, Feodor F.; Leitert, Arne On the minimum eccentricity shortest path problem. (English) Zbl 1373.68266 Theor. Comput. Sci. 694, 66-78 (2017). MSC: 68Q25 05C12 05C69 05C85 68Q17 68W25 PDFBibTeX XMLCite \textit{F. F. Dragan} and \textit{A. Leitert}, Theor. Comput. Sci. 694, 66--78 (2017; Zbl 1373.68266) Full Text: DOI
Dragan, Feodor F.; Köhler, Ekkehard; Leitert, Arne Line-distortion, bandwidth and path-length of a graph. (English) Zbl 1359.05120 Algorithmica 77, No. 3, 686-713 (2017). MSC: 05C85 05C70 68W25 PDFBibTeX XMLCite \textit{F. F. Dragan} et al., Algorithmica 77, No. 3, 686--713 (2017; Zbl 1359.05120) Full Text: DOI arXiv
Leitert, Arne; Dragan, Feodor F. On strong tree-breadth. (English) Zbl 1427.68248 Chan, T-H. Hubert (ed.) et al., Combinatorial optimization and applications. 10th international conference, COCOA 2016, Hong Kong, China, December 16–18, 2016. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10043, 62-76 (2016). MSC: 68R10 68Q17 68Q25 PDFBibTeX XMLCite \textit{A. Leitert} and \textit{F. F. Dragan}, Lect. Notes Comput. Sci. 10043, 62--76 (2016; Zbl 1427.68248) Full Text: DOI
Dragan, Feodor F.; Leitert, Arne Minimum eccentricity shortest paths in some structured graph classes. (English) Zbl 1417.05205 Mayr, Ernst W. (ed.), Graph-theoretic concepts in computer science. 41st international workshop, WG 2015, Garching, Germany, June 17–19, 2015. Revised papers. Berlin: Springer. Lect. Notes Comput. Sci. 9224, 189-202 (2016). MSC: 05C85 05C38 68Q25 PDFBibTeX XMLCite \textit{F. F. Dragan} and \textit{A. Leitert}, Lect. Notes Comput. Sci. 9224, 189--202 (2016; Zbl 1417.05205) Full Text: DOI arXiv
Dragan, Feodor F.; Leitert, Arne On the minimum eccentricity shortest path problem. (English) Zbl 1373.68265 Dehne, Frank (ed.) et al., Algorithms and data structures. 14th international symposium, WADS 2015, Victoria, BC, Canada, August 5–7, 2015. Proceedings. Cham: Springer (ISBN 978-3-319-21839-7/pbk; 978-3-319-21840-3/ebook). Lecture Notes in Computer Science 9214, 276-288 (2015). MSC: 68Q25 05C12 05C69 05C85 68Q17 68W25 PDFBibTeX XMLCite \textit{F. F. Dragan} and \textit{A. Leitert}, Lect. Notes Comput. Sci. 9214, 276--288 (2015; Zbl 1373.68265) Full Text: DOI
Dragan, Feodor F.; Köhler, Ekkehard An approximation algorithm for the tree \(t\)-spanner problem on unweighted graphs via generalized chordal graphs. (English) Zbl 1303.05186 Algorithmica 69, No. 4, 884-905 (2014). MSC: 05C85 68W25 PDFBibTeX XMLCite \textit{F. F. Dragan} and \textit{E. Köhler}, Algorithmica 69, No. 4, 884--905 (2014; Zbl 1303.05186) Full Text: DOI
Dragan, Feodor F.; Abu-Ata, Muad Collective additive tree spanners of bounded tree-breadth graphs with generalizations and consequences. (English) Zbl 1417.68159 Theor. Comput. Sci. 547, 1-17 (2014). MSC: 68R10 05C85 68W25 PDFBibTeX XMLCite \textit{F. F. Dragan} and \textit{M. Abu-Ata}, Theor. Comput. Sci. 547, 1--17 (2014; Zbl 1417.68159) Full Text: DOI
Dragan, Feodor F.; Xiang, Yang How to use spanning trees to navigate in graphs. (English) Zbl 1267.05254 Algorithmica 66, No. 3, 479-511 (2013). MSC: 05C85 05C05 05C12 PDFBibTeX XMLCite \textit{F. F. Dragan} and \textit{Y. Xiang}, Algorithmica 66, No. 3, 479--511 (2013; Zbl 1267.05254) Full Text: DOI
Chepoi, Victor; Dragan, Feodor F.; Estellon, Bertrand; Habib, Michel; Vaxès, Yann; Xiang, Yang Additive spanners and distance and routing labeling schemes for hyperbolic graphs. (English) Zbl 1239.05048 Algorithmica 62, No. 3-4, 713-732 (2012). MSC: 05C12 05C78 20F65 PDFBibTeX XMLCite \textit{V. Chepoi} et al., Algorithmica 62, No. 3--4, 713--732 (2012; Zbl 1239.05048) Full Text: DOI
Xiang, Yang; Jin, Ruoming; Fuhry, David; Dragan, Feodor F. Summarizing transactional databases with overlapped hyperrectangles. (English) Zbl 1235.68068 Data Min. Knowl. Discov. 23, No. 2, 215-251 (2011). MSC: 68P15 68T05 68Q17 PDFBibTeX XMLCite \textit{Y. Xiang} et al., Data Min. Knowl. Discov. 23, No. 2, 215--251 (2011; Zbl 1235.68068) Full Text: DOI
Dragan, Feodor F.; Fomin, Fedor V.; Golovach, Petr A. Spanners in sparse graphs. (English) Zbl 1234.68149 J. Comput. Syst. Sci. 77, No. 6, 1108-1119 (2011). MSC: 68Q25 05C12 05C85 PDFBibTeX XMLCite \textit{F. F. Dragan} et al., J. Comput. Syst. Sci. 77, No. 6, 1108--1119 (2011; Zbl 1234.68149) Full Text: DOI
Dragan, Feodor F.; Köhler, Ekkehard An approximation algorithm for the tree \(t\)-spanner problem on unweighted graphs via generalized chordal graphs. (English) Zbl 1343.05149 Goldberg, Leslie Ann (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 14th international workshop, APPROX 2011, and 15th international workshop, RANDOM 2011, Princeton, NJ, USA, August 17–19, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-22934-3/pbk). Lecture Notes in Computer Science 6845, 171-183 (2011). MSC: 05C85 68W25 68W40 PDFBibTeX XMLCite \textit{F. F. Dragan} and \textit{E. Köhler}, Lect. Notes Comput. Sci. 6845, 171--183 (2011; Zbl 1343.05149) Full Text: DOI
Dragan, Feodor F.; Yan, Chenyu Network flow spanners. (English) Zbl 1202.90054 Networks 56, No. 3, 159-168 (2010). MSC: 90B18 05C85 PDFBibTeX XMLCite \textit{F. F. Dragan} and \textit{C. Yan}, Networks 56, No. 3, 159--168 (2010; Zbl 1202.90054) Full Text: DOI
Dragan, Feodor F.; Yan, Chenyu Collective tree spanners in graphs with bounded parameters. (English) Zbl 1223.05247 Algorithmica 57, No. 1, 22-43 (2010). MSC: 05C75 05C10 05C12 05C70 PDFBibTeX XMLCite \textit{F. F. Dragan} and \textit{C. Yan}, Algorithmica 57, No. 1, 22--43 (2010; Zbl 1223.05247) Full Text: DOI
Dragan, Feodor F.; Corneil, Derek G.; Köhler, Ekkehard; Xiang, Yang Additive spanners for circle graphs and polygonal graphs. (English) Zbl 1202.05024 Broersma, Hajo (ed.) et al., Graph-theoretic concepts in computer science. 34th international workshop, WG 2008, Durham, UK, June 30–July 2, 2008. Revised papers. Berlin: Springer (ISBN 978-3-540-92247-6/pbk). Lecture Notes in Computer Science 5344, 110-121 (2008). MSC: 05C05 05C62 68Q25 PDFBibTeX XMLCite \textit{F. F. Dragan} et al., Lect. Notes Comput. Sci. 5344, 110--121 (2008; Zbl 1202.05024) Full Text: DOI
Dourisboure, Yon; Dragan, Feodor F.; Gavoille, Cyril; Yan, Chenyu Spanners for bounded tree-length graphs. (English) Zbl 1123.68087 Theor. Comput. Sci. 383, No. 1, 34-44 (2007). MSC: 68R10 05C05 05C12 PDFBibTeX XMLCite \textit{Y. Dourisboure} et al., Theor. Comput. Sci. 383, No. 1, 34--44 (2007; Zbl 1123.68087) Full Text: DOI
Chepoi, Victor D.; Dragan, Feodor F.; Yan, Chenyu Additive sparse spanners for graphs with bounded length of largest induced cycle. (English) Zbl 1080.68085 Theor. Comput. Sci. 347, No. 1-2, 54-75 (2005). MSC: 68R10 PDFBibTeX XMLCite \textit{V. D. Chepoi} et al., Theor. Comput. Sci. 347, No. 1--2, 54--75 (2005; Zbl 1080.68085) Full Text: DOI
Brandstädt, Andreas; Dragan, Feodor F.; Le, Hoàng-Oanh; Le, Van Bang Tree spanners on chordal graphs: complexity and algorithms. (English) Zbl 1049.05075 Theor. Comput. Sci. 310, No. 1-3, 329-354 (2004). Reviewer: Haiko Müller (Leeds) MSC: 05C85 05C05 05C12 05C62 68R10 68Q25 PDFBibTeX XMLCite \textit{A. Brandstädt} et al., Theor. Comput. Sci. 310, No. 1--3, 329--354 (2004; Zbl 1049.05075) Full Text: DOI
Corneil, Derek G.; Dragan, Feodor F.; Köhler, Ekkehard On the power of BFS to determine a graph’s diameter. (English) Zbl 1036.68072 Networks 42, No. 4, 209-222 (2003). MSC: 68R10 05C12 PDFBibTeX XMLCite \textit{D. G. Corneil} et al., Networks 42, No. 4, 209--222 (2003; Zbl 1036.68072) Full Text: DOI
Chepoi, Victor; Dragan, Feodor Finding a central vertex in an HHD-free graph. (English) Zbl 1022.05080 Discrete Appl. Math. 131, No. 1, 93-111 (2003). MSC: 05C85 05C12 PDFBibTeX XMLCite \textit{V. Chepoi} and \textit{F. Dragan}, Discrete Appl. Math. 131, No. 1, 93--111 (2003; Zbl 1022.05080) Full Text: DOI
Brandstädt, Andreas; Dragan, Feodor F. On linear and circular structure of (claw, net)-free graphs. (English) Zbl 1032.05095 Discrete Appl. Math. 129, No. 2-3, 285-303 (2003). Reviewer: B.Randerath (Köln) MSC: 05C69 05C75 05C85 PDFBibTeX XMLCite \textit{A. Brandstädt} and \textit{F. F. Dragan}, Discrete Appl. Math. 129, No. 2--3, 285--303 (2003; Zbl 1032.05095) Full Text: DOI
Corneil, Derek G.; Dragan, Feodor F.; Habib, Michel; Paul, Christophe Diameter determination on restricted graph families. (English) Zbl 0990.05119 Discrete Appl. Math. 113, No. 2-3, 143-166 (2001). MSC: 05C90 68R10 PDFBibTeX XMLCite \textit{D. G. Corneil} et al., Discrete Appl. Math. 113, No. 2--3, 143--166 (2001; Zbl 0990.05119) Full Text: DOI
Dragan, Feodor F.; Nicolai, Falk LexBFS-orderings of distance-hereditary graphs with application to the diametral pair problem. (English) Zbl 0940.05024 Discrete Appl. Math. 98, No. 3, 191-207 (2000). Reviewer: H.Müller (Jena) MSC: 05C12 05C85 68R10 PDFBibTeX XMLCite \textit{F. F. Dragan} and \textit{F. Nicolai}, Discrete Appl. Math. 98, No. 3, 191--207 (2000; Zbl 0940.05024) Full Text: DOI
Dragan, Feodor F. Strongly orderable graphs. A common generalization of strongly chordal and chordal bipartite graphs. (English) Zbl 0960.05094 Discrete Appl. Math. 99, No. 1-3, 427-442 (2000). Reviewer: Ekkehard Köhler (Berlin) MSC: 05C85 05C75 68Q25 PDFBibTeX XMLCite \textit{F. F. Dragan}, Discrete Appl. Math. 99, No. 1--3, 427--442 (2000; Zbl 0960.05094) Full Text: DOI
Dragan, Feodor F.; Nicolai, Falk LexBFS-orderings and powers of HHD-free graphs. (English) Zbl 0934.05110 Int. J. Comput. Math. 71, No. 1, 35-56 (1999). Reviewer: Andreas Brandstädt (Rostock) MSC: 05C75 68R10 PDFBibTeX XMLCite \textit{F. F. Dragan} and \textit{F. Nicolai}, Int. J. Comput. Math. 71, No. 1, 35--56 (1999; Zbl 0934.05110) Full Text: DOI
Dragan, Feodor F.; Nicolai, Falk; Brandstädt, Andreas Powers of HHD-free graphs. (English) Zbl 1018.05092 Int. J. Comput. Math. 69, No. 3-4, 217-242 (1998). Reviewer: Van Bang Le (Rostock) MSC: 05C75 PDFBibTeX XMLCite \textit{F. F. Dragan} et al., Int. J. Comput. Math. 69, No. 3--4, 217--242 (1998; Zbl 1018.05092) Full Text: DOI
Brandstädt, Andreas; Chepoi, Victor D.; Dragan, Feodor F. The algorithmic use of hypertree structure and maximum neighbourhood orderings. (English) Zbl 0893.05018 Discrete Appl. Math. 82, No. 1-3, 43-77 (1998). Reviewer: G.Gutin (Odense) MSC: 05C85 05C05 05C35 68R10 68Q25 PDFBibTeX XMLCite \textit{A. Brandstädt} et al., Discrete Appl. Math. 82, No. 1--3, 43--77 (1998; Zbl 0893.05018) Full Text: DOI Link
Brandstädt, Andreas; Dragan, Feodor F.; Nicolai, Falk Homogeneously orderable graphs. (English) Zbl 0903.68136 Theor. Comput. Sci. 172, No. 1-2, 209-232 (1997). MSC: 68R10 PDFBibTeX XMLCite \textit{A. Brandstädt} et al., Theor. Comput. Sci. 172, No. 1--2, 209--232 (1997; Zbl 0903.68136) Full Text: DOI
Brandstädt, Andreas; Dragan, Feodor F.; Nicolai, Falk LexBFS-orderings and powers of chordal graphs. (English) Zbl 0880.05074 Discrete Math. 171, No. 1-3, 27-42 (1997). Reviewer: Ján Plesník (Bratislava) MSC: 05C75 05C85 PDFBibTeX XMLCite \textit{A. Brandstädt} et al., Discrete Math. 171, No. 1--3, 27--42 (1997; Zbl 0880.05074) Full Text: DOI
Brandstädt, Andreas; Chepoi, Victor D.; Dragan, Feodor F. Perfect elimination orderings of chordal powers of graphs. (English) Zbl 0948.05050 Discrete Math. 158, No. 1-3, 273-278 (1996). MSC: 05C99 PDFBibTeX XMLCite \textit{A. Brandstädt} et al., Discrete Math. 158, No. 1--3, 273--278 (1996; Zbl 0948.05050) Full Text: DOI
Dragan, Feodor F.; Voloshin, Vitaly I. Incidence graphs of biacyclic hypergraphs. (English) Zbl 0863.05060 Discrete Appl. Math. 68, No. 3, 259-266 (1996). Reviewer: A.Brandstädt (Rostock) MSC: 05C65 05C75 PDFBibTeX XMLCite \textit{F. F. Dragan} and \textit{V. I. Voloshin}, Discrete Appl. Math. 68, No. 3, 259--266 (1996; Zbl 0863.05060) Full Text: DOI Link
Dragan, Feodor F.; Brandstädt, Andreas \(r\)-dominating cliques in graphs with hypertree structure. (English) Zbl 0870.05038 Discrete Math. 162, No. 1-3, 93-108 (1996). MSC: 05C35 05C85 68R10 PDFBibTeX XMLCite \textit{F. F. Dragan} and \textit{A. Brandstädt}, Discrete Math. 162, No. 1--3, 93--108 (1996; Zbl 0870.05038) Full Text: DOI
Brandstädt, Andreas; Dragan, Feodor F.; Nicolai, Falk Homogeneously orderable graphs and the Steiner tree problem. (English) Zbl 07810381 Nagl, Manfred (ed.), Graph-theoretic concepts in computer science. 21st international workshop, WG ’95, Aachen, Germany, June 20–22, 1995. Proceedings. Berlin: Springer-Verlag. Lect. Notes Comput. Sci. 1017, 381-395 (1995). MSC: 05C75 05C05 05C85 68Q25 PDFBibTeX XMLCite \textit{A. Brandstädt} et al., Lect. Notes Comput. Sci. 1017, 381--395 (1995; Zbl 07810381) Full Text: DOI
Brandstädt, Andreas; Chepoi, Victor D.; Dragan, Feodor F. The algorithmic use of hypertree structure and maximum neighbourhood orderings. (English) Zbl 1528.68277 Mayr, Ernst W. (ed.) et al., Graph-theoretic concepts in computer science. 20th international workshop. WG ’94, Herrsching, Germany, June 16–18, 1994. Proceedings. Berlin: Springer-Verlag. Lect. Notes Comput. Sci. 903, 65-80 (1995). MSC: 68R10 05C85 68Q25 PDFBibTeX XMLCite \textit{A. Brandstädt} et al., Lect. Notes Comput. Sci. 903, 65--80 (1995; Zbl 1528.68277) Full Text: DOI
Chepoi, Victor D.; Dragan, Feodor F. On Condorcet and median points of simple rectilinear polygons (extended abstract). (English) Zbl 1508.68383 Reichel, Horst (ed.), Fundamentals of computation theory. 10th international conference, FCT’95, Dresden, Germany, August 22–25, 1995. Proceedings. Berlin: Springer-Verlag. Lect. Notes Comput. Sci. 965, 181-190 (1995). MSC: 68U05 PDFBibTeX XMLCite \textit{V. D. Chepoi} and \textit{F. F. Dragan}, Lect. Notes Comput. Sci. 965, 181--190 (1995; Zbl 1508.68383) Full Text: DOI
Brandstädt, Andreas; Dragan, Feodor F.; Chepoi, Victor D.; Voloshin, Vitaly I. Dually chordal graphs. (English) Zbl 1528.68278 van Leeuwen, Jan (ed.), WG ’93. Graph-theoretic concepts in computer science, 19th international workshop, Utrecht, the Netherlands, June 16–18, 1993. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 790, 237-251 (1994). MSC: 68R10 05C65 05C75 68P15 PDFBibTeX XMLCite \textit{A. Brandstädt} et al., Lect. Notes Comput. Sci. 790, 237--251 (1994; Zbl 1528.68278) Full Text: DOI
Dragan, Feodor F. Dominating cliques in distance-hereditary graphs. (English) Zbl 1502.05233 Schmidt, Erik M. (ed.) et al., Algorithm theory – SWAT ’94. 4th Scandinavian workshop on algorithm theory, Aarhus, Denmark, July 6–8, 1994. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 824, 370-381 (1994). MSC: 05C85 05C69 05C70 68W40 PDFBibTeX XMLCite \textit{F. F. Dragan}, Lect. Notes Comput. Sci. 824, 370--381 (1994; Zbl 1502.05233) Full Text: DOI
Chepoi, Victor; Dragan, Feodor Computing a median point of a simple rectilinear polygon. (English) Zbl 0803.68133 Inf. Process. Lett. 49, No. 6, 281-285 (1994). MSC: 68U05 68Q25 PDFBibTeX XMLCite \textit{V. Chepoi} and \textit{F. Dragan}, Inf. Process. Lett. 49, No. 6, 281--285 (1994; Zbl 0803.68133) Full Text: DOI