2 Publications

Mark all

[2]
2024 | Published | Conference Paper | IST-REx-ID: 18309 | OA
Hu B, Kosinas E, Polak A. Connectivity oracles for predictable vertex failures. In: 32nd Annual European Symposium on Algorithms. Vol 308. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2024. doi:10.4230/LIPIcs.ESA.2024.72
[Published Version] View | Files available | DOI | arXiv
 
[1]
2024 | Published | Conference Paper | IST-REx-ID: 18922
Georgiadis L, Italiano GF, Kosinas E. Computing the 3-edge-connected components of directed graphs in linear time. In: 65th Annual Symposium on Foundations of Computer Science. IEEE; 2024:62-85. doi:10.1109/focs61266.2024.00015
View | DOI
 

Search

Filter Publications

Display / Sort

Citation Style: AMA

Export / Embed

Grants


2 Publications

Mark all

[2]
2024 | Published | Conference Paper | IST-REx-ID: 18309 | OA
Hu B, Kosinas E, Polak A. Connectivity oracles for predictable vertex failures. In: 32nd Annual European Symposium on Algorithms. Vol 308. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2024. doi:10.4230/LIPIcs.ESA.2024.72
[Published Version] View | Files available | DOI | arXiv
 
[1]
2024 | Published | Conference Paper | IST-REx-ID: 18922
Georgiadis L, Italiano GF, Kosinas E. Computing the 3-edge-connected components of directed graphs in linear time. In: 65th Annual Symposium on Foundations of Computer Science. IEEE; 2024:62-85. doi:10.1109/focs61266.2024.00015
View | DOI
 

Search

Filter Publications

Display / Sort

Citation Style: AMA

Export / Embed