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.

21 Publications


2026 | Published | Conference Paper | IST-REx-ID: 22000 | OA
Tinarrage, Raphaël. “Simplicial Approximation to CW Complexes with Spherical Delaunay Triangulations.” In 42nd International Symposium on Computational Geometry, Vol. 367. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026. https://doi.org/10.4230/LIPIcs.SoCG.2026.93.
[Published Version] View | Files available | DOI | arXiv
 

2026 | Published | Conference Paper | IST-REx-ID: 22002 | OA
Leśkiewicz, Jakub, Bartosz Furmanek, Michał Lipiński, and Dmitriy Morozov. “Topological Simplification Guided by Forbidden Regions.” In 42nd International Symposium on Computational Geometry, Vol. 367. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026. https://doi.org/10.4230/LIPIcs.SoCG.2026.72.
[Published Version] View | Files available | DOI | arXiv
 

2026 | Published | Conference Paper | IST-REx-ID: 22003 | OA
Adams, Henry, Sushovan Majhi, Fedor Manin, Ziga Virk, and Nicolò Zava. “Lower Bounding the Gromov–Hausdorff Distance in Metric Graphs.” In 42nd International Symposium on Computational Geometry, Vol. 367. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026. https://doi.org/10.4230/LIPIcs.SoCG.2026.3.
[Published Version] View | Files available | DOI | arXiv
 

2026 | Published | Conference Paper | IST-REx-ID: 22004 | OA
Chan, Timothy M., Hsien Chih Chang, Jie Gao, Sándor Kisfaludi-Bak, Hung Le, and Da Wei Zheng. “Charting the Diameter Computation Landscape of Intersection Graphs in 3D and Above.” In 42nd International Symposium on Computational Geometry, Vol. 367. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026. https://doi.org/10.4230/LIPIcs.SoCG.2026.29.
[Published Version] View | Files available | DOI | arXiv
 

2026 | Published | Conference Paper | IST-REx-ID: 21411 | OA
Bentert, Matthias, Esra Ceylan, Valentin Hübner, Stefan Schmid, and Jiří Srba. “Fast Re-Routing in Networks: On the Complexity of Perfect Resilience.” In 29th International Conference on Principles of Distributed Systems, Vol. 361. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026. https://doi.org/10.4230/LIPIcs.OPODIS.2025.31.
[Published Version] View | Files available | DOI
 

2026 | Published | Conference Paper | IST-REx-ID: 22146 | OA
Kalinin, Nikita, and Joel D Andersson. “Learning Rate Scheduling with Matrix Factorization for Private Training.” In 7th Symposium on Foundations of Responsible Computing, Vol. 368. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026. https://doi.org/10.4230/LIPIcs.FORC.2026.2.
[Published Version] View | Files available | DOI | arXiv
 

2026 | Published | Conference Paper | IST-REx-ID: 22299 | OA
Edelsbrunner, Herbert, Michał Lipiński, Marian Mrozek, Manuel Soriano Trigueros, and Fedor Zimin. “The Depth Poset under Transpositions in the Filter.” In 42nd International Symposium on Computational Geometry, Vol. 367. Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2026. https://doi.org/10.4230/LIPICS.SOCG.2026.41.
[Published Version] View | Files available | DOI | arXiv
 

2026 | Published | Conference Paper | IST-REx-ID: 22405 | OA
Chan, Timothy M., Hsien-Chih Chang, Jie Gao, Sándor Kisfaludi-Bak, Hung Le, and Da Wei Zheng. “Charting the Landscape of Diameter Computation on Geometric Intersection Graphs in the Plane.” In 53rd International Colloquium on Automata, Languages, and Programming, Vol. 374. Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2026. https://doi.org/10.4230/LIPICS.ICALP.2026.54.
[Published Version] View | Files available | DOI | arXiv
 

2025 | Published | Conference Paper | IST-REx-ID: 22007 | OA
Pietrzak, Krzysztof Z, and Pengxiang Wang. “Time-Space Tradeoffs of Truncation with Preprocessing.” In 6th Conference on Information-Theoretic Cryptography, Vol. 343. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025. https://doi.org/10.4230/LIPIcs.ITC.2025.4.
[Published Version] View | Files available | DOI | Cryptology ePrint
 

2025 | Published | Conference Paper | IST-REx-ID: 20005 | OA
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
 

2025 | Published | Conference Paper | IST-REx-ID: 20006 | OA
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 | OA
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
 

2024 | Published | Conference Paper | IST-REx-ID: 17170 | OA
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 | OA
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
 

earlier version | 2024 | Published | Conference Paper | IST-REx-ID: 15168 | OA
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 | OA
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
 

earlier version | 2023 | Published | Conference Paper | IST-REx-ID: 14417 | OA
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
 

earlier version | 2023 | Published | Conference Paper | IST-REx-ID: 13221 | OA
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 | WoS | arXiv
 

2023 | Published | Conference Paper | IST-REx-ID: 13120 | OA
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
 

2022 | Published | Conference Paper | IST-REx-ID: 11808 | OA
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
 

Filters and Search Terms

eissn=1868-8969

Search

Filter Publications

Display / Sort

Citation Style: Chicago

Export / Embed