Loukas Georgiadis

Proceedings of the 65th IEEE Annual Symposium on Foundations of Computer Science, 2024

2-Fault-Tolerant Strong Connectivity Oracles.

[BibT_eX]

[DOI]

Daniel Tsokaktsis

Proceedings of the Symposium on Algorithm Engineering and Experiments, 2024

2023

Faster Computation of 3-Edge-Connected Components in Digraphs.

[BibT_eX]

[DOI]

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

On 2-Strong Connectivity Orientations of Mixed Graphs and Related Problems.

[BibT_eX]

[DOI]

Dionysios Kefallinos

Proceedings of the Combinatorial Algorithms - 34th International Workshop, 2023

2022

On maximal 3-edge-connected subgraphs of undirected graphs.

[BibT_eX]

[DOI]

CoRR, 2022

An Experimental Study of Algorithms for Packing Arborescences.

[BibT_eX]

[DOI]

Dionysios Kefallinos

Anna Mpanti

Stavros D. Nikolopoulos

Proceedings of the 20th International Symposium on Experimental Algorithms, 2022

Computing the 4-Edge-Connected Components of a Graph: An Experimental Study.

[BibT_eX]

[DOI]

Proceedings of the 30th Annual European Symposium on Algorithms, 2022

2021

Improved Linear-Time Algorithm for Computing the 4-Edge-Connected Components of a Graph.

[BibT_eX]

[DOI]

CoRR, 2021

Computing Vertex-Edge Cut-Pairs and 2-Edge Cuts in Practice.

[BibT_eX]

[DOI]

Proceedings of the 19th International Symposium on Experimental Algorithms, 2021

Computing the 4-Edge-Connected Components of a Graph in Linear Time.

[BibT_eX]

[DOI]

Proceedings of the 29th Annual European Symposium on Algorithms, 2021

An Experimental Study of Algorithms for Computing the Edge Connectivity of a Directed Graph.

[BibT_eX]

[DOI]

Proceedings of the Symposium on Algorithm Engineering and Experiments, 2021

2020

Approximating the smallest 2-vertex connected spanning subgraph of a directed graph.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

Strong Connectivity in Directed Graphs under Failures, with Applications.

[BibT_eX]

[DOI]

SIAM J. Comput., 2020

Linear-Time Algorithms for Computing Twinless Strong Articulation Points and Related Problems.

[BibT_eX]

[DOI]

Proceedings of the 31st International Symposium on Algorithms and Computation, 2020

2019

Faster Algorithms for All-Pairs Bounded Min-Cuts.

[BibT_eX]

[DOI]

Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

Dynamic Dominators and Low-High Orders in DAGs.

[BibT_eX]

[DOI]

Konstantinos Giannis

Luigi Laura

Proceedings of the 27th Annual European Symposium on Algorithms, 2019

2018

Computing Critical Nodes in Directed Graphs.

[BibT_eX]

[DOI]

Nilakantha Paudel

ACM J. Exp. Algorithmics, 2018

2-vertex connectivity in directed graphs.

[BibT_eX]

[DOI]

Inf. Comput., 2018

Incremental Strong Connectivity and 2-Connectivity in Directed Graphs.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2018: Theoretical Informatics, 2018

Computing 2-Connected Components and Maximal 2-Connected Subgraphs in Directed Graphs: An Experimental Study.

[BibT_eX]

[DOI]

Nilakantha Paudel

Proceedings of the Twentieth Workshop on Algorithm Engineering and Experiments, 2018

2017

Sparse certificates for 2-connectivity in directed graphs.

[BibT_eX]

[DOI]

Charis Papadopoulos

Theor. Comput. Sci., 2017

Incremental Low-High Orders of Directed Graphs and Applications.

[BibT_eX]

[DOI]

Konstantinos Giannis

Luigi Laura

Proceedings of the 16th International Symposium on Experimental Algorithms, 2017

Approximating the Smallest 2-Vertex-Connected Spanning Subgraph via Low-High Orders.

[BibT_eX]

[DOI]

Proceedings of the 16th International Symposium on Experimental Algorithms, 2017

Decremental Data Structures for Connectivity and Dominators in Directed Graphs.

[BibT_eX]

[DOI]

Thomas Dueholm Hansen

Sebastian Krinninger

Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

All-Pairs 2-Reachability in O(n^w log n) Time.

[BibT_eX]

[DOI]

Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

2016

Addendum to "Dominator Tree Certification and Divergent Spanning Trees".

[BibT_eX]

[DOI]

Robert E. Tarjan

ACM Trans. Algorithms, 2016

Dominator Tree Certification and Divergent Spanning Trees.

[BibT_eX]

[DOI]

Robert E. Tarjan

ACM Trans. Algorithms, 2016

2-Edge Connectivity in Directed Graphs.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2016

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

[BibT_eX]

[DOI]

Konstantinos Giannis

Luigi Laura

CoRR, 2016

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

[BibT_eX]

[DOI]

CoRR, 2016

Strong Articulation Points and Strong Bridges in Large Scale Graphs.

[BibT_eX]

[DOI]

Algorithmica, 2016

Sparse Subgraphs for 2-Connectivity in Directed Graphs.

[BibT_eX]

[DOI]

Charis Papadopoulos

Proceedings of the Experimental Algorithms - 15th International Symposium, 2016

Incremental 2-Edge-Connectivity in Directed Graphs.

[BibT_eX]

[DOI]

Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

2-Connectivity in Directed Graphs.

[BibT_eX]

[DOI]

Proceedings of the 24th Annual European Symposium on Algorithms, 2016

2015

A Note on Fault Tolerant Reachability for Directed Graphs.

[BibT_eX]

[DOI]

Robert E. Tarjan

CoRR, 2015

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

[BibT_eX]

[DOI]

CoRR, 2015

Approximating the Smallest Spanning Subgraph for 2-Edge-Connectivity in Directed Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2015, 2015

2-Connectivity in Directed Graphs: An Experimental Study.

[BibT_eX]

[DOI]

Proceedings of the Seventeenth Workshop on Algorithm Engineering and Experiments, 2015

2014

Join-Reachability Problems in Directed Graphs.

[BibT_eX]

[DOI]

Stavros D. Nikolopoulos

Leonidas Palios

Theory Comput. Syst., 2014

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

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2014

Loop Nesting Forests, Dominators, and Applications.

[BibT_eX]

[DOI]

Proceedings of the Experimental Algorithms - 13th International Symposium, 2014

2013

Finding dominators via disjoint set union.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2013

Dominator Certification and Independent Spanning Trees: An Experimental Study.

[BibT_eX]

[DOI]

Proceedings of the Experimental Algorithms, 12th International Symposium, 2013

2012

Dominator Tree Certification and Independent Spanning Trees

[BibT_eX]

[DOI]

CoRR, 2012

Dominators, Directed Bipolar Orders, and Independent Spanning Trees.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

An Experimental Study of Dynamic Dominators.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2012, 2012

2011

Data structures for mergeable trees.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2011

Dynamic Dominators in Practice.

[BibT_eX]

[DOI]

Konstantinos Patakakis

Vasileios A. Tatsis

Proceedings of the 15th Panhellenic Conference on Informatics, 2011

Approximating the Smallest 2-Vertex Connected Spanning Subgraph of a Directed Graph.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2011, 2011

2010

Control of wireless networks with rechargeable batteries [transactions papers].

[BibT_eX]

[DOI]

Marios Gatzianas

Leandros Tassiulas

IEEE Trans. Wirel. Commun., 2010

Testing 2-Vertex Connectivity and Computing Pairs of Vertex-Disjoint s-t Paths in Digraphs.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

2009

Shortest-path feasibility algorithms: An experimental evaluation.

[BibT_eX]

[DOI]

ACM J. Exp. Algorithmics, 2009

An Experimental Study of Minimum Mean Cycle Algorithms.

[BibT_eX]

[DOI]

Andrew V. Goldberg

Proceedings of the Eleventh Workshop on Algorithm Engineering and Experiments, 2009

2008

Linear-Time Algorithms for Dominators and Other Path-Evaluation Problems.

[BibT_eX]

[DOI]

SIAM J. Comput., 2008

An O(nlogn) version of the Averbakh-Berman algorithm for the robust median of a tree.

[BibT_eX]

[DOI]

Gerth Stølting Brodal

Irit Katriel

Oper. Res. Lett., 2008

Computing Frequency Dominators and Related Problems.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 19th International Symposium, 2008

2007

Dynamic Matchings in Convex Bipartite Graphs.

[BibT_eX]

[DOI]

Gerth Stølting Brodal

Kristoffer Arnsfelt Hansen

Irit Katriel

Proceedings of the Mathematical Foundations of Computer Science 2007, 2007

2006

Finding Dominators in Practice.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2006

Design of data structures for mergeable trees.

[BibT_eX]

[DOI]

Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

Improved Dynamic Planar Point Location.

[BibT_eX]

[DOI]

Lars Arge

Gerth Stølting Brodal

Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), 2006

2005

Dominator tree verification and vertex-disjoint paths.

[BibT_eX]

[DOI]

Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

2004

Finding dominators revisited: extended abstract.

[BibT_eX]

[DOI]

Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

Finding Dominators in Practice.

[BibT_eX]

[DOI]