The following publications are possibly variants of this publication:
- 2-Connectivity in Directed GraphsLoukas Georgiadis, Giuseppe F. Italiano, Nikos Parotsidis. esa 2016: [doi]
- Sparse certificates for 2-connectivity in directed graphsLoukas Georgiadis, Giuseppe F. Italiano, Aikaterini Karanasiou, Charis Papadopoulos, Nikos Parotsidis. TCS, 698:40-66, 2017. [doi]
- Sparse Subgraphs for 2-Connectivity in Directed GraphsLoukas Georgiadis, Giuseppe F. Italiano, Aikaterini Karanasiou, Charis Papadopoulos, Nikos Parotsidis. wea 2016: 150-166 [doi]
- Incremental Strong Connectivity and 2-Connectivity in Directed GraphsLoukas Georgiadis, Giuseppe F. Italiano, Nikos Parotsidis. latin 2018: 529-543 [doi]
- Computing 2-Connected Components and Maximal 2-Connected Subgraphs in Directed Graphs: An Experimental StudyLoukas Georgiadis, Giuseppe F. Italiano, Aikaterini Karanasiou, Nikos Parotsidis, Nilakantha Paudel. alenex 2018: 169-183 [doi]
- An Experimental Study of Algorithms for Computing the Edge Connectivity of a Directed GraphLoukas Georgiadis, Dionysios Kefallinos, Luigi Laura, Nikos Parotsidis. alenex 2021: 85-97 [doi]