Evangelos Kosinas

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

Online Drone Scheduling for Last-Mile Delivery.

[BibT_eX]

[DOI]

Saswata Jana

Athanasios L. Konstantinidis

Manas Jyoti Kashyop

Partha Sarathi Mandal

Proceedings of the Structural Information and Communication Complexity, 2024

Computing the 3-Edge-Connected Components of Directed Graphs in Linear Time.

[BibT_eX]

[DOI]

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

Connectivity Oracles for Predictable Vertex Failures.

[BibT_eX]

[DOI]

Bingbing Hu

Adam Polak

Proceedings of the 32nd Annual European Symposium on Algorithms, 2024

2-Fault-Tolerant Strong Connectivity Oracles.

[BibT_eX]

[DOI]

Daniel Tsokaktsis

Proceedings of the Symposium on Algorithm Engineering and Experiments, 2024

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

Connectivity Queries Under Vertex Failures: Not Optimal, but Practical.

[BibT_eX]

[DOI]

Proceedings of the 31st Annual European Symposium on Algorithms, 2023

2022

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

[BibT_eX]

[DOI]

CoRR, 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

2020

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

[BibT_eX]

[DOI]