Hirvonen, Juho, et al. “On the Convergence Time in Graphical Games: A Locality-Sensitive Approach.”10.4230/LIPIcs.OPODIS.2023.11__27th International Conference on Principles of Distributed Systems, vol. 286, 11, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, doi: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, Monika H., et al. “Faster Submodular Maximization for Several Classes of Matroids.”10.4230/LIPIcs.ICALP.2023.74__50th International Colloquium on Automata, Languages, and Programming, vol. 261, 74, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023, doi: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, Ezio, et al. “Hypernode Automata.”10.4230/LIPIcs.CONCUR.2023.21__34th International Conference on Concurrency Theory, vol. 279, 21, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023, doi: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, Ranita, et al. “Counting Cells of Order-k Voronoi Tessellations in d<sup>3</sup> with Morse Theory.”10.4230/LIPIcs.SoCG.2021.16__Leibniz International Proceedings in Informatics, vol. 189, 16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021, doi:10.4230/LIPIcs.SoCG.2021.16.
LibreCat: https://research-explorer.ista.ac.at/record/9604
DOI: 10.4230/LIPIcs.SoCG.2021.16

Corbet, René, et al. “Computing the Multicover Bifiltration.”10.4230/LIPIcs.SoCG.2021.27__Leibniz International Proceedings in Informatics, vol. 189, 27, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021, doi: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, Dan-Adrian, et al. “In Search of the Fastest Concurrent Union-Find Algorithm.”10.4230/LIPIcs.OPODIS.2019.15__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.
LibreCat: https://research-explorer.ista.ac.at/record/7605
DOI: 10.4230/LIPIcs.OPODIS.2019.15
arXiv: 1911.06347

Avvakumov, Sergey, and Gabriel Nivasch. “Homotopic Curve Shortening and the Affine Curve-Shortening Flow.”10.4230/LIPIcs.SoCG.2020.12__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.
LibreCat: https://research-explorer.ista.ac.at/record/7991
DOI: 10.4230/LIPIcs.SoCG.2020.12
arXiv: 1909.00263

Patakova, Zuzana. “Bounding Radon Number via Betti Numbers.”10.4230/LIPIcs.SoCG.2020.61__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.
LibreCat: https://research-explorer.ista.ac.at/record/7989
DOI: 10.4230/LIPIcs.SoCG.2020.61
arXiv: 1908.01677

Patakova, Zuzana, et al. “Barycentric Cuts through a Convex Body.”10.4230/LIPIcs.SoCG.2020.62__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.
LibreCat: https://research-explorer.ista.ac.at/record/7992
DOI: 10.4230/LIPIcs.SoCG.2020.62
arXiv: 2003.13536

Arroyo Guevara, Alan M., et al. “Extending Drawings of Graphs to Arrangements of Pseudolines.”10.4230/LIPIcs.SoCG.2020.9__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.
LibreCat: https://research-explorer.ista.ac.at/record/7994
DOI: 10.4230/LIPIcs.SoCG.2020.9
arXiv: 1804.09317

Chatterjee, Krishnendu, et al. “Multi-Dimensional Long-Run Average Problems for Vector Addition Systems with States.”10.4230/LIPIcs.CONCUR.2020.23__31st International Conference on Concurrency Theory, vol. 171, 23, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi: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, Guy, and Thomas A. Henzinger. “A Survey of Bidding Games on Graphs.”10.4230/LIPIcs.CONCUR.2020.2__31st International Conference on Concurrency Theory, vol. 171, 2, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.CONCUR.2020.2.
LibreCat: https://research-explorer.ista.ac.at/record/8599
DOI: 10.4230/LIPIcs.CONCUR.2020.2

Chatterjee, Krishnendu, et al. “Simplified Game of Life: Algorithms and Complexity.”10.4230/LIPIcs.MFCS.2020.22__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.
LibreCat: https://research-explorer.ista.ac.at/record/8533
DOI: 10.4230/LIPIcs.MFCS.2020.22
arXiv: 2007.02894

Jecker, Ismael R., et al. “Unary Prime Languages.”10.4230/LIPIcs.MFCS.2020.51__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.
LibreCat: https://research-explorer.ista.ac.at/record/8534
DOI: 10.4230/LIPIcs.MFCS.2020.51

Wagner, Uli, and Emo Welzl. “Connectivity of Triangulation Flip Graphs in the Plane (Part II: Bistellar Flips).”10.4230/LIPIcs.SoCG.2020.67__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.
LibreCat: https://research-explorer.ista.ac.at/record/7990
DOI: 10.4230/LIPIcs.SoCG.2020.67
arXiv: 2003.13557

Osang, Georg F., et al. “Generalizing CGAL Periodic Delaunay Triangulations.”10.4230/LIPIcs.ESA.2020.75__28th Annual European Symposium on Algorithms, vol. 173, 75, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.ESA.2020.75.
LibreCat: https://research-explorer.ista.ac.at/record/8703
DOI: 10.4230/LIPIcs.ESA.2020.75

Huszár, Kristóf, et al. On the Treewidth of Triangulated 3-Manifolds. Vol. 99, 46, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, doi: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, Bernhard, et al. Synchronizing the Asynchronous. Vol. 118, 21, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, doi:10.4230/LIPIcs.CONCUR.2018.21.
LibreCat: https://research-explorer.ista.ac.at/record/133
DOI: 10.4230/LIPIcs.CONCUR.2018.21

Alwen, Joel F., et al. Cumulative Space in Black-White Pebbling and Resolution. Edited by Christos Papadimitriou, vol. 67, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, p. 38:1-38-21, doi:10.4230/LIPIcs.ITCS.2017.38.
LibreCat: https://research-explorer.ista.ac.at/record/1175
DOI: 10.4230/LIPIcs.ITCS.2017.38

Edelsbrunner, Herbert, and Hubert Wagner. Topological Data Analysis with Bregman Divergences. Vol. 77, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, pp. 391–3916, doi:10.4230/LIPIcs.SoCG.2017.39.
LibreCat: https://research-explorer.ista.ac.at/record/688
DOI: 10.4230/LIPIcs.SoCG.2017.39

Pietrzak, Krzysztof Z., and Maciej Skórski. Non Uniform Attacks against Pseudoentropy. Vol. 80, 39, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:10.4230/LIPIcs.ICALP.2017.39.
LibreCat: https://research-explorer.ista.ac.at/record/697
DOI: 10.4230/LIPIcs.ICALP.2017.39

Obremski, Maciej, and Maciej Skórski. Renyi Entropy Estimation Revisited. Vol. 81, 20, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:10.4230/LIPIcs.APPROX-RANDOM.2017.20.
LibreCat: https://research-explorer.ista.ac.at/record/710
DOI: 10.4230/LIPIcs.APPROX-RANDOM.2017.20

Chatterjee, Krishnendu, et al. Bidirectional Nested Weighted Automata. Vol. 85, 5, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:10.4230/LIPIcs.CONCUR.2017.5.
LibreCat: https://research-explorer.ista.ac.at/record/711
DOI: 10.4230/LIPIcs.CONCUR.2017.5

Avni, Guy, et al. Timed Network Games with Clocks. Vol. 83, 37, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:10.4230/LIPIcs.MFCS.2017.37.
LibreCat: https://research-explorer.ista.ac.at/record/963
DOI: 10.4230/LIPIcs.MFCS.2017.37

Skórski, Maciej. Lower Bounds on Key Derivation for Square-Friendly Applications. Vol. 66, 57, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:10.4230/LIPIcs.STACS.2017.57.
LibreCat: https://research-explorer.ista.ac.at/record/1174
DOI: 10.4230/LIPIcs.STACS.2017.57
WoS: 000521077300057