publications

2024

• Loukas Georgiadis, Evangelos Kosinas, and Daniel Tsokaktsis. 2-Fault-Tolerant Strong Connectivity Oracles. In ALENEX 2024.

2023

• Loukas Georgiadis, Dionysios Kefallinos, and Evangelos Kosinas. On 2-strong connectivity orientations of mixed graphs and related problems. In IWOCA 2023.

• Loukas Georgiadis, Evangelos Kipouridis, Charis Papadopoulos, and Nikos Parotsidis. Faster Computation of 3-Edge-Connected Components in Digraphs. In SODA 2023.

• Giuseppe F. Italiano, Athanasios L. Konstantinidis, and Charis Papadopoulos. Structural Parameterization of Cluster Deletion. In WALCOM 2023. 

• Charis Papadopoulos and Spyridon Tzimas. Computing a minimum subset feedback vertex set on chordal graphs parameterized by leafage. Algorithmica, 2023. 

• Charis Papadopoulos and Athanasios E. Zisis. Computing and listing avoidable vertices and paths. Algorithmica, 2023. 

• Anna Mpanti, Stavros D. Nikolopoulos, and Leonidas Palios. Adding a tail in classes of perfect graphs. Algorithms, 2023.

2022

• Loukas Georgiadis, Giuseppe F. Italiano, and Evangelos Kosinas. Computing the 4-Edge-Connected Components of a Graph: An Experimental Study. In ESA 2022.

• Dionysios Kefallinos, Loukas Georgiadis, Anna Mpanti, and Stavros Nikolopoulos. An Experimental Study of Algorithms for Packing Arborescences. In SEA 2022.

• Charis Papadopoulos and Spyridon Tzimas. Computing a Minimum Subset Feedback Vertex Set on Chordal Graphs Parameterized by Leafage. In IWOCA 2022.

• Charis Papadopoulos and Athanasios Zisis. Computing and Listing Avoidable Vertices and Paths. In LATIN 2022. 

2021

• Loukas Georgiadis, Giuseppe F. Italiano, and Evangelos Kosinas. Computing the 4-Edge-Connected Components of a Graph in Linear Time. In ESA 2021.

• Loukas Georgiadis, Konstantinos Giannis, Giuseppe Italiano, and Evangelos Kosinas. Computing Vertex-Edge Cut-Pairs and 2-Edge Cuts in Practice. In SEA 2021. 

• Loukas Georgiadis, Dionysiοs Kefallinos, Nikos Parotsidis, and Luigi Laura. An Experimental Study of Algorithms for Computing the Edge Connectivity of a Directed Graph. In ALENEX 2021. 

• Athanasios L. Konstantinidis and Charis Papadopoulos. Cluster deletion on interval graphs and split related graphs. Algorithmica 83: 2018-2046, 2021.

2020

• Loukas Georgiadis, Giuseppe F. Italiano, and Nikos Parotsidis. Strong Connectivity in Directed Graphs under Failures, with Applications and Related Problems. SIAM Journal on Computing, volume 49, issue 5, pages 865–926.  

• Loukas Georgiadis and Evangelos Kosinas. Linear-Time Algorithms for Computing Twinless Strong Articulation Points and Related Problems. In ISAAC 2020.  

• Athanasios L. Konstantinidis and Charis Papadopoulos. Maximizing the strong triadic closure in split graphs and proper interval graphs. Discrete Applied Mathematics 285: 79-95, 2020.

• Petr A. Golovach, Pinar Heggernes, Athanasios L. Konstantinidis, Paloma T. Lima, and Charis Papadopoulos. Parameterized aspects of strong subgraph closure. Algorithmica 82: 2006-2038, 2020.

• Charis Papadopoulos and Spyridon Tzimas. Subset feedback vertex set on graphs of bounded independent set size. Theoretical Computer Science 814: 177-188, 2020.