Hirvonen, J., Schmid, L., Chatterjee, K., &; Schmid, S. (2024). On the convergence time in graphical games: A locality-sensitive approach. In 27th International Conference on Principles of Distributed Systems (Vol. 286). Tokyo, Japan: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.OPODIS.2023.11 
LibreCat: https://research-explorer.ista.ac.at/record/15006
DOI: 10.4230/LIPIcs.OPODIS.2023.11
arXiv: 2102.13457

Henzinger, M. H., Liu, P., Vondrák, J., &; Zheng, D. W. (2023). Faster submodular maximization for several classes of matroids. In 50th International Colloquium on Automata, Languages, and Programming (Vol. 261). Paderborn, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.ICALP.2023.74 
LibreCat: https://research-explorer.ista.ac.at/record/14086
DOI: 10.4230/LIPIcs.ICALP.2023.74
arXiv: 2305.00122

Bartocci, E., Henzinger, T. A., Nickovic, D., &; Oliveira da Costa, A. (2023). Hypernode automata. In 34th International Conference on Concurrency Theory (Vol. 279). Antwerp, Belgium: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.CONCUR.2023.21 
LibreCat: https://research-explorer.ista.ac.at/record/14405
DOI: 10.4230/LIPIcs.CONCUR.2023.21
arXiv: 2305.02836

Biswas, R., Cultrera di Montesano, S., Edelsbrunner, H., &; Saghafian, M. (2021). Counting cells of order-k voronoi tessellations in d<sup>3</sup> with morse theory. In Leibniz International Proceedings in Informatics (Vol. 189). Online: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.SoCG.2021.16 
LibreCat: https://research-explorer.ista.ac.at/record/9604
DOI: 10.4230/LIPIcs.SoCG.2021.16

Corbet, R., Kerber, M., Lesnick, M., &; Osang, G. F. (2021). Computing the multicover bifiltration. In Leibniz International Proceedings in Informatics (Vol. 189). Online: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.SoCG.2021.27 
LibreCat: https://research-explorer.ista.ac.at/record/9605
DOI: 10.4230/LIPIcs.SoCG.2021.27
arXiv: 2103.07823

Alistarh, D.-A., Fedorov, A., &; Koval, N. (2020). In search of the fastest concurrent union-find algorithm. In 23rd International Conference on Principles of Distributed Systems (Vol. 153, p. 15:1-15:16). Neuchatal, Switzerland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.OPODIS.2019.15 
LibreCat: https://research-explorer.ista.ac.at/record/7605
DOI: 10.4230/LIPIcs.OPODIS.2019.15
arXiv: 1911.06347

Avvakumov, S., &; Nivasch, G. (2020). Homotopic curve shortening and the affine curve-shortening flow. In 36th International Symposium on Computational Geometry (Vol. 164). Zürich, Switzerland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.SoCG.2020.12 
LibreCat: https://research-explorer.ista.ac.at/record/7991
DOI: 10.4230/LIPIcs.SoCG.2020.12
arXiv: 1909.00263

Patakova, Z. (2020). Bounding radon number via Betti numbers. In 36th International Symposium on Computational Geometry (Vol. 164). Zürich, Switzerland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.SoCG.2020.61 
LibreCat: https://research-explorer.ista.ac.at/record/7989
DOI: 10.4230/LIPIcs.SoCG.2020.61
arXiv: 1908.01677

Patakova, Z., Tancer, M., &; Wagner, U. (2020). Barycentric cuts through a convex body. In 36th International Symposium on Computational Geometry (Vol. 164). Zürich, Switzerland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.SoCG.2020.62 
LibreCat: https://research-explorer.ista.ac.at/record/7992
DOI: 10.4230/LIPIcs.SoCG.2020.62
arXiv: 2003.13536

Arroyo Guevara, A. M., Bensmail, J., &; Bruce Richter, R. (2020). Extending drawings of graphs to arrangements of pseudolines. In 36th International Symposium on Computational Geometry (Vol. 164). Zürich, Switzerland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.SoCG.2020.9 
LibreCat: https://research-explorer.ista.ac.at/record/7994
DOI: 10.4230/LIPIcs.SoCG.2020.9
arXiv: 1804.09317

Chatterjee, K., Henzinger, T. A., &; Otop, J. (2020). Multi-dimensional long-run average problems for vector addition systems with states. In 31st International Conference on Concurrency Theory (Vol. 171). Virtual: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.CONCUR.2020.23 
LibreCat: https://research-explorer.ista.ac.at/record/8600
DOI: 10.4230/LIPIcs.CONCUR.2020.23
arXiv: 2007.08917

Avni, G., &; Henzinger, T. A. (2020). A survey of bidding games on graphs. In 31st International Conference on Concurrency Theory (Vol. 171). Virtual: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.CONCUR.2020.2 
LibreCat: https://research-explorer.ista.ac.at/record/8599
DOI: 10.4230/LIPIcs.CONCUR.2020.2

Chatterjee, K., Ibsen-Jensen, R., Jecker, I. R., &; Svoboda, J. (2020). Simplified game of life: Algorithms and complexity. In 45th International Symposium on Mathematical Foundations of Computer Science (Vol. 170). Prague, Czech Republic: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.MFCS.2020.22 
LibreCat: https://research-explorer.ista.ac.at/record/8533
DOI: 10.4230/LIPIcs.MFCS.2020.22
arXiv: 2007.02894

Jecker, I. R., Kupferman, O., &; Mazzocchi, N. (2020). Unary prime languages. In 45th International Symposium on Mathematical Foundations of Computer Science (Vol. 170). Prague, Czech Republic: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.MFCS.2020.51 
LibreCat: https://research-explorer.ista.ac.at/record/8534
DOI: 10.4230/LIPIcs.MFCS.2020.51

Wagner, U., &; Welzl, E. (2020). Connectivity of triangulation flip graphs in the plane (Part II: Bistellar flips). In 36th International Symposium on Computational Geometry (Vol. 164). Zürich, Switzerland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.SoCG.2020.67 
LibreCat: https://research-explorer.ista.ac.at/record/7990
DOI: 10.4230/LIPIcs.SoCG.2020.67
arXiv: 2003.13557

Osang, G. F., Rouxel-Labbé, M., &; Teillaud, M. (2020). Generalizing CGAL periodic Delaunay triangulations. In 28th Annual European Symposium on Algorithms (Vol. 173). Virtual, Online; Pisa, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.ESA.2020.75 
LibreCat: https://research-explorer.ista.ac.at/record/8703
DOI: 10.4230/LIPIcs.ESA.2020.75

Huszár, K., Spreer, J., &; Wagner, U. (2018). On the treewidth of triangulated 3-manifolds (Vol. 99). Presented at the SoCG: Symposium on Computational Geometry, Budapest, Hungary: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.SoCG.2018.46 
LibreCat: https://research-explorer.ista.ac.at/record/285
DOI: 10.4230/LIPIcs.SoCG.2018.46
arXiv: 1712.00434

Kragl, B., Qadeer, S., &; Henzinger, T. A. (2018). Synchronizing the asynchronous (Vol. 118). Presented at the CONCUR: International Conference on Concurrency Theory, Beijing, China: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.CONCUR.2018.21 
LibreCat: https://research-explorer.ista.ac.at/record/133
DOI: 10.4230/LIPIcs.CONCUR.2018.21

Alwen, J. F., De Rezende, S., Nordstrom, J., &; Vinyals, M. (2017). Cumulative space in black-white pebbling and resolution. In C. Papadimitriou (Ed.) (Vol. 67, p. 38:1-38-21). Presented at the ITCS: Innovations in Theoretical Computer Science, Berkeley, CA, United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.ITCS.2017.38 
LibreCat: https://research-explorer.ista.ac.at/record/1175
DOI: 10.4230/LIPIcs.ITCS.2017.38

Edelsbrunner, H., &; Wagner, H. (2017). Topological data analysis with Bregman divergences (Vol. 77, pp. 391–3916). Presented at the Symposium on Computational Geometry, SoCG, Brisbane, Australia: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.SoCG.2017.39 
LibreCat: https://research-explorer.ista.ac.at/record/688
DOI: 10.4230/LIPIcs.SoCG.2017.39