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
R. Tinarrage, “Simplicial approximation to CW complexes with spherical Delaunay triangulations,” in 42nd International Symposium on Computational Geometry, New Brunswick, NJ, United States, 2026, vol. 367.
[Published Version] View | Files available | DOI | arXiv
 

2026 | Published | Conference Paper | IST-REx-ID: 22002 | OA
J. Leśkiewicz, B. Furmanek, M. Lipiński, and D. Morozov, “Topological simplification guided by forbidden regions,” in 42nd International Symposium on Computational Geometry, New Brunswick, NJ, United States, 2026, vol. 367.
[Published Version] View | Files available | DOI | arXiv
 

2026 | Published | Conference Paper | IST-REx-ID: 22003 | OA
H. Adams, S. Majhi, F. Manin, Z. Virk, and N. Zava, “Lower bounding the Gromov–Hausdorff distance in metric graphs,” in 42nd International Symposium on Computational Geometry, New Brunswick, NJ, United States, 2026, vol. 367.
[Published Version] View | Files available | DOI | arXiv
 

2026 | Published | Conference Paper | IST-REx-ID: 22004 | OA
T. M. Chan, H. C. Chang, J. Gao, S. Kisfaludi-Bak, H. Le, and D. W. Zheng, “Charting the diameter computation landscape of intersection graphs in 3D and above,” in 42nd International Symposium on Computational Geometry, New Brunswick, NJ, United States, 2026, vol. 367.
[Published Version] View | Files available | DOI | arXiv
 

2026 | Published | Conference Paper | IST-REx-ID: 21411 | OA
M. Bentert, E. Ceylan, V. Hübner, S. Schmid, and J. Srba, “Fast re-routing in networks: On the complexity of perfect resilience,” in 29th International Conference on Principles of Distributed Systems, Iaşi, Romania, 2026, vol. 361.
[Published Version] View | Files available | DOI
 

2026 | Published | Conference Paper | IST-REx-ID: 22146 | OA
N. Kalinin and J. D. Andersson, “Learning rate scheduling with matrix factorization for private training,” in 7th Symposium on Foundations of Responsible Computing, Cambridge, MA; United States, 2026, vol. 368.
[Published Version] View | Files available | DOI | arXiv
 

2026 | Published | Conference Paper | IST-REx-ID: 22299 | OA
H. Edelsbrunner, M. Lipiński, M. Mrozek, M. Soriano Trigueros, and F. Zimin, “The depth poset under transpositions in the filter,” in 42nd International Symposium on Computational Geometry, New Brunswick, NJ, United States, 2026, vol. 367.
[Published Version] View | Files available | DOI | arXiv
 

2026 | Published | Conference Paper | IST-REx-ID: 22405 | OA
T. M. Chan, H.-C. Chang, J. Gao, S. Kisfaludi-Bak, H. Le, and D. W. Zheng, “Charting the landscape of diameter computation on geometric intersection graphs in the plane,” in 53rd International Colloquium on Automata, Languages, and Programming, Egham, United Kingdom, 2026, vol. 374.
[Published Version] View | Files available | DOI | arXiv
 

2025 | Published | Conference Paper | IST-REx-ID: 22007 | OA
K. Z. Pietrzak and P. Wang, “Time-space tradeoffs of truncation with preprocessing,” in 6th Conference on Information-Theoretic Cryptography, Santa Barbara, CA, United States, 2025, vol. 343.
[Published Version] View | Files available | DOI | Cryptology ePrint
 

2025 | Published | Conference Paper | IST-REx-ID: 20005 | OA
H. Edelsbrunner, A. Garber, and M. Saghafian, “On spheres with k points inside,” in 41st International Symposium on Computational Geometry, Kanazawa, Japan, 2025, vol. 332.
[Published Version] View | Files available | DOI | arXiv
 

2025 | Published | Conference Paper | IST-REx-ID: 20006 | OA
L. Ost, S. Cultrera di Montesano, and H. Edelsbrunner, “Banana trees for the persistence in time series experimentally,” in 41st International Symposium on Computational Geometry, Kanazawa, Japan, 2025, vol. 332.
[Published Version] View | Files available | DOI | arXiv
 

2025 | Published | Conference Paper | IST-REx-ID: 20004 | OA
E. Streltsova and U. Wagner, “Levels in arrangements: Linear relations, the g-matrix, and applications to crossing numbers,” in 41st International Symposium on Computational Geometry, Kanazawa, Japan, 2025, vol. 332.
[Published Version] View | Files available | DOI | arXiv
 

2024 | Published | Conference Paper | IST-REx-ID: 17170 | OA
D. Attali 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, Athens, Greece, 2024, vol. 293, p. 11:1-11:19.
[Published Version] View | Files available | DOI | arXiv
 

2024 | Published | Conference Paper | IST-REx-ID: 18928 | OA
M. Henzinger, B. Saha, M. P. Seybold, and C. Ye, “On the complexity of algorithms with predictions for dynamic graph problems,” in 15th Innovations in Theoretical Computer Science Conference, Berkeley, CA, United States, 2024, vol. 287, p. 62:1-62:25.
[Published Version] View | Files available | DOI | WoS | arXiv
 

earlier version | 2024 | Published | Conference Paper | IST-REx-ID: 15168 | OA
M. Filakovský, T. V. Nakajima, J. Opršal, G. Tasinato, and U. Wagner, “Hardness of linearly ordered 4-colouring of 3-colourable 3-uniform hypergraphs,” in 41st International Symposium on Theoretical Aspects of Computer Science, Clermont-Ferrand, France, 2024, vol. 289.
[Published Version] View | Files available | DOI | WoS | arXiv
 

2023 | Published | Conference Paper | IST-REx-ID: 13292 | OA
T. A. Henzinger, P. Kebis, N. A. Mazzocchi, and N. E. Sarac, “Regular methods for operator precedence languages,” in 50th International Colloquium on Automata, Languages, and Programming, Paderborn, Germany, 2023, vol. 261, p. 129:1--129:20.
[Published Version] View | Files available | DOI | arXiv
 

earlier version | 2023 | Published | Conference Paper | IST-REx-ID: 14417 | OA
C. Baier, K. Chatterjee, T. Meggendorfer, and J. Piribauer, “Entropic risk for turn-based stochastic games,” in 48th International Symposium on Mathematical Foundations of Computer Science, Bordeaux, France, 2023, vol. 272.
[Published Version] View | Files available | DOI | arXiv
 

earlier version | 2023 | Published | Conference Paper | IST-REx-ID: 13221 | OA
U. Boker, T. A. Henzinger, N. A. Mazzocchi, and N. E. Sarac, “Safety and liveness of quantitative automata,” in 34th International Conference on Concurrency Theory, Antwerp, Belgium, 2023, vol. 279.
[Published Version] View | Files available | DOI | WoS | arXiv
 

2023 | Published | Conference Paper | IST-REx-ID: 13120 | OA
M. Dvorak and J. Blanchette, “Closure properties of general grammars - formally verified,” in 14th International Conference on Interactive Theorem Proving, Bialystok, Poland, 2023, vol. 268.
[Published Version] View | Files available | DOI | WoS | arXiv
 

2022 | Published | Conference Paper | IST-REx-ID: 11808 | OA
K. Hanauer, M. Henzinger, and C. Schulz, “Recent advances in fully dynamic graph algorithms,” in 1st Symposium on Algorithmic Foundations of Dynamic Networks, Virtual, 2022, vol. 221.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 

Filters and Search Terms

eissn=1868-8969

Search

Filter Publications

Display / Sort

Citation Style: IEEE

Export / Embed