Linear-Time Algorithms for Computing Twinless Strong Articulation Points and Related Problems. - Loukas Georgiadis; Evangelos Kosinas (ISAAC, 2020)

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

Computing Vertex-Edge Cut-Pairs and 2-Edge Cuts in Practice. - Loukas Georgiadis; Konstantinos Giannis; Giuseppe F. Italiano; Evangelos Kosinas (SEA, 2021)

Improved Linear-Time Algorithm for Computing the 4-Edge-Connected Components of a Graph. - Loukas Georgiadis; Giuseppe F. Italiano; Evangelos Kosinas (CoRR, 2021)

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

On maximal 3-edge-connected subgraphs of undirected graphs. - Loukas Georgiadis; Giuseppe F. Italiano; Evangelos Kosinas; Debasish Pattanayak (CoRR, 2022)

Connectivity Queries Under Vertex Failures: Not Optimal, but Practical. - Evangelos Kosinas (ESA, 2023)

On 2-Strong Connectivity Orientations of Mixed Graphs and Related Problems. - Loukas Georgiadis; Dionysios Kefallinos; Evangelos Kosinas (IWOCA, 2023)

2-Fault-Tolerant Strong Connectivity Oracles. - Loukas Georgiadis; Evangelos Kosinas; Daniel Tsokaktsis (ALENEX, 2024)

Connectivity Oracles for Predictable Vertex Failures. - Bingbing Hu; Evangelos Kosinas; Adam Polak 001 (ESA, 2024)

Computing the 3-Edge-Connected Components of Directed Graphs in Linear Time. - Loukas Georgiadis; Giuseppe F. Italiano; Evangelos Kosinas (FOCS, 2024)

Online Drone Scheduling for Last-Mile Delivery. - Saswata Jana; Giuseppe F. Italiano; Manas Jyoti Kashyop; Athanasios L. Konstantinidis; Evangelos Kosinas; Partha Sarathi Mandal 001 (SIROCCO, 2024)

Computing the 5-Edge-Connected Components in Linear Time. - Evangelos Kosinas (SODA, 2024)

An Optimal 3-Fault-Tolerant Connectivity Oracle. - Evangelos Kosinas (ICALP, 2025)