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.
112 Publications
2021 | Published | Conference Paper | IST-REx-ID: 9605 | 
Corbet, René, et al. “Computing the Multicover Bifiltration.” Leibniz International Proceedings in Informatics, vol. 189, 27, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021, doi:10.4230/LIPIcs.SoCG.2021.27.
[Published Version]
View
| Files available
| DOI
| arXiv
2020 | Published | Conference Paper | IST-REx-ID: 11816 |
Henzinger, Monika, et al. “Dynamic Matching Algorithms in Practice.” 8th Annual European Symposium on Algorithms, vol. 173, 58, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.ESA.2020.58.
[Published Version]
View
| DOI
| Download Published Version (ext.)
| arXiv
2020 | Published | Conference Paper | IST-REx-ID: 11818 |
Henzinger, Monika, and Sagar Kale. “Fully-Dynamic Coresets.” 28th Annual European Symposium on Algorithms, vol. 173, 57, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.ESA.2020.57.
[Published Version]
View
| DOI
| Download Published Version (ext.)
| arXiv
2020 | Published | Conference Paper | IST-REx-ID: 11819 |
Henzinger, Monika, et al. “Finding All Global Minimum Cuts in Practice.” 28th Annual European Symposium on Algorithms, vol. 173, 59, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.ESA.2020.59.
[Published Version]
View
| DOI
| Download Published Version (ext.)
| arXiv
2020 | Published | Conference Paper | IST-REx-ID: 11822 |
Hanauer, Kathrin, et al. “Faster Fully Dynamic Transitive Closure in Practice.” 18th International Symposium on Experimental Algorithms, vol. 160, 14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.SEA.2020.14.
[Published Version]
View
| DOI
| Download Published Version (ext.)
| arXiv
2020 | Published | Conference Paper | IST-REx-ID: 11824 |
Henzinger, Monika, et al. “Dynamic Approximate Maximum Independent Set of Intervals, Hypercubes and Hyperrectangles.” 36th International Symposium on Computational Geometry, vol. 164, 51, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.SoCG.2020.51.
[Published Version]
View
| DOI
| Download Published Version (ext.)
| arXiv
2020 | Published | Conference Paper | IST-REx-ID: 11825 |
Henzinger, Monika, and Pan Peng. “Constant-Time Dynamic (Δ+1)-Coloring.” 37th International Symposium on Theoretical Aspects of Computer Science, vol. 154, 53, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.STACS.2020.53.
[Published Version]
View
| DOI
| Download Published Version (ext.)
| arXiv
2020 | Published | Conference Paper | IST-REx-ID: 8725 |
Aksenov, Vitaly, et al. “The Splay-List: A Distribution-Adaptive Concurrent Skip-List.” 34th International Symposium on Distributed Computing, vol. 179, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, p. 3:1-3:18, doi:10.4230/LIPIcs.DISC.2020.3.
[Published Version]
View
| Files available
| DOI
| arXiv
2020 | Published | Conference Paper | IST-REx-ID: 7348 |
Ferrere, Thomas, et al. “Monitoring Event Frequencies.” 28th EACSL Annual Conference on Computer Science Logic, vol. 152, 20, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.CSL.2020.20.
[Published Version]
View
| Files available
| DOI
| arXiv
2020 | Published | Conference Paper | IST-REx-ID: 7952 |
Boissonnat, Jean-Daniel, and Mathijs Wintraecken. “The Topological Correctness of PL-Approximations of Isomanifolds.” 36th International Symposium on Computational Geometry, vol. 164, 20:1-20:18, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.SoCG.2020.20.
[Published Version]
View
| Files available
| DOI
2020 | Published | Conference Paper | IST-REx-ID: 7605 |
Alistarh, Dan-Adrian, et al. “In Search of the Fastest Concurrent Union-Find Algorithm.” 23rd International Conference on Principles of Distributed Systems, vol. 153, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, p. 15:1-15:16, doi:10.4230/LIPIcs.OPODIS.2019.15.
[Published Version]
View
| Files available
| DOI
| arXiv
2020 | Published | Conference Paper | IST-REx-ID: 7990 |
Wagner, Uli, and Emo Welzl. “Connectivity of Triangulation Flip Graphs in the Plane (Part II: Bistellar Flips).” 36th International Symposium on Computational Geometry, vol. 164, 67:1-67:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.SoCG.2020.67.
[Published Version]
View
| Files available
| DOI
| arXiv
2020 | Published | Conference Paper | IST-REx-ID: 7991 |
Avvakumov, Sergey, and Gabriel Nivasch. “Homotopic Curve Shortening and the Affine Curve-Shortening Flow.” 36th International Symposium on Computational Geometry, vol. 164, 12:1-12:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.SoCG.2020.12.
[Published Version]
View
| Files available
| DOI
| arXiv
2020 | Published | Conference Paper | IST-REx-ID: 7989 |
Patakova, Zuzana. “Bounding Radon Number via Betti Numbers.” 36th International Symposium on Computational Geometry, vol. 164, 61:1-61:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.SoCG.2020.61.
[Published Version]
View
| Files available
| DOI
| arXiv
2020 | Published | Conference Paper | IST-REx-ID: 7992 |
Patakova, Zuzana, et al. “Barycentric Cuts through a Convex Body.” 36th International Symposium on Computational Geometry, vol. 164, 62:1-62:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.SoCG.2020.62.
[Published Version]
View
| Files available
| DOI
| arXiv
2020 | Published | Conference Paper | IST-REx-ID: 7994 |
Arroyo Guevara, Alan M., et al. “Extending Drawings of Graphs to Arrangements of Pseudolines.” 36th International Symposium on Computational Geometry, vol. 164, 9:1-9:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.SoCG.2020.9.
[Published Version]
View
| Files available
| DOI
| arXiv
2020 | Published | Conference Paper | IST-REx-ID: 8600 |
Chatterjee, Krishnendu, et al. “Multi-Dimensional Long-Run Average Problems for Vector Addition Systems with States.” 31st International Conference on Concurrency Theory, vol. 171, 23, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.CONCUR.2020.23.
[Published Version]
View
| Files available
| DOI
| arXiv
2020 | Published | Conference Paper | IST-REx-ID: 8533 |
Chatterjee, Krishnendu, et al. “Simplified Game of Life: Algorithms and Complexity.” 45th International Symposium on Mathematical Foundations of Computer Science, vol. 170, 22:1-22:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.MFCS.2020.22.
[Published Version]
View
| Files available
| DOI
| arXiv
2020 | Published | Conference Paper | IST-REx-ID: 8534 |
Jecker, Ismael R., et al. “Unary Prime Languages.” 45th International Symposium on Mathematical Foundations of Computer Science, vol. 170, 51:1-51:12, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.MFCS.2020.51.
[Published Version]
View
| Files available
| DOI
2020 | Published | Conference Paper | IST-REx-ID: 8599 |
Avni, Guy, and Thomas A. Henzinger. “A Survey of Bidding Games on Graphs.” 31st International Conference on Concurrency Theory, vol. 171, 2, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.CONCUR.2020.2.
[Published Version]
View
| Files available
| DOI