Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Feodor F. Dragan
@inproceedings{DBLP:conf/wg/DraganD23,
author = {Feodor F. Dragan and
Guillaume Ducoffe},
editor = {Dani{\"{e}}l Paulusma and
Bernard Ries},
title = {{\(\alpha\)} \({}_{\mbox{i}}\)-Metric Graphs: Radius, Diameter and
all Eccentricities},
booktitle = {Graph-Theoretic Concepts in Computer Science - 49th International
Workshop, {WG} 2023, Fribourg, Switzerland, June 28-30, 2023, Revised
Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {14093},
pages = {276--290},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-43380-1\_20},
doi = {10.1007/978-3-031-43380-1\_20},
timestamp = {Wed, 27 Sep 2023 09:00:02 +0200},
biburl = {https://dblp.org/rec/conf/wg/DraganD23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2305-02545,
author = {Feodor F. Dragan and
Guillaume Ducoffe},
title = {{\(\alpha\)}\({}_{\mbox{i}}\)-Metric Graphs: Radius, Diameter and
all Eccentricities},
journal = {CoRR},
volume = {abs/2305.02545},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2305.02545},
doi = {10.48550/ARXIV.2305.02545},
eprinttype = {arXiv},
eprint = {2305.02545},
timestamp = {Wed, 10 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2305-02545.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/GuarneraDL22,
author = {Heather M. Guarnera and
Feodor F. Dragan and
Arne Leitert},
title = {Injective Hulls of Various Graph Classes},
journal = {Graphs Comb.},
volume = {38},
number = {4},
pages = {112},
year = {2022},
url = {https://doi.org/10.1007/s00373-022-02512-z},
doi = {10.1007/S00373-022-02512-Z},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/GuarneraDL22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/ChalopinCDDMV21,
author = {J{\'{e}}r{\'{e}}mie Chalopin and
Victor Chepoi and
Feodor F. Dragan and
Guillaume Ducoffe and
Abdulhakeem Mohammed and
Yann Vax{\`{e}}s},
title = {Fast Approximation and Exact Computation of Negative Curvature Parameters
of Graphs},
journal = {Discret. Comput. Geom.},
volume = {65},
number = {3},
pages = {856--892},
year = {2021},
url = {https://doi.org/10.1007/s00454-019-00107-9},
doi = {10.1007/S00454-019-00107-9},
timestamp = {Tue, 23 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dcg/ChalopinCDDMV21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/DucoffeD21,
author = {Guillaume Ducoffe and
Feodor F. Dragan},
title = {A story of diameter, radius, and (almost) Helly property},
journal = {Networks},
volume = {77},
number = {3},
pages = {435--453},
year = {2021},
url = {https://doi.org/10.1002/net.21998},
doi = {10.1002/NET.21998},
timestamp = {Wed, 07 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/DucoffeD21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DraganG21,
author = {Feodor F. Dragan and
Heather M. Guarnera},
title = {Helly-gap of a graph and vertex eccentricities},
journal = {Theor. Comput. Sci.},
volume = {867},
pages = {68--84},
year = {2021},
url = {https://doi.org/10.1016/j.tcs.2021.03.022},
doi = {10.1016/J.TCS.2021.03.022},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/DraganG21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/complexnetworks/MohammedDG21,
author = {Abdulhakeem Othman Mohammed and
Feodor F. Dragan and
Heather M. Guarnera},
editor = {Rosa Mar{\'{\i}}a Benito and
Chantal Cherifi and
Hocine Cherifi and
Esteban Moro and
Luis M. Rocha and
Marta Sales{-}Pardo},
title = {Fellow Travelers Phenomenon Present in Real-World Networks},
booktitle = {Complex Networks {\&} Their Applications {X} - Volume 1, Proceedings
of the Tenth International Conference on Complex Networks and Their
Applications {COMPLEX} {NETWORKS} 2021, Madrid, Spain, November 30
- December 2, 2021},
series = {Studies in Computational Intelligence},
volume = {1015},
pages = {194--206},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-93409-5\_17},
doi = {10.1007/978-3-030-93409-5\_17},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/complexnetworks/MohammedDG21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/DraganDG21,
author = {Feodor F. Dragan and
Guillaume Ducoffe and
Heather M. Guarnera},
editor = {Anna Lubiw and
Mohammad R. Salavatipour},
title = {Fast Deterministic Algorithms for Computing All Eccentricities in
(Hyperbolic) Helly Graphs},
booktitle = {Algorithms and Data Structures - 17th International Symposium, {WADS}
2021, Virtual Event, August 9-11, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12808},
pages = {300--314},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-83508-8\_22},
doi = {10.1007/978-3-030-83508-8\_22},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/wads/DraganDG21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2102-08349,
author = {Feodor F. Dragan and
Guillaume Ducoffe and
Heather M. Guarnera},
title = {Fast deterministic algorithms for computing all eccentricities in
(hyperbolic) Helly graphs},
journal = {CoRR},
volume = {abs/2102.08349},
year = {2021},
url = {https://arxiv.org/abs/2102.08349},
eprinttype = {arXiv},
eprint = {2102.08349},
timestamp = {Fri, 19 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2102-08349.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Dragan20,
author = {Feodor F. Dragan},
title = {An eccentricity 2-approximating spanning tree of a chordal graph is
computable in linear time},
journal = {Inf. Process. Lett.},
volume = {154},
year = {2020},
url = {https://doi.org/10.1016/j.ipl.2019.105873},
doi = {10.1016/J.IPL.2019.105873},
timestamp = {Mon, 16 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Dragan20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/DraganG20,
author = {Feodor F. Dragan and
Heather M. Guarnera},
title = {Eccentricity terrain of \emph{{\(\delta\)}}-hyperbolic graphs},
journal = {J. Comput. Syst. Sci.},
volume = {112},
pages = {50--65},
year = {2020},
url = {https://doi.org/10.1016/j.jcss.2020.03.004},
doi = {10.1016/J.JCSS.2020.03.004},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/DraganG20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DraganG20,
author = {Feodor F. Dragan and
Heather M. Guarnera},
title = {Eccentricity function in distance-hereditary graphs},
journal = {Theor. Comput. Sci.},
volume = {833},
pages = {26--40},
year = {2020},
url = {https://doi.org/10.1016/j.tcs.2020.05.004},
doi = {10.1016/J.TCS.2020.05.004},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/DraganG20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ics/JinPWDAR20,
author = {Ruoming Jin and
Zhen Peng and
Wendell Wu and
Feodor F. Dragan and
Gagan Agrawal and
Bin Ren},
editor = {Eduard Ayguad{\'{e}} and
Wen{-}mei W. Hwu and
Rosa M. Badia and
H. Peter Hofstee},
title = {Parallelizing pruned landmark labeling: dealing with dependencies
in graph algorithms},
booktitle = {{ICS} '20: 2020 International Conference on Supercomputing, Barcelona
Spain, June, 2020},
pages = {11:1--11:13},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3392717.3392745},
doi = {10.1145/3392717.3392745},
timestamp = {Wed, 15 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ics/JinPWDAR20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2002-08495,
author = {Feodor F. Dragan and
Heather M. Guarnera},
title = {Eccentricity terrain of {\(\delta\)}-hyperbolic graphs},
journal = {CoRR},
volume = {abs/2002.08495},
year = {2020},
url = {https://arxiv.org/abs/2002.08495},
eprinttype = {arXiv},
eprint = {2002.08495},
timestamp = {Mon, 02 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2002-08495.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2005-01921,
author = {Feodor F. Dragan and
Heather M. Guarnera},
title = {Helly-gap of a graph and vertex eccentricities},
journal = {CoRR},
volume = {abs/2005.01921},
year = {2020},
url = {https://arxiv.org/abs/2005.01921},
eprinttype = {arXiv},
eprint = {2005.01921},
timestamp = {Fri, 08 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2005-01921.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2007-14377,
author = {Heather M. Guarnera and
Feodor F. Dragan and
Arne Leitert},
title = {Injective hulls of various graph classes},
journal = {CoRR},
volume = {abs/2007.14377},
year = {2020},
url = {https://arxiv.org/abs/2007.14377},
eprinttype = {arXiv},
eprint = {2007.14377},
timestamp = {Mon, 03 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2007-14377.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/DraganG19,
author = {Feodor F. Dragan and
Heather M. Guarnera},
title = {Obstructions to a small hyperbolicity in Helly graphs},
journal = {Discret. Math.},
volume = {342},
number = {2},
pages = {326--338},
year = {2019},
url = {https://doi.org/10.1016/j.disc.2018.10.017},
doi = {10.1016/J.DISC.2018.10.017},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/DraganG19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmtcs/DraganM19,
author = {Feodor F. Dragan and
Abdulhakeem Mohammed},
title = {Slimness of graphs},
journal = {Discret. Math. Theor. Comput. Sci.},
volume = {21},
number = {3},
year = {2019},
url = {https://doi.org/10.23638/DMTCS-21-3-10},
doi = {10.23638/DMTCS-21-3-10},
timestamp = {Tue, 24 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dmtcs/DraganM19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/ChepoiDHVA19,
author = {Victor Chepoi and
Feodor F. Dragan and
Michel Habib and
Yann Vax{\`{e}}s and
Hend Alrasheed},
title = {Fast approximation of eccentricities and distances in hyperbolic graphs},
journal = {J. Graph Algorithms Appl.},
volume = {23},
number = {2},
pages = {393--433},
year = {2019},
url = {https://doi.org/10.7155/jgaa.00496},
doi = {10.7155/JGAA.00496},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/ChepoiDHVA19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/LeitertD19,
author = {Arne Leitert and
Feodor F. Dragan},
title = {Parameterized approximation algorithms for some location problems
in graphs},
journal = {Theor. Comput. Sci.},
volume = {755},
pages = {48--64},
year = {2019},
url = {https://doi.org/10.1016/j.tcs.2018.06.049},
doi = {10.1016/J.TCS.2018.06.049},
timestamp = {Fri, 04 Jan 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/LeitertD19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1906-12018,
author = {Ruoming Jin and
Zhen Peng and
Wendell Wu and
Feodor F. Dragan and
Gagan Agrawal and
Bin Ren},
title = {Pruned Landmark Labeling Meets Vertex Centric Computation: {A} Surprisingly
Happy Marriage!},
journal = {CoRR},
volume = {abs/1906.12018},
year = {2019},
url = {http://arxiv.org/abs/1906.12018},
eprinttype = {arXiv},
eprint = {1906.12018},
timestamp = {Mon, 01 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1906-12018.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1907-05445,
author = {Feodor F. Dragan and
Heather M. Guarnera},
title = {Eccentricity function in distance-hereditary graphs},
journal = {CoRR},
volume = {abs/1907.05445},
year = {2019},
url = {http://arxiv.org/abs/1907.05445},
eprinttype = {arXiv},
eprint = {1907.05445},
timestamp = {Wed, 17 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1907-05445.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1910-10412,
author = {Feodor F. Dragan and
Guillaume Ducoffe},
title = {A story of diameter, radius and Helly property},
journal = {CoRR},
volume = {abs/1910.10412},
year = {2019},
url = {http://arxiv.org/abs/1910.10412},
eprinttype = {arXiv},
eprint = {1910.10412},
timestamp = {Fri, 25 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1910-10412.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoa/ChepoiDHVA18,
author = {Victor Chepoi and
Feodor F. Dragan and
Michel Habib and
Yann Vax{\`{e}}s and
Hend Alrasheed},
editor = {Donghyun Kim and
R. N. Uma and
Alexander Zelikovsky},
title = {Fast Approximation of Centrality and Distances in Hyperbolic Graphs},
booktitle = {Combinatorial Optimization and Applications - 12th International Conference,
{COCOA} 2018, Atlanta, GA, USA, December 15-17, 2018, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11346},
pages = {3--18},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-030-04651-4\_1},
doi = {10.1007/978-3-030-04651-4\_1},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cocoa/ChepoiDHVA18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/ChalopinCDDMV18,
author = {J{\'{e}}r{\'{e}}mie Chalopin and
Victor Chepoi and
Feodor F. Dragan and
Guillaume Ducoffe and
Abdulhakeem Mohammed and
Yann Vax{\`{e}}s},
editor = {Bettina Speckmann and
Csaba D. T{\'{o}}th},
title = {Fast Approximation and Exact Computation of Negative Curvature Parameters
of Graphs},
booktitle = {34th International Symposium on Computational Geometry, SoCG 2018,
June 11-14, 2018, Budapest, Hungary},
series = {LIPIcs},
volume = {99},
pages = {22:1--22:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.SoCG.2018.22},
doi = {10.4230/LIPICS.SOCG.2018.22},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/ChalopinCDDMV18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1803-04660,
author = {Feodor F. Dragan and
Michel Habib and
Laurent Viennot},
title = {Revisiting Radius, Diameter, and all Eccentricity Computation in Graphs
through Certificates},
journal = {CoRR},
volume = {abs/1803.04660},
year = {2018},
url = {http://arxiv.org/abs/1803.04660},
eprinttype = {arXiv},
eprint = {1803.04660},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1803-04660.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1803-06324,
author = {J{\'{e}}r{\'{e}}mie Chalopin and
Victor Chepoi and
Feodor F. Dragan and
Guillaume Ducoffe and
Abdulhakeem Mohammed and
Yann Vax{\`{e}}s},
title = {Fast approximation and exact computation of negative curvature parameters
of graphs},
journal = {CoRR},
volume = {abs/1803.06324},
year = {2018},
url = {http://arxiv.org/abs/1803.06324},
eprinttype = {arXiv},
eprint = {1803.06324},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1803-06324.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1805-07232,
author = {Victor Chepoi and
Feodor F. Dragan and
Michel Habib and
Yann Vax{\`{e}}s and
Hend Al{-}Rasheed},
title = {Fast approximation of centrality and distances in hyperbolic graphs},
journal = {CoRR},
volume = {abs/1805.07232},
year = {2018},
url = {http://arxiv.org/abs/1805.07232},
eprinttype = {arXiv},
eprint = {1805.07232},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1805-07232.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DraganKL17,
author = {Feodor F. Dragan and
Ekkehard K{\"{o}}hler and
Arne Leitert},
title = {Line-Distortion, Bandwidth and Path-Length of a Graph},
journal = {Algorithmica},
volume = {77},
number = {3},
pages = {686--713},
year = {2017},
url = {https://doi.org/10.1007/s00453-015-0094-7},
doi = {10.1007/S00453-015-0094-7},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/DraganKL17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/DraganKL17,
author = {Feodor F. Dragan and
Dieter Kratsch and
Van Bang Le},
title = {Preface: Special graph classes and algorithms-in honor of Professor
Andreas Brandst{\"{a}}dt on the occasion of his 65th birthday},
journal = {Discret. Appl. Math.},
volume = {216},
pages = {1},
year = {2017},
url = {https://doi.org/10.1016/j.dam.2016.08.009},
doi = {10.1016/J.DAM.2016.08.009},
timestamp = {Sun, 22 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/DraganKL17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/DraganKA17,
author = {Feodor F. Dragan and
Ekkehard K{\"{o}}hler and
Hend Alrasheed},
title = {Eccentricity approximating trees},
journal = {Discret. Appl. Math.},
volume = {232},
pages = {142--156},
year = {2017},
url = {https://doi.org/10.1016/j.dam.2017.07.017},
doi = {10.1016/J.DAM.2017.07.017},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/DraganKA17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DraganL17,
author = {Feodor F. Dragan and
Arne Leitert},
title = {On the minimum eccentricity shortest path problem},
journal = {Theor. Comput. Sci.},
volume = {694},
pages = {66--78},
year = {2017},
url = {https://doi.org/10.1016/j.tcs.2017.07.004},
doi = {10.1016/J.TCS.2017.07.004},
timestamp = {Thu, 21 Sep 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/DraganL17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoa/LeitertD17,
author = {Arne Leitert and
Feodor F. Dragan},
editor = {Xiaofeng Gao and
Hongwei Du and
Meng Han},
title = {Parameterized Approximation Algorithms for Some Location Problems
in Graphs},
booktitle = {Combinatorial Optimization and Applications - 11th International Conference,
{COCOA} 2017, Shanghai, China, December 16-18, 2017, Proceedings,
Part {II}},
series = {Lecture Notes in Computer Science},
volume = {10628},
pages = {348--361},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-71147-8\_24},
doi = {10.1007/978-3-319-71147-8\_24},
timestamp = {Tue, 14 Jun 2022 14:15:49 +0200},
biburl = {https://dblp.org/rec/conf/cocoa/LeitertD17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ChepoiDV17,
author = {Victor Chepoi and
Feodor F. Dragan and
Yann Vax{\`{e}}s},
editor = {Philip N. Klein},
title = {Core congestion is inherent in hyperbolic networks},
booktitle = {Proceedings of the Twenty-Eighth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2017, Barcelona, Spain, Hotel Porta Fira, January
16-19},
pages = {2264--2279},
publisher = {{SIAM}},
year = {2017},
url = {https://doi.org/10.1137/1.9781611974782.149},
doi = {10.1137/1.9781611974782.149},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/ChepoiDV17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/DraganM17,
author = {Feodor F. Dragan and
Abdulhakeem Mohammed},
title = {Slimness of graphs},
journal = {CoRR},
volume = {abs/1705.09797},
year = {2017},
url = {http://arxiv.org/abs/1705.09797},
eprinttype = {arXiv},
eprint = {1705.09797},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/DraganM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/LeitertD17,
author = {Arne Leitert and
Feodor F. Dragan},
title = {Parameterized Approximation Algorithms for some Location Problems
in Graphs},
journal = {CoRR},
volume = {abs/1706.07475},
year = {2017},
url = {http://arxiv.org/abs/1706.07475},
eprinttype = {arXiv},
eprint = {1706.07475},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/LeitertD17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1709-02837,
author = {Feodor F. Dragan and
Heather M. Guarnera},
title = {Obstructions to a small hyperbolicity in Helly graphs},
journal = {CoRR},
volume = {abs/1709.02837},
year = {2017},
url = {http://arxiv.org/abs/1709.02837},
eprinttype = {arXiv},
eprint = {1709.02837},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1709-02837.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/DraganL16,
author = {Feodor F. Dragan and
Arne Leitert},
title = {Minimum Eccentricity Shortest Paths in some Structured Graph Classes},
journal = {J. Graph Algorithms Appl.},
volume = {20},
number = {2},
pages = {299--322},
year = {2016},
url = {https://doi.org/10.7155/jgaa.00394},
doi = {10.7155/JGAA.00394},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/DraganL16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Abu-AtaD16,
author = {Muad Abu{-}Ata and
Feodor F. Dragan},
title = {Metric tree-like structures in real-world networks: an empirical study},
journal = {Networks},
volume = {67},
number = {1},
pages = {49--68},
year = {2016},
url = {https://doi.org/10.1002/net.21631},
doi = {10.1002/NET.21631},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Abu-AtaD16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoa/LeitertD16,
author = {Arne Leitert and
Feodor F. Dragan},
editor = {T.{-}H. Hubert Chan and
Minming Li and
Lusheng Wang},
title = {On Strong Tree-Breadth},
booktitle = {Combinatorial Optimization and Applications - 10th International Conference,
{COCOA} 2016, Hong Kong, China, December 16-18, 2016, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10043},
pages = {62--76},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-319-48749-6\_5},
doi = {10.1007/978-3-319-48749-6\_5},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/cocoa/LeitertD16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/complenet/AlrasheedD16,
author = {Hend Alrasheed and
Feodor F. Dragan},
editor = {Hocine Cherifi and
Bruno Gon{\c{c}}alves and
Ronaldo Menezes and
Roberta Sinatra},
title = {The Network of Genetic Admixture in Humans},
booktitle = {Complex Networks {VII} - Proceedings of the 7th Workshop on Complex
Networks, CompleNet 2016, Dijon, France, March 23-25, 2016},
series = {Studies in Computational Intelligence},
volume = {644},
pages = {243--256},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-319-30569-1\_18},
doi = {10.1007/978-3-319-30569-1\_18},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/complenet/AlrasheedD16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/DraganKA16,
author = {Feodor F. Dragan and
Ekkehard K{\"{o}}hler and
Hend Alrasheed},
editor = {Pinar Heggernes},
title = {Eccentricity Approximating Trees - Extended Abstract},
booktitle = {Graph-Theoretic Concepts in Computer Science - 42nd International
Workshop, {WG} 2016, Istanbul, Turkey, June 22-24, 2016, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {9941},
pages = {145--157},
year = {2016},
url = {https://doi.org/10.1007/978-3-662-53536-3\_13},
doi = {10.1007/978-3-662-53536-3\_13},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/DraganKA16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/ChepoiDV16,
author = {Victor Chepoi and
Feodor F. Dragan and
Yann Vax{\`{e}}s},
title = {Core congestion is inherent in hyperbolic networks},
journal = {CoRR},
volume = {abs/1605.03059},
year = {2016},
url = {http://arxiv.org/abs/1605.03059},
eprinttype = {arXiv},
eprint = {1605.03059},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/ChepoiDV16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/complenet/AlrasheedD15,
author = {Hend Alrasheed and
Feodor F. Dragan},
editor = {Giuseppe Mangioni and
Filippo Simini and
Stephen Miles Uzzo and
Dashun Wang},
title = {Core-Periphery Models for Graphs Based on their {\(\delta\)}-Hyperbolicity:
An Example Using Biological Networks},
booktitle = {Complex Networks {VI} - Proceedings of the 6th Workshop on Complex
Networks CompleNet 2015, New York City, USA, March 25-27, 2015},
series = {Studies in Computational Intelligence},
volume = {597},
pages = {65--77},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-16112-9\_7},
doi = {10.1007/978-3-319-16112-9\_7},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/complenet/AlrasheedD15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/DraganL15,
author = {Feodor F. Dragan and
Arne Leitert},
editor = {Frank Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Ulrike Stege},
title = {On the Minimum Eccentricity Shortest Path Problem},
booktitle = {Algorithms and Data Structures - 14th International Symposium, {WADS}
2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9214},
pages = {276--288},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-21840-3\_23},
doi = {10.1007/978-3-319-21840-3\_23},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/wads/DraganL15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/DraganL15,
author = {Feodor F. Dragan and
Arne Leitert},
editor = {Ernst W. Mayr},
title = {Minimum Eccentricity Shortest Paths in Some Structured Graph Classes},
booktitle = {Graph-Theoretic Concepts in Computer Science - 41st International
Workshop, {WG} 2015, Garching, Germany, June 17-19, 2015, Revised
Papers},
series = {Lecture Notes in Computer Science},
volume = {9224},
pages = {189--202},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-662-53174-7\_14},
doi = {10.1007/978-3-662-53174-7\_14},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/DraganL15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/DraganL15,
author = {Feodor F. Dragan and
Arne Leitert},
title = {Minimum Eccentricity Shortest Paths in some Structured Graph Classes},
journal = {CoRR},
volume = {abs/1511.05109},
year = {2015},
url = {http://arxiv.org/abs/1511.05109},
eprinttype = {arXiv},
eprint = {1511.05109},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/DraganL15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DraganK14,
author = {Feodor F. Dragan and
Ekkehard K{\"{o}}hler},
title = {An Approximation Algorithm for the Tree t-Spanner Problem on Unweighted
Graphs via Generalized Chordal Graphs},
journal = {Algorithmica},
volume = {69},
number = {4},
pages = {884--905},
year = {2014},
url = {https://doi.org/10.1007/s00453-013-9765-4},
doi = {10.1007/S00453-013-9765-4},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/DraganK14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DraganA14,
author = {Feodor F. Dragan and
Muad Abu{-}Ata},
title = {Collective additive tree spanners of bounded tree-breadth graphs with
generalizations and consequences},
journal = {Theor. Comput. Sci.},
volume = {547},
pages = {1--17},
year = {2014},
url = {https://doi.org/10.1016/j.tcs.2014.06.007},
doi = {10.1016/J.TCS.2014.06.007},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/DraganA14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/DraganKL14,
author = {Feodor F. Dragan and
Ekkehard K{\"{o}}hler and
Arne Leitert},
editor = {R. Ravi and
Inge Li G{\o}rtz},
title = {Line-Distortion, Bandwidth and Path-Length of a Graph},
booktitle = {Algorithm Theory - {SWAT} 2014 - 14th Scandinavian Symposium and Workshops,
Copenhagen, Denmark, July 2-4, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8503},
pages = {158--169},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-08404-6\_14},
doi = {10.1007/978-3-319-08404-6\_14},
timestamp = {Sun, 02 Jun 2019 21:15:18 +0200},
biburl = {https://dblp.org/rec/conf/swat/DraganKL14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Abu-AtaD14,
author = {Muad Abu{-}Ata and
Feodor F. Dragan},
title = {Metric tree-like structures in real-life networks: an empirical study},
journal = {CoRR},
volume = {abs/1402.3364},
year = {2014},
url = {http://arxiv.org/abs/1402.3364},
eprinttype = {arXiv},
eprint = {1402.3364},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Abu-AtaD14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/DraganKL14,
author = {Feodor F. Dragan and
Ekkehard K{\"{o}}hler and
Arne Leitert},
title = {Line-distortion, Bandwidth and Path-length of a graph},
journal = {CoRR},
volume = {abs/1409.8389},
year = {2014},
url = {http://arxiv.org/abs/1409.8389},
eprinttype = {arXiv},
eprint = {1409.8389},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/DraganKL14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DraganX13,
author = {Feodor F. Dragan and
Yang Xiang},
title = {How to Use Spanning Trees to Navigate in Graphs},
journal = {Algorithmica},
volume = {66},
number = {3},
pages = {479--511},
year = {2013},
url = {https://doi.org/10.1007/s00453-012-9647-1},
doi = {10.1007/S00453-012-9647-1},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/DraganX13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sofsem/DraganA13,
author = {Feodor F. Dragan and
Muad Abu{-}Ata},
editor = {Peter van Emde Boas and
Frans C. A. Groen and
Giuseppe F. Italiano and
Jerzy R. Nawrocki and
Harald Sack},
title = {Collective Additive Tree Spanners of Bounded Tree-Breadth Graphs with
Generalizations and Consequences},
booktitle = {{SOFSEM} 2013: Theory and Practice of Computer Science, 39th International
Conference on Current Trends in Theory and Practice of Computer Science,
{\v{S}}pindler{\r{u}}v Ml{\'{y}}n, Czech Republic, January 26-31,
2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7741},
pages = {194--206},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-35843-2\_18},
doi = {10.1007/978-3-642-35843-2\_18},
timestamp = {Mon, 28 Aug 2023 21:17:48 +0200},
biburl = {https://dblp.org/rec/conf/sofsem/DraganA13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/Dragan13,
author = {Feodor F. Dragan},
editor = {Andreas Brandst{\"{a}}dt and
Klaus Jansen and
R{\"{u}}diger Reischuk},
title = {Tree-Like Structures in Graphs: {A} Metric Point of View},
booktitle = {Graph-Theoretic Concepts in Computer Science - 39th International
Workshop, {WG} 2013, L{\"{u}}beck, Germany, June 19-21, 2013,
Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {8165},
pages = {1--4},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-45043-3\_1},
doi = {10.1007/978-3-642-45043-3\_1},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/Dragan13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ChepoiDEHVX12,
author = {Victor Chepoi and
Feodor F. Dragan and
Bertrand Estellon and
Michel Habib and
Yann Vax{\`{e}}s and
Yang Xiang},
title = {Additive Spanners and Distance and Routing Labeling Schemes for Hyperbolic
Graphs},
journal = {Algorithmica},
volume = {62},
number = {3-4},
pages = {713--732},
year = {2012},
url = {https://doi.org/10.1007/s00453-010-9478-x},
doi = {10.1007/S00453-010-9478-X},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/ChepoiDEHVX12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/YanXD12,
author = {Chenyu Yan and
Yang Xiang and
Feodor F. Dragan},
title = {Compact and low delay routing labeling scheme for Unit Disk Graphs},
journal = {Comput. Geom.},
volume = {45},
number = {7},
pages = {305--325},
year = {2012},
url = {https://doi.org/10.1016/j.comgeo.2012.01.015},
doi = {10.1016/J.COMGEO.2012.01.015},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comgeo/YanXD12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/DraganCKX12,
author = {Feodor F. Dragan and
Derek G. Corneil and
Ekkehard K{\"{o}}hler and
Yang Xiang},
title = {Collective additive tree spanners for circle graphs and polygonal
graphs},
journal = {Discret. Appl. Math.},
volume = {160},
number = {12},
pages = {1717--1729},
year = {2012},
url = {https://doi.org/10.1016/j.dam.2012.03.036},
doi = {10.1016/J.DAM.2012.03.036},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/DraganCKX12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/ChepoiDNRV12,
author = {Victor Chepoi and
Feodor F. Dragan and
Ilan Newman and
Yuri Rabinovich and
Yann Vax{\`{e}}s},
title = {Constant Approximation Algorithms for Embedding Graph Metrics into
Trees and Outerplanar Graphs},
journal = {Discret. Comput. Geom.},
volume = {47},
number = {1},
pages = {187--214},
year = {2012},
url = {https://doi.org/10.1007/s00454-011-9386-0},
doi = {10.1007/S00454-011-9386-0},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dcg/ChepoiDNRV12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1207-2506,
author = {Feodor F. Dragan and
Muad Abu{-}Ata},
title = {Collective Additive Tree Spanners of Bounded Tree-Breadth Graphs with
Generalizations and Consequences},
journal = {CoRR},
volume = {abs/1207.2506},
year = {2012},
url = {http://arxiv.org/abs/1207.2506},
eprinttype = {arXiv},
eprint = {1207.2506},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1207-2506.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/datamine/XiangJFD11,
author = {Yang Xiang and
Ruoming Jin and
David Fuhry and
Feodor F. Dragan},
title = {Summarizing transactional databases with overlapped hyperrectangles},
journal = {Data Min. Knowl. Discov.},
volume = {23},
number = {2},
pages = {215--251},
year = {2011},
url = {https://doi.org/10.1007/s10618-010-0203-9},
doi = {10.1007/S10618-010-0203-9},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/datamine/XiangJFD11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/DraganFG11,
author = {Feodor F. Dragan and
Fedor V. Fomin and
Petr A. Golovach},
title = {Spanners in sparse graphs},
journal = {J. Comput. Syst. Sci.},
volume = {77},
number = {6},
pages = {1108--1119},
year = {2011},
url = {https://doi.org/10.1016/j.jcss.2010.10.002},
doi = {10.1016/J.JCSS.2010.10.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/DraganFG11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/DraganM11,
author = {Feodor F. Dragan and
Mart{\'{\i}}n Matamala},
title = {Navigating in a Graph by Aid of Its Spanning Tree Metric},
journal = {{SIAM} J. Discret. Math.},
volume = {25},
number = {1},
pages = {306--332},
year = {2011},
url = {https://doi.org/10.1137/090761549},
doi = {10.1137/090761549},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/DraganM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DraganFG11,
author = {Feodor F. Dragan and
Fedor V. Fomin and
Petr A. Golovach},
title = {Approximation of minimum weight spanners for sparse graphs},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {8-10},
pages = {846--852},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.11.034},
doi = {10.1016/J.TCS.2010.11.034},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/DraganFG11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/DraganK11,
author = {Feodor F. Dragan and
Ekkehard K{\"{o}}hler},
editor = {Leslie Ann Goldberg and
Klaus Jansen and
R. Ravi and
Jos{\'{e}} D. P. Rolim},
title = {An Approximation Algorithm for the Tree t-Spanner Problem on Unweighted
Graphs via Generalized Chordal Graphs},
booktitle = {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},
series = {Lecture Notes in Computer Science},
volume = {6845},
pages = {171--183},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22935-0\_15},
doi = {10.1007/978-3-642-22935-0\_15},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/DraganK11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DraganY10,
author = {Feodor F. Dragan and
Chenyu Yan},
title = {Collective Tree Spanners in Graphs with Bounded Parameters},
journal = {Algorithmica},
volume = {57},
number = {1},
pages = {22--43},
year = {2010},
url = {https://doi.org/10.1007/s00453-008-9194-y},
doi = {10.1007/S00453-008-9194-Y},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/DraganY10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/DraganY10,
author = {Feodor F. Dragan and
Chenyu Yan},
title = {Network flow spanners},
journal = {Networks},
volume = {56},
number = {3},
pages = {159--168},
year = {2010},
url = {https://doi.org/10.1002/net.20357},
doi = {10.1002/NET.20357},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/DraganY10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/ChepoiDNRV10,
author = {Victor Chepoi and
Feodor F. Dragan and
Ilan Newman and
Yuri Rabinovich and
Yann Vax{\`{e}}s},
editor = {Maria J. Serna and
Ronen Shaltiel and
Klaus Jansen and
Jos{\'{e}} D. P. Rolim},
title = {Constant Approximation Algorithms for Embedding Graph Metrics into
Trees and Outerplanar Graphs},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, 13th International Workshop, {APPROX} 2010, and 14th
International Workshop, {RANDOM} 2010, Barcelona, Spain, September
1-3, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6302},
pages = {95--109},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-15369-3\_8},
doi = {10.1007/978-3-642-15369-3\_8},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/ChepoiDNRV10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoa/BuschDS10,
author = {Arthur H. Busch and
Feodor F. Dragan and
R. Sritharan},
editor = {Weili Wu and
Ovidiu Daescu},
title = {New Min-Max Theorems for Weakly Chordal and Dually Chordal Graphs},
booktitle = {Combinatorial Optimization and Applications - 4th International Conference,
{COCOA} 2010, Kailua-Kona, HI, USA, December 18-20, 2010, Proceedings,
Part {II}},
series = {Lecture Notes in Computer Science},
volume = {6509},
pages = {207--218},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-17461-2\_17},
doi = {10.1007/978-3-642-17461-2\_17},
timestamp = {Thu, 02 Dec 2021 16:45:00 +0100},
biburl = {https://dblp.org/rec/conf/cocoa/BuschDS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1007-0489,
author = {Victor Chepoi and
Feodor F. Dragan and
Ilan Newman and
Yuri Rabinovich and
Yann Vax{\`{e}}s},
title = {Constant approximation algorithms for embedding graph metrics into
trees and outerplanar graphs},
journal = {CoRR},
volume = {abs/1007.0489},
year = {2010},
url = {http://arxiv.org/abs/1007.0489},
eprinttype = {arXiv},
eprint = {1007.0489},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1007-0489.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/DraganXY09,
author = {Feodor F. Dragan and
Yang Xiang and
Chenyu Yan},
title = {Collective Tree Spanners for Unit Disk Graphs with Applications},
journal = {Electron. Notes Discret. Math.},
volume = {32},
pages = {117--124},
year = {2009},
url = {https://doi.org/10.1016/j.endm.2009.02.016},
doi = {10.1016/J.ENDM.2009.02.016},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/DraganXY09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jnw/BreitbartDG09,
author = {Yuri Breitbart and
Feodor F. Dragan and
Hassan Gobjuka},
title = {Effective Monitor Placement in Internet Networks},
journal = {J. Networks},
volume = {4},
number = {7},
pages = {657--666},
year = {2009},
url = {https://doi.org/10.4304/jnw.4.7.657-666},
doi = {10.4304/JNW.4.7.657-666},
timestamp = {Tue, 15 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jnw/BreitbartDG09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/DraganX09,
author = {Feodor F. Dragan and
Yang Xiang},
editor = {Rastislav Kr{\'{a}}lovic and
Damian Niwinski},
title = {How to Use Spanning Trees to Navigate in Graphs},
booktitle = {Mathematical Foundations of Computer Science 2009, 34th International
Symposium, {MFCS} 2009, Novy Smokovec, High Tatras, Slovakia, August
24-28, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5734},
pages = {282--294},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-03816-7\_25},
doi = {10.1007/978-3-642-03816-7\_25},
timestamp = {Tue, 14 May 2019 10:00:37 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/DraganX09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/YanXD09,
author = {Chenyu Yan and
Yang Xiang and
Feodor F. Dragan},
editor = {Frank K. H. A. Dehne and
Marina L. Gavrilova and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Csaba D. T{\'{o}}th},
title = {Compact and Low Delay Routing Labeling Scheme for Unit Disk Graphs},
booktitle = {Algorithms and Data Structures, 11th International Symposium, {WADS}
2009, Banff, Canada, August 21-23, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5664},
pages = {566--577},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-03367-4\_49},
doi = {10.1007/978-3-642-03367-4\_49},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/wads/YanXD09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/ChepoiDEHV08,
author = {Victor Chepoi and
Feodor F. Dragan and
Bertrand Estellon and
Michel Habib and
Yann Vax{\`{e}}s},
title = {Notes on diameters, centers, and approximating trees of delta-hyperbolic
geodesic spaces and graphs},
journal = {Electron. Notes Discret. Math.},
volume = {31},
pages = {231--234},
year = {2008},
url = {https://doi.org/10.1016/j.endm.2008.06.046},
doi = {10.1016/J.ENDM.2008.06.046},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/ChepoiDEHV08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/ChepoiDEHV08,
author = {Victor Chepoi and
Feodor F. Dragan and
Bertrand Estellon and
Michel Habib and
Yann Vax{\`{e}}s},
editor = {Monique Teillaud},
title = {Diameters, centers, and approximating trees of delta-hyperbolicgeodesic
spaces and graphs},
booktitle = {Proceedings of the 24th {ACM} Symposium on Computational Geometry,
College Park, MD, USA, June 9-11, 2008},
pages = {59--68},
publisher = {{ACM}},
year = {2008},
url = {https://doi.org/10.1145/1377676.1377687},
doi = {10.1145/1377676.1377687},
timestamp = {Mon, 14 Jun 2021 16:24:59 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/ChepoiDEHV08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/DraganFG08,
author = {Feodor F. Dragan and
Fedor V. Fomin and
Petr A. Golovach},
editor = {Luca Aceto and
Ivan Damg{\aa}rd and
Leslie Ann Goldberg and
Magn{\'{u}}s M. Halld{\'{o}}rsson and
Anna Ing{\'{o}}lfsd{\'{o}}ttir and
Igor Walukiewicz},
title = {Spanners in Sparse Graphs},
booktitle = {Automata, Languages and Programming, 35th International Colloquium,
{ICALP} 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part
{I:} Tack {A:} Algorithms, Automata, Complexity, and Games},
series = {Lecture Notes in Computer Science},
volume = {5125},
pages = {597--608},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-70575-8\_49},
doi = {10.1007/978-3-540-70575-8\_49},
timestamp = {Fri, 27 Mar 2020 09:02:59 +0100},
biburl = {https://dblp.org/rec/conf/icalp/DraganFG08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icdm/JinXFD08,
author = {Ruoming Jin and
Yang Xiang and
David Fuhry and
Feodor F. Dragan},
title = {Overlapping Matrix Pattern Visualization: {A} Hypergraph Approach},
booktitle = {Proceedings of the 8th {IEEE} International Conference on Data Mining
{(ICDM} 2008), December 15-19, 2008, Pisa, Italy},
pages = {313--322},
publisher = {{IEEE} Computer Society},
year = {2008},
url = {https://doi.org/10.1109/ICDM.2008.102},
doi = {10.1109/ICDM.2008.102},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/icdm/JinXFD08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/DraganM08,
author = {Feodor F. Dragan and
Mart{\'{\i}}n Matamala},
editor = {Seok{-}Hee Hong and
Hiroshi Nagamochi and
Takuro Fukunaga},
title = {Navigating in a Graph by Aid of Its Spanning Tree},
booktitle = {Algorithms and Computation, 19th International Symposium, {ISAAC}
2008, Gold Coast, Australia, December 15-17, 2008. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5369},
pages = {788--799},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-92182-0\_69},
doi = {10.1007/978-3-540-92182-0\_69},
timestamp = {Thu, 27 Apr 2023 14:57:19 +0200},
biburl = {https://dblp.org/rec/conf/isaac/DraganM08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/kdd/XiangJFD08,
author = {Yang Xiang and
Ruoming Jin and
David Fuhry and
Feodor F. Dragan},
editor = {Ying Li and
Bing Liu and
Sunita Sarawagi},
title = {Succinct summarization of transactional databases: an overlapped hyperrectangle
scheme},
booktitle = {Proceedings of the 14th {ACM} {SIGKDD} International Conference on
Knowledge Discovery and Data Mining, Las Vegas, Nevada, USA, August
24-27, 2008},
pages = {758--766},
publisher = {{ACM}},
year = {2008},
url = {https://doi.org/10.1145/1401890.1401981},
doi = {10.1145/1401890.1401981},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/kdd/XiangJFD08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/DraganYX08,
author = {Feodor F. Dragan and
Chenyu Yan and
Yang Xiang},
editor = {Eduardo Sany Laber and
Claudson F. Bornstein and
Loana Tito Nogueira and
Lu{\'{e}}rbio Faria},
title = {Collective Additive Tree Spanners of Homogeneously Orderable Graphs},
booktitle = {{LATIN} 2008: Theoretical Informatics, 8th Latin American Symposium,
B{\'{u}}zios, Brazil, April 7-11, 2008, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4957},
pages = {555--567},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-78773-0\_48},
doi = {10.1007/978-3-540-78773-0\_48},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/latin/DraganYX08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/DraganFG08,
author = {Feodor F. Dragan and
Fedor V. Fomin and
Petr A. Golovach},
editor = {Edward Ochmanski and
Jerzy Tyszkiewicz},
title = {A {PTAS} for the Sparsest Spanners Problem on Apex-Minor-Free Graphs},
booktitle = {Mathematical Foundations of Computer Science 2008, 33rd International
Symposium, {MFCS} 2008, Torun, Poland, August 25-29, 2008, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5162},
pages = {290--298},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-85238-4\_23},
doi = {10.1007/978-3-540-85238-4\_23},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/DraganFG08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/DraganCKX08,
author = {Feodor F. Dragan and
Derek G. Corneil and
Ekkehard K{\"{o}}hler and
Yang Xiang},
editor = {Hajo Broersma and
Thomas Erlebach and
Tom Friedetzky and
Dani{\"{e}}l Paulusma},
title = {Additive Spanners for Circle Graphs and Polygonal Graphs},
booktitle = {Graph-Theoretic Concepts in Computer Science, 34th International Workshop,
{WG} 2008, Durham, UK, June 30 - July 2, 2008. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {5344},
pages = {110--121},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-92248-3\_11},
doi = {10.1007/978-3-540-92248-3\_11},
timestamp = {Sun, 25 Oct 2020 23:07:56 +0100},
biburl = {https://dblp.org/rec/conf/wg/DraganCKX08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BrandstadtDLLU07,
author = {Andreas Brandst{\"{a}}dt and
Feodor F. Dragan and
Ho{\`{a}}ng{-}Oanh Le and
Van Bang Le and
Ryuhei Uehara},
title = {Tree Spanners for Bipartite Graphs and Probe Interval Graphs},
journal = {Algorithmica},
volume = {47},
number = {1},
pages = {27--51},
year = {2007},
url = {https://doi.org/10.1007/s00453-006-1209-y},
doi = {10.1007/S00453-006-1209-Y},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BrandstadtDLLU07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/DraganL07,
author = {Feodor F. Dragan and
Irina Lomonosov},
title = {On compact and efficient routing in certain graph classes},
journal = {Discret. Appl. Math.},
volume = {155},
number = {11},
pages = {1458--1470},
year = {2007},
url = {https://doi.org/10.1016/j.dam.2007.03.011},
doi = {10.1016/J.DAM.2007.03.011},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/DraganL07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DourisboureDGY07,
author = {Yon Dourisboure and
Feodor F. Dragan and
Cyril Gavoille and
Chenyu Yan},
title = {Spanners for bounded tree-length graphs},
journal = {Theor. Comput. Sci.},
volume = {383},
number = {1},
pages = {34--44},
year = {2007},
url = {https://doi.org/10.1016/j.tcs.2007.03.058},
doi = {10.1016/J.TCS.2007.03.058},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/DourisboureDGY07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/ChepoiDV06,
author = {Victor Chepoi and
Feodor F. Dragan and
Yann Vax{\`{e}}s},
title = {Distance and routing labeling schemes for non-positively curved plane
graphs},
journal = {J. Algorithms},
volume = {61},
number = {2},
pages = {60--88},
year = {2006},
url = {https://doi.org/10.1016/j.jalgor.2004.07.011},
doi = {10.1016/J.JALGOR.2004.07.011},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/ChepoiDV06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/DraganYC06,
author = {Feodor F. Dragan and
Chenyu Yan and
Derek G. Corneil},
title = {Collective Tree Spanners and Routing in AT-free Related Graphs},
journal = {J. Graph Algorithms Appl.},
volume = {10},
number = {2},
pages = {97--122},
year = {2006},
url = {https://doi.org/10.7155/jgaa.00120},
doi = {10.7155/JGAA.00120},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/DraganYC06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/DraganYL06,
author = {Feodor F. Dragan and
Chenyu Yan and
Irina Lomonosov},
title = {Collective tree spanners of graphs},
journal = {{SIAM} J. Discret. Math.},
volume = {20},
number = {1},
pages = {241--260},
year = {2006},
url = {https://doi.org/10.1137/S089548010444167X},
doi = {10.1137/S089548010444167X},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/DraganYL06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/winet/ChepoiDV06,
author = {Victor Chepoi and
Feodor F. Dragan and
Yann Vax{\`{e}}s},
title = {Addressing, distances and routing in triangular systems with applications
in cellular networks},
journal = {Wirel. Networks},
volume = {12},
number = {6},
pages = {671--679},
year = {2006},
url = {https://doi.org/10.1007/s11276-006-6527-0},
doi = {10.1007/S11276-006-6527-0},
timestamp = {Thu, 18 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/winet/ChepoiDV06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/DraganY06,
author = {Feodor F. Dragan and
Chenyu Yan},
editor = {Tiziana Calamoneri and
Irene Finocchi and
Giuseppe F. Italiano},
title = {Distance Approximating Trees: Complexity and Algorithms},
booktitle = {Algorithms and Complexity, 6th Italian Conference, {CIAC} 2006, Rome,
Italy, May 29-31, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3998},
pages = {260--271},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11758471\_26},
doi = {10.1007/11758471\_26},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/ciac/DraganY06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/DraganY06,
author = {Feodor F. Dragan and
Chenyu Yan},
editor = {Jos{\'{e}} R. Correa and
Alejandro Hevia and
Marcos A. Kiwi},
title = {Network Flow Spanners},
booktitle = {{LATIN} 2006: Theoretical Informatics, 7th Latin American Symposium,
Valdivia, Chile, March 20-24, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3887},
pages = {410--422},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11682462\_39},
doi = {10.1007/11682462\_39},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/latin/DraganY06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BrandstadtDXY06,
author = {Andreas Brandst{\"{a}}dt and
Feodor F. Dragan and
Yang Xiang and
Chenyu Yan},
editor = {Lars Arge and
Rusins Freivalds},
title = {Generalized Powers of Graphs and Their Algorithmic Use},
booktitle = {Algorithm Theory - {SWAT} 2006, 10th ScandinavianWorkshop on Algorithm
Theory, Riga, Latvia, July 6-8, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4059},
pages = {423--434},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11785293\_39},
doi = {10.1007/11785293\_39},
timestamp = {Tue, 14 May 2019 10:00:39 +0200},
biburl = {https://dblp.org/rec/conf/swat/BrandstadtDXY06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/Dragan05,
author = {Feodor F. Dragan},
title = {Estimating all pairs shortest paths in restricted graph families:
a unified approach},
journal = {J. Algorithms},
volume = {57},
number = {1},
pages = {1--21},
year = {2005},
url = {https://doi.org/10.1016/j.jalgor.2004.09.002},
doi = {10.1016/J.JALGOR.2004.09.002},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/Dragan05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/BrandstadtDLM05,
author = {Andreas Brandst{\"{a}}dt and
Feodor F. Dragan and
Ho{\`{a}}ng{-}Oanh Le and
Raffaele Mosca},
title = {New Graph Classes of Bounded Clique-Width},
journal = {Theory Comput. Syst.},
volume = {38},
number = {5},
pages = {623--645},
year = {2005},
url = {https://doi.org/10.1007/s00224-004-1154-6},
doi = {10.1007/S00224-004-1154-6},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/BrandstadtDLM05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ChepoiDY05,
author = {Victor Chepoi and
Feodor F. Dragan and
Chenyu Yan},
title = {Additive sparse spanners for graphs with bounded length of largest
induced cycle},
journal = {Theor. Comput. Sci.},
volume = {347},
number = {1-2},
pages = {54--75},
year = {2005},
url = {https://doi.org/10.1016/j.tcs.2005.05.017},
doi = {10.1016/J.TCS.2005.05.017},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ChepoiDY05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/DraganY05,
author = {Feodor F. Dragan and
Chenyu Yan},
editor = {Xiaotie Deng and
Ding{-}Zhu Du},
title = {Collective Tree Spanners in Graphs with Bounded Genus, Chordality,
Tree-Width, or Clique-Width},
booktitle = {Algorithms and Computation, 16th International Symposium, {ISAAC}
2005, Sanya, Hainan, China, December 19-21, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3827},
pages = {583--592},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11602613\_59},
doi = {10.1007/11602613\_59},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/isaac/DraganY05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/snpd/ChepoiDV05,
author = {Victor Chepoi and
Feodor F. Dragan and
Yann Vax{\`{e}}s},
editor = {Lawrence Chung and
Yeong{-}Tae Song},
title = {Distance-Based Location Update and Routing in Irregular Cellular Networks},
booktitle = {Proceedings of the 6th {ACIS} International Conference on Software
Engineering, Artificial Intelligence, Networking and Parallel/Distributed
Computing {(SNPD} 2005), May 23-25, 2005, Towson, Maryland, {USA}},
pages = {380--387},
publisher = {{IEEE} Computer Society},
year = {2005},
url = {https://doi.org/10.1109/SNPD-SAWN.2005.32},
doi = {10.1109/SNPD-SAWN.2005.32},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/snpd/ChepoiDV05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/CorneilDKY05,
author = {Derek G. Corneil and
Feodor F. Dragan and
Ekkehard K{\"{o}}hler and
Chenyu Yan},
editor = {Dieter Kratsch},
title = {Collective Tree 1-Spanners for Interval Graphs},
booktitle = {Graph-Theoretic Concepts in Computer Science, 31st International Workshop,
{WG} 2005, Metz, France, June 23-25, 2005, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {3787},
pages = {151--162},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11604686\_14},
doi = {10.1007/11604686\_14},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/CorneilDKY05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BrandstadtDLL04,
author = {Andreas Brandst{\"{a}}dt and
Feodor F. Dragan and
Ho{\`{a}}ng{-}Oanh Le and
Van Bang Le},
title = {Tree spanners on chordal graphs: complexity and algorithms},
journal = {Theor. Comput. Sci.},
volume = {310},
number = {1-3},
pages = {329--354},
year = {2004},
url = {https://doi.org/10.1016/S0304-3975(03)00424-9},
doi = {10.1016/S0304-3975(03)00424-9},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BrandstadtDLL04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icccn/BreitbartDG04,
author = {Yuri Breitbart and
Feodor F. Dragan and
Hassan Gobjuka},
editor = {Ronald P. Luijten and
Luiz A. DaSilva and
Antonius P. J. Engbersen},
title = {Effective Network Monitoring},
booktitle = {Proceedings of the International Conference On Computer Communications
and Networks {(ICCCN} 2004), October 11-13, 2004, Chicago, IL, {USA}},
pages = {394--399},
publisher = {{IEEE}},
year = {2004},
url = {https://doi.org/10.1109/ICCCN.2004.1401682},
doi = {10.1109/ICCCN.2004.1401682},
timestamp = {Wed, 16 Oct 2019 14:14:49 +0200},
biburl = {https://dblp.org/rec/conf/icccn/BreitbartDG04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipps/ChepoiDV04,
author = {Victor Chepoi and
Feodor F. Dragan and
Yann Vax{\`{e}}s},
title = {Addressing, Distances and Routing in Triangular Systems with Applications
in Cellular and Sensor Networks},
booktitle = {18th International Parallel and Distributed Processing Symposium {(IPDPS}
2004), {CD-ROM} / Abstracts Proceedings, 26-30 April 2004, Santa Fe,
New Mexico, {USA}},
publisher = {{IEEE} Computer Society},
year = {2004},
url = {https://doi.org/10.1109/IPDPS.2004.1303249},
doi = {10.1109/IPDPS.2004.1303249},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ipps/ChepoiDV04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/DraganL04,
author = {Feodor F. Dragan and
Irina Lomonosov},
editor = {Rudolf Fleischer and
Gerhard Trippen},
title = {On Compact and Efficient Routing in Certain Graph Classes},
booktitle = {Algorithms and Computation, 15th International Symposium, {ISAAC}
2004, Hong Kong, China, December 20-22, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3341},
pages = {402--414},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-30551-4\_36},
doi = {10.1007/978-3-540-30551-4\_36},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/isaac/DraganL04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/DraganYL04,
author = {Feodor F. Dragan and
Chenyu Yan and
Irina Lomonosov},
editor = {Torben Hagerup and
Jyrki Katajainen},
title = {Collective Tree Spanners of Graphs},
booktitle = {Algorithm Theory - {SWAT} 2004, 9th Scandinavian Workshop on Algorithm
Theory, Humlebaek, Denmark, July 8-10, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3111},
pages = {64--76},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-27810-8\_7},
doi = {10.1007/978-3-540-27810-8\_7},
timestamp = {Tue, 14 May 2019 10:00:39 +0200},
biburl = {https://dblp.org/rec/conf/swat/DraganYL04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/DraganYC04,
author = {Feodor F. Dragan and
Chenyu Yan and
Derek G. Corneil},
editor = {Juraj Hromkovic and
Manfred Nagl and
Bernhard Westfechtel},
title = {Collective Tree Spanners and Routing in AT-free Related Graphs},
booktitle = {Graph-Theoretic Concepts in Computer Science, 30th International Workshop,WG
2004, Bad Honnef, Germany, June 21-23, 2004, Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {3353},
pages = {68--80},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-30559-0\_6},
doi = {10.1007/978-3-540-30559-0\_6},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/DraganYC04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BrandstadtD03,
author = {Andreas Brandst{\"{a}}dt and
Feodor F. Dragan},
title = {On linear and circular structure of (claw, net)-free graphs},
journal = {Discret. Appl. Math.},
volume = {129},
number = {2-3},
pages = {285--303},
year = {2003},
url = {https://doi.org/10.1016/S0166-218X(02)00571-1},
doi = {10.1016/S0166-218X(02)00571-1},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BrandstadtD03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/ChepoiD03,
author = {Victor Chepoi and
Feodor F. Dragan},
title = {Finding a central vertex in an HHD-free graph},
journal = {Discret. Appl. Math.},
volume = {131},
number = {1},
pages = {93--11},
year = {2003},
url = {https://doi.org/10.1016/S0166-218X(02)00419-5},
doi = {10.1016/S0166-218X(02)00419-5},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/ChepoiD03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/CorneilDK03,
author = {Derek G. Corneil and
Feodor F. Dragan and
Ekkehard K{\"{o}}hler},
title = {On the power of {BFS} to determine a graph's diameter},
journal = {Networks},
volume = {42},
number = {4},
pages = {209--222},
year = {2003},
url = {https://doi.org/10.1002/net.10098},
doi = {10.1002/NET.10098},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/CorneilDK03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/ChepoiDY03,
author = {Victor Chepoi and
Feodor F. Dragan and
Chenyu Yan},
editor = {Rossella Petreschi and
Giuseppe Persiano and
Riccardo Silvestri},
title = {Additive Spanners for k-Chordal Graphs},
booktitle = {Algorithms and Complexity, 5th Italian Conference, {CIAC} 2003, Rome,
Italy, May 28-30, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2653},
pages = {96--107},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/3-540-44849-7\_16},
doi = {10.1007/3-540-44849-7\_16},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/ciac/ChepoiDY03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/BrandstadtDLLU03,
author = {Andreas Brandst{\"{a}}dt and
Feodor F. Dragan and
Ho{\`{a}}ng{-}Oanh Le and
Van Bang Le and
Ryuhei Uehara},
editor = {Hans L. Bodlaender},
title = {Tree Spanners for Bipartite Graphs and Probe Interval Graphs},
booktitle = {Graph-Theoretic Concepts in Computer Science, 29th International Workshop,
{WG} 2003, Elspeet, The Netherlands, June 19-21, 2003, Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {2880},
pages = {106--118},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/978-3-540-39890-5\_10},
doi = {10.1007/978-3-540-39890-5\_10},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/wg/BrandstadtDLLU03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcad/DraganKMMZ02,
author = {Feodor F. Dragan and
Andrew B. Kahng and
Ion I. Mandoiu and
Sudhakar Muddu and
Alexander Zelikovsky},
title = {Provably good global buffering by generalized multiterminalmulticommodity
flow approximation},
journal = {{IEEE} Trans. Comput. Aided Des. Integr. Circuits Syst.},
volume = {21},
number = {3},
pages = {263--274},
year = {2002},
url = {https://doi.org/10.1109/43.986421},
doi = {10.1109/43.986421},
timestamp = {Thu, 24 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcad/DraganKMMZ02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/BrandstadtDLL02,
author = {Andreas Brandst{\"{a}}dt and
Feodor F. Dragan and
Ho{\`{a}}ng{-}Oanh Le and
Van Bang Le},
editor = {Prosenjit Bose and
Pat Morin},
title = {Tree Spanners on Chordal Graphs: Complexity, Algorithms, Open Problems},
booktitle = {Algorithms and Computation, 13th International Symposium, {ISAAC}
2002 Vancouver, BC, Canada, November 21-23, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2518},
pages = {163--174},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-36136-7\_15},
doi = {10.1007/3-540-36136-7\_15},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/isaac/BrandstadtDLL02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/CorneilDK02,
author = {Derek G. Corneil and
Feodor F. Dragan and
Ekkehard K{\"{o}}hler},
editor = {Sergio Rajsbaum},
title = {On the Power of {BFS} to Determine a Graphs Diameter},
booktitle = {{LATIN} 2002: Theoretical Informatics, 5th Latin American Symposium,
Cancun, Mexico, April 3-6, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2286},
pages = {209--223},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45995-2\_22},
doi = {10.1007/3-540-45995-2\_22},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/latin/CorneilDK02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/pdcs/DraganL02,
author = {Feodor F. Dragan and
Irina Lomonosov},
editor = {Selim G. Akl and
Teofilo F. Gonzalez},
title = {New Routing Schemes for Interval, Circular-Arc, and Permutation Graphs},
booktitle = {International Conference on Parallel and Distributed Computing Systems,
{PDCS} 2002, November 4-6, 2002, Cambridge, {USA}},
pages = {78--83},
publisher = {{IASTED/ACTA} Press},
year = {2002},
timestamp = {Tue, 26 Sep 2006 13:37:10 +0200},
biburl = {https://dblp.org/rec/conf/pdcs/DraganL02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ChepoiDV02,
author = {Victor Chepoi and
Feodor F. Dragan and
Yann Vax{\`{e}}s},
editor = {David Eppstein},
title = {Center and diameter problems in plane triangulations and quadrangulations},
booktitle = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
pages = {346--355},
publisher = {{ACM/SIAM}},
year = {2002},
url = {http://dl.acm.org/citation.cfm?id=545381.545427},
timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
biburl = {https://dblp.org/rec/conf/soda/ChepoiDV02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/BrandstadtDLM02,
author = {Andreas Brandst{\"{a}}dt and
Feodor F. Dragan and
Ho{\`{a}}ng{-}Oanh Le and
Raffaele Mosca},
editor = {Ludek Kucera},
title = {New Graph Classes of Bounded Clique-Width},
booktitle = {Graph-Theoretic Concepts in Computer Science, 28th International Workshop,
{WG} 2002, Cesky Krumlov, Czech Republic, June 13-15, 2002, Revised
Papers},
series = {Lecture Notes in Computer Science},
volume = {2573},
pages = {57--67},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-36379-3\_6},
doi = {10.1007/3-540-36379-3\_6},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/BrandstadtDLM02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/CorneilDHP01,
author = {Derek G. Corneil and
Feodor F. Dragan and
Michel Habib and
Christophe Paul},
title = {Diameter determination on restricted graph families},
journal = {Discret. Appl. Math.},
volume = {113},
number = {2-3},
pages = {143--166},
year = {2001},
url = {https://doi.org/10.1016/S0166-218X(00)00281-X},
doi = {10.1016/S0166-218X(00)00281-X},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/CorneilDHP01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aspdac/DraganKMMZ01,
author = {Feodor F. Dragan and
Andrew B. Kahng and
Ion I. Mandoiu and
Sudhakar Muddu and
Alexander Zelikovsky},
editor = {Satoshi Goto},
title = {Provably good global buffering by multi-terminal multicommodity flow
approximation},
booktitle = {Proceedings of {ASP-DAC} 2001, Asia and South Pacific Design Automation
Conference 2001, January 30-February 2, 2001, Yokohama, Japan},
pages = {120--125},
publisher = {{ACM}},
year = {2001},
url = {https://doi.org/10.1145/370155.370299},
doi = {10.1145/370155.370299},
timestamp = {Wed, 16 Oct 2019 14:14:52 +0200},
biburl = {https://dblp.org/rec/conf/aspdac/DraganKMMZ01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/DraganKMMZ01,
author = {Feodor F. Dragan and
Andrew B. Kahng and
Ion I. Mandoiu and
Sudhakar Muddu and
Alexander Zelikovsky},
editor = {Frank K. H. A. Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Roberto Tamassia},
title = {Practical Approximation Algorithms for Separable Packing Linear Programs},
booktitle = {Algorithms and Data Structures, 7th International Workshop, {WADS}
2001, Providence, RI, USA, August 8-10, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2125},
pages = {325--337},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44634-6\_30},
doi = {10.1007/3-540-44634-6\_30},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/DraganKMMZ01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/Dragan01,
author = {Feodor F. Dragan},
editor = {Andreas Brandst{\"{a}}dt and
Van Bang Le},
title = {Estimating All Pairs Shortest Paths in Restricted Graph Families:
{A} Unified Approach},
booktitle = {Graph-Theoretic Concepts in Computer Science, 27th International Workshop,
{WG} 2001, Boltenhagen, Germany, June 14-16, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2204},
pages = {103--116},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-45477-2\_11},
doi = {10.1007/3-540-45477-2\_11},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/Dragan01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/DraganN00,
author = {Feodor F. Dragan and
Falk Nicolai},
title = {LexBFS-orderings of Distance-hereditary Graphs with Application to
the Diametral Pair Problem},
journal = {Discret. Appl. Math.},
volume = {98},
number = {3},
pages = {191--207},
year = {2000},
url = {https://doi.org/10.1016/S0166-218X(99)00157-2},
doi = {10.1016/S0166-218X(99)00157-2},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/DraganN00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Dragan00,
author = {Feodor F. Dragan},
title = {Strongly Orderable Graphs a Common Generalization of Strongly Chordal
and Chordal Bipartite Graphs},
journal = {Discret. Appl. Math.},
volume = {99},
number = {1-3},
pages = {427--442},
year = {2000},
url = {https://doi.org/10.1016/S0166-218X(99)00149-3},
doi = {10.1016/S0166-218X(99)00149-3},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Dragan00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BrandstadtDLS00,
author = {Andreas Brandst{\"{a}}dt and
Feodor F. Dragan and
Van Bang Le and
Thomas Szymczak},
title = {On stable cutsets in graphs},
journal = {Discret. Appl. Math.},
volume = {105},
number = {1-3},
pages = {39--50},
year = {2000},
url = {https://doi.org/10.1016/S0166-218X(00)00197-9},
doi = {10.1016/S0166-218X(00)00197-9},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BrandstadtDLS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/ChepoiD00,
author = {Victor Chepoi and
Feodor F. Dragan},
title = {A Note on Distance Approximating Trees in Graphs},
journal = {Eur. J. Comb.},
volume = {21},
number = {6},
pages = {761--766},
year = {2000},
url = {https://doi.org/10.1006/eujc.1999.0381},
doi = {10.1006/EUJC.1999.0381},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/ChepoiD00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BrandstadtDK00,
author = {Andreas Brandst{\"{a}}dt and
Feodor F. Dragan and
Ekkehard K{\"{o}}hler},
title = {Linear Time Algorithms for Hamiltonian Problems on (Claw, Net)-Free
Graphs},
journal = {{SIAM} J. Comput.},
volume = {30},
number = {5},
pages = {1662--1677},
year = {2000},
url = {https://doi.org/10.1137/S0097539799357775},
doi = {10.1137/S0097539799357775},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BrandstadtDK00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iccad/DraganKMMZ00,
author = {Feodor F. Dragan and
Andrew B. Kahng and
Ion I. Mandoiu and
Sudhakar Muddu and
Alexander Zelikovsky},
editor = {Ellen Sentovich},
title = {Provably Good Global Buffering Using an Available Buffer Block Plan},
booktitle = {Proceedings of the 2000 {IEEE/ACM} International Conference on Computer-Aided
Design, 2000, San Jose, California, USA, November 5-9, 2000},
pages = {104--109},
publisher = {{IEEE} Computer Society},
year = {2000},
url = {https://doi.org/10.1109/ICCAD.2000.896458},
doi = {10.1109/ICCAD.2000.896458},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/iccad/DraganKMMZ00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Dragan99,
author = {Feodor F. Dragan},
title = {Almost Diameter of a House-hole-free Graph in Linear Time Via LexBFS},
journal = {Discret. Appl. Math.},
volume = {95},
number = {1-3},
pages = {223--239},
year = {1999},
url = {https://doi.org/10.1016/S0166-218X(99)00077-3},
doi = {10.1016/S0166-218X(99)00077-3},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Dragan99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/ChepoiD99,
author = {Victor Chepoi and
Feodor F. Dragan},
title = {A note on distance approximating trees in graphs},
journal = {Electron. Notes Discret. Math.},
volume = {3},
pages = {39},
year = {1999},
url = {https://doi.org/10.1016/S1571-0653(05)80019-8},
doi = {10.1016/S1571-0653(05)80019-8},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/ChepoiD99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijcm/DraganN99,
author = {Feodor F. Dragan and
Falk Nicolai},
title = {Lexbfs-orderings and powers of hhd-free graphs},
journal = {Int. J. Comput. Math.},
volume = {71},
number = {1},
pages = {35--56},
year = {1999},
url = {https://doi.org/10.1080/00207169908804791},
doi = {10.1080/00207169908804791},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijcm/DraganN99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/BrandstadtCD99,
author = {Andreas Brandst{\"{a}}dt and
Victor Chepoi and
Feodor F. Dragan},
title = {Distance Approximating Trees for Chordal and Dually Chordal Graphs},
journal = {J. Algorithms},
volume = {30},
number = {1},
pages = {166--184},
year = {1999},
url = {https://doi.org/10.1006/jagm.1998.0962},
doi = {10.1006/JAGM.1998.0962},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/BrandstadtCD99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/DraganNB99,
author = {Feodor F. Dragan and
Falk Nicolai and
Andreas Brandst{\"{a}}dt},
title = {Convexity and HHD-Free Graphs},
journal = {{SIAM} J. Discret. Math.},
volume = {12},
number = {1},
pages = {119--135},
year = {1999},
url = {https://doi.org/10.1137/S0895480195321718},
doi = {10.1137/S0895480195321718},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/DraganNB99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/BrandstadtDK99,
author = {Andreas Brandst{\"{a}}dt and
Feodor F. Dragan and
Ekkehard K{\"{o}}hler},
editor = {Peter Widmayer and
Gabriele Neyer and
Stephan J. Eidenbenz},
title = {Linear Time Algorithms for Hamiltonian Problems on (Claw, Net)-Free
Graphs},
booktitle = {Graph-Theoretic Concepts in Computer Science, 25th International Workshop,
{WG} '99, Ascona, Switzerland, June 17-19, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1665},
pages = {364--376},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-46784-X\_34},
doi = {10.1007/3-540-46784-X\_34},
timestamp = {Wed, 11 Sep 2019 13:15:53 +0200},
biburl = {https://dblp.org/rec/conf/wg/BrandstadtDK99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BrandstadtCD98,
author = {Andreas Brandst{\"{a}}dt and
Victor Chepoi and
Feodor F. Dragan},
title = {The Algorithmic Use of Hypertree Structure and Maximum Neighbourhood
Orderings},
journal = {Discret. Appl. Math.},
volume = {82},
number = {1-3},
pages = {43--77},
year = {1998},
url = {https://doi.org/10.1016/S0166-218X(97)00125-X},
doi = {10.1016/S0166-218X(97)00125-X},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BrandstadtCD98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijcm/DraganNB98,
author = {Feodor F. Dragan and
Falk Nicolai and
Andreas Brandst{\"{a}}dt},
title = {Powers of hhd-free graphs},
journal = {Int. J. Comput. Math.},
volume = {69},
number = {3-4},
pages = {217--242},
year = {1998},
url = {https://doi.org/10.1080/00207169808804720},
doi = {10.1080/00207169808804720},
timestamp = {Fri, 10 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijcm/DraganNB98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/BrandstadtD98,
author = {Andreas Brandst{\"{a}}dt and
Feodor F. Dragan},
title = {A linear-time algorithm for connected r-domination and Steiner tree
on distance-hereditary graphs},
journal = {Networks},
volume = {31},
number = {3},
pages = {177--182},
year = {1998},
url = {https://doi.org/10.1002/(SICI)1097-0037(199805)31:3\&\#60;177::AID-NET4\&\#62;3.0.CO;2-C},
doi = {10.1002/(SICI)1097-0037(199805)31:3\&\#60;177::AID-NET4\&\#62;3.0.CO;2-C},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/BrandstadtD98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/BrandstadtDCV98,
author = {Andreas Brandst{\"{a}}dt and
Feodor F. Dragan and
Victor Chepoi and
Vitaly I. Voloshin},
title = {Dually Chordal Graphs},
journal = {{SIAM} J. Discret. Math.},
volume = {11},
number = {3},
pages = {437--455},
year = {1998},
url = {https://doi.org/10.1137/S0895480193253415},
doi = {10.1137/S0895480193253415},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/BrandstadtDCV98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/CorneilDHP98,
author = {Derek G. Corneil and
Feodor F. Dragan and
Michel Habib and
Christophe Paul},
editor = {Juraj Hromkovic and
Ondrej S{\'{y}}kora},
title = {Diameter Determination on Restricted Graph Faminlies},
booktitle = {Graph-Theoretic Concepts in Computer Science, 24th International Workshop,
{WG} '98, Smolenice Castle, Slovak Republic, June 18-20, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1517},
pages = {192--202},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/10692760\_16},
doi = {10.1007/10692760\_16},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/CorneilDHP98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BrandstadtDN97,
author = {Andreas Brandst{\"{a}}dt and
Feodor F. Dragan and
Falk Nicolai},
title = {LexBFS-orderings and powers of chordal graphs},
journal = {Discret. Math.},
volume = {171},
number = {1-3},
pages = {27--42},
year = {1997},
url = {https://doi.org/10.1016/S0012-365X(96)00070-2},
doi = {10.1016/S0012-365X(96)00070-2},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/BrandstadtDN97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/DraganN97,
author = {Feodor F. Dragan and
Falk Nicolai},
title = {r-domination problems on homogeneously orderable graphs},
journal = {Networks},
volume = {30},
number = {2},
pages = {121--131},
year = {1997},
url = {https://doi.org/10.1002/(SICI)1097-0037(199709)30:2\&\#60;121::AID-NET6\&\#62;3.0.CO;2-E},
doi = {10.1002/(SICI)1097-0037(199709)30:2\&\#60;121::AID-NET6\&\#62;3.0.CO;2-E},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/DraganN97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/BrandstadtCD97,
author = {Andreas Brandst{\"{a}}dt and
Victor Chepoi and
Feodor F. Dragan},
title = {Clique \emph{r}-Domination and Clique \emph{r}-Packing Problems on
Dually Chordal Graphs},
journal = {{SIAM} J. Discret. Math.},
volume = {10},
number = {1},
pages = {109--127},
year = {1997},
url = {https://doi.org/10.1137/S0895480194267853},
doi = {10.1137/S0895480194267853},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/BrandstadtCD97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BrandstadtDN97,
author = {Andreas Brandst{\"{a}}dt and
Feodor F. Dragan and
Falk Nicolai},
title = {Homogeneously Orderable Graphs},
journal = {Theor. Comput. Sci.},
volume = {172},
number = {1-2},
pages = {209--232},
year = {1997},
url = {https://doi.org/10.1016/S0304-3975(96)00091-6},
doi = {10.1016/S0304-3975(96)00091-6},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BrandstadtDN97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/BrandstadtCD97,
author = {Andreas Brandst{\"{a}}dt and
Victor Chepoi and
Feodor F. Dragan},
editor = {Rainer E. Burkard and
Gerhard J. Woeginger},
title = {Distance Approximating Trees for Chordal and Dually Chordal Graphs
(Extended Abstract)},
booktitle = {Algorithms - {ESA} '97, 5th Annual European Symposium, Graz, Austria,
September 15-17, 1997, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1284},
pages = {78--91},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/3-540-63397-9\_7},
doi = {10.1007/3-540-63397-9\_7},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/esa/BrandstadtCD97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/Dragan97,
author = {Feodor F. Dragan},
editor = {Rolf H. M{\"{o}}hring},
title = {On Greedy Matching Ordering and Greedy Matchable Graphs (Extended
Abstract)},
booktitle = {Graph-Theoretic Concepts in Computer Science, 23rd International Workshop,
{WG} '97, Berlin, Germany, June 18-20, 1997, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1335},
pages = {184--198},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/BFb0024498},
doi = {10.1007/BFB0024498},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/Dragan97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/DraganV96,
author = {Feodor F. Dragan and
Vitaly I. Voloshin},
title = {Incidence Graphs of Biacyclic Hypergraphs},
journal = {Discret. Appl. Math.},
volume = {68},
number = {3},
pages = {259--266},
year = {1996},
url = {https://doi.org/10.1016/0166-218X(95)00070-8},
doi = {10.1016/0166-218X(95)00070-8},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/DraganV96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BrandstadtCD96,
author = {Andreas Brandst{\"{a}}dt and
Victor Chepoi and
Feodor F. Dragan},
title = {Perfect elimination orderings of chordal powers of graphs},
journal = {Discret. Math.},
volume = {158},
number = {1-3},
pages = {273--278},
year = {1996},
url = {https://doi.org/10.1016/0012-365X(95)00081-7},
doi = {10.1016/0012-365X(95)00081-7},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/BrandstadtCD96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/DraganB96,
author = {Feodor F. Dragan and
Andreas Brandst{\"{a}}dt},
title = {r-Dominating cliques in graphs with hypertree structure},
journal = {Discret. Math.},
volume = {162},
number = {1-3},
pages = {93--108},
year = {1996},
url = {https://doi.org/10.1016/0012-365X(95)00277-4},
doi = {10.1016/0012-365X(95)00277-4},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/DraganB96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/DraganNB96,
author = {Feodor F. Dragan and
Falk Nicolai and
Andreas Brandst{\"{a}}dt},
editor = {Fabrizio d'Amore and
Paolo Giulio Franciosa and
Alberto Marchetti{-}Spaccamela},
title = {LexBFS-Orderings and Power of Graphs},
booktitle = {Graph-Theoretic Concepts in Computer Science, 22nd International Workshop,
{WG} '96, Cadenabbia (Como), Italy, June 12-14, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1197},
pages = {166--180},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-62559-3\_15},
doi = {10.1007/3-540-62559-3\_15},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/DraganNB96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fct/ChepoiD95,
author = {Victor Chepoi and
Feodor F. Dragan},
editor = {Horst Reichel},
title = {On Condorcet and Median Points of Simple Rectilinear Polygons (Extended
Abstract)},
booktitle = {Fundamentals of Computation Theory, 10th International Symposium,
{FCT} '95, Dresden, Germany, August 22-25, 1995, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {965},
pages = {181--190},
publisher = {Springer},
year = {1995},
url = {https://doi.org/10.1007/3-540-60249-6\_50},
doi = {10.1007/3-540-60249-6\_50},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/fct/ChepoiD95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fct/DraganN95,
author = {Feodor F. Dragan and
Falk Nicolai},
editor = {Horst Reichel},
title = {r-Domination Problems on Homogeneously Ordered Graphs (Extended Abstract)},
booktitle = {Fundamentals of Computation Theory, 10th International Symposium,
{FCT} '95, Dresden, Germany, August 22-25, 1995, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {965},
pages = {201--210},
publisher = {Springer},
year = {1995},
url = {https://doi.org/10.1007/3-540-60249-6\_52},
doi = {10.1007/3-540-60249-6\_52},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fct/DraganN95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/BrandstadtDN95,
author = {Andreas Brandst{\"{a}}dt and
Feodor F. Dragan and
Falk Nicolai},
editor = {Manfred Nagl},
title = {Homogeneously Orderable Graphs and the Steiner Tree Problem},
booktitle = {Graph-Theoretic Concepts in Computer Science, 21st International Workshop,
{WG} '95, Aachen, Germany, June 20-22, 1995, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1017},
pages = {381--395},
publisher = {Springer},
year = {1995},
url = {https://doi.org/10.1007/3-540-60618-1\_90},
doi = {10.1007/3-540-60618-1\_90},
timestamp = {Thu, 14 Oct 2021 10:32:32 +0200},
biburl = {https://dblp.org/rec/conf/wg/BrandstadtDN95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChepoiD94,
author = {Victor Chepoi and
Feodor F. Dragan},
title = {Computing a Median Point of a Simple Rectilinear Polygon},
journal = {Inf. Process. Lett.},
volume = {49},
number = {6},
pages = {281--285},
year = {1994},
url = {https://doi.org/10.1016/0020-0190(94)90100-7},
doi = {10.1016/0020-0190(94)90100-7},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ChepoiD94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/ChepoiD94,
author = {Victor Chepoi and
Feodor F. Dragan},
editor = {Jan van Leeuwen},
title = {A Linear-Time Algorithm for Finding a Central Vertex of a Chordal
Graph},
booktitle = {Algorithms - {ESA} '94, Second Annual European Symposium, Utrecht,
The Netherlands, September 26-28, 1994, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {855},
pages = {159--170},
publisher = {Springer},
year = {1994},
url = {https://doi.org/10.1007/BFb0049406},
doi = {10.1007/BFB0049406},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/esa/ChepoiD94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/DraganB94,
author = {Feodor F. Dragan and
Andreas Brandst{\"{a}}dt},
editor = {Patrice Enjalbert and
Ernst W. Mayr and
Klaus W. Wagner},
title = {Dominating Cliques in Graphs with Hypertree Structures},
booktitle = {{STACS} 94, 11th Annual Symposium on Theoretical Aspects of Computer
Science, Caen, France, February 24-26, 1994, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {775},
pages = {735--746},
publisher = {Springer},
year = {1994},
url = {https://doi.org/10.1007/3-540-57785-8\_186},
doi = {10.1007/3-540-57785-8\_186},
timestamp = {Tue, 14 May 2019 10:00:48 +0200},
biburl = {https://dblp.org/rec/conf/stacs/DraganB94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Dragan94,
author = {Feodor F. Dragan},
editor = {Erik Meineche Schmidt and
Sven Skyum},
title = {Dominating Cliques in Distance-Hereditary Graphs},
booktitle = {Algorithm Theory - {SWAT} '94, 4th Scandinavian Workshop on Algorithm
Theory, Aarhus, Denmark, July 6-8, 1994, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {824},
pages = {370--381},
publisher = {Springer},
year = {1994},
url = {https://doi.org/10.1007/3-540-58218-5\_34},
doi = {10.1007/3-540-58218-5\_34},
timestamp = {Tue, 14 May 2019 10:00:39 +0200},
biburl = {https://dblp.org/rec/conf/swat/Dragan94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/BrandstadtCD94,
author = {Andreas Brandst{\"{a}}dt and
Victor Chepoi and
Feodor F. Dragan},
editor = {Ernst W. Mayr and
Gunther Schmidt and
Gottfried Tinhofer},
title = {The Algorithmic Use of Hypertree Structure and Maximum Neighbourhood
Orderings},
booktitle = {Graph-Theoretic Concepts in Computer Science, 20th International Workshop,
{WG} '94, Herrsching, Germany, June 16-18, 1994, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {903},
pages = {65--80},
publisher = {Springer},
year = {1994},
url = {https://doi.org/10.1007/3-540-59071-4\_38},
doi = {10.1007/3-540-59071-4\_38},
timestamp = {Sun, 02 Oct 2022 16:17:33 +0200},
biburl = {https://dblp.org/rec/conf/wg/BrandstadtCD94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/csjm/Dragan93,
author = {Feodor F. Dragan},
title = {HT-graphs: centers, connected r-domination and Steiner trees},
journal = {Comput. Sci. J. Moldova},
volume = {1},
number = {2},
pages = {64--83},
year = {1993},
url = {http://www.math.md/publications/csjm/issues/v1-n2/7770/},
timestamp = {Wed, 02 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/csjm/Dragan93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/csjm/ChepoiD93,
author = {Victor Chepoi and
Feodor F. Dragan},
title = {On link diameter of a simple rectilinear polygon},
journal = {Comput. Sci. J. Moldova},
volume = {1},
number = {3},
pages = {62--74},
year = {1993},
url = {http://www.math.md/publications/csjm/issues/v1-n3/7791/},
timestamp = {Wed, 02 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/csjm/ChepoiD93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/BrandstadtDCV93,
author = {Andreas Brandst{\"{a}}dt and
Feodor F. Dragan and
Victor Chepoi and
Vitaly I. Voloshin},
editor = {Jan van Leeuwen},
title = {Dually Chordal Graphs},
booktitle = {Graph-Theoretic Concepts in Computer Science, 19th International Workshop,
{WG} '93, Utrecht, The Netherlands, June 16-18, 1993, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {790},
pages = {237--251},
publisher = {Springer},
year = {1993},
url = {https://doi.org/10.1007/3-540-57899-4\_56},
doi = {10.1007/3-540-57899-4\_56},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/BrandstadtDCV93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-02-06 23:50 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
