Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Loukas Georgiadis
@inproceedings{DBLP:conf/iwoca/GeorgiadisKK23,
author = {Loukas Georgiadis and
Dionysios Kefallinos and
Evangelos Kosinas},
editor = {Sun{-}Yuan Hsieh and
Ling{-}Ju Hung and
Chia{-}Wei Lee},
title = {On 2-Strong Connectivity Orientations of Mixed Graphs and Related
Problems},
booktitle = {Combinatorial Algorithms - 34th International Workshop, {IWOCA} 2023,
Tainan, Taiwan, June 7-10, 2023, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13889},
pages = {209--220},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-34347-6\_18},
doi = {10.1007/978-3-031-34347-6\_18},
timestamp = {Mon, 26 Jun 2023 15:55:36 +0200},
biburl = {https://dblp.org/rec/conf/iwoca/GeorgiadisKK23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GeorgiadisKPP23,
author = {Loukas Georgiadis and
Evangelos Kipouridis and
Charis Papadopoulos and
Nikos Parotsidis},
editor = {Nikhil Bansal and
Viswanath Nagarajan},
title = {Faster Computation of 3-Edge-Connected Components in Digraphs},
booktitle = {Proceedings of the 2023 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2023, Florence, Italy, January 22-25, 2023},
pages = {2489--2531},
publisher = {{SIAM}},
year = {2023},
url = {https://doi.org/10.1137/1.9781611977554.ch96},
doi = {10.1137/1.9781611977554.CH96},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/GeorgiadisKPP23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/wea/2023,
editor = {Loukas Georgiadis},
title = {21st International Symposium on Experimental Algorithms, {SEA} 2023,
July 24-26, 2023, Barcelona, Spain},
series = {LIPIcs},
volume = {265},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://www.dagstuhl.de/dagpub/978-3-95977-279-2},
isbn = {978-3-95977-279-2},
timestamp = {Thu, 20 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wea/2023.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2302-02215,
author = {Loukas Georgiadis and
Dionysios Kefallinos and
Evangelos Kosinas},
title = {On 2-strong connectivity orientations of mixed graphs and related
problems},
journal = {CoRR},
volume = {abs/2302.02215},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2302.02215},
doi = {10.48550/ARXIV.2302.02215},
eprinttype = {arXiv},
eprint = {2302.02215},
timestamp = {Sun, 19 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2302-02215.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2311-00854,
author = {Loukas Georgiadis and
Evangelos Kosinas and
Daniel Tsokaktsis},
title = {2-Fault-Tolerant Strong Connectivity Oracles},
journal = {CoRR},
volume = {abs/2311.00854},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2311.00854},
doi = {10.48550/ARXIV.2311.00854},
eprinttype = {arXiv},
eprint = {2311.00854},
timestamp = {Tue, 07 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2311-00854.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/GeorgiadisIK22,
author = {Loukas Georgiadis and
Giuseppe F. Italiano and
Evangelos Kosinas},
editor = {Shiri Chechik and
Gonzalo Navarro and
Eva Rotenberg and
Grzegorz Herman},
title = {Computing the 4-Edge-Connected Components of a Graph: An Experimental
Study},
booktitle = {30th Annual European Symposium on Algorithms, {ESA} 2022, September
5-9, 2022, Berlin/Potsdam, Germany},
series = {LIPIcs},
volume = {244},
pages = {60:1--60:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.ESA.2022.60},
doi = {10.4230/LIPICS.ESA.2022.60},
timestamp = {Wed, 28 Feb 2024 00:16:41 +0100},
biburl = {https://dblp.org/rec/conf/esa/GeorgiadisIK22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wea/GeorgiadisKMN22,
author = {Loukas Georgiadis and
Dionysios Kefallinos and
Anna Mpanti and
Stavros D. Nikolopoulos},
editor = {Christian Schulz and
Bora U{\c{c}}ar},
title = {An Experimental Study of Algorithms for Packing Arborescences},
booktitle = {20th International Symposium on Experimental Algorithms, {SEA} 2022,
July 25-27, 2022, Heidelberg, Germany},
series = {LIPIcs},
volume = {233},
pages = {14:1--14:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.SEA.2022.14},
doi = {10.4230/LIPICS.SEA.2022.14},
timestamp = {Mon, 11 Jul 2022 14:59:46 +0200},
biburl = {https://dblp.org/rec/conf/wea/GeorgiadisKMN22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2211-06521,
author = {Loukas Georgiadis and
Giuseppe F. Italiano and
Evangelos Kosinas and
Debasish Pattanayak},
title = {On maximal 3-edge-connected subgraphs of undirected graphs},
journal = {CoRR},
volume = {abs/2211.06521},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2211.06521},
doi = {10.48550/ARXIV.2211.06521},
eprinttype = {arXiv},
eprint = {2211.06521},
timestamp = {Tue, 15 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2211-06521.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/GeorgiadisKLP21,
author = {Loukas Georgiadis and
Dionysios Kefallinos and
Luigi Laura and
Nikos Parotsidis},
editor = {Martin Farach{-}Colton and
Sabine Storandt},
title = {An Experimental Study of Algorithms for Computing the Edge Connectivity
of a Directed Graph},
booktitle = {Proceedings of the Symposium on Algorithm Engineering and Experiments,
{ALENEX} 2021, Virtual Conference, January 10-11, 2021},
pages = {85--97},
publisher = {{SIAM}},
year = {2021},
url = {https://doi.org/10.1137/1.9781611976472.7},
doi = {10.1137/1.9781611976472.7},
timestamp = {Wed, 17 Mar 2021 12:44:04 +0100},
biburl = {https://dblp.org/rec/conf/alenex/GeorgiadisKLP21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/GeorgiadisIK21,
author = {Loukas Georgiadis and
Giuseppe F. Italiano and
Evangelos Kosinas},
editor = {Petra Mutzel and
Rasmus Pagh and
Grzegorz Herman},
title = {Computing the 4-Edge-Connected Components of a Graph in Linear Time},
booktitle = {29th Annual European Symposium on Algorithms, {ESA} 2021, September
6-8, 2021, Lisbon, Portugal (Virtual Conference)},
series = {LIPIcs},
volume = {204},
pages = {47:1--47:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ESA.2021.47},
doi = {10.4230/LIPICS.ESA.2021.47},
timestamp = {Tue, 31 Aug 2021 14:18:27 +0200},
biburl = {https://dblp.org/rec/conf/esa/GeorgiadisIK21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wea/GeorgiadisGIK21,
author = {Loukas Georgiadis and
Konstantinos Giannis and
Giuseppe F. Italiano and
Evangelos Kosinas},
editor = {David Coudert and
Emanuele Natale},
title = {Computing Vertex-Edge Cut-Pairs and 2-Edge Cuts in Practice},
booktitle = {19th International Symposium on Experimental Algorithms, {SEA} 2021,
June 7-9, 2021, Nice, France},
series = {LIPIcs},
volume = {190},
pages = {20:1--20:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.SEA.2021.20},
doi = {10.4230/LIPICS.SEA.2021.20},
timestamp = {Tue, 01 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wea/GeorgiadisGIK21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2105-02910,
author = {Loukas Georgiadis and
Giuseppe F. Italiano and
Evangelos Kosinas},
title = {Computing the 4-Edge-Connected Components of a Graph in Linear Time},
journal = {CoRR},
volume = {abs/2105.02910},
year = {2021},
url = {https://arxiv.org/abs/2105.02910},
eprinttype = {arXiv},
eprint = {2105.02910},
timestamp = {Fri, 14 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2105-02910.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2108-08558,
author = {Loukas Georgiadis and
Giuseppe F. Italiano and
Evangelos Kosinas},
title = {Improved Linear-Time Algorithm for Computing the 4-Edge-Connected
Components of a Graph},
journal = {CoRR},
volume = {abs/2108.08558},
year = {2021},
url = {https://arxiv.org/abs/2108.08558},
eprinttype = {arXiv},
eprint = {2108.08558},
timestamp = {Mon, 23 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2108-08558.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GeorgiadisIP20,
author = {Loukas Georgiadis and
Giuseppe F. Italiano and
Nikos Parotsidis},
title = {Strong Connectivity in Directed Graphs under Failures, with Applications},
journal = {{SIAM} J. Comput.},
volume = {49},
number = {5},
pages = {865--926},
year = {2020},
url = {https://doi.org/10.1137/19M1258530},
doi = {10.1137/19M1258530},
timestamp = {Tue, 01 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/GeorgiadisIP20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GeorgiadisIK20,
author = {Loukas Georgiadis and
Giuseppe F. Italiano and
Aikaterini Karanasiou},
title = {Approximating the smallest 2-vertex connected spanning subgraph of
a directed graph},
journal = {Theor. Comput. Sci.},
volume = {807},
pages = {185--200},
year = {2020},
url = {https://doi.org/10.1016/j.tcs.2019.09.040},
doi = {10.1016/J.TCS.2019.09.040},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/GeorgiadisIK20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/GeorgiadisK20,
author = {Loukas Georgiadis and
Evangelos Kosinas},
editor = {Yixin Cao and
Siu{-}Wing Cheng and
Minming Li},
title = {Linear-Time Algorithms for Computing Twinless Strong Articulation
Points and Related Problems},
booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC}
2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)},
series = {LIPIcs},
volume = {181},
pages = {38:1--38:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.38},
doi = {10.4230/LIPICS.ISAAC.2020.38},
timestamp = {Thu, 16 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/GeorgiadisK20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2007-03933,
author = {Loukas Georgiadis and
Evangelos Kosinas},
title = {Linear-Time Algorithms for Computing Twinless Strong Articulation
Points and Related Problems},
journal = {CoRR},
volume = {abs/2007.03933},
year = {2020},
url = {https://arxiv.org/abs/2007.03933},
eprinttype = {arXiv},
eprint = {2007.03933},
timestamp = {Mon, 20 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2007-03933.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/GeorgiadisGIKL19,
author = {Loukas Georgiadis and
Konstantinos Giannis and
Giuseppe F. Italiano and
Aikaterini Karanasiou and
Luigi Laura},
editor = {Michael A. Bender and
Ola Svensson and
Grzegorz Herman},
title = {Dynamic Dominators and Low-High Orders in DAGs},
booktitle = {27th Annual European Symposium on Algorithms, {ESA} 2019, September
9-11, 2019, Munich/Garching, Germany},
series = {LIPIcs},
volume = {144},
pages = {50:1--50:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ESA.2019.50},
doi = {10.4230/LIPICS.ESA.2019.50},
timestamp = {Mon, 23 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/GeorgiadisGIKL19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/AbboudGIKPTUW19,
author = {Amir Abboud and
Loukas Georgiadis and
Giuseppe F. Italiano and
Robert Krauthgamer and
Nikos Parotsidis and
Ohad Trabelsi and
Przemyslaw Uznanski and
Daniel Wolleb{-}Graf},
editor = {Christel Baier and
Ioannis Chatzigiannakis and
Paola Flocchini and
Stefano Leonardi},
title = {Faster Algorithms for All-Pairs Bounded Min-Cuts},
booktitle = {46th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2019, July 9-12, 2019, Patras, Greece},
series = {LIPIcs},
volume = {132},
pages = {7:1--7:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2019.7},
doi = {10.4230/LIPICS.ICALP.2019.7},
timestamp = {Tue, 27 Dec 2022 09:06:31 +0100},
biburl = {https://dblp.org/rec/conf/icalp/AbboudGIKPTUW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/GeorgiadisILP18,
author = {Loukas Georgiadis and
Giuseppe F. Italiano and
Luigi Laura and
Nikos Parotsidis},
title = {2-vertex connectivity in directed graphs},
journal = {Inf. Comput.},
volume = {261},
pages = {248--264},
year = {2018},
url = {https://doi.org/10.1016/j.ic.2018.02.007},
doi = {10.1016/J.IC.2018.02.007},
timestamp = {Tue, 03 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/GeorgiadisILP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/PaudelGI18,
author = {Nilakantha Paudel and
Loukas Georgiadis and
Giuseppe F. Italiano},
title = {Computing Critical Nodes in Directed Graphs},
journal = {{ACM} J. Exp. Algorithmics},
volume = {23},
year = {2018},
url = {https://doi.org/10.1145/3228332},
doi = {10.1145/3228332},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/PaudelGI18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/GeorgiadisIKPP18,
author = {Loukas Georgiadis and
Giuseppe F. Italiano and
Aikaterini Karanasiou and
Nikos Parotsidis and
Nilakantha Paudel},
editor = {Rasmus Pagh and
Suresh Venkatasubramanian},
title = {Computing 2-Connected Components and Maximal 2-Connected Subgraphs
in Directed Graphs: An Experimental Study},
booktitle = {Proceedings of the Twentieth Workshop on Algorithm Engineering and
Experiments, {ALENEX} 2018, New Orleans, LA, USA, January 7-8, 2018},
pages = {169--183},
publisher = {{SIAM}},
year = {2018},
url = {https://doi.org/10.1137/1.9781611975055.15},
doi = {10.1137/1.9781611975055.15},
timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/alenex/GeorgiadisIKPP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/GeorgiadisIP18,
author = {Loukas Georgiadis and
Giuseppe F. Italiano and
Nikos Parotsidis},
editor = {Michael A. Bender and
Martin Farach{-}Colton and
Miguel A. Mosteiro},
title = {Incremental Strong Connectivity and 2-Connectivity in Directed Graphs},
booktitle = {{LATIN} 2018: Theoretical Informatics - 13th Latin American Symposium,
Buenos Aires, Argentina, April 16-19, 2018, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10807},
pages = {529--543},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-319-77404-6\_39},
doi = {10.1007/978-3-319-77404-6\_39},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/latin/GeorgiadisIP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1802-10189,
author = {Loukas Georgiadis and
Giuseppe F. Italiano and
Nikos Parotsidis},
title = {Incremental Strong Connectivity and 2-Connectivity in Directed Graphs},
journal = {CoRR},
volume = {abs/1802.10189},
year = {2018},
url = {http://arxiv.org/abs/1802.10189},
eprinttype = {arXiv},
eprint = {1802.10189},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1802-10189.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1807-05803,
author = {Amir Abboud and
Loukas Georgiadis and
Daniel Graf and
Giuseppe F. Italiano and
Robert Krauthgamer and
Nikos Parotsidis and
Ohad Trabelsi and
Przemyslaw Uznanski},
title = {Faster Algorithms for All-Pairs Bounded Min-Cuts},
journal = {CoRR},
volume = {abs/1807.05803},
year = {2018},
url = {http://arxiv.org/abs/1807.05803},
eprinttype = {arXiv},
eprint = {1807.05803},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1807-05803.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GeorgiadisIKPP17,
author = {Loukas Georgiadis and
Giuseppe F. Italiano and
Aikaterini Karanasiou and
Charis Papadopoulos and
Nikos Parotsidis},
title = {Sparse certificates for 2-connectivity in directed graphs},
journal = {Theor. Comput. Sci.},
volume = {698},
pages = {40--66},
year = {2017},
url = {https://doi.org/10.1016/j.tcs.2017.06.015},
doi = {10.1016/J.TCS.2017.06.015},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/GeorgiadisIKPP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/PaudelGI17,
author = {Nilakantha Paudel and
Loukas Georgiadis and
Giuseppe F. Italiano},
editor = {S{\'{a}}ndor P. Fekete and
Vijaya Ramachandran},
title = {Computing Critical Nodes in Directed Graphs},
booktitle = {Proceedings of the Ninteenth Workshop on Algorithm Engineering and
Experiments, {ALENEX} 2017, Barcelona, Spain, Hotel Porta Fira, January
17-18, 2017},
pages = {43--57},
publisher = {{SIAM}},
year = {2017},
url = {https://doi.org/10.1137/1.9781611974768.4},
doi = {10.1137/1.9781611974768.4},
timestamp = {Fri, 19 May 2017 01:26:03 +0200},
biburl = {https://dblp.org/rec/conf/alenex/PaudelGI17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/GeorgiadisHIKP17,
author = {Loukas Georgiadis and
Thomas Dueholm Hansen and
Giuseppe F. Italiano and
Sebastian Krinninger and
Nikos Parotsidis},
editor = {Ioannis Chatzigiannakis and
Piotr Indyk and
Fabian Kuhn and
Anca Muscholl},
title = {Decremental Data Structures for Connectivity and Dominators in Directed
Graphs},
booktitle = {44th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2017, July 10-14, 2017, Warsaw, Poland},
series = {LIPIcs},
volume = {80},
pages = {42:1--42:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2017.42},
doi = {10.4230/LIPICS.ICALP.2017.42},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/icalp/GeorgiadisHIKP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/GeorgiadisGIPU17,
author = {Loukas Georgiadis and
Daniel Graf and
Giuseppe F. Italiano and
Nikos Parotsidis and
Przemyslaw Uznanski},
editor = {Ioannis Chatzigiannakis and
Piotr Indyk and
Fabian Kuhn and
Anca Muscholl},
title = {All-Pairs 2-Reachability in O(n{\^{}}w log n) Time},
booktitle = {44th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2017, July 10-14, 2017, Warsaw, Poland},
series = {LIPIcs},
volume = {80},
pages = {74:1--74:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2017.74},
doi = {10.4230/LIPICS.ICALP.2017.74},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/icalp/GeorgiadisGIPU17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GeorgiadisIP17,
author = {Loukas Georgiadis and
Giuseppe F. Italiano and
Nikos Parotsidis},
editor = {Philip N. Klein},
title = {Strong Connectivity in Directed Graphs under Failures, with Applications},
booktitle = {Proceedings of the Twenty-Eighth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2017, Barcelona, Spain, Hotel Porta Fira, January
16-19},
pages = {1880--1899},
publisher = {{SIAM}},
year = {2017},
url = {https://doi.org/10.1137/1.9781611974782.123},
doi = {10.1137/1.9781611974782.123},
timestamp = {Tue, 02 Feb 2021 17:07:33 +0100},
biburl = {https://dblp.org/rec/conf/soda/GeorgiadisIP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wea/GeorgiadisIK17,
author = {Loukas Georgiadis and
Giuseppe F. Italiano and
Aikaterini Karanasiou},
editor = {Costas S. Iliopoulos and
Solon P. Pissis and
Simon J. Puglisi and
Rajeev Raman},
title = {Approximating the Smallest 2-Vertex-Connected Spanning Subgraph via
Low-High Orders},
booktitle = {16th International Symposium on Experimental Algorithms, {SEA} 2017,
June 21-23, 2017, London, {UK}},
series = {LIPIcs},
volume = {75},
pages = {9:1--9:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.SEA.2017.9},
doi = {10.4230/LIPICS.SEA.2017.9},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/wea/GeorgiadisIK17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wea/GeorgiadisKKL17,
author = {Loukas Georgiadis and
Konstantinos Giannis and
Aikaterini Karanasiou and
Luigi Laura},
editor = {Costas S. Iliopoulos and
Solon P. Pissis and
Simon J. Puglisi and
Rajeev Raman},
title = {Incremental Low-High Orders of Directed Graphs and Applications},
booktitle = {16th International Symposium on Experimental Algorithms, {SEA} 2017,
June 21-23, 2017, London, {UK}},
series = {LIPIcs},
volume = {75},
pages = {27:1--27:21},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.SEA.2017.27},
doi = {10.4230/LIPICS.SEA.2017.27},
timestamp = {Sun, 08 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wea/GeorgiadisKKL17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GeorgiadisHIKP17,
author = {Loukas Georgiadis and
Thomas Dueholm Hansen and
Giuseppe F. Italiano and
Sebastian Krinninger and
Nikos Parotsidis},
title = {Decremental Data Structures for Connectivity and Dominators in Directed
Graphs},
journal = {CoRR},
volume = {abs/1704.08235},
year = {2017},
url = {http://arxiv.org/abs/1704.08235},
eprinttype = {arXiv},
eprint = {1704.08235},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/GeorgiadisHIKP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/FirmaniGILS16,
author = {Donatella Firmani and
Loukas Georgiadis and
Giuseppe F. Italiano and
Luigi Laura and
Federico Santaroni},
title = {Strong Articulation Points and Strong Bridges in Large Scale Graphs},
journal = {Algorithmica},
volume = {74},
number = {3},
pages = {1123--1147},
year = {2016},
url = {https://doi.org/10.1007/s00453-015-9991-z},
doi = {10.1007/S00453-015-9991-Z},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/FirmaniGILS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/GeorgiadisT16,
author = {Loukas Georgiadis and
Robert E. Tarjan},
title = {Dominator Tree Certification and Divergent Spanning Trees},
journal = {{ACM} Trans. Algorithms},
volume = {12},
number = {1},
pages = {11:1--11:42},
year = {2016},
url = {https://doi.org/10.1145/2764913},
doi = {10.1145/2764913},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/GeorgiadisT16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/GeorgiadisT16a,
author = {Loukas Georgiadis and
Robert E. Tarjan},
title = {Addendum to "Dominator Tree Certification and Divergent Spanning
Trees"},
journal = {{ACM} Trans. Algorithms},
volume = {12},
number = {4},
pages = {56:1--56:3},
year = {2016},
url = {https://doi.org/10.1145/2928271},
doi = {10.1145/2928271},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/GeorgiadisT16a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/GeorgiadisILP16,
author = {Loukas Georgiadis and
Giuseppe F. Italiano and
Luigi Laura and
Nikos Parotsidis},
title = {2-Edge Connectivity in Directed Graphs},
journal = {{ACM} Trans. Algorithms},
volume = {13},
number = {1},
pages = {9:1--9:24},
year = {2016},
url = {https://doi.org/10.1145/2968448},
doi = {10.1145/2968448},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/talg/GeorgiadisILP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/GeorgiadisIP16,
author = {Loukas Georgiadis and
Giuseppe F. Italiano and
Nikos Parotsidis},
editor = {Piotr Sankowski and
Christos D. Zaroliagis},
title = {2-Connectivity in Directed Graphs},
booktitle = {24th Annual European Symposium on Algorithms, {ESA} 2016, August 22-24,
2016, Aarhus, Denmark},
series = {LIPIcs},
volume = {57},
pages = {1:1--1:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.ESA.2016.1},
doi = {10.4230/LIPICS.ESA.2016.1},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/esa/GeorgiadisIP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/GeorgiadisIP16,
author = {Loukas Georgiadis and
Giuseppe F. Italiano and
Nikos Parotsidis},
editor = {Ioannis Chatzigiannakis and
Michael Mitzenmacher and
Yuval Rabani and
Davide Sangiorgi},
title = {Incremental 2-Edge-Connectivity in Directed Graphs},
booktitle = {43rd International Colloquium on Automata, Languages, and Programming,
{ICALP} 2016, July 11-15, 2016, Rome, Italy},
series = {LIPIcs},
volume = {55},
pages = {49:1--49:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2016.49},
doi = {10.4230/LIPICS.ICALP.2016.49},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/icalp/GeorgiadisIP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wea/GeorgiadisIKPP16,
author = {Loukas Georgiadis and
Giuseppe F. Italiano and
Aikaterini Karanasiou and
Charis Papadopoulos and
Nikos Parotsidis},
editor = {Andrew V. Goldberg and
Alexander S. Kulikov},
title = {Sparse Subgraphs for 2-Connectivity in Directed Graphs},
booktitle = {Experimental Algorithms - 15th International Symposium, {SEA} 2016,
St. Petersburg, Russia, June 5-8, 2016, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9685},
pages = {150--166},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-319-38851-9\_11},
doi = {10.1007/978-3-319-38851-9\_11},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wea/GeorgiadisIKPP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GeorgiadisILS16,
author = {Loukas Georgiadis and
Giuseppe F. Italiano and
Luigi Laura and
Federico Santaroni},
title = {An Experimental Study of Dynamic Dominators},
journal = {CoRR},
volume = {abs/1604.02711},
year = {2016},
url = {http://arxiv.org/abs/1604.02711},
eprinttype = {arXiv},
eprint = {1604.02711},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/GeorgiadisILS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GeorgiadisIP16,
author = {Loukas Georgiadis and
Giuseppe F. Italiano and
Nikos Parotsidis},
title = {Incremental 2-Edge-Connectivity in Directed Graphs},
journal = {CoRR},
volume = {abs/1607.07073},
year = {2016},
url = {http://arxiv.org/abs/1607.07073},
eprinttype = {arXiv},
eprint = {1607.07073},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/GeorgiadisIP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GeorgiadisKKL16,
author = {Loukas Georgiadis and
Aikaterini Karanasiou and
Konstantinos Giannis and
Luigi Laura},
title = {On Low-High Orders of Directed Graphs: Incremental Algorithms and
Applications},
journal = {CoRR},
volume = {abs/1608.06462},
year = {2016},
url = {http://arxiv.org/abs/1608.06462},
eprinttype = {arXiv},
eprint = {1608.06462},
timestamp = {Sun, 08 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/GeorgiadisKKL16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GeorgiadisGIPU16,
author = {Loukas Georgiadis and
Daniel Graf and
Giuseppe F. Italiano and
Nikos Parotsidis and
Przemyslaw Uznanski},
title = {All-Pairs {\textdollar}2{\textdollar}-reachability in {\~{O}}(n\({}^{\mbox{{\(\omega\)}}}\))
Time},
journal = {CoRR},
volume = {abs/1612.08075},
year = {2016},
url = {http://arxiv.org/abs/1612.08075},
eprinttype = {arXiv},
eprint = {1612.08075},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/GeorgiadisGIPU16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/LuigiGILP15,
author = {William Di Luigi and
Loukas Georgiadis and
Giuseppe F. Italiano and
Luigi Laura and
Nikos Parotsidis},
editor = {Ulrik Brandes and
David Eppstein},
title = {2-Connectivity in Directed Graphs: An Experimental Study},
booktitle = {Proceedings of the Seventeenth Workshop on Algorithm Engineering and
Experiments, {ALENEX} 2015, San Diego, CA, USA, January 5, 2015},
pages = {173--187},
publisher = {{SIAM}},
year = {2015},
url = {https://doi.org/10.1137/1.9781611973754.15},
doi = {10.1137/1.9781611973754.15},
timestamp = {Fri, 19 May 2017 01:26:03 +0200},
biburl = {https://dblp.org/rec/conf/alenex/LuigiGILP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/GeorgiadisIPP15,
author = {Loukas Georgiadis and
Giuseppe F. Italiano and
Charis Papadopoulos and
Nikos Parotsidis},
editor = {Nikhil Bansal and
Irene Finocchi},
title = {Approximating the Smallest Spanning Subgraph for 2-Edge-Connectivity
in Directed Graphs},
booktitle = {Algorithms - {ESA} 2015 - 23rd Annual European Symposium, Patras,
Greece, September 14-16, 2015, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9294},
pages = {582--594},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-662-48350-3\_49},
doi = {10.1007/978-3-662-48350-3\_49},
timestamp = {Tue, 15 Feb 2022 07:54:27 +0100},
biburl = {https://dblp.org/rec/conf/esa/GeorgiadisIPP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/GeorgiadisILP15,
author = {Loukas Georgiadis and
Giuseppe F. Italiano and
Luigi Laura and
Nikos Parotsidis},
editor = {Magn{\'{u}}s M. Halld{\'{o}}rsson and
Kazuo Iwama and
Naoki Kobayashi and
Bettina Speckmann},
title = {2-Vertex Connectivity in Directed Graphs},
booktitle = {Automata, Languages, and Programming - 42nd International Colloquium,
{ICALP} 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {9134},
pages = {605--616},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-662-47672-7\_49},
doi = {10.1007/978-3-662-47672-7\_49},
timestamp = {Fri, 27 Mar 2020 09:02:59 +0100},
biburl = {https://dblp.org/rec/conf/icalp/GeorgiadisILP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GeorgiadisILP15,
author = {Loukas Georgiadis and
Giuseppe F. Italiano and
Luigi Laura and
Nikos Parotsidis},
editor = {Piotr Indyk},
title = {2-Edge Connectivity in Directed Graphs},
booktitle = {Proceedings of the Twenty-Sixth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2015, San Diego, CA, USA, January 4-6, 2015},
pages = {1988--2005},
publisher = {{SIAM}},
year = {2015},
url = {https://doi.org/10.1137/1.9781611973730.132},
doi = {10.1137/1.9781611973730.132},
timestamp = {Tue, 02 Feb 2021 17:07:30 +0100},
biburl = {https://dblp.org/rec/conf/soda/GeorgiadisILP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GeorgiadisIPP15,
author = {Loukas Georgiadis and
Giuseppe F. Italiano and
Charis Papadopoulos and
Nikos Parotsidis},
title = {Approximating the Smallest Spanning Subgraph for 2-Edge-Connectivity
in Directed Graphs},
journal = {CoRR},
volume = {abs/1509.02841},
year = {2015},
url = {http://arxiv.org/abs/1509.02841},
eprinttype = {arXiv},
eprint = {1509.02841},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/GeorgiadisIPP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GeorgiadisIP15,
author = {Loukas Georgiadis and
Giuseppe F. Italiano and
Nikos Parotsidis},
title = {A New Framework for Strong Connectivity and 2-Connectivity in Directed
Graphs},
journal = {CoRR},
volume = {abs/1511.02913},
year = {2015},
url = {http://arxiv.org/abs/1511.02913},
eprinttype = {arXiv},
eprint = {1511.02913},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/GeorgiadisIP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GeorgiadisT15,
author = {Loukas Georgiadis and
Robert E. Tarjan},
title = {A Note on Fault Tolerant Reachability for Directed Graphs},
journal = {CoRR},
volume = {abs/1511.07741},
year = {2015},
url = {http://arxiv.org/abs/1511.07741},
eprinttype = {arXiv},
eprint = {1511.07741},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/GeorgiadisT15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/FraczakGMT14,
author = {Wojciech Fraczak and
Loukas Georgiadis and
Andrew Miller and
Robert Endre Tarjan},
title = {Corrections to "Finding dominators via disjoint set union"
{[J.} Discrete Algorithms 23 {(2013)} 2-20]},
journal = {J. Discrete Algorithms},
volume = {26},
pages = {106--110},
year = {2014},
url = {https://doi.org/10.1016/j.jda.2014.01.002},
doi = {10.1016/J.JDA.2014.01.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/FraczakGMT14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/GeorgiadisNP14,
author = {Loukas Georgiadis and
Stavros D. Nikolopoulos and
Leonidas Palios},
title = {Join-Reachability Problems in Directed Graphs},
journal = {Theory Comput. Syst.},
volume = {55},
number = {2},
pages = {347--379},
year = {2014},
url = {https://doi.org/10.1007/s00224-013-9450-7},
doi = {10.1007/S00224-013-9450-7},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/GeorgiadisNP14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wea/GeorgiadisLPT14,
author = {Loukas Georgiadis and
Luigi Laura and
Nikos Parotsidis and
Robert Endre Tarjan},
editor = {Joachim Gudmundsson and
Jyrki Katajainen},
title = {Loop Nesting Forests, Dominators, and Applications},
booktitle = {Experimental Algorithms - 13th International Symposium, {SEA} 2014,
Copenhagen, Denmark, June 29 - July 1, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8504},
pages = {174--186},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-07959-2\_15},
doi = {10.1007/978-3-319-07959-2\_15},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/wea/GeorgiadisLPT14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GeorgiadisILP14,
author = {Loukas Georgiadis and
Giuseppe F. Italiano and
Luigi Laura and
Nikos Parotsidis},
title = {2-Edge Connectivity in Directed Graphs},
journal = {CoRR},
volume = {abs/1407.3041},
year = {2014},
url = {http://arxiv.org/abs/1407.3041},
eprinttype = {arXiv},
eprint = {1407.3041},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/GeorgiadisILP14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GeorgiadisILP14a,
author = {Loukas Georgiadis and
Giuseppe F. Italiano and
Luigi Laura and
Nikos Parotsidis},
title = {2-Vertex Connectivity in Directed Graphs},
journal = {CoRR},
volume = {abs/1409.6277},
year = {2014},
url = {http://arxiv.org/abs/1409.6277},
eprinttype = {arXiv},
eprint = {1409.6277},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/GeorgiadisILP14a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/FraczakGMT13,
author = {Wojciech Fraczak and
Loukas Georgiadis and
Andrew Miller and
Robert Endre Tarjan},
title = {Finding dominators via disjoint set union},
journal = {J. Discrete Algorithms},
volume = {23},
pages = {2--20},
year = {2013},
url = {https://doi.org/10.1016/j.jda.2013.10.003},
doi = {10.1016/J.JDA.2013.10.003},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/FraczakGMT13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wea/GeorgiadisLPT13,
author = {Loukas Georgiadis and
Luigi Laura and
Nikos Parotsidis and
Robert Endre Tarjan},
editor = {Vincenzo Bonifaci and
Camil Demetrescu and
Alberto Marchetti{-}Spaccamela},
title = {Dominator Certification and Independent Spanning Trees: An Experimental
Study},
booktitle = {Experimental Algorithms, 12th International Symposium, {SEA} 2013,
Rome, Italy, June 5-7, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7933},
pages = {284--295},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-38527-8\_26},
doi = {10.1007/978-3-642-38527-8\_26},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/wea/GeorgiadisLPT13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/FraczakGMT13,
author = {Wojciech Fraczak and
Loukas Georgiadis and
Andrew Miller and
Robert Endre Tarjan},
title = {Finding Dominators via Disjoint Set Union},
journal = {CoRR},
volume = {abs/1310.2118},
year = {2013},
url = {http://arxiv.org/abs/1310.2118},
eprinttype = {arXiv},
eprint = {1310.2118},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/FraczakGMT13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/GeorgiadisILS12,
author = {Loukas Georgiadis and
Giuseppe F. Italiano and
Luigi Laura and
Federico Santaroni},
editor = {Leah Epstein and
Paolo Ferragina},
title = {An Experimental Study of Dynamic Dominators},
booktitle = {Algorithms - {ESA} 2012 - 20th Annual European Symposium, Ljubljana,
Slovenia, September 10-12, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7501},
pages = {491--502},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-33090-2\_43},
doi = {10.1007/978-3-642-33090-2\_43},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/esa/GeorgiadisILS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/GeorgiadisT12,
author = {Loukas Georgiadis and
Robert Endre Tarjan},
editor = {Artur Czumaj and
Kurt Mehlhorn and
Andrew M. Pitts and
Roger Wattenhofer},
title = {Dominators, Directed Bipolar Orders, and Independent Spanning Trees},
booktitle = {Automata, Languages, and Programming - 39th International Colloquium,
{ICALP} 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {7391},
pages = {375--386},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-31594-7\_32},
doi = {10.1007/978-3-642-31594-7\_32},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/GeorgiadisT12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1210-8303,
author = {Loukas Georgiadis and
Robert Endre Tarjan},
title = {Dominator Tree Certification and Independent Spanning Trees},
journal = {CoRR},
volume = {abs/1210.8303},
year = {2012},
url = {http://arxiv.org/abs/1210.8303},
eprinttype = {arXiv},
eprint = {1210.8303},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1210-8303.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/GeorgiadisKSTW11,
author = {Loukas Georgiadis and
Haim Kaplan and
Nira Shafrir and
Robert Endre Tarjan and
Renato Fonseca F. Werneck},
title = {Data structures for mergeable trees},
journal = {{ACM} Trans. Algorithms},
volume = {7},
number = {2},
pages = {14:1--14:30},
year = {2011},
url = {https://doi.org/10.1145/1921659.1921660},
doi = {10.1145/1921659.1921660},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/GeorgiadisKSTW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csr/GeorgiadisNP11,
author = {Loukas Georgiadis and
Stavros D. Nikolopoulos and
Leonidas Palios},
editor = {Alexander S. Kulikov and
Nikolay K. Vereshchagin},
title = {Join-Reachability Problems in Directed Graphs},
booktitle = {Computer Science - Theory and Applications - 6th International Computer
Science Symposium in Russia, {CSR} 2011, St. Petersburg, Russia, June
14-18, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6651},
pages = {195--208},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-20712-9\_15},
doi = {10.1007/978-3-642-20712-9\_15},
timestamp = {Tue, 14 May 2019 10:00:51 +0200},
biburl = {https://dblp.org/rec/conf/csr/GeorgiadisNP11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/Georgiadis11,
author = {Loukas Georgiadis},
editor = {Camil Demetrescu and
Magn{\'{u}}s M. Halld{\'{o}}rsson},
title = {Approximating the Smallest 2-Vertex Connected Spanning Subgraph of
a Directed Graph},
booktitle = {Algorithms - {ESA} 2011 - 19th Annual European Symposium, Saarbr{\"{u}}cken,
Germany, September 5-9, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6942},
pages = {13--24},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-23719-5\_2},
doi = {10.1007/978-3-642-23719-5\_2},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/esa/Georgiadis11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/pci/PatakakisGT11,
author = {Konstantinos Patakakis and
Loukas Georgiadis and
Vasileios A. Tatsis},
editor = {Pantelis Angelidis and
Angelos Michalas},
title = {Dynamic Dominators in Practice},
booktitle = {15th Panhellenic Conference on Informatics, {PCI} 2011, Kastoria,
Greece, September 30 - October 2, 2011},
pages = {100--104},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/PCI.2011.28},
doi = {10.1109/PCI.2011.28},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/pci/PatakakisGT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/twc/GatzianasGT10,
author = {Marios Gatzianas and
Loukas Georgiadis and
Leandros Tassiulas},
title = {Control of wireless networks with rechargeable batteries [transactions
papers]},
journal = {{IEEE} Trans. Wirel. Commun.},
volume = {9},
number = {2},
pages = {581--593},
year = {2010},
url = {https://doi.org/10.1109/TWC.2010.080903},
doi = {10.1109/TWC.2010.080903},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/twc/GatzianasGT10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/Georgiadis10,
author = {Loukas Georgiadis},
editor = {Samson Abramsky and
Cyril Gavoille and
Claude Kirchner and
Friedhelm Meyer auf der Heide and
Paul G. Spirakis},
title = {Testing 2-Vertex Connectivity and Computing Pairs of Vertex-Disjoint
\emph{s}-\emph{t} Paths in Digraphs},
booktitle = {Automata, Languages and Programming, 37th International Colloquium,
{ICALP} 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part
{I}},
series = {Lecture Notes in Computer Science},
volume = {6198},
pages = {738--749},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-14165-2\_62},
doi = {10.1007/978-3-642-14165-2\_62},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/Georgiadis10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1012-4938,
author = {Loukas Georgiadis and
Stavros D. Nikolopoulos and
Leonidas Palios},
title = {Join-Reachability Problems in Directed Graphs},
journal = {CoRR},
volume = {abs/1012.4938},
year = {2010},
url = {http://arxiv.org/abs/1012.4938},
eprinttype = {arXiv},
eprint = {1012.4938},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1012-4938.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/CherkasskyGGTW09,
author = {Boris V. Cherkassky and
Loukas Georgiadis and
Andrew V. Goldberg and
Robert Endre Tarjan and
Renato Fonseca F. Werneck},
title = {Shortest-path feasibility algorithms: An experimental evaluation},
journal = {{ACM} J. Exp. Algorithmics},
volume = {14},
year = {2009},
url = {https://doi.org/10.1145/1498698.1537602},
doi = {10.1145/1498698.1537602},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/CherkasskyGGTW09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/GeorgiadisGTW09,
author = {Loukas Georgiadis and
Andrew V. Goldberg and
Robert Endre Tarjan and
Renato Fonseca F. Werneck},
editor = {Irene Finocchi and
John Hershberger},
title = {An Experimental Study of Minimum Mean Cycle Algorithms},
booktitle = {Proceedings of the Eleventh Workshop on Algorithm Engineering and
Experiments, {ALENEX} 2009, New York, New York, USA, January 3, 2009},
pages = {1--13},
publisher = {{SIAM}},
year = {2009},
url = {https://doi.org/10.1137/1.9781611972894.1},
doi = {10.1137/1.9781611972894.1},
timestamp = {Wed, 03 Jan 2018 16:51:51 +0100},
biburl = {https://dblp.org/rec/conf/alenex/GeorgiadisGTW09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/BrodalGK08,
author = {Gerth St{\o}lting Brodal and
Loukas Georgiadis and
Irit Katriel},
title = {An O(nlogn) version of the Averbakh-Berman algorithm for the robust
median of a tree},
journal = {Oper. Res. Lett.},
volume = {36},
number = {1},
pages = {14--18},
year = {2008},
url = {https://doi.org/10.1016/j.orl.2007.02.012},
doi = {10.1016/J.ORL.2007.02.012},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/BrodalGK08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BuchsbaumGKRTW08,
author = {Adam L. Buchsbaum and
Loukas Georgiadis and
Haim Kaplan and
Anne Rogers and
Robert Endre Tarjan and
Jeffery R. Westbrook},
title = {Linear-Time Algorithms for Dominators and Other Path-Evaluation Problems},
journal = {{SIAM} J. Comput.},
volume = {38},
number = {4},
pages = {1533--1573},
year = {2008},
url = {https://doi.org/10.1137/070693217},
doi = {10.1137/070693217},
timestamp = {Mon, 08 Apr 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BuchsbaumGKRTW08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/CherkasskyGGTW08,
author = {Boris V. Cherkassky and
Loukas Georgiadis and
Andrew V. Goldberg and
Robert Endre Tarjan and
Renato Fonseca F. Werneck},
editor = {J. Ian Munro and
Dorothea Wagner},
title = {Shortest Path Feasibility Algorithms: An Experimental Evaluation},
booktitle = {Proceedings of the Tenth Workshop on Algorithm Engineering and Experiments,
{ALENEX} 2008, San Francisco, California, USA, January 19, 2008},
pages = {118--132},
publisher = {{SIAM}},
year = {2008},
url = {https://doi.org/10.1137/1.9781611972887.12},
doi = {10.1137/1.9781611972887.12},
timestamp = {Fri, 19 May 2017 01:26:03 +0200},
biburl = {https://dblp.org/rec/conf/alenex/CherkasskyGGTW08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/Georgiadis08,
author = {Loukas Georgiadis},
editor = {Seok{-}Hee Hong and
Hiroshi Nagamochi and
Takuro Fukunaga},
title = {Computing Frequency Dominators and Related Problems},
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 = {704--715},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-92182-0\_62},
doi = {10.1007/978-3-540-92182-0\_62},
timestamp = {Thu, 27 Apr 2023 14:57:19 +0200},
biburl = {https://dblp.org/rec/conf/isaac/Georgiadis08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/BrodalGHK07,
author = {Gerth St{\o}lting Brodal and
Loukas Georgiadis and
Kristoffer Arnsfelt Hansen and
Irit Katriel},
editor = {Ludek Kucera and
Anton{\'{\i}}n Kucera},
title = {Dynamic Matchings in Convex Bipartite Graphs},
booktitle = {Mathematical Foundations of Computer Science 2007, 32nd International
Symposium, {MFCS} 2007, Cesk{\'{y}} Krumlov, Czech Republic,
August 26-31, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4708},
pages = {406--417},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-74456-6\_37},
doi = {10.1007/978-3-540-74456-6\_37},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/BrodalGHK07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0711-1682,
author = {Loukas Georgiadis and
Haim Kaplan and
Nira Shafrir and
Robert Endre Tarjan and
Renato Fonseca F. Werneck},
title = {Data Structures for Mergeable Trees},
journal = {CoRR},
volume = {abs/0711.1682},
year = {2007},
url = {http://arxiv.org/abs/0711.1682},
eprinttype = {arXiv},
eprint = {0711.1682},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0711-1682.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/GeorgiadisTW06,
author = {Loukas Georgiadis and
Robert Endre Tarjan and
Renato Fonseca F. Werneck},
title = {Finding Dominators in Practice},
journal = {J. Graph Algorithms Appl.},
volume = {10},
number = {1},
pages = {69--94},
year = {2006},
url = {https://doi.org/10.7155/jgaa.00119},
doi = {10.7155/JGAA.00119},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/GeorgiadisTW06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ArgeBG06,
author = {Lars Arge and
Gerth St{\o}lting Brodal and
Loukas Georgiadis},
title = {Improved Dynamic Planar Point Location},
booktitle = {47th Annual {IEEE} Symposium on Foundations of Computer Science {(FOCS}
2006), 21-24 October 2006, Berkeley, California, USA, Proceedings},
pages = {305--314},
publisher = {{IEEE} Computer Society},
year = {2006},
url = {https://doi.org/10.1109/FOCS.2006.40},
doi = {10.1109/FOCS.2006.40},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ArgeBG06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GeorgiadisTW06,
author = {Loukas Georgiadis and
Robert Endre Tarjan and
Renato Fonseca F. Werneck},
title = {Design of data structures for mergeable trees},
booktitle = {Proceedings of the Seventeenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2006, Miami, Florida, USA, January 22-26, 2006},
pages = {394--403},
publisher = {{ACM} Press},
year = {2006},
url = {http://dl.acm.org/citation.cfm?id=1109557.1109602},
timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
biburl = {https://dblp.org/rec/conf/soda/GeorgiadisTW06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GeorgiadisT05,
author = {Loukas Georgiadis and
Robert Endre Tarjan},
title = {Dominator tree verification and vertex-disjoint paths},
booktitle = {Proceedings of the Sixteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2005, Vancouver, British Columbia, Canada, January
23-25, 2005},
pages = {433--442},
publisher = {{SIAM}},
year = {2005},
url = {http://dl.acm.org/citation.cfm?id=1070432.1070492},
timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
biburl = {https://dblp.org/rec/conf/soda/GeorgiadisT05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/GeorgiadisWTTA04,
author = {Loukas Georgiadis and
Renato Fonseca F. Werneck and
Robert Endre Tarjan and
Spyridon Triantafyllis and
David I. August},
editor = {Susanne Albers and
Tomasz Radzik},
title = {Finding Dominators in Practice},
booktitle = {Algorithms - {ESA} 2004, 12th Annual European Symposium, Bergen, Norway,
September 14-17, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3221},
pages = {677--688},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-30140-0\_60},
doi = {10.1007/978-3-540-30140-0\_60},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/esa/GeorgiadisWTTA04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GeorgiadisT04,
author = {Loukas Georgiadis and
Robert Endre Tarjan},
editor = {J. Ian Munro},
title = {Finding dominators revisited: extended abstract},
booktitle = {Proceedings of the Fifteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2004, New Orleans, Louisiana, USA, January 11-14,
2004},
pages = {869--878},
publisher = {{SIAM}},
year = {2004},
url = {http://dl.acm.org/citation.cfm?id=982792.982922},
timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
biburl = {https://dblp.org/rec/conf/soda/GeorgiadisT04.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-04-21 18:18 CEST 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:
