Boissonnat, Jean-Daniel, et al. “Tracing Isomanifolds in Rd in Time Polynomial in d Using Coxeter-Freudenthal-Kuhn Triangulations.”10.4230/LIPIcs.SoCG.2021.17__37th International Symposium on Computational Geometry (SoCG 2021), vol. 189, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021, p. 17:1-17:16, doi:10.4230/LIPIcs.SoCG.2021.17.

Henzinger, Monika H., and Sagar Kale. “Fully-Dynamic Coresets.”10.4230/LIPIcs.ESA.2020.57__28th Annual European Symposium on Algorithms, vol. 173, 57, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.ESA.2020.57.

Henzinger, Monika H., et al. “Dynamic Matching Algorithms in Practice.”10.4230/LIPIcs.ESA.2020.58__8th Annual European Symposium on Algorithms, vol. 173, 58, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.ESA.2020.58.

Henzinger, Monika H., et al. “Dynamic Approximate Maximum Independent Set of Intervals, Hypercubes and Hyperrectangles.”10.4230/LIPIcs.SoCG.2020.51__36th International Symposium on Computational Geometry, vol. 164, 51, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.SoCG.2020.51.

Hanauer, Kathrin, et al. “Faster Fully Dynamic Transitive Closure in Practice.”10.4230/LIPIcs.SEA.2020.14__18th International Symposium on Experimental Algorithms, vol. 160, 14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.SEA.2020.14.

Henzinger, Monika H., and Pan Peng. “Constant-Time Dynamic (+1)-Coloring.”10.4230/LIPIcs.STACS.2020.53__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.

Henzinger, Monika H., et al. “Finding All Global Minimum Cuts in Practice.”10.4230/LIPIcs.ESA.2020.59__28th Annual European Symposium on Algorithms, vol. 173, 59, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.ESA.2020.59.

Ferrere, Thomas, et al. “Monitoring Event Frequencies.”10.4230/LIPIcs.CSL.2020.20__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.

Aksenov, Vitaly, et al. “The Splay-List: A Distribution-Adaptive Concurrent Skip-List.”10.4230/LIPIcs.DISC.2020.3__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.

Boissonnat, Jean-Daniel, and Mathijs Wintraecken. “The Topological Correctness of PL-Approximations of Isomanifolds.”10.4230/LIPIcs.SoCG.2020.20__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.

Ancona, Bertie, et al. “Algorithms and Hardness for Diameter in Dynamic Graphs.”10.4230/LIPICS.ICALP.2019.13__46th International Colloquium on Automata, Languages, and Programming, vol. 132, 13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, doi:10.4230/LIPICS.ICALP.2019.13.

Pietrzak, Krzysztof Z. “Simple Verifiable Delay Functions.”10.4230/LIPICS.ITCS.2019.60__10th Innovations in Theoretical Computer Science Conference, vol. 124, 60, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, doi:10.4230/LIPICS.ITCS.2019.60.

Kolmogorov, Vladimir. “Testing the Complexity of a Valued CSP Language.”10.4230/LIPICS.ICALP.2019.77__46th International Colloquium on Automata, Languages and Programming, vol. 132, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, p. 77:1-77:12, doi:10.4230/LIPICS.ICALP.2019.77.

Fulek, Radoslav, and Jan Kyncl. “Z_2-Genus of Graphs and Minimum Rank of Partial Symmetric Matrices.”10.4230/LIPICS.SOCG.2019.39__35th International Symposium on Computational Geometry (SoCG 2019), vol. 129, 39, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, doi:10.4230/LIPICS.SOCG.2019.39.

Huszár, Kristóf, and Jonathan Spreer. “-Manifold Triangulations with Small Treewidth.”10.4230/LIPIcs.SoCG.2019.44__35th International Symposium on Computational Geometry, vol. 129, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, p. 44:1-44:20, doi:10.4230/LIPIcs.SoCG.2019.44.

Fulek, Radoslav, et al. “The Crossing Tverberg Theorem.”10.4230/LIPICS.SOCG.2019.38__35th International Symposium on Computational Geometry, vol. 129, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, p. 38:1-38:13, doi:10.4230/LIPICS.SOCG.2019.38.

Goranci, Gramoz, et al. “Dynamic Effective Resistances and Approximate Schur Complement on Separable Graphs.”10.4230/LIPICS.ESA.2018.40__26th Annual European Symposium on Algorithms, vol. 112, 40, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, doi:10.4230/LIPICS.ESA.2018.40.

Goranci, Gramoz, et al. “A Tree Structure for Dynamic Facility Location.”10.4230/LIPICS.ESA.2018.39__26th Annual European Symposium on Algorithms, vol. 112, 39, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, doi:10.4230/LIPICS.ESA.2018.39.

Biedermann, Sonja, et al. “Memetic Graph Clustering.”10.4230/LIPICS.SEA.2018.3__17th International Symposium on Experimental Algorithms, vol. 103, 3, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, doi:10.4230/LIPICS.SEA.2018.3.

Pietrzak, Krzysztof Z. “Proofs of Catalytic Space.”10.4230/LIPICS.ITCS.2019.59__10th Innovations in Theoretical Computer Science  Conference (ITCS 2019), vol. 124, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, p. 59:1-59:25, doi:10.4230/LIPICS.ITCS.2019.59.