Loukas Georgiadis
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
38
Venues
10
Active years
2004–2026
Best venue rank
A*
Where they publish
Papers
38 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | ICALP | Computing the (k+2)-Edge-Connected Components in k-Edge-Connected Digraphs in Subquadratic Time. | Loukas Georgiadis, Evangelos Kipouridis, Evangelos Kosinas, Charis Papadopoulos, Nikos Parotsidis |
| 2025 | ESA | Faster Dynamic 2-Edge Connectivity in Directed Graphs. | Loukas Georgiadis, Konstantinos Giannis, Giuseppe F. Italiano |
| 2024 | ALENEX | 2-Fault-Tolerant Strong Connectivity Oracles. | Loukas Georgiadis, Evangelos Kosinas, Daniel Tsokaktsis |
| 2024 | FOCS | Computing the 3-Edge-Connected Components of Directed Graphs in Linear Time. | Loukas Georgiadis, Giuseppe F. Italiano, Evangelos Kosinas |
| 2023 | IWOCA | On 2-Strong Connectivity Orientations of Mixed Graphs and Related Problems. | Loukas Georgiadis, Dionysios Kefallinos, Evangelos Kosinas |
| 2023 | SODA | Faster Computation of 3-Edge-Connected Components in Digraphs. | Loukas Georgiadis, Evangelos Kipouridis, Charis Papadopoulos, Nikos Parotsidis |
| 2022 | ESA | Computing the 4-Edge-Connected Components of a Graph: An Experimental Study. | Loukas Georgiadis, Giuseppe F. Italiano, Evangelos Kosinas |
| 2021 | ALENEX | An Experimental Study of Algorithms for Computing the Edge Connectivity of a Directed Graph. | Loukas Georgiadis, Dionysios Kefallinos, Luigi Laura, Nikos Parotsidis |
| 2021 | ESA | Computing the 4-Edge-Connected Components of a Graph in Linear Time. | Loukas Georgiadis, Giuseppe F. Italiano, Evangelos Kosinas |
| 2020 | ISAAC | Linear-Time Algorithms for Computing Twinless Strong Articulation Points and Related Problems. | Loukas Georgiadis, Evangelos Kosinas |
| 2019 | ESA | Dynamic Dominators and Low-High Orders in DAGs. | Loukas Georgiadis, Konstantinos Giannis, Giuseppe F. Italiano, Aikaterini Karanasiou, Luigi Laura |
| 2019 | ICALP | 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 |
| 2018 | ALENEX | 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 |
| 2018 | LATIN | Incremental Strong Connectivity and 2-Connectivity in Directed Graphs. | Loukas Georgiadis, Giuseppe F. Italiano, Nikos Parotsidis |
| 2017 | ALENEX | Computing Critical Nodes in Directed Graphs. | Nilakantha Paudel, Loukas Georgiadis, Giuseppe F. Italiano |
| 2017 | ICALP | All-Pairs 2-Reachability in O(n^w log n) Time. | Loukas Georgiadis, Daniel Graf, Giuseppe F. Italiano, Nikos Parotsidis, Przemyslaw Uznanski |
| 2017 | ICALP | Decremental Data Structures for Connectivity and Dominators in Directed Graphs. | Loukas Georgiadis, Thomas Dueholm Hansen, Giuseppe F. Italiano, Sebastian Krinninger, Nikos Parotsidis |
| 2017 | SODA | Strong Connectivity in Directed Graphs under Failures, with Applications. | Loukas Georgiadis, Giuseppe F. Italiano, Nikos Parotsidis |
| 2016 | ESA | 2-Connectivity in Directed Graphs. | Loukas Georgiadis, Giuseppe F. Italiano, Nikos Parotsidis |
| 2016 | ICALP | Incremental 2-Edge-Connectivity in Directed Graphs. | Loukas Georgiadis, Giuseppe F. Italiano, Nikos Parotsidis |
| 2015 | ALENEX | 2-Connectivity in Directed Graphs: An Experimental Study. | William Di Luigi, Loukas Georgiadis, Giuseppe F. Italiano, Luigi Laura, Nikos Parotsidis |
| 2015 | ESA | Approximating the Smallest Spanning Subgraph for 2-Edge-Connectivity in Directed Graphs. | Loukas Georgiadis, Giuseppe F. Italiano, Charis Papadopoulos, Nikos Parotsidis |
| 2015 | ICALP | 2-Vertex Connectivity in Directed Graphs. | Loukas Georgiadis, Giuseppe F. Italiano, Luigi Laura, Nikos Parotsidis |
| 2015 | SODA | 2-Edge Connectivity in Directed Graphs. | Loukas Georgiadis, Giuseppe F. Italiano, Luigi Laura, Nikos Parotsidis |
| 2012 | ESA | An Experimental Study of Dynamic Dominators. | Loukas Georgiadis, Giuseppe F. Italiano, Luigi Laura, Federico Santaroni |
| 2012 | ICALP | Dominators, Directed Bipolar Orders, and Independent Spanning Trees. | Loukas Georgiadis, Robert Endre Tarjan |
| 2011 | CSR | Join-Reachability Problems in Directed Graphs. | Loukas Georgiadis, Stavros D. Nikolopoulos, Leonidas Palios |
| 2011 | ESA | Approximating the Smallest 2-Vertex Connected Spanning Subgraph of a Directed Graph. | Loukas Georgiadis |
| 2010 | ICALP | Testing 2-Vertex Connectivity and Computing Pairs of Vertex-Disjoint | Loukas Georgiadis |
| 2009 | ALENEX | An Experimental Study of Minimum Mean Cycle Algorithms. | Loukas Georgiadis, Andrew V. Goldberg, Robert Endre Tarjan, Renato Fonseca F. Werneck |
| 2008 | ALENEX | Shortest Path Feasibility Algorithms: An Experimental Evaluation. | Boris V. Cherkassky, Loukas Georgiadis, Andrew V. Goldberg, Robert Endre Tarjan, Renato Fonseca F. Werneck |
| 2008 | ISAAC | Computing Frequency Dominators and Related Problems. | Loukas Georgiadis |
| 2007 | MFCS | Dynamic Matchings in Convex Bipartite Graphs. | Gerth Stlting Brodal, Loukas Georgiadis, Kristoffer Arnsfelt Hansen, Irit Katriel |
| 2006 | FOCS | Improved Dynamic Planar Point Location. | Lars Arge, Gerth Stlting Brodal, Loukas Georgiadis |
| 2006 | SODA | Design of data structures for mergeable trees. | Loukas Georgiadis, Robert Endre Tarjan, Renato Fonseca F. Werneck |
| 2005 | SODA | Dominator tree verification and vertex-disjoint paths. | Loukas Georgiadis, Robert Endre Tarjan |
| 2004 | ESA | Finding Dominators in Practice. | Loukas Georgiadis, Renato Fonseca F. Werneck, Robert Endre Tarjan, Spyridon Triantafyllis, David I. August |
| 2004 | SODA | Finding dominators revisited: extended abstract. | Loukas Georgiadis, Robert Endre Tarjan |