Evangelos Kosinas
3 Publications
2025 | Published | Conference Paper | IST-REx-ID: 20534 | 
Henzinger, M., Kosinas, E., Münk, R., & Räcke, H. (2025). Efficient contractions of dynamic graphs - with applications. In 33rd Annual European Symposium on Algorithms (Vol. 351). Warsaw, Poland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ESA.2025.36
[Published Version]
View
| Files available
| DOI
| arXiv
2024 | Published | Conference Paper | IST-REx-ID: 18922
Georgiadis, L., Italiano, G. F., & Kosinas, E. (2024). Computing the 3-edge-connected components of directed graphs in linear time. In 65th Annual Symposium on Foundations of Computer Science (pp. 62–85). Chicago, IL, United States: IEEE. https://doi.org/10.1109/focs61266.2024.00015
View
| DOI
| WoS
2024 | Published | Conference Paper | IST-REx-ID: 18309 |
Hu, B., Kosinas, E., & Polak, A. (2024). Connectivity oracles for predictable vertex failures. In 32nd Annual European Symposium on Algorithms (Vol. 308). London, United Kingdom: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ESA.2024.72
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
Grants
3 Publications
2025 | Published | Conference Paper | IST-REx-ID: 20534 |
Henzinger, M., Kosinas, E., Münk, R., & Räcke, H. (2025). Efficient contractions of dynamic graphs - with applications. In 33rd Annual European Symposium on Algorithms (Vol. 351). Warsaw, Poland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ESA.2025.36
[Published Version]
View
| Files available
| DOI
| arXiv
2024 | Published | Conference Paper | IST-REx-ID: 18922
Georgiadis, L., Italiano, G. F., & Kosinas, E. (2024). Computing the 3-edge-connected components of directed graphs in linear time. In 65th Annual Symposium on Foundations of Computer Science (pp. 62–85). Chicago, IL, United States: IEEE. https://doi.org/10.1109/focs61266.2024.00015
View
| DOI
| WoS
2024 | Published | Conference Paper | IST-REx-ID: 18309 |
Hu, B., Kosinas, E., & Polak, A. (2024). Connectivity oracles for predictable vertex failures. In 32nd Annual European Symposium on Algorithms (Vol. 308). London, United Kingdom: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ESA.2024.72
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv