No. Title Author Year
1 Computing the 4-Edge-Connected Components of a Graph in Linear Time Georgiadis, Loukas et al. 2021
2 Computing Vertex-Edge Cut-Pairs and 2-Edge Cuts in Practice Georgiadis, Loukas et al. 2021
3 Linear-Time Algorithms for Computing Twinless Strong Articulation Points and Related Problems Georgiadis, Loukas et al. 2020
4 Dynamic Dominators and Low-High Orders in DAGs Georgiadis, Loukas et al. 2019
5 Faster Algorithms for All-Pairs Bounded Min-Cuts Abboud, Amir et al. 2019
6 All-Pairs 2-Reachability in O(n^w log n) Time Georgiadis, Loukas et al. 2017
7 Approximating the Smallest 2-Vertex-Connected Spanning Subgraph via Low-High Orders Georgiadis, Loukas et al. 2017
8 Decremental Data Structures for Connectivity and Dominators in Directed Graphs Georgiadis, Loukas et al. 2017
9 Incremental Low-High Orders of Directed Graphs and Applications Georgiadis, Loukas et al. 2017
10 2-Connectivity in Directed Graphs (Invited Talk) Georgiadis, Loukas et al. 2016
11 Incremental 2-Edge-Connectivity in Directed Graphs Georgiadis, Loukas et al. 2016
Current Page :
Number of result pages: 1
Number of documents: 11


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI