Evangelos Kosinas
Henzinger_Monika Group
2 Publications
2024 | Published | Conference Paper | IST-REx-ID: 18309 | 
Connectivity oracles for predictable vertex failures
B. Hu, E. Kosinas, A. Polak, in:, 32nd Annual European Symposium on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.
[Published Version]
View
| Files available
| DOI
| arXiv
B. Hu, E. Kosinas, A. Polak, in:, 32nd Annual European Symposium on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.
2024 | Published | Conference Paper | IST-REx-ID: 18922
Computing the 3-edge-connected components of directed graphs in linear time
Georgiadis, Loukas, Computing the 3-edge-connected components of directed graphs in linear time. 65th Annual Symposium on Foundations of Computer Science. 2024
View
| DOI
Georgiadis, Loukas, Computing the 3-edge-connected components of directed graphs in linear time. 65th Annual Symposium on Foundations of Computer Science. 2024
Grants
2 Publications
2024 | Published | Conference Paper | IST-REx-ID: 18309 |
Connectivity oracles for predictable vertex failures
B. Hu, E. Kosinas, A. Polak, in:, 32nd Annual European Symposium on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.
[Published Version]
View
| Files available
| DOI
| arXiv
B. Hu, E. Kosinas, A. Polak, in:, 32nd Annual European Symposium on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.
2024 | Published | Conference Paper | IST-REx-ID: 18922
Computing the 3-edge-connected components of directed graphs in linear time
Georgiadis, Loukas, Computing the 3-edge-connected components of directed graphs in linear time. 65th Annual Symposium on Foundations of Computer Science. 2024
View
| DOI
Georgiadis, Loukas, Computing the 3-edge-connected components of directed graphs in linear time. 65th Annual Symposium on Foundations of Computer Science. 2024