default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLoukas Georgiadis
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c43]Loukas Georgiadis, Evangelos Kosinas, Daniel Tsokaktsis:
2-Fault-Tolerant Strong Connectivity Oracles. ALENEX 2024: 91-104- 2023
- [c42]Loukas Georgiadis
, Dionysios Kefallinos, Evangelos Kosinas:
On 2-Strong Connectivity Orientations of Mixed Graphs and Related Problems. IWOCA 2023: 209-220 - [c41]Loukas Georgiadis, Evangelos Kipouridis, Charis Papadopoulos, Nikos Parotsidis:
Faster Computation of 3-Edge-Connected Components in Digraphs. SODA 2023: 2489-2531 - [e1]Loukas Georgiadis:
21st International Symposium on Experimental Algorithms, SEA 2023, July 24-26, 2023, Barcelona, Spain. LIPIcs 265, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2023, ISBN 978-3-95977-279-2 [contents] - [i22]Loukas Georgiadis, Dionysios Kefallinos, Evangelos Kosinas:
On 2-strong connectivity orientations of mixed graphs and related problems. CoRR abs/2302.02215 (2023) - [i21]Loukas Georgiadis, Evangelos Kosinas, Daniel Tsokaktsis:
2-Fault-Tolerant Strong Connectivity Oracles. CoRR abs/2311.00854 (2023) - 2022
- [c40]Loukas Georgiadis, Giuseppe F. Italiano, Evangelos Kosinas:
Computing the 4-Edge-Connected Components of a Graph: An Experimental Study. ESA 2022: 60:1-60:16 - [c39]Loukas Georgiadis, Dionysios Kefallinos, Anna Mpanti, Stavros D. Nikolopoulos:
An Experimental Study of Algorithms for Packing Arborescences. SEA 2022: 14:1-14:16 - [i20]Loukas Georgiadis, Giuseppe F. Italiano, Evangelos Kosinas, Debasish Pattanayak:
On maximal 3-edge-connected subgraphs of undirected graphs. CoRR abs/2211.06521 (2022) - 2021
- [c38]Loukas Georgiadis, Dionysios Kefallinos, Luigi Laura, Nikos Parotsidis:
An Experimental Study of Algorithms for Computing the Edge Connectivity of a Directed Graph. ALENEX 2021: 85-97 - [c37]Loukas Georgiadis, Giuseppe F. Italiano, Evangelos Kosinas:
Computing the 4-Edge-Connected Components of a Graph in Linear Time. ESA 2021: 47:1-47:17 - [c36]Loukas Georgiadis, Konstantinos Giannis, Giuseppe F. Italiano, Evangelos Kosinas:
Computing Vertex-Edge Cut-Pairs and 2-Edge Cuts in Practice. SEA 2021: 20:1-20:19 - [i19]Loukas Georgiadis, Giuseppe F. Italiano, Evangelos Kosinas:
Computing the 4-Edge-Connected Components of a Graph in Linear Time. CoRR abs/2105.02910 (2021) - [i18]Loukas Georgiadis, Giuseppe F. Italiano, Evangelos Kosinas:
Improved Linear-Time Algorithm for Computing the 4-Edge-Connected Components of a Graph. CoRR abs/2108.08558 (2021) - 2020
- [j18]Loukas Georgiadis, Giuseppe F. Italiano, Nikos Parotsidis:
Strong Connectivity in Directed Graphs under Failures, with Applications. SIAM J. Comput. 49(5): 865-926 (2020) - [j17]Loukas Georgiadis, Giuseppe F. Italiano, Aikaterini Karanasiou:
Approximating the smallest 2-vertex connected spanning subgraph of a directed graph. Theor. Comput. Sci. 807: 185-200 (2020) - [c35]Loukas Georgiadis, Evangelos Kosinas:
Linear-Time Algorithms for Computing Twinless Strong Articulation Points and Related Problems. ISAAC 2020: 38:1-38:16 - [i17]Loukas Georgiadis, Evangelos Kosinas:
Linear-Time Algorithms for Computing Twinless Strong Articulation Points and Related Problems. CoRR abs/2007.03933 (2020)
2010 – 2019
- 2019
- [c34]Loukas Georgiadis, Konstantinos Giannis, Giuseppe F. Italiano, Aikaterini Karanasiou, Luigi Laura:
Dynamic Dominators and Low-High Orders in DAGs. ESA 2019: 50:1-50:18 - [c33]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: 7:1-7:15 - 2018
- [j16]Loukas Georgiadis, Giuseppe F. Italiano, Luigi Laura, Nikos Parotsidis:
2-vertex connectivity in directed graphs. Inf. Comput. 261: 248-264 (2018) - [j15]Nilakantha Paudel, Loukas Georgiadis, Giuseppe F. Italiano:
Computing Critical Nodes in Directed Graphs. ACM J. Exp. Algorithmics 23 (2018) - [c32]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: 169-183 - [c31]Loukas Georgiadis, Giuseppe F. Italiano, Nikos Parotsidis:
Incremental Strong Connectivity and 2-Connectivity in Directed Graphs. LATIN 2018: 529-543 - [i16]Loukas Georgiadis, Giuseppe F. Italiano, Nikos Parotsidis:
Incremental Strong Connectivity and 2-Connectivity in Directed Graphs. CoRR abs/1802.10189 (2018) - [i15]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 abs/1807.05803 (2018) - 2017
- [j14]Loukas Georgiadis, Giuseppe F. Italiano, Aikaterini Karanasiou, Charis Papadopoulos, Nikos Parotsidis:
Sparse certificates for 2-connectivity in directed graphs. Theor. Comput. Sci. 698: 40-66 (2017) - [c30]Nilakantha Paudel, Loukas Georgiadis, Giuseppe F. Italiano:
Computing Critical Nodes in Directed Graphs. ALENEX 2017: 43-57 - [c29]Loukas Georgiadis, Thomas Dueholm Hansen, Giuseppe F. Italiano, Sebastian Krinninger, Nikos Parotsidis:
Decremental Data Structures for Connectivity and Dominators in Directed Graphs. ICALP 2017: 42:1-42:15 - [c28]Loukas Georgiadis, Daniel Graf, Giuseppe F. Italiano, Nikos Parotsidis, Przemyslaw Uznanski:
All-Pairs 2-Reachability in O(n^w log n) Time. ICALP 2017: 74:1-74:14 - [c27]Loukas Georgiadis, Giuseppe F. Italiano, Nikos Parotsidis:
Strong Connectivity in Directed Graphs under Failures, with Applications. SODA 2017: 1880-1899 - [c26]Loukas Georgiadis, Giuseppe F. Italiano, Aikaterini Karanasiou:
Approximating the Smallest 2-Vertex-Connected Spanning Subgraph via Low-High Orders. SEA 2017: 9:1-9:16 - [c25]Loukas Georgiadis, Konstantinos Giannis, Aikaterini Karanasiou, Luigi Laura:
Incremental Low-High Orders of Directed Graphs and Applications. SEA 2017: 27:1-27:21 - [i14]Loukas Georgiadis, Thomas Dueholm Hansen, Giuseppe F. Italiano, Sebastian Krinninger, Nikos Parotsidis:
Decremental Data Structures for Connectivity and Dominators in Directed Graphs. CoRR abs/1704.08235 (2017) - 2016
- [j13]Donatella Firmani, Loukas Georgiadis, Giuseppe F. Italiano, Luigi Laura, Federico Santaroni:
Strong Articulation Points and Strong Bridges in Large Scale Graphs. Algorithmica 74(3): 1123-1147 (2016) - [j12]Loukas Georgiadis, Robert E. Tarjan:
Dominator Tree Certification and Divergent Spanning Trees. ACM Trans. Algorithms 12(1): 11:1-11:42 (2016) - [j11]Loukas Georgiadis, Robert E. Tarjan:
Addendum to "Dominator Tree Certification and Divergent Spanning Trees". ACM Trans. Algorithms 12(4): 56:1-56:3 (2016) - [j10]Loukas Georgiadis, Giuseppe F. Italiano, Luigi Laura, Nikos Parotsidis:
2-Edge Connectivity in Directed Graphs. ACM Trans. Algorithms 13(1): 9:1-9:24 (2016) - [c24]Loukas Georgiadis, Giuseppe F. Italiano, Nikos Parotsidis:
2-Connectivity in Directed Graphs. ESA 2016: 1:1-1:14 - [c23]Loukas Georgiadis, Giuseppe F. Italiano, Nikos Parotsidis:
Incremental 2-Edge-Connectivity in Directed Graphs. ICALP 2016: 49:1-49:15 - [c22]Loukas Georgiadis, Giuseppe F. Italiano, Aikaterini Karanasiou, Charis Papadopoulos, Nikos Parotsidis:
Sparse Subgraphs for 2-Connectivity in Directed Graphs. SEA 2016: 150-166 - [i13]Loukas Georgiadis, Giuseppe F. Italiano, Luigi Laura, Federico Santaroni:
An Experimental Study of Dynamic Dominators. CoRR abs/1604.02711 (2016) - [i12]Loukas Georgiadis, Giuseppe F. Italiano, Nikos Parotsidis:
Incremental 2-Edge-Connectivity in Directed Graphs. CoRR abs/1607.07073 (2016) - [i11]Loukas Georgiadis, Aikaterini Karanasiou, Konstantinos Giannis, Luigi Laura:
On Low-High Orders of Directed Graphs: Incremental Algorithms and Applications. CoRR abs/1608.06462 (2016) - [i10]Loukas Georgiadis, Daniel Graf, Giuseppe F. Italiano, Nikos Parotsidis, Przemyslaw Uznanski:
All-Pairs $2$-reachability in Õ(nω) Time. CoRR abs/1612.08075 (2016) - 2015
- [c21]William Di Luigi, Loukas Georgiadis, Giuseppe F. Italiano, Luigi Laura, Nikos Parotsidis:
2-Connectivity in Directed Graphs: An Experimental Study. ALENEX 2015: 173-187 - [c20]Loukas Georgiadis, Giuseppe F. Italiano, Charis Papadopoulos, Nikos Parotsidis:
Approximating the Smallest Spanning Subgraph for 2-Edge-Connectivity in Directed Graphs. ESA 2015: 582-594 - [c19]Loukas Georgiadis, Giuseppe F. Italiano, Luigi Laura, Nikos Parotsidis:
2-Vertex Connectivity in Directed Graphs. ICALP (1) 2015: 605-616 - [c18]Loukas Georgiadis, Giuseppe F. Italiano, Luigi Laura, Nikos Parotsidis:
2-Edge Connectivity in Directed Graphs. SODA 2015: 1988-2005 - [i9]Loukas Georgiadis, Giuseppe F. Italiano, Charis Papadopoulos, Nikos Parotsidis:
Approximating the Smallest Spanning Subgraph for 2-Edge-Connectivity in Directed Graphs. CoRR abs/1509.02841 (2015) - [i8]Loukas Georgiadis, Giuseppe F. Italiano, Nikos Parotsidis:
A New Framework for Strong Connectivity and 2-Connectivity in Directed Graphs. CoRR abs/1511.02913 (2015) - [i7]Loukas Georgiadis, Robert E. Tarjan:
A Note on Fault Tolerant Reachability for Directed Graphs. CoRR abs/1511.07741 (2015) - 2014
- [j9]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: 106-110 (2014) - [j8]Loukas Georgiadis, Stavros D. Nikolopoulos, Leonidas Palios:
Join-Reachability Problems in Directed Graphs. Theory Comput. Syst. 55(2): 347-379 (2014) - [c17]Loukas Georgiadis, Luigi Laura, Nikos Parotsidis, Robert Endre Tarjan:
Loop Nesting Forests, Dominators, and Applications. SEA 2014: 174-186 - [i6]Loukas Georgiadis, Giuseppe F. Italiano, Luigi Laura, Nikos Parotsidis:
2-Edge Connectivity in Directed Graphs. CoRR abs/1407.3041 (2014) - [i5]Loukas Georgiadis, Giuseppe F. Italiano, Luigi Laura, Nikos Parotsidis:
2-Vertex Connectivity in Directed Graphs. CoRR abs/1409.6277 (2014) - 2013
- [j7]Wojciech Fraczak, Loukas Georgiadis, Andrew Miller, Robert Endre Tarjan:
Finding dominators via disjoint set union. J. Discrete Algorithms 23: 2-20 (2013) - [c16]Loukas Georgiadis, Luigi Laura, Nikos Parotsidis, Robert Endre Tarjan:
Dominator Certification and Independent Spanning Trees: An Experimental Study. SEA 2013: 284-295 - [i4]Wojciech Fraczak, Loukas Georgiadis, Andrew Miller, Robert Endre Tarjan:
Finding Dominators via Disjoint Set Union. CoRR abs/1310.2118 (2013) - 2012
- [c15]Loukas Georgiadis, Giuseppe F. Italiano, Luigi Laura, Federico Santaroni:
An Experimental Study of Dynamic Dominators. ESA 2012: 491-502 - [c14]Loukas Georgiadis, Robert Endre Tarjan:
Dominators, Directed Bipolar Orders, and Independent Spanning Trees. ICALP (1) 2012: 375-386 - [i3]Loukas Georgiadis, Robert Endre Tarjan:
Dominator Tree Certification and Independent Spanning Trees. CoRR abs/1210.8303 (2012) - 2011
- [j6]Loukas Georgiadis, Haim Kaplan, Nira Shafrir, Robert Endre Tarjan, Renato Fonseca F. Werneck:
Data structures for mergeable trees. ACM Trans. Algorithms 7(2): 14:1-14:30 (2011) - [c13]Loukas Georgiadis, Stavros D. Nikolopoulos, Leonidas Palios:
Join-Reachability Problems in Directed Graphs. CSR 2011: 195-208 - [c12]Loukas Georgiadis:
Approximating the Smallest 2-Vertex Connected Spanning Subgraph of a Directed Graph. ESA 2011: 13-24 - [c11]Konstantinos Patakakis, Loukas Georgiadis, Vasileios A. Tatsis:
Dynamic Dominators in Practice. Panhellenic Conference on Informatics 2011: 100-104 - 2010
- [j5]Marios Gatzianas, Loukas Georgiadis, Leandros Tassiulas:
Control of wireless networks with rechargeable batteries [transactions papers]. IEEE Trans. Wirel. Commun. 9(2): 581-593 (2010) - [c10]Loukas Georgiadis:
Testing 2-Vertex Connectivity and Computing Pairs of Vertex-Disjoint s-t Paths in Digraphs. ICALP (1) 2010: 738-749 - [i2]Loukas Georgiadis, Stavros D. Nikolopoulos, Leonidas Palios:
Join-Reachability Problems in Directed Graphs. CoRR abs/1012.4938 (2010)
2000 – 2009
- 2009
- [j4]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) - [c9]Loukas Georgiadis, Andrew V. Goldberg, Robert Endre Tarjan, Renato Fonseca F. Werneck:
An Experimental Study of Minimum Mean Cycle Algorithms. ALENEX 2009: 1-13 - 2008
- [j3]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): 14-18 (2008) - [j2]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): 1533-1573 (2008) - [c8]Boris V. Cherkassky, Loukas Georgiadis, Andrew V. Goldberg, Robert Endre Tarjan, Renato Fonseca F. Werneck:
Shortest Path Feasibility Algorithms: An Experimental Evaluation. ALENEX 2008: 118-132 - [c7]Loukas Georgiadis:
Computing Frequency Dominators and Related Problems. ISAAC 2008: 704-715 - 2007
- [c6]Gerth Stølting Brodal, Loukas Georgiadis, Kristoffer Arnsfelt Hansen, Irit Katriel:
Dynamic Matchings in Convex Bipartite Graphs. MFCS 2007: 406-417 - [i1]Loukas Georgiadis, Haim Kaplan, Nira Shafrir, Robert Endre Tarjan, Renato Fonseca F. Werneck:
Data Structures for Mergeable Trees. CoRR abs/0711.1682 (2007) - 2006
- [j1]Loukas Georgiadis, Robert Endre Tarjan, Renato Fonseca F. Werneck:
Finding Dominators in Practice. J. Graph Algorithms Appl. 10(1): 69-94 (2006) - [c5]Lars Arge, Gerth Stølting Brodal, Loukas Georgiadis:
Improved Dynamic Planar Point Location. FOCS 2006: 305-314 - [c4]Loukas Georgiadis, Robert Endre Tarjan, Renato Fonseca F. Werneck:
Design of data structures for mergeable trees. SODA 2006: 394-403 - 2005
- [c3]Loukas Georgiadis, Robert Endre Tarjan:
Dominator tree verification and vertex-disjoint paths. SODA 2005: 433-442 - 2004
- [c2]Loukas Georgiadis, Renato Fonseca F. Werneck, Robert Endre Tarjan, Spyridon Triantafyllis, David I. August:
Finding Dominators in Practice. ESA 2004: 677-688 - [c1]Loukas Georgiadis, Robert Endre Tarjan:
Finding dominators revisited: extended abstract. SODA 2004: 869-878
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-22 20:52 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
