Finding Dominators in Practice. - Loukas Georgiadis; Renato Fonseca F. Werneck; Robert Endre Tarjan; Spyridon Triantafyllis; David I. August (ESA, 2004)

Finding dominators revisited: extended abstract. - Loukas Georgiadis; Robert Endre Tarjan (SODA, 2004)

Dominator tree verification and vertex-disjoint paths. - Loukas Georgiadis; Robert Endre Tarjan (SODA, 2005)

Improved Dynamic Planar Point Location. - Lars Arge; Gerth Stølting Brodal; Loukas Georgiadis (FOCS, 2006)

Design of data structures for mergeable trees. - Loukas Georgiadis; Robert Endre Tarjan; Renato Fonseca F. Werneck (SODA, 2006)

Finding Dominators in Practice. - Loukas Georgiadis; Robert Endre Tarjan; Renato Fonseca F. Werneck (J. Graph Algorithms Appl., 2006)

Dynamic Matchings in Convex Bipartite Graphs. - Gerth Stølting Brodal; Loukas Georgiadis; Kristoffer Arnsfelt Hansen; Irit Katriel (MFCS, 2007)

Computing Frequency Dominators and Related Problems. - Loukas Georgiadis (ISAAC, 2008)

An O(nlogn) version of the Averbakh-Berman algorithm for the robust median of a tree. - Gerth Stølting Brodal; Loukas Georgiadis; Irit Katriel (Oper. Res. Lett., 2008)

Linear-Time Algorithms for Dominators and Other Path-Evaluation Problems. - Adam L. Buchsbaum; Loukas Georgiadis; Haim Kaplan; Anne Rogers; Robert Endre Tarjan; Jeffery R. Westbrook (SIAM J. Comput., 2008)

An Experimental Study of Minimum Mean Cycle Algorithms. - Loukas Georgiadis; Andrew V. Goldberg; Robert Endre Tarjan; Renato Fonseca F. Werneck (ALENEX, 2009)

Shortest-path feasibility algorithms: An experimental evaluation. - Boris V. Cherkassky; Loukas Georgiadis; Andrew V. Goldberg; Robert Endre Tarjan; Renato Fonseca F. Werneck (ACM J. Exp. Algorithmics, 2009)

Testing 2-Vertex Connectivity and Computing Pairs of Vertex-Disjoint s-t Paths in Digraphs. - Loukas Georgiadis (ICALP (1), 2010)

Control of wireless networks with rechargeable batteries [transactions papers]. - Marios Gatzianas; Loukas Georgiadis; Leandros Tassiulas (IEEE Trans. Wirel. Commun., 2010)

Approximating the Smallest 2-Vertex Connected Spanning Subgraph of a Directed Graph. - Loukas Georgiadis (ESA, 2011)

Dynamic Dominators in Practice. - Konstantinos Patakakis; Loukas Georgiadis; Vasileios A. Tatsis (Panhellenic Conference on Informatics, 2011)

Data structures for mergeable trees. - Loukas Georgiadis; Haim Kaplan; Nira Shafrir; Robert Endre Tarjan; Renato Fonseca F. Werneck (ACM Trans. Algorithms, 2011)

An Experimental Study of Dynamic Dominators. - Loukas Georgiadis; Giuseppe F. Italiano; Luigi Laura; Federico Santaroni (ESA, 2012)

Dominators, Directed Bipolar Orders, and Independent Spanning Trees. - Loukas Georgiadis; Robert Endre Tarjan (ICALP (1), 2012)

Dominator Tree Certification and Independent Spanning Trees - Loukas Georgiadis; Robert Endre Tarjan (CoRR, 2012)

Dominator Certification and Independent Spanning Trees: An Experimental Study. - Loukas Georgiadis; Luigi Laura; Nikos Parotsidis; Robert Endre Tarjan (SEA, 2013)

Finding dominators via disjoint set union. - Wojciech Fraczak; Loukas Georgiadis; Andrew Miller; Robert Endre Tarjan (J. Discrete Algorithms, 2013)

Loop Nesting Forests, Dominators, and Applications. - Loukas Georgiadis; Luigi Laura; Nikos Parotsidis; Robert Endre Tarjan (SEA, 2014)

Corrections to "Finding dominators via disjoint set union" [J. Discrete Algorithms 23 (2013) 2-20]. - Wojciech Fraczak; Loukas Georgiadis; Andrew Miller; Robert Endre Tarjan (J. Discrete Algorithms, 2014)

Join-Reachability Problems in Directed Graphs. - Loukas Georgiadis; Stavros D. Nikolopoulos; Leonidas Palios (Theory Comput. Syst., 2014)

2-Connectivity in Directed Graphs: An Experimental Study. - William Di Luigi; Loukas Georgiadis; Giuseppe F. Italiano; Luigi Laura; Nikos Parotsidis (ALENEX, 2015)

Approximating the Smallest Spanning Subgraph for 2-Edge-Connectivity in Directed Graphs. - Loukas Georgiadis; Giuseppe F. Italiano; Charis Papadopoulos; Nikos Parotsidis (ESA, 2015)

A New Framework for Strong Connectivity and 2-Connectivity in Directed Graphs. - Loukas Georgiadis; Giuseppe F. Italiano; Nikos Parotsidis (CoRR, 2015)

A Note on Fault Tolerant Reachability for Directed Graphs. - Loukas Georgiadis; Robert E. Tarjan (CoRR, 2015)

2-Connectivity in Directed Graphs. - Loukas Georgiadis; Giuseppe F. Italiano; Nikos Parotsidis (ESA, 2016)

Incremental 2-Edge-Connectivity in Directed Graphs. - Loukas Georgiadis; Giuseppe F. Italiano; Nikos Parotsidis (ICALP, 2016)

Sparse Subgraphs for 2-Connectivity in Directed Graphs. - Loukas Georgiadis; Giuseppe F. Italiano; Aikaterini Karanasiou; Charis Papadopoulos; Nikos Parotsidis (SEA, 2016)

Strong Articulation Points and Strong Bridges in Large Scale Graphs. - Donatella Firmani; Loukas Georgiadis; Giuseppe F. Italiano; Luigi Laura; Federico Santaroni (Algorithmica, 2016)

All-Pairs $2$-reachability in Õ(nω) Time. - Loukas Georgiadis; Daniel Graf 001; Giuseppe F. Italiano; Nikos Parotsidis; Przemyslaw Uznanski (CoRR, 2016)

On Low-High Orders of Directed Graphs: Incremental Algorithms and Applications. - Loukas Georgiadis; Aikaterini Karanasiou; Konstantinos Giannis; Luigi Laura (CoRR, 2016)

2-Edge Connectivity in Directed Graphs. - Loukas Georgiadis; Giuseppe F. Italiano; Luigi Laura; Nikos Parotsidis (ACM Trans. Algorithms, 2016)

Dominator Tree Certification and Divergent Spanning Trees. - Loukas Georgiadis; Robert E. Tarjan (ACM Trans. Algorithms, 2016)

Addendum to "Dominator Tree Certification and Divergent Spanning Trees". - Loukas Georgiadis; Robert E. Tarjan (ACM Trans. Algorithms, 2016)

All-Pairs 2-Reachability in O(n^w log n) Time. - Loukas Georgiadis; Daniel Graf 001; Giuseppe F. Italiano; Nikos Parotsidis; Przemyslaw Uznanski (ICALP, 2017)

Decremental Data Structures for Connectivity and Dominators in Directed Graphs. - Loukas Georgiadis; Thomas Dueholm Hansen; Giuseppe F. Italiano; Sebastian Krinninger; Nikos Parotsidis (ICALP, 2017)

Approximating the Smallest 2-Vertex-Connected Spanning Subgraph via Low-High Orders. - Loukas Georgiadis; Giuseppe F. Italiano; Aikaterini Karanasiou (SEA, 2017)

Incremental Low-High Orders of Directed Graphs and Applications. - Loukas Georgiadis; Konstantinos Giannis; Aikaterini Karanasiou; Luigi Laura (SEA, 2017)

Sparse certificates for 2-connectivity in directed graphs. - Loukas Georgiadis; Giuseppe F. Italiano; Aikaterini Karanasiou; Charis Papadopoulos; Nikos Parotsidis (Theor. Comput. Sci., 2017)

Computing 2-Connected Components and Maximal 2-Connected Subgraphs in Directed Graphs: An Experimental Study. - Loukas Georgiadis; Giuseppe F. Italiano; Aikaterini Karanasiou; Nikos Parotsidis; Nilakantha Paudel (ALENEX, 2018)

Incremental Strong Connectivity and 2-Connectivity in Directed Graphs. - Loukas Georgiadis; Giuseppe F. Italiano; Nikos Parotsidis (LATIN, 2018)

2-vertex connectivity in directed graphs. - Loukas Georgiadis; Giuseppe F. Italiano; Luigi Laura; Nikos Parotsidis (Inf. Comput., 2018)

Computing Critical Nodes in Directed Graphs. - Nilakantha Paudel; Loukas Georgiadis; Giuseppe F. Italiano (ACM J. Exp. Algorithmics, 2018)

Dynamic Dominators and Low-High Orders in DAGs. - Loukas Georgiadis; Konstantinos Giannis; Giuseppe F. Italiano; Aikaterini Karanasiou; Luigi Laura (ESA, 2019)

Faster Algorithms for All-Pairs Bounded Min-Cuts. - Amir Abboud; Loukas Georgiadis; Giuseppe F. Italiano; Robert Krauthgamer; Nikos Parotsidis; Ohad Trabelsi; Przemyslaw Uznanski; Daniel Wolleb-Graf (ICALP, 2019)

Linear-Time Algorithms for Computing Twinless Strong Articulation Points and Related Problems. - Loukas Georgiadis; Evangelos Kosinas (ISAAC, 2020)

Strong Connectivity in Directed Graphs under Failures, with Applications. - Loukas Georgiadis; Giuseppe F. Italiano; Nikos Parotsidis (SIAM J. Comput., 2020)

Approximating the smallest 2-vertex connected spanning subgraph of a directed graph. - Loukas Georgiadis; Giuseppe F. Italiano; Aikaterini Karanasiou (Theor. Comput. Sci., 2020)

An Experimental Study of Algorithms for Computing the Edge Connectivity of a Directed Graph. - Loukas Georgiadis; Dionysios Kefallinos; Luigi Laura; Nikos Parotsidis (ALENEX, 2021)

Computing the 4-Edge-Connected Components of a Graph in Linear Time. - Loukas Georgiadis; Giuseppe F. Italiano; Evangelos Kosinas (ESA, 2021)

Computing Vertex-Edge Cut-Pairs and 2-Edge Cuts in Practice. - Loukas Georgiadis; Konstantinos Giannis; Giuseppe F. Italiano; Evangelos Kosinas (SEA, 2021)

Improved Linear-Time Algorithm for Computing the 4-Edge-Connected Components of a Graph. - Loukas Georgiadis; Giuseppe F. Italiano; Evangelos Kosinas (CoRR, 2021)

Computing the 4-Edge-Connected Components of a Graph: An Experimental Study. - Loukas Georgiadis; Giuseppe F. Italiano; Evangelos Kosinas (ESA, 2022)

An Experimental Study of Algorithms for Packing Arborescences. - Loukas Georgiadis; Dionysios Kefallinos; Anna Mpanti; Stavros D. Nikolopoulos (SEA, 2022)

On maximal 3-edge-connected subgraphs of undirected graphs. - Loukas Georgiadis; Giuseppe F. Italiano; Evangelos Kosinas; Debasish Pattanayak (CoRR, 2022)

On 2-Strong Connectivity Orientations of Mixed Graphs and Related Problems. - Loukas Georgiadis; Dionysios Kefallinos; Evangelos Kosinas (IWOCA, 2023)

Faster Computation of 3-Edge-Connected Components in Digraphs. - Loukas Georgiadis; Evangelos Kipouridis; Charis Papadopoulos; Nikos Parotsidis (SODA, 2023)

2-Fault-Tolerant Strong Connectivity Oracles. - Loukas Georgiadis; Evangelos Kosinas; Daniel Tsokaktsis (ALENEX, 2024)

Computing the 3-Edge-Connected Components of Directed Graphs in Linear Time. - Loukas Georgiadis; Giuseppe F. Italiano; Evangelos Kosinas (FOCS, 2024)