Loukas Georgiadis

90 papers A* 12A 16B 12C 1Misc 1Journal 42Unranked 4
YearRankTypeTitle / Venue / Authors
2026 J jnl
Computing the 4-Edge-Connected Components of a Graph: An Experimental Study.
ACM Trans. Algorithms
Loukas Georgiadis, Giuseppe F. Italiano, Evangelos Kosinas
2026 J jnl
On maximal k-edge-connected subgraphs of undirected graphs.
J. Comput. Syst. Sci.
Loukas Georgiadis, Giuseppe F. Italiano, Evangelos Kosinas, Debasish Pattanayak
2025 — ed.
Algorithms and Complexity - 14th International Conference, CIAC 2025, Rome, Italy, June 10-12, 2025, Proceedings, Part I
CIAC (1)
Irene Finocchi, Loukas Georgiadis
2025 — ed.
Algorithms and Complexity - 14th International Conference, CIAC 2025, Rome, Italy, June 10-12, 2025, Proceedings, Part II
CIAC (2)
Irene Finocchi, Loukas Georgiadis
2025 A conf
Faster Dynamic 2-Edge Connectivity in Directed Graphs.
ESA
Loukas Georgiadis, Konstantinos Giannis, Giuseppe F. Italiano
2024 A conf
2-Fault-Tolerant Strong Connectivity Oracles.
ALENEX
Loukas Georgiadis, Evangelos Kosinas, Daniel Tsokaktsis
2024 A* conf
Computing the 3-Edge-Connected Components of Directed Graphs in Linear Time.
FOCS
Loukas Georgiadis, Giuseppe F. Italiano, Evangelos Kosinas
2023 J jnl
2-Fault-Tolerant Strong Connectivity Oracles.
CoRR
Loukas Georgiadis, Evangelos Kosinas, Daniel Tsokaktsis
2023 B ed.
21st International Symposium on Experimental Algorithms, SEA 2023, Barcelona, Spain, July 24-26, 2023
SEA
Loukas Georgiadis
2023 A* conf
Faster Computation of 3-Edge-Connected Components in Digraphs.
SODA
Loukas Georgiadis, Evangelos Kipouridis, Charis Papadopoulos, Nikos Parotsidis
2023 C conf
On 2-Strong Connectivity Orientations of Mixed Graphs and Related Problems.
IWOCA
Loukas Georgiadis, Dionysios Kefallinos, Evangelos Kosinas
2023 J jnl
On 2-strong connectivity orientations of mixed graphs and related problems.
CoRR
Loukas Georgiadis, Dionysios Kefallinos, Evangelos Kosinas
2022 B conf
An Experimental Study of Algorithms for Packing Arborescences.
SEA
Loukas Georgiadis, Dionysios Kefallinos, Anna Mpanti, Stavros D. Nikolopoulos
2022 A conf
Computing the 4-Edge-Connected Components of a Graph: An Experimental Study.
ESA
Loukas Georgiadis, Giuseppe F. Italiano, Evangelos Kosinas
2022 J jnl
On maximal 3-edge-connected subgraphs of undirected graphs.
CoRR
Loukas Georgiadis, Giuseppe F. Italiano, Evangelos Kosinas, Debasish Pattanayak
2021 A conf
An Experimental Study of Algorithms for Computing the Edge Connectivity of a Directed Graph.
ALENEX
Loukas Georgiadis, Dionysios Kefallinos, Luigi Laura, Nikos Parotsidis
2021 B conf
Computing Vertex-Edge Cut-Pairs and 2-Edge Cuts in Practice.
SEA
Loukas Georgiadis, Konstantinos Giannis, Giuseppe F. Italiano, Evangelos Kosinas
2021 A conf
Computing the 4-Edge-Connected Components of a Graph in Linear Time.
ESA
Loukas Georgiadis, Giuseppe F. Italiano, Evangelos Kosinas
2021 J jnl
Computing the 4-Edge-Connected Components of a Graph in Linear Time.
CoRR
Loukas Georgiadis, Giuseppe F. Italiano, Evangelos Kosinas
2021 J jnl
Improved Linear-Time Algorithm for Computing the 4-Edge-Connected Components of a Graph.
CoRR
Loukas Georgiadis, Giuseppe F. Italiano, Evangelos Kosinas
2020 J jnl
Approximating the smallest 2-vertex connected spanning subgraph of a directed graph.
Theor. Comput. Sci.
Loukas Georgiadis, Giuseppe F. Italiano, Aikaterini Karanasiou
2020 B conf
Linear-Time Algorithms for Computing Twinless Strong Articulation Points and Related Problems.
ISAAC
Loukas Georgiadis, Evangelos Kosinas
2020 J jnl
Linear-Time Algorithms for Computing Twinless Strong Articulation Points and Related Problems.
CoRR
Loukas Georgiadis, Evangelos Kosinas
2020 J jnl
Strong Connectivity in Directed Graphs under Failures, with Applications.
SIAM J. Comput.
Loukas Georgiadis, Giuseppe F. Italiano, Nikos Parotsidis
2019 A conf
Dynamic Dominators and Low-High Orders in DAGs.
ESA
Loukas Georgiadis, Konstantinos Giannis, Giuseppe F. Italiano, Aikaterini Karanasiou, Luigi Laura
2019 A* conf
Faster Algorithms for All-Pairs Bounded Min-Cuts.
ICALP
Amir Abboud, Loukas Georgiadis, Giuseppe F. Italiano, Robert Krauthgamer, Nikos Parotsidis, Ohad Trabelsi, Przemyslaw Uznanski, Daniel Wolleb-Graf
2018 J jnl
2-vertex connectivity in directed graphs.
Inf. Comput.
Loukas Georgiadis, Giuseppe F. Italiano, Luigi Laura, Nikos Parotsidis
2018 A conf
Computing 2-Connected Components and Maximal 2-Connected Subgraphs in Directed Graphs: An Experimental Study.
ALENEX
Loukas Georgiadis, Giuseppe F. Italiano, Aikaterini Karanasiou, Nikos Parotsidis, Nilakantha Paudel
2018 J jnl
Computing Critical Nodes in Directed Graphs.
ACM J. Exp. Algorithmics
Nilakantha Paudel, Loukas Georgiadis, Giuseppe F. Italiano
2018 J jnl
Faster Algorithms for All-Pairs Bounded Min-Cuts.
CoRR
Amir Abboud, Loukas Georgiadis, Daniel Graf, Giuseppe F. Italiano, Robert Krauthgamer, Nikos Parotsidis, Ohad Trabelsi, Przemyslaw Uznanski
2018 B conf
Incremental Strong Connectivity and 2-Connectivity in Directed Graphs.
LATIN
Loukas Georgiadis, Giuseppe F. Italiano, Nikos Parotsidis
2018 J jnl
Incremental Strong Connectivity and 2-Connectivity in Directed Graphs.
CoRR
Loukas Georgiadis, Giuseppe F. Italiano, Nikos Parotsidis
2017 A* conf
All-Pairs 2-Reachability in O(n^w log n) Time.
ICALP
Loukas Georgiadis, Daniel Graf, Giuseppe F. Italiano, Nikos Parotsidis, Przemyslaw Uznanski
2017 B conf
Approximating the Smallest 2-Vertex-Connected Spanning Subgraph via Low-High Orders.
SEA
Loukas Georgiadis, Giuseppe F. Italiano, Aikaterini Karanasiou
2017 A conf
Computing Critical Nodes in Directed Graphs.
ALENEX
Nilakantha Paudel, Loukas Georgiadis, Giuseppe F. Italiano
2017 A* conf
Decremental Data Structures for Connectivity and Dominators in Directed Graphs.
ICALP
Loukas Georgiadis, Thomas Dueholm Hansen, Giuseppe F. Italiano, Sebastian Krinninger, Nikos Parotsidis
2017 J jnl
Decremental Data Structures for Connectivity and Dominators in Directed Graphs.
CoRR
Loukas Georgiadis, Thomas Dueholm Hansen, Giuseppe F. Italiano, Sebastian Krinninger, Nikos Parotsidis
2017 B conf
Incremental Low-High Orders of Directed Graphs and Applications.
SEA
Loukas Georgiadis, Konstantinos Giannis, Aikaterini Karanasiou, Luigi Laura
2017 J jnl
Sparse certificates for 2-connectivity in directed graphs.
Theor. Comput. Sci.
Loukas Georgiadis, Giuseppe F. Italiano, Aikaterini Karanasiou, Charis Papadopoulos, Nikos Parotsidis
2017 A* conf
Strong Connectivity in Directed Graphs under Failures, with Applications.
SODA
Loukas Georgiadis, Giuseppe F. Italiano, Nikos Parotsidis
2016 A conf
2-Connectivity in Directed Graphs.
ESA
Loukas Georgiadis, Giuseppe F. Italiano, Nikos Parotsidis
2016 J jnl
2-Edge Connectivity in Directed Graphs.
ACM Trans. Algorithms
Loukas Georgiadis, Giuseppe F. Italiano, Luigi Laura, Nikos Parotsidis
2016 J jnl
Addendum to "Dominator Tree Certification and Divergent Spanning Trees".
ACM Trans. Algorithms
Loukas Georgiadis, Robert E. Tarjan
2016 J jnl
All-Pairs $2$-reachability in Õ(n
CoRR
Loukas Georgiadis, Daniel Graf, Giuseppe F. Italiano, Nikos Parotsidis, Przemyslaw Uznanski
2016 J jnl
An Experimental Study of Dynamic Dominators.
CoRR
Loukas Georgiadis, Giuseppe F. Italiano, Luigi Laura, Federico Santaroni
2016 J jnl
Dominator Tree Certification and Divergent Spanning Trees.
ACM Trans. Algorithms
Loukas Georgiadis, Robert E. Tarjan
2016 A* conf
Incremental 2-Edge-Connectivity in Directed Graphs.
ICALP
Loukas Georgiadis, Giuseppe F. Italiano, Nikos Parotsidis
2016 J jnl
Incremental 2-Edge-Connectivity in Directed Graphs.
CoRR
Loukas Georgiadis, Giuseppe F. Italiano, Nikos Parotsidis
2016 J jnl
On Low-High Orders of Directed Graphs: Incremental Algorithms and Applications.
CoRR
Loukas Georgiadis, Aikaterini Karanasiou, Konstantinos Giannis, Luigi Laura
2016 B conf
Sparse Subgraphs for 2-Connectivity in Directed Graphs.
SEA
Loukas Georgiadis, Giuseppe F. Italiano, Aikaterini Karanasiou, Charis Papadopoulos, Nikos Parotsidis
2016 J jnl
Strong Articulation Points and Strong Bridges in Large Scale Graphs.
Algorithmica
Donatella Firmani, Loukas Georgiadis, Giuseppe F. Italiano, Luigi Laura, Federico Santaroni
2015 A conf
2-Connectivity in Directed Graphs: An Experimental Study.
ALENEX
William Di Luigi, Loukas Georgiadis, Giuseppe F. Italiano, Luigi Laura, Nikos Parotsidis
2015 A* conf
2-Edge Connectivity in Directed Graphs.
SODA
Loukas Georgiadis, Giuseppe F. Italiano, Luigi Laura, Nikos Parotsidis
2015 — conf
2-Vertex Connectivity in Directed Graphs.
ICALP (1)
Loukas Georgiadis, Giuseppe F. Italiano, Luigi Laura, Nikos Parotsidis
2015 J jnl
A New Framework for Strong Connectivity and 2-Connectivity in Directed Graphs.
CoRR
Loukas Georgiadis, Giuseppe F. Italiano, Nikos Parotsidis
2015 J jnl
A Note on Fault Tolerant Reachability for Directed Graphs.
CoRR
Loukas Georgiadis, Robert E. Tarjan
2015 A conf
Approximating the Smallest Spanning Subgraph for 2-Edge-Connectivity in Directed Graphs.
ESA
Loukas Georgiadis, Giuseppe F. Italiano, Charis Papadopoulos, Nikos Parotsidis
2015 J jnl
Approximating the Smallest Spanning Subgraph for 2-Edge-Connectivity in Directed Graphs.
CoRR
Loukas Georgiadis, Giuseppe F. Italiano, Charis Papadopoulos, Nikos Parotsidis
2014 J jnl
2-Edge Connectivity in Directed Graphs.
CoRR
Loukas Georgiadis, Giuseppe F. Italiano, Luigi Laura, Nikos Parotsidis
2014 J jnl
2-Vertex Connectivity in Directed Graphs.
CoRR
Loukas Georgiadis, Giuseppe F. Italiano, Luigi Laura, Nikos Parotsidis
2014 J jnl
Corrections to "Finding dominators via disjoint set union" [J. Discrete Algorithms 23 (2013) 2-20].
J. Discrete Algorithms
Wojciech Fraczak, Loukas Georgiadis, Andrew Miller, Robert Endre Tarjan
2014 J jnl
Join-Reachability Problems in Directed Graphs.
Theory Comput. Syst.
Loukas Georgiadis, Stavros D. Nikolopoulos, Leonidas Palios
2014 B conf
Loop Nesting Forests, Dominators, and Applications.
SEA
Loukas Georgiadis, Luigi Laura, Nikos Parotsidis, Robert Endre Tarjan
2013 B conf
Dominator Certification and Independent Spanning Trees: An Experimental Study.
SEA
Loukas Georgiadis, Luigi Laura, Nikos Parotsidis, Robert Endre Tarjan
2013 J jnl
Finding Dominators via Disjoint Set Union.
CoRR
Wojciech Fraczak, Loukas Georgiadis, Andrew Miller, Robert Endre Tarjan
2013 J jnl
Finding dominators via disjoint set union.
J. Discrete Algorithms
Wojciech Fraczak, Loukas Georgiadis, Andrew Miller, Robert Endre Tarjan
2012 A conf
An Experimental Study of Dynamic Dominators.
ESA
Loukas Georgiadis, Giuseppe F. Italiano, Luigi Laura, Federico Santaroni
2012 J jnl
Dominator Tree Certification and Independent Spanning Trees
CoRR
Loukas Georgiadis, Robert Endre Tarjan
2012 — conf
Dominators, Directed Bipolar Orders, and Independent Spanning Trees.
ICALP (1)
Loukas Georgiadis, Robert Endre Tarjan
2011 A conf
Approximating the Smallest 2-Vertex Connected Spanning Subgraph of a Directed Graph.
ESA
Loukas Georgiadis
2011 J jnl
Data structures for mergeable trees.
ACM Trans. Algorithms
Loukas Georgiadis, Haim Kaplan, Nira Shafrir, Robert Endre Tarjan, Renato Fonseca F. Werneck
2011 — conf
Dynamic Dominators in Practice.
Panhellenic Conference on Informatics
Konstantinos Patakakis, Loukas Georgiadis, Vasileios A. Tatsis
2011 Misc conf
Join-Reachability Problems in Directed Graphs.
CSR
Loukas Georgiadis, Stavros D. Nikolopoulos, Leonidas Palios
2010 J jnl
Control of wireless networks with rechargeable batteries [transactions papers].
IEEE Trans. Wirel. Commun.
Marios Gatzianas, Loukas Georgiadis, Leandros Tassiulas
2010 J jnl
Join-Reachability Problems in Directed Graphs
CoRR
Loukas Georgiadis, Stavros D. Nikolopoulos, Leonidas Palios
2010 — conf
Testing 2-Vertex Connectivity and Computing Pairs of Vertex-Disjoint
ICALP (1)
Loukas Georgiadis
2009 A conf
An Experimental Study of Minimum Mean Cycle Algorithms.
ALENEX
Loukas Georgiadis, Andrew V. Goldberg, Robert Endre Tarjan, Renato Fonseca F. Werneck
2009 J jnl
Shortest-path feasibility algorithms: An experimental evaluation.
ACM J. Exp. Algorithmics
Boris V. Cherkassky, Loukas Georgiadis, Andrew V. Goldberg, Robert Endre Tarjan, Renato Fonseca F. Werneck
2008 J jnl
An O(nlogn) version of the Averbakh-Berman algorithm for the robust median of a tree.
Oper. Res. Lett.
Gerth Stølting Brodal, Loukas Georgiadis, Irit Katriel
2008 B conf
Computing Frequency Dominators and Related Problems.
ISAAC
Loukas Georgiadis
2008 J jnl
Linear-Time Algorithms for Dominators and Other Path-Evaluation Problems.
SIAM J. Comput.
Adam L. Buchsbaum, Loukas Georgiadis, Haim Kaplan, Anne Rogers, Robert Endre Tarjan, Jeffery R. Westbrook
2008 A conf
Shortest Path Feasibility Algorithms: An Experimental Evaluation.
ALENEX
Boris V. Cherkassky, Loukas Georgiadis, Andrew V. Goldberg, Robert Endre Tarjan, Renato Fonseca F. Werneck
2007 J jnl
Data Structures for Mergeable Trees
CoRR
Loukas Georgiadis, Haim Kaplan, Nira Shafrir, Robert Endre Tarjan, Renato Fonseca F. Werneck
2007 B conf
Dynamic Matchings in Convex Bipartite Graphs.
MFCS
Gerth Stølting Brodal, Loukas Georgiadis, Kristoffer Arnsfelt Hansen, Irit Katriel
2006 A* conf
Design of data structures for mergeable trees.
SODA
Loukas Georgiadis, Robert Endre Tarjan, Renato Fonseca F. Werneck
2006 J jnl
Finding Dominators in Practice.
J. Graph Algorithms Appl.
Loukas Georgiadis, Robert Endre Tarjan, Renato Fonseca F. Werneck
2006 A* conf
Improved Dynamic Planar Point Location.
FOCS
Lars Arge, Gerth Stølting Brodal, Loukas Georgiadis
2005 A* conf
Dominator tree verification and vertex-disjoint paths.
SODA
Loukas Georgiadis, Robert Endre Tarjan
2004 A conf
Finding Dominators in Practice.
ESA
Loukas Georgiadis, Renato Fonseca F. Werneck, Robert Endre Tarjan, Spyridon Triantafyllis, David I. August
2004 A* conf
Finding dominators revisited: extended abstract.
SODA
Loukas Georgiadis, Robert Endre Tarjan