Preprints
Conference Papers
Faster Computation of 3-Edge-Connected Components in Digraphs
Loukas Georgiadis, Evangelos Kipouridis, Charis Papadopoulos and Nikos Parotsidis
34th ACM-SIAM Symposium on Discrete Algorithms (SODA23). To appear.
Loukas Georgiadis, Giuseppe F. Italiano and Evangelos Kosinas
In Proceedings of the 30th Annual European Symposium on Algorithms (ESA 2022) B, pages 60:1--60:16.
Related version: Improved Linear-Time Algorithm for Computing the 4-Edge-Connected Components of a Graph
Dionysios Kefallinos, Loukas Georgiadis, Anna Mpanti and Stavros Nikolopoulos.
In Proceedings of the 20th Symposium on Experimental Algorithms (SEA 2022), pages 14:1--14:16.
Computing the 4-Edge-Connected Components of a Graph in Linear Time
Loukas Georgiadis, Giuseppe F. Italiano and Evangelos Kosinas
In Proceedings of the 29th Annual European Symposium on Algorithms (ESA 2021) A, pages 47:1--47:17.
Loukas Georgiadis, Konstantinos Giannis, Giuseppe Italiano and Evangelos Kosinas
19th Symposium on Experimental Algorithms (SEA 2021), pages 20:1--20:19.
Loukas Georgiadis, Dionysiïs Kefallinos, Nikos Parotsidis and Luigi Laura
In Proceedings of the SIAM Symposium on Algorithm Engineering and Experiments (ALENEX 2021), pages 85-97.
Linear-Time Algorithms for Computing Twinless Strong Articulation Points and Related Problems
Loukas Georgiadis and Evangelos Kosinas
In Proceedings of the 31st International Symposium on Algorithms and Computation (ISAAC 2020), pages 38:1--38:16.
Preliminary full version at arXiv
Loukas Georgiadis, Konstantinos Giannis, Giuseppe F. Italiano, Aikaterini Karanasiou and Luigi Laura
In Proceedings of the 27th Annual European Symposium on Algorithms (ESA 2019) B, pages 50:1--50:18.
Faster Algorithms for All-Pairs Bounded Min-Cuts
Amir Abboud, Loukas Georgiadis, Daniel Graf, Giuseppe F. Italiano, Robert Krauthgamer, Nikos Parotsidis, Ohad Trabelsi and Przemyslaw Uznanski
In Proceedings of the 46th International Colloquium on Automata, Languages and Programming (ICALP 2019) A, pages 7:1-7:15.
Preliminary full version at arXiv
Loukas Georgiadis, Giuseppe F. Italiano and Nikos Parotsidis
In Proceedings of the 13th Latin American Theoretical INformatics Symposium (LATIN 2018), pages 529-543.
Loukas Georgiadis, Giuseppe F. Italiano, Aikaterini Karanasiou, Nikos Parotsidis and Nilakantha Paudel
In Proceedings of the 20th SIAM Meeting on Algorithm Engineering and Experimentation (ALENEX 2018), pages 169-183.
Loukas Georgiadis, Thomas Dueholm Hansen, Giuseppe F. Italiano, Sebastian Krinninger and Nikos Parotsidis
In Proceedings of the 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017) A, pages 42:1--42:15.
Loukas Georgiadis, Daniel Graf, Giuseppe F. Italiano, Nikos Parotsidis and Przemysław Uznański
In Proceedings of the 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017) A, pages 74:1--74:14.
Loukas Georgiadis, Konstantinos Giannis, Aikaterini Karanasiou and Luigi Laura
In Proceedings of the 16th International Symposium on Experimental Algorithms (SEA 2017), pages 27:1-27:21.
Loukas Georgiadis, Giuseppe F. Italiano and Aikaterini Karanasiou
In Proceedings of the 16th International Symposium on Experimental Algorithms (SEA 2017), pages 9:1-9:16.
Loukas Georgiadis, Giuseppe F. Italiano and Nikos Parotsidis
In Proceedings of the 28th ACM-SIAM Symposium on Discrete Algorithms (SODA 2017), pages 1880-1899.
Nilakantha Paudel, Loukas Georgiadis and Giuseppe F. Italiano
In Proceedings of the 19th SIAM Meeting on Algorithm Engineering and Experimentation (ALENEX 2017), pages 43-57.
Loukas Georgiadis, Giuseppe F. Italiano and Nikos Parotsidis
In Proceedings of the 24th Annual European Symposium on Algorithms (ESA 2016), pages 1:1-1:14.
Loukas Georgiadis, Giuseppe F. Italiano and Nikos Parotsidis
In Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016) A, pages 49:1-49:15.
Loukas Georgiadis, Giuseppe F. Italiano, Aikaterini Karanasiou, Charis Papadopoulos and Nikos Parotsidis
In Proceedings of the 15th International Symposium on Experimental Algorithms (SEA 2016), pages 150-166.
Approximating the Smallest Spanning Subgraph for 2-Edge-Connectivity in Directed Graphs
Loukas Georgiadis, Giuseppe F. Italiano, Charis Papadopoulos and Nikos Parotsidis
In Proceedings of the 23rd Annual European Symposium on Algorithms (ESA 2015) B, pages 582-594.
2-Vertex Connectivity in Directed Graphs
Loukas Georgiadis, Giuseppe F. Italiano, Luigi Laura and Nikos Parotsidis
In Proceedings of the 42nd International Colloquium on Automata, Languages, and Programming (ICALP 2015) A, pages 605-616.
2-Connectivity in Directed Graphs: An Experimental Study
William Di Luigi, Loukas Georgiadis, Giuseppe F. Italiano, Luigi Laura and Nikos Parotsidis
In Proceedings of the 17th SIAM Meeting on Algorithm Engineering and Experimentation (ALENEX 2015), pages 173-187.
2-Edge Connectivity in Directed Graphs
Loukas Georgiadis, Giuseppe F. Italiano, Luigi Laura and Nikos Parotsidis
In Proceedings of the 26th ACM-SIAM Symposium on Discrete Algorithms (SODA 2015), pages 1988-2005.
Loukas Georgiadis, Luigi Laura, Nikos Parotsidis and Robert E. Tarjan
In Proceedings of the 13th International Symposium on Experimental Algorithms (SEA 2014), pages 174-186.
Dominator Tree Certification and Independent Spanning Trees: An Experimental Study
Loukas Georgiadis, Luigi Laura, Nikos Parotsidis and Robert E. Tarjan
In Proceedings of the 12th International Symposium on Experimental Algorithms (SEA 2013), pages 284-295.
Loukas Georgiadis and Nikos Parotsidis
Proceedings of the 2nd International Symposium on Computing in Informatics and Mathematics (ISCIM 2013), pages 15-20.
An Experimental Study of Dynamic Dominators
Loukas Georgiadis, Giuseppe F. Italiano, Luigi Laura and Federico Santaroni
In Proceedings of the 20th Annual European Symposium on Algorithms (ESA 2012) B, pages 491-502.
Dominators, Directed Bipolar Orders, and Independent Spanning Trees
Loukas Georgiadis and Robert E. Tarjan
In Proceedings of the 39th International Colloquium on Automata, Languages and Programming (ICALP 2012) A, pages 375-386.
Loukas Georgiadis
In Proceedings of the19th Annual European Symposium on Algorithms (ESA 2011) B, pages 13-24.
Dynamic Dominators in Practice
Konstantinos Patakakis, Loukas Georgiadis, and Vasileios A. Tatsis.
In Proceedings of the 15th Panhellenic Conference on Informatics (PCI 2011), pages 100-104.
Join-Reachability Problems in Directed Graphs
Loukas Georgiadis, Stavros D. Nikolopoulos, and Leonidas Palios
In Proceedings of the 6th International Computer Science Symposium in Russia (CSR 2011), pages 195-208.
Preliminary version
Testing 2-Vertex Connectivity and Computing Pairs of Vertex-Disjoint s-t Paths in Digraphs
Loukas Georgiadis
In Proceedings of the 37th International Colloquium on Automata, Languages and Programming (ICALP 2010) A, pages 738-749.
Preliminary version
An Experimental Study of Minimum Mean Cycle Algorithms
Loukas Georgiadis, Andrew V. Goldberg, Robert E. Tarjan, and Renato F. Werneck
In Proceedings of the 11th Workshop on Algorithm Engineering and Experiments (ALENEX 2009), pages1-13.
© SIAM.
Computing Frequency Dominators and Related Problems
Loukas Georgiadis
In Proceedings of the 19th International Symposium on Algorithms and Computation (ISAAC 2008), pages 704-715.
© Springer-Verlag.
Preliminary version
Shortest Path Feasibility Algorithms: An Experimental Evaluation
Boris V. Cherkassky, Loukas Georgiadis, Andrew V. Goldberg, Robert E. Tarjan and Renato F. Werneck
In Proceedings of the 10th Workshop on Algorithm Engineering and Experiments (ALENEX 2008), pages 118-132.
© SIAM.
Dynamic Matchings in Convex Bipartite Graphs
Gerth S. Brodal, Loukas Georgiadis, Kristoffer A. Hansen and Irit Katriel
In Proceedings of the 32nd International Symposium on Mathematical Fundations of Computer Science (MFCS 2007),
Lecture Notes in Computer Science, volume 4708, pages 406-417, Springer-Verlag, 2007.
© Springer-Verlag.
Improved Dynamic Planar Point Location
Lars Arge, Gerth S. Brodal and Loukas Georgiadis
In Proceedings of the 47th IEEE Symposium on Foundations of Computer Science (FOCS 2006), pages 305-314.
© IEEE.
Preliminary version
Design of Data Structures for Mergeable Trees
Loukas Georgiadis, Robert E. Tarjan and Renato F. Werneck
In Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms (SODA 2006), pages 394-403, 2006.
© SIAM.
Preliminary version
Dominator Tree Verification and Vertex-Disjoint Paths
Loukas Georgiadis and Robert E. Tarjan
In Proceedings of the 16th ACM-SIAM Symposium on Discrete Algorithms (SODA 2005), pages 433-442, 2005.
© SIAM.
Preliminary version
Finding Dominators in Practice
Loukas Georgiadis, Renato F. Werneck, Robert E. Tarjan, Spyridon Triantafyllis and David I. August
In Proceedings of the 12th Annual European Symposium on Algorithms (ESA 2004) B,
Lecture Notes in Computer Science, volume 3221, pages 677-688, Springer-Verlag, 2004.
© Springer-Verlag.
Preliminary version
Finding Dominators Revisited
Loukas Georgiadis and Robert E. Tarjan
In Proceedings of the 15th ACM-SIAM Symposium on Discrete Algorithms (SODA 2004), pages 862-871, 2004.
© SIAM.
Preliminary version
Journal Papers
Loukas Georgiadis, Giuseppe F. Italiano and Nikos Parotsidis
SIAM Journal on Computing, volume 49, issue 5, pages 865–926.
Loukas Georgiadis, Giuseppe F. Italiano and Aikaterini Karanasiou
Theoretical Computer Science, volume 807, pages 185-200, February 2020.
Nilakantha Paudel, Loukas Georgiadis and Giuseppe F. Italiano
ACM Journal of Experimental Algorithmics, special issue ALENEX 20107, volume 23, issue 2, pages 2.2:1--2.2:24, July 2018.
Loukas Georgiadis, Giuseppe F. Italiano, Luigi Laura and Nikos Parotsidis
Information and Computation, special issue on selected papers from ICALP 2015, volume 261, part 2, August 2018, pages 248-264.
Loukas Georgiadis, Giuseppe F. Italiano, Aikaterini Karanasiou, Charis Papadopoulos and Nikos Parotsidis
Theoretical Computer Science, volume 698, October 2017, pages 40-66.
2-Edge Connectivity in Directed Graphs
Loukas Georgiadis, Giuseppe F. Italiano, Luigi Laura and Nikos Parotsidis
ACM Transactions on Algorithms, volume 13, issue 1, pages 9:1-9:24, October 2016.
Addendum to “Dominator Tree Certification and Divergent Spanning Trees”
(A Note on Fault Tolerant Reachability for Directed Graphs)
Loukas Georgiadis and Robert E. Tarjan
ACM Transactions on Algorithms, volume 12, issue 4, pages 56:1-56:3, August 2016.
Dominator Tree Certification and Divergent Spanning Trees
Loukas Georgiadis and Robert E. Tarjan
ACM Transactions on Algorithms, volume 12, issue 1, pages 11:1-11:42, November 2015.
Donatella Firmani, Loukas Georgiadis, Giuseppe F. Italiano, Luigi Laura, and Federico Santaroni
Algorithmica, volume 74, number 3, pages 1123-1147.
© Springer.
Join-Reachability Problems in Directed Graphs
Loukas Georgiadis, Stavros D. Nikolopoulos, and Leonidas Palios
Theory of Computing Systems, volume 55(2), pages 347-379, 2014.
Special Issue on Selected Papers from CSR 2011.
© Springer.
Wojciech Fraczak, Loukas Georgiadis, Andrew Miller, and Robert E. Tarjan
Journal of Discrete Algorithms (JDA), volume 26, pages 106-110, 2014.
© Elsevier.
Wojciech Fraczak, Loukas Georgiadis, Andrew Miller, and Robert E. Tarjan
Journal of Discrete Algorithms (JDA), volume 23, pages 2-20, 2013.
© Elsevier.
Data Structures for Mergeable Trees
Loukas Georgiadis, Haim Kaplan, Nira Shafrir, Robert E. Tarjan and Renato Werneck
ACM Transactions on Algorithms, volume 7, issue 2, pages 14:1-14:30, 2011.
©ACM.
Preliminary version at arXiv
Shortest Path Feasibility Algorithms: An Experimental Evaluation
Boris V. Cherkassky, Loukas Georgiadis, Andrew V. Goldberg, Robert E. Tarjan and Renato F. Werneck
ACM Journal of Experimental Algorithmics, special section devoted to selected best papers
presented at ALENEX'08, volume 14, pages 2.7-2.47, 2009.
©ACM.
Linear-Time Algorithms for Dominators and Other Path-Evaluation Problems
Adam L. Buchsbaum, Loukas Georgiadis, Haim Kaplan, Ann Rogers, Robert E. Tarjan and Jeffery R. Westbrook
SIAM Journal on Computing, volume 38, issue 4, pages 1533-1573, 2008.
©SIAM.
Preliminary version at arXiv
An O(nlogn) Version of the Averbakh-Berman Algorithm for the Robust Median of a Tree
Gerth S. Brodal, Loukas Georgiadis, and Irit Katriel
Operations Research Letters, volume 36, issue 1, pages 14-18.
© Elsevier.
Preliminary version
Finding Dominators in Practice
Loukas Georgiadis, Robert E. Tarjan and Renato F. Werneck
Journal of Graph Algorithms and Applications (JGAA), volume 10, issue 1, pages 69-94.
Special Issue on Selected Papers from Engineering and Applications Track of ESA 2004.
Books
Loukas Georgiadis, Stavros D. Nikolopoulos and Leonidas Palios
Kallipos 2015
Stavros D. Nikolopoulos, Leonidas Palios and Loukas Georgiadis
Kallipos 2015
Wireless Network Traffic and Quality of Service Support: Trends and Standards
T. D. Lagkas, P. Angelidis and L. Georgiadis (Editors)
IGI Global, 2010.
PhD Thesis
Linear-Time Algorithms for Dominators and Related Problems
