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 R. 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. doi:10.4230/LIPIcs.SoCG.2026.93
[Published Version] View | Files available | DOI | arXiv
 

2026 | Published | Conference Paper | IST-REx-ID: 22002 | OA
Leśkiewicz J, Furmanek B, Lipiński M, Morozov D. Topological simplification guided by forbidden regions. In: 42nd International Symposium on Computational Geometry. Vol 367. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2026. doi:10.4230/LIPIcs.SoCG.2026.72
[Published Version] View | Files available | DOI | arXiv
 

2026 | Published | Conference Paper | IST-REx-ID: 22003 | OA
Adams H, Majhi S, Manin F, Virk Z, Zava N. 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. doi:10.4230/LIPIcs.SoCG.2026.3
[Published Version] View | Files available | DOI | arXiv
 

2026 | Published | Conference Paper | IST-REx-ID: 22004 | OA
Chan TM, Chang HC, Gao J, Kisfaludi-Bak S, Le H, Zheng DW. 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. doi:10.4230/LIPIcs.SoCG.2026.29
[Published Version] View | Files available | DOI | arXiv
 

2026 | Published | Conference Paper | IST-REx-ID: 21411 | OA
Bentert M, Ceylan E, Hübner V, Schmid S, Srba J. 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. doi:10.4230/LIPIcs.OPODIS.2025.31
[Published Version] View | Files available | DOI
 

2026 | Published | Conference Paper | IST-REx-ID: 22146 | OA
Kalinin N, Andersson JD. 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. doi:10.4230/LIPIcs.FORC.2026.2
[Published Version] View | Files available | DOI | arXiv
 

2026 | Published | Conference Paper | IST-REx-ID: 22299 | OA
Edelsbrunner H, Lipiński M, Mrozek M, Soriano Trigueros M, Zimin F. 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. doi:10.4230/LIPICS.SOCG.2026.41
[Published Version] View | Files available | DOI | arXiv
 

2026 | Published | Conference Paper | IST-REx-ID: 22405 | OA
Chan TM, Chang H-C, Gao J, Kisfaludi-Bak S, Le H, Zheng DW. 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. doi:10.4230/LIPICS.ICALP.2026.54
[Published Version] View | Files available | DOI | arXiv
 

2025 | Published | Conference Paper | IST-REx-ID: 22007 | OA
Pietrzak KZ, Wang P. Time-space tradeoffs of truncation with preprocessing. In: 6th Conference on Information-Theoretic Cryptography. Vol 343. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2025. doi:10.4230/LIPIcs.ITC.2025.4
[Published Version] View | Files available | DOI | Cryptology ePrint
 

2025 | Published | Conference Paper | IST-REx-ID: 20005 | OA
Edelsbrunner H, Garber A, Saghafian M. On spheres with k points inside. In: 41st International Symposium on Computational Geometry. Vol 332. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2025. doi:10.4230/LIPIcs.SoCG.2025.43
[Published Version] View | Files available | DOI | arXiv
 

2025 | Published | Conference Paper | IST-REx-ID: 20006 | OA
Ost L, Cultrera di Montesano S, Edelsbrunner H. 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. doi:10.4230/LIPIcs.SoCG.2025.71
[Published Version] View | Files available | DOI | arXiv
 

2025 | Published | Conference Paper | IST-REx-ID: 20004 | OA
Streltsova E, Wagner U. 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. doi:10.4230/LIPIcs.SoCG.2025.75
[Published Version] View | Files available | DOI | arXiv
 

2024 | Published | Conference Paper | IST-REx-ID: 17170 | OA
Attali D, Kourimska H, Fillmore CD, et al. 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. Vol 293. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2024:11:1-11:19. doi:10.4230/LIPIcs.SoCG.2024.11
[Published Version] View | Files available | DOI | arXiv
 

2024 | Published | Conference Paper | IST-REx-ID: 18928 | OA
Henzinger M, Saha B, Seybold MP, Ye C. On the complexity of algorithms with predictions for dynamic graph problems. In: 15th Innovations in Theoretical Computer Science Conference. Vol 287. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2024:62:1-62:25. doi: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ý M, Nakajima TV, Opršal J, Tasinato G, Wagner U. 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. doi:10.4230/LIPIcs.STACS.2024.34
[Published Version] View | Files available | DOI | WoS | arXiv
 

2023 | Published | Conference Paper | IST-REx-ID: 13292 | OA
Henzinger TA, Kebis P, Mazzocchi NA, Sarac NE. Regular methods for operator precedence languages. In: 50th International Colloquium on Automata, Languages, and Programming. Vol 261. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2023:129:1--129:20. doi: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 C, Chatterjee K, Meggendorfer T, Piribauer J. 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. doi: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 U, Henzinger TA, Mazzocchi NA, Sarac NE. Safety and liveness of quantitative automata. In: 34th International Conference on Concurrency Theory. Vol 279. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2023. doi:10.4230/LIPIcs.CONCUR.2023.17
[Published Version] View | Files available | DOI | WoS | arXiv
 

2023 | Published | Conference Paper | IST-REx-ID: 13120 | OA
Dvorak M, Blanchette J. 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. doi:10.4230/LIPIcs.ITP.2023.15
[Published Version] View | Files available | DOI | WoS | arXiv
 

2022 | Published | Conference Paper | IST-REx-ID: 11808 | OA
Hanauer K, Henzinger M, Schulz C. 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. doi: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: AMA

Export / Embed