Evangelos Kosinas
3 Publications
2025 | Published | Conference Paper | IST-REx-ID: 20534 | 
M. Henzinger, E. Kosinas, R. Münk, and H. Räcke, “Efficient contractions of dynamic graphs - with applications,” in 33rd Annual European Symposium on Algorithms, Warsaw, Poland, 2025, vol. 351.
[Published Version]
View
| Files available
| DOI
| arXiv
2024 | Published | Conference Paper | IST-REx-ID: 18922
L. Georgiadis, G. F. Italiano, and E. Kosinas, “Computing the 3-edge-connected components of directed graphs in linear time,” in 65th Annual Symposium on Foundations of Computer Science, Chicago, IL, United States, 2024, pp. 62–85.
View
| DOI
| WoS
2024 | Published | Conference Paper | IST-REx-ID: 18309 |
B. Hu, E. Kosinas, and A. Polak, “Connectivity oracles for predictable vertex failures,” in 32nd Annual European Symposium on Algorithms, London, United Kingdom, 2024, vol. 308.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
Grants
3 Publications
2025 | Published | Conference Paper | IST-REx-ID: 20534 |
M. Henzinger, E. Kosinas, R. Münk, and H. Räcke, “Efficient contractions of dynamic graphs - with applications,” in 33rd Annual European Symposium on Algorithms, Warsaw, Poland, 2025, vol. 351.
[Published Version]
View
| Files available
| DOI
| arXiv
2024 | Published | Conference Paper | IST-REx-ID: 18922
L. Georgiadis, G. F. Italiano, and E. Kosinas, “Computing the 3-edge-connected components of directed graphs in linear time,” in 65th Annual Symposium on Foundations of Computer Science, Chicago, IL, United States, 2024, pp. 62–85.
View
| DOI
| WoS
2024 | Published | Conference Paper | IST-REx-ID: 18309 |
B. Hu, E. Kosinas, and A. Polak, “Connectivity oracles for predictable vertex failures,” in 32nd Annual European Symposium on Algorithms, London, United Kingdom, 2024, vol. 308.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv