Loukas Georgiadis

According to our database1, Loukas Georgiadis authored at least 51 papers between 2004 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
Approximating the smallest 2-vertex connected spanning subgraph of a directed graph.
Theor. Comput. Sci., 2020

2019
Faster Algorithms for All-Pairs Bounded Min-Cuts.
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

Dynamic Dominators and Low-High Orders in DAGs.
Proceedings of the 27th Annual European Symposium on Algorithms, 2019

2018
Computing Critical Nodes in Directed Graphs.
ACM Journal of Experimental Algorithmics, 2018

2-vertex connectivity in directed graphs.
Inf. Comput., 2018

Incremental Strong Connectivity and 2-Connectivity in Directed Graphs.
Proceedings of the LATIN 2018: Theoretical Informatics, 2018

Computing 2-Connected Components and Maximal 2-Connected Subgraphs in Directed Graphs: An Experimental Study.
Proceedings of the Twentieth Workshop on Algorithm Engineering and Experiments, 2018

2017
Sparse certificates for 2-connectivity in directed graphs.
Theor. Comput. Sci., 2017

Incremental Low-High Orders of Directed Graphs and Applications.
Proceedings of the 16th International Symposium on Experimental Algorithms, 2017

Approximating the Smallest 2-Vertex-Connected Spanning Subgraph via Low-High Orders.
Proceedings of the 16th International Symposium on Experimental Algorithms, 2017

Strong Connectivity in Directed Graphs under Failures, with Applications.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Decremental Data Structures for Connectivity and Dominators in Directed Graphs.
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

All-Pairs 2-Reachability in O(n^w log n) Time.
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

2016
Addendum to "Dominator Tree Certification and Divergent Spanning Trees".
ACM Trans. Algorithms, 2016

Dominator Tree Certification and Divergent Spanning Trees.
ACM Trans. Algorithms, 2016

2-Edge Connectivity in Directed Graphs.
ACM Trans. Algorithms, 2016

On Low-High Orders of Directed Graphs: Incremental Algorithms and Applications.
CoRR, 2016

All-Pairs $2$-reachability in Õ(nω) Time.
CoRR, 2016

Strong Articulation Points and Strong Bridges in Large Scale Graphs.
Algorithmica, 2016

Sparse Subgraphs for 2-Connectivity in Directed Graphs.
Proceedings of the Experimental Algorithms - 15th International Symposium, 2016

Incremental 2-Edge-Connectivity in Directed Graphs.
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

2-Connectivity in Directed Graphs.
Proceedings of the 24th Annual European Symposium on Algorithms, 2016

2015
A Note on Fault Tolerant Reachability for Directed Graphs.
CoRR, 2015

A New Framework for Strong Connectivity and 2-Connectivity in Directed Graphs.
CoRR, 2015

Approximating the Smallest Spanning Subgraph for 2-Edge-Connectivity in Directed Graphs.
Proceedings of the Algorithms - ESA 2015, 2015

2-Connectivity in Directed Graphs: An Experimental Study.
Proceedings of the Seventeenth Workshop on Algorithm Engineering and Experiments, 2015

2014
Join-Reachability Problems in Directed Graphs.
Theory Comput. Syst., 2014

Corrections to "Finding dominators via disjoint set union" [J. Discrete Algorithms 23 (2013) 2-20].
J. Discrete Algorithms, 2014

Loop Nesting Forests, Dominators, and Applications.
Proceedings of the Experimental Algorithms - 13th International Symposium, 2014

2013
Finding dominators via disjoint set union.
J. Discrete Algorithms, 2013

Dominator Certification and Independent Spanning Trees: An Experimental Study.
Proceedings of the Experimental Algorithms, 12th International Symposium, 2013

2012
Dominator Tree Certification and Independent Spanning Trees
CoRR, 2012

Dominators, Directed Bipolar Orders, and Independent Spanning Trees.
Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

An Experimental Study of Dynamic Dominators.
Proceedings of the Algorithms - ESA 2012, 2012

2011
Data structures for mergeable trees.
ACM Trans. Algorithms, 2011

Dynamic Dominators in Practice.
Proceedings of the 15th Panhellenic Conference on Informatics, 2011

Approximating the Smallest 2-Vertex Connected Spanning Subgraph of a Directed Graph.
Proceedings of the Algorithms - ESA 2011, 2011

2010
Control of wireless networks with rechargeable batteries [transactions papers].
IEEE Trans. Wireless Communications, 2010

Testing 2-Vertex Connectivity and Computing Pairs of Vertex-Disjoint s-t Paths in Digraphs.
Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

2009
Shortest-path feasibility algorithms: An experimental evaluation.
ACM Journal of Experimental Algorithmics, 2009

An Experimental Study of Minimum Mean Cycle Algorithms.
Proceedings of the Eleventh Workshop on Algorithm Engineering and Experiments, 2009

2008
Linear-Time Algorithms for Dominators and Other Path-Evaluation Problems.
SIAM J. Comput., 2008

An O(nlogn) version of the Averbakh-Berman algorithm for the robust median of a tree.
Oper. Res. Lett., 2008

Computing Frequency Dominators and Related Problems.
Proceedings of the Algorithms and Computation, 19th International Symposium, 2008

2007
Dynamic Matchings in Convex Bipartite Graphs.
Proceedings of the Mathematical Foundations of Computer Science 2007, 2007

2006
Finding Dominators in Practice.
J. Graph Algorithms Appl., 2006

Design of data structures for mergeable trees.
Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

Improved Dynamic Planar Point Location.
Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), 2006

2005
Dominator tree verification and vertex-disjoint paths.
Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

2004
Finding dominators revisited: extended abstract.
Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

Finding Dominators in Practice.
Proceedings of the Algorithms, 2004


  Loading...