Loukas Georgiadis

Publication Activity (10 Years)

Years Active: 2004-2024
Publications (10 Years): 51

Top Topics

Connected Subgraphs

Top Venues

Publications

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