Please note that ISTA Research Explorer no longer supports Internet Explorer versions 8 or 9 (or earlier).
We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.
12 Publications
2025 | Published | Conference Paper | IST-REx-ID: 20006 | 
Ost, Lara, Sebastiano Cultrera di Montesano, and Herbert Edelsbrunner. “Banana Trees for the Persistence in Time Series Experimentally.” In 41st International Symposium on Computational Geometry, Vol. 332. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025. https://doi.org/10.4230/LIPIcs.SoCG.2025.71.
[Published Version]
View
| Files available
| DOI
| arXiv
2025 | Published | Conference Paper | IST-REx-ID: 20004 |
Streltsova, Elizaveta, and Uli Wagner. “Levels in Arrangements: Linear Relations, the g-Matrix, and Applications to Crossing Numbers.” In 41st International Symposium on Computational Geometry, Vol. 332. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025. https://doi.org/10.4230/LIPIcs.SoCG.2025.75.
[Published Version]
View
| Files available
| DOI
| arXiv
2025 | Published | Conference Paper | IST-REx-ID: 20005 |
Edelsbrunner, Herbert, Alexey Garber, and Morteza Saghafian. “On Spheres with k Points Inside.” In 41st International Symposium on Computational Geometry, Vol. 332. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025. https://doi.org/10.4230/LIPIcs.SoCG.2025.43.
[Published Version]
View
| Files available
| DOI
| arXiv
2024 | Published | Conference Paper | IST-REx-ID: 17170 |
Attali, Dominique, Hana Kourimska, Christopher D Fillmore, Ishika Ghosh, André Lieutier, Elizabeth R Stephenson, and Mathijs Wintraecken. “Tight Bounds for the Learning of Homotopy à La Niyogi, Smale, and Weinberger for Subsets of Euclidean Spaces and of Riemannian Manifolds.” In 40th International Symposium on Computational Geometry, 293:11:1-11:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. https://doi.org/10.4230/LIPIcs.SoCG.2024.11.
[Published Version]
View
| Files available
| DOI
| arXiv
2024 | Published | Conference Paper | IST-REx-ID: 18928 |
Henzinger, Monika, Barna Saha, Martin P. Seybold, and Christopher Ye. “On the Complexity of Algorithms with Predictions for Dynamic Graph Problems.” In 15th Innovations in Theoretical Computer Science Conference, 287:62:1-62:25. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. https://doi.org/10.4230/LIPIcs.ITCS.2024.62.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2024 | Published | Conference Paper | IST-REx-ID: 15168 |
Filakovský, Marek, Tamio Vesa Nakajima, Jakub Opršal, Gianluca Tasinato, and Uli Wagner. “Hardness of Linearly Ordered 4-Colouring of 3-Colourable 3-Uniform Hypergraphs.” In 41st International Symposium on Theoretical Aspects of Computer Science, Vol. 289. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. https://doi.org/10.4230/LIPIcs.STACS.2024.34.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2023 | Published | Conference Paper | IST-REx-ID: 13292 |
Henzinger, Thomas A, Pavol Kebis, Nicolas Adrien Mazzocchi, and Naci E Sarac. “Regular Methods for Operator Precedence Languages.” In 50th International Colloquium on Automata, Languages, and Programming, 261:129:1--129:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. https://doi.org/10.4230/LIPIcs.ICALP.2023.129.
[Published Version]
View
| Files available
| DOI
| arXiv
2023 | Published | Conference Paper | IST-REx-ID: 14417 |
Baier, Christel, Krishnendu Chatterjee, Tobias Meggendorfer, and Jakob Piribauer. “Entropic Risk for Turn-Based Stochastic Games.” In 48th International Symposium on Mathematical Foundations of Computer Science, Vol. 272. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. https://doi.org/10.4230/LIPIcs.MFCS.2023.15.
[Published Version]
View
| Files available
| DOI
| arXiv
2023 | Published | Conference Paper | IST-REx-ID: 13120 |
Dvorak, Martin, and Jasmin Blanchette. “Closure Properties of General Grammars - Formally Verified.” In 14th International Conference on Interactive Theorem Proving, Vol. 268. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. https://doi.org/10.4230/LIPIcs.ITP.2023.15.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2023 | Published | Conference Paper | IST-REx-ID: 13221 |
Boker, Udi, Thomas A Henzinger, Nicolas Adrien Mazzocchi, and Naci E Sarac. “Safety and Liveness of Quantitative Automata.” In 34th International Conference on Concurrency Theory, Vol. 279. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. https://doi.org/10.4230/LIPIcs.CONCUR.2023.17.
[Published Version]
View
| Files available
| DOI
| arXiv
2022 | Published | Conference Paper | IST-REx-ID: 11808 |
Hanauer, Kathrin, Monika Henzinger, and Christian Schulz. “Recent Advances in Fully Dynamic Graph Algorithms.” In 1st Symposium on Algorithmic Foundations of Dynamic Networks, Vol. 221. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. https://doi.org/10.4230/LIPIcs.SAND.2022.1.
[Published Version]
View
| DOI
| Download Published Version (ext.)
| arXiv
2022 | Published | Conference Paper | IST-REx-ID: 12182 |
Pacut, Maciej, Mahmoud Parham, Joel Rybicki, Stefan Schmid, Jukka Suomela, and Aleksandr Tereshchenko. “Brief Announcement: Temporal Locality in Online Algorithms.” In 36th International Symposium on Distributed Computing, Vol. 246. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. https://doi.org/10.4230/LIPIcs.DISC.2022.52.
[Published Version]
View
| Files available
| DOI