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.
65 Publications
2020 | Conference Paper | IST-REx-ID: 11816 | 
Henzinger MH, Shahbaz K, Paul R, Schulz C. 2020. Dynamic matching algorithms in practice. 8th Annual European Symposium on Algorithms. ESA: Annual European Symposium on Algorithms, LIPIcs, vol. 173, 58.
[Published Version]
View
| DOI
| Download Published Version (ext.)
| arXiv
2020 | Conference Paper | IST-REx-ID: 11824 |
Henzinger MH, Neumann S, Wiese A. 2020. Dynamic approximate maximum independent set of intervals, hypercubes and hyperrectangles. 36th International Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 164, 51.
[Published Version]
View
| DOI
| Download Published Version (ext.)
| arXiv
2020 | Conference Paper | IST-REx-ID: 11822 |
Hanauer K, Henzinger MH, Schulz C. 2020. Faster fully dynamic transitive closure in practice. 18th International Symposium on Experimental Algorithms. SEA: Symposium on Experimental Algorithms, LIPIcs, vol. 160, 14.
[Published Version]
View
| DOI
| Download Published Version (ext.)
| arXiv
2020 | Conference Paper | IST-REx-ID: 11825 |
Henzinger MH, Peng P. 2020. Constant-time dynamic (Δ+1)-coloring. 37th International Symposium on Theoretical Aspects of Computer Science. STACS: Symposium on Theoretical Aspects of Computer Science, LIPIcs, vol. 154, 53.
[Published Version]
View
| DOI
| Download Published Version (ext.)
| arXiv
2020 | Conference Paper | IST-REx-ID: 11819 |
Henzinger MH, Noe A, Schulz C, Strash D. 2020. Finding all global minimum cuts in practice. 28th Annual European Symposium on Algorithms. ESA: Annual European Symposium on Algorithms, LIPIcs, vol. 173, 59.
[Published Version]
View
| DOI
| Download Published Version (ext.)
| arXiv
2020 | Conference Paper | IST-REx-ID: 7348 |
Ferrere T, Henzinger TA, Kragl B. 2020. Monitoring event frequencies. 28th EACSL Annual Conference on Computer Science Logic. CSL: Computer Science Logic, LIPIcs, vol. 152, 20.
[Published Version]
View
| Files available
| DOI
| arXiv
2020 | Conference Paper | IST-REx-ID: 8725 |
Aksenov V, Alistarh D-A, Drozdova A, Mohtashami A. 2020. The splay-list: A distribution-adaptive concurrent skip-list. 34th International Symposium on Distributed Computing. DISC: Symposium on Distributed ComputingLIPIcs vol. 179, 3:1-3:18.
[Published Version]
View
| Files available
| DOI
| arXiv
2020 | Conference Paper | IST-REx-ID: 7952 |
Boissonnat J-D, Wintraecken M. 2020. The topological correctness of PL-approximations of isomanifolds. 36th International Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 164, 20:1-20:18.
[Published Version]
View
| Files available
| DOI
2019 | Conference Paper | IST-REx-ID: 11826 |
Ancona B, Henzinger MH, Roditty L, Williams VV, Wein N. 2019. Algorithms and hardness for diameter in dynamic graphs. 46th International Colloquium on Automata, Languages, and Programming. ICALP: International Colloquium on Automata, Languages, and Programming, LIPIcs, vol. 132, 13.
[Published Version]
View
| DOI
| Download Published Version (ext.)
| arXiv
2019 | Conference Paper | IST-REx-ID: 6528 |
Pietrzak KZ. 2019. Simple verifiable delay functions. 10th Innovations in Theoretical Computer Science Conference. ITCS 2019: Innovations in Theoretical Computer Science, LIPIcs, vol. 124, 60.
[Published Version]
View
| Files available
| DOI
| Download Published Version (ext.)
2019 | Conference Paper | IST-REx-ID: 6725 |
Kolmogorov V. 2019. Testing the complexity of a valued CSP language. 46th International Colloquium on Automata, Languages and Programming. ICALP 2019: International Colloquim on Automata, Languages and Programming, LIPIcs, vol. 132, 77:1-77:12.
[Published Version]
View
| Files available
| DOI
| arXiv
2019 | Conference Paper | IST-REx-ID: 7401 |
Fulek R, Kyncl J. 2019. Z_2-Genus of graphs and minimum rank of partial symmetric matrices. 35th International Symposium on Computational Geometry (SoCG 2019). SoCG: Symposium on Computational Geometry, LIPIcs, vol. 129, 39.
[Published Version]
View
| Files available
| DOI
| arXiv
2019 | Conference Paper | IST-REx-ID: 6556 |
Huszár K, Spreer J. 2019. 3-manifold triangulations with small treewidth. 35th International Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 129, 44:1-44:20.
[Published Version]
View
| Files available
| DOI
| arXiv
2019 | Conference Paper | IST-REx-ID: 6647 |
Fulek R, Gärtner B, Kupavskii A, Valtr P, Wagner U. 2019. The crossing Tverberg theorem. 35th International Symposium on Computational Geometry. SoCG 2019: Symposium on Computational Geometry, LIPIcs, vol. 129, 38:1-38:13.
[Published Version]
View
| Files available
| DOI
| arXiv
2018 | Conference Paper | IST-REx-ID: 11828 |
Goranci G, Henzinger MH, Peng P. 2018. Dynamic effective resistances and approximate schur complement on separable graphs. 26th Annual European Symposium on Algorithms. ESA: Annual European Symposium on Algorithms, LIPIcs, vol. 112, 40.
[Published Version]
View
| DOI
| Download Published Version (ext.)
| arXiv
2018 | Conference Paper | IST-REx-ID: 11827 |
Goranci G, Henzinger MH, Leniowski D. 2018. A tree structure for dynamic facility location. 26th Annual European Symposium on Algorithms. ESA: Annual European Symposium on Algorithms, LIPIcs, vol. 112, 39.
[Published Version]
View
| DOI
| Download Published Version (ext.)
| arXiv
2018 | Conference Paper | IST-REx-ID: 11911 |
Biedermann S, Henzinger MH, Schulz C, Schuster B. 2018. Memetic graph clustering. 17th International Symposium on Experimental Algorithms. SEA: Symposium on Experimental Algorithms, LIPIcs, vol. 103, 3.
[Published Version]
View
| DOI
| Download Published Version (ext.)
| arXiv
2018 | Conference Paper | IST-REx-ID: 7407 |
Pietrzak KZ. 2018. Proofs of catalytic space. 10th Innovations in Theoretical Computer Science Conference (ITCS 2019). ITCS: Innovations in theoretical Computer Science Conference, LIPIcs, vol. 124, 59:1-59:25.
[Published Version]
View
| Files available
| DOI
| Download Published Version (ext.)
2018 | Conference Paper | IST-REx-ID: 6005 |
Avni G, Guha S, Kupferman O. 2018. Timed network games with clocks. MFCS: Mathematical Foundations of Computer Science, LIPIcs, vol. 117, 23.
[Published Version]
View
| Files available
| DOI
2017 | Conference Paper | IST-REx-ID: 11829 |
Henzinger MH, Lincoln A, Neumann S, Vassilevska Williams V. 2017. Conditional hardness for sensitivity problems. 8th Innovations in Theoretical Computer Science Conference. ITCS: Innovations in Theoretical Computer Science Conference, LIPIcs, vol. 67, 26.
[Published Version]
View
| DOI
| Download Published Version (ext.)
| arXiv