<h2>LIPIcs, Volume 258, SoCG 2023</h2>
<ul>
<li>
<span class="authors">Erin W. Chambers and Joachim Gudmundsson</span>
<span class="title">LIPIcs, Volume 258, SoCG 2023, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2023">10.4230/LIPIcs.SoCG.2023</a>
</li>
<li>
<span class="authors">Erin W. Chambers and Joachim Gudmundsson</span>
<span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2023.0">10.4230/LIPIcs.SoCG.2023.0</a>
</li>
<li>
<span class="authors">Mikkel Abrahamsen, Linda Kleist, and Tillmann Miltzow</span>
<span class="title">Geometric Embeddability of Complexes Is ∃ℝ-Complete</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2023.1">10.4230/LIPIcs.SoCG.2023.1</a>
</li>
<li>
<span class="authors">Mikkel Abrahamsen and Bartosz Walczak</span>
<span class="title">Distinguishing Classes of Intersection Graphs of Homothets or Similarities of Two Convex Disks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2023.2">10.4230/LIPIcs.SoCG.2023.2</a>
</li>
<li>
<span class="authors">Peyman Afshani and Pingan Cheng</span>
<span class="title">Lower Bounds for Intersection Reporting Among Flat Objects</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2023.3">10.4230/LIPIcs.SoCG.2023.3</a>
</li>
<li>
<span class="authors">Pankaj K. Agarwal and Sariel Har-Peled</span>
<span class="title">Computing Instance-Optimal Kernels in Two Dimensions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2023.4">10.4230/LIPIcs.SoCG.2023.4</a>
</li>
<li>
<span class="authors">Pankaj K. Agarwal and Esther Ezra</span>
<span class="title">Line Intersection Searching Amid Unit Balls in 3-Space</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2023.5">10.4230/LIPIcs.SoCG.2023.5</a>
</li>
<li>
<span class="authors">Oswin Aichholzer, Man-Kwun Chiu, Hung P. Hoang, Michael Hoffmann, Jan Kynčl, Yannic Maus, Birgit Vogtenhuber, and Alexandra Weinberger</span>
<span class="title">Drawings of Complete Multipartite Graphs up to Triangle Flips</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2023.6">10.4230/LIPIcs.SoCG.2023.6</a>
</li>
<li>
<span class="authors">Ángel Javier Alonso and Michael Kerber</span>
<span class="title">Decomposition of Zero-Dimensional Persistence Modules via Rooted Subsets</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2023.7">10.4230/LIPIcs.SoCG.2023.7</a>
</li>
<li>
<span class="authors">Gergely Ambrus, Martin Balko, Nóra Frankl, Attila Jung, and Márton Naszódi</span>
<span class="title">On Helly Numbers of Exponential Lattices</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2023.8">10.4230/LIPIcs.SoCG.2023.8</a>
</li>
<li>
<span class="authors">Sunil Arya and David M. Mount</span>
<span class="title">Optimal Volume-Sensitive Bounds for Polytope Approximation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2023.9">10.4230/LIPIcs.SoCG.2023.9</a>
</li>
<li>
<span class="authors">Sayan Bandyapadhyay, Fedor V. Fomin, and Tanmay Inamdar</span>
<span class="title">Coresets for Clustering in Geometric Intersection Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2023.10">10.4230/LIPIcs.SoCG.2023.10</a>
</li>
<li>
<span class="authors">Sayan Bandyapadhyay, William Lochet, Saket Saurabh, and Jie Xue</span>
<span class="title">Minimum-Membership Geometric Set Cover, Revisited</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2023.11">10.4230/LIPIcs.SoCG.2023.11</a>
</li>
<li>
<span class="authors">Sayan Bandyapadhyay, William Lochet, and Saket Saurabh</span>
<span class="title">FPT Constant-Approximations for Capacitated Clustering to Minimize the Sum of Cluster Radii</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2023.12">10.4230/LIPIcs.SoCG.2023.12</a>
</li>
<li>
<span class="authors">J. Andreas Bærentzen, Rasmus Emil Christensen, Emil Toftegaard Gæde, and Eva Rotenberg</span>
<span class="title">Multilevel Skeletonization Using Local Separators</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2023.13">10.4230/LIPIcs.SoCG.2023.13</a>
</li>
<li>
<span class="authors">Ulrich Bauer and Maximilian Schmahl</span>
<span class="title">Efficient Computation of Image Persistence</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2023.14">10.4230/LIPIcs.SoCG.2023.14</a>
</li>
<li>
<span class="authors">Ulrich Bauer, Fabian Lenzen, and Michael Lesnick</span>
<span class="title">Efficient Two-Parameter Persistence Computation via Cohomology</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2023.15">10.4230/LIPIcs.SoCG.2023.15</a>
</li>
<li>
<span class="authors">Sarita de Berg, Marc van Kreveld, and Frank Staals</span>
<span class="title">The Complexity of Geodesic Spanners</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2023.16">10.4230/LIPIcs.SoCG.2023.16</a>
</li>
<li>
<span class="authors">Helena Bergold, Stefan Felsner, and Manfred Scheucher</span>
<span class="title">An Extension Theorem for Signotopes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2023.17">10.4230/LIPIcs.SoCG.2023.17</a>
</li>
<li>
<span class="authors">Sujoy Bhore, Robert Ganian, Liana Khazaliya, Fabrizio Montecchiani, and Martin Nöllenburg</span>
<span class="title">Extending Orthogonal Planar Graph Drawings Is Fixed-Parameter Tractable</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2023.18">10.4230/LIPIcs.SoCG.2023.18</a>
</li>
<li>
<span class="authors">Ahmad Biniaz</span>
<span class="title">Improved Bounds for Covering Paths and Trees in the Plane</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2023.19">10.4230/LIPIcs.SoCG.2023.19</a>
</li>
<li>
<span class="authors">Mickaël Buchet, Bianca B. Dornelas, and Michael Kerber</span>
<span class="title">Sparse Higher Order Čech Filtrations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2023.20">10.4230/LIPIcs.SoCG.2023.20</a>
</li>
<li>
<span class="authors">Benjamin A. Burton and Alexander He</span>
<span class="title">Finding Large Counterexamples by Selectively Exploring the Pachner Graph</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2023.21">10.4230/LIPIcs.SoCG.2023.21</a>
</li>
<li>
<span class="authors">Jean Cardinal and Micha Sharir</span>
<span class="title">Improved Algebraic Degeneracy Testing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2023.22">10.4230/LIPIcs.SoCG.2023.22</a>
</li>
<li>
<span class="authors">Timothy M. Chan and Zhengcheng Huang</span>
<span class="title">Constant-Hop Spanners for More Geometric Intersection Graphs, with Even Smaller Size</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2023.23">10.4230/LIPIcs.SoCG.2023.23</a>
</li>
<li>
<span class="authors">Timothy M. Chan</span>
<span class="title">Minimum L_∞ Hausdorff Distance of Point Sets Under Translation: Generalizing Klee’s Measure Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2023.24">10.4230/LIPIcs.SoCG.2023.24</a>
</li>
<li>
<span class="authors">Nate Clause, Tamal K. Dey, Facundo Mémoli, and Bei Wang</span>
<span class="title">Meta-Diagrams for 2-Parameter Persistence</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2023.25">10.4230/LIPIcs.SoCG.2023.25</a>
</li>
<li>
<span class="authors">Vincent Delecroix, Matthijs Ebbens, Francis Lazarus, and Ivan Yakovlev</span>
<span class="title">Algorithms for Length Spectra of Combinatorial Tori</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2023.26">10.4230/LIPIcs.SoCG.2023.26</a>
</li>
<li>
<span class="authors">Vincent Despré, Benedikt Kolbe, Hugo Parlier, and Monique Teillaud</span>
<span class="title">Computing a Dirichlet Domain for a Hyperbolic Surface</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2023.27">10.4230/LIPIcs.SoCG.2023.27</a>
</li>
<li>
<span class="authors">Eduard Eiben, Robert Ganian, and Iyad Kanj</span>
<span class="title">The Parameterized Complexity of Coordinated Motion Planning</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2023.28">10.4230/LIPIcs.SoCG.2023.28</a>
</li>
<li>
<span class="authors">David Eppstein</span>
<span class="title">Non-Crossing Hamiltonian Paths and Cycles in Output-Polynomial Time</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2023.29">10.4230/LIPIcs.SoCG.2023.29</a>
</li>
<li>
<span class="authors">Jared Espenant, J. Mark Keil, and Debajyoti Mondal</span>
<span class="title">Finding a Maximum Clique in a Disk Graph</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2023.30">10.4230/LIPIcs.SoCG.2023.30</a>
</li>
<li>
<span class="authors">Stefan Felsner, Hendrik Schrezenmaier, Felix Schröder, and Raphael Steiner</span>
<span class="title">Linear Size Universal Point Sets for Classes of Planar Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2023.31">10.4230/LIPIcs.SoCG.2023.31</a>
</li>
<li>
<span class="authors">Thomas Fernique and Daria Pchelina</span>
<span class="title">When Ternary Triangulated Disc Packings Are Densest: Examples, Counter-Examples and Techniques</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2023.32">10.4230/LIPIcs.SoCG.2023.32</a>
</li>
<li>
<span class="authors">Arnold Filtser</span>
<span class="title">Labeled Nearest Neighbor Search and Metric Spanners via Locality Sensitive Orderings</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2023.33">10.4230/LIPIcs.SoCG.2023.33</a>
</li>
<li>
<span class="authors">Esther Galby, Andrea Munaro, and Shizhou Yang</span>
<span class="title">Polynomial-Time Approximation Schemes for Independent Packing Problems on Fractionally Tree-Independence-Number-Fragile Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2023.34">10.4230/LIPIcs.SoCG.2023.34</a>
</li>
<li>
<span class="authors">Auguste H. Gezalyan and David M. Mount</span>
<span class="title">Voronoi Diagrams in the Hilbert Metric</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2023.35">10.4230/LIPIcs.SoCG.2023.35</a>
</li>
<li>
<span class="authors">Egor Gorbachev and Marvin Künnemann</span>
<span class="title">Combinatorial Designs Meet Hypercliques: Higher Lower Bounds for Klee’s Measure Problem and Related Problems in Dimensions d ≥ 4</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2023.36">10.4230/LIPIcs.SoCG.2023.36</a>
</li>
<li>
<span class="authors">Aziz Burak Gülen, Facundo Mémoli, Zhengchao Wan, and Yusu Wang</span>
<span class="title">A Generalization of the Persistent Laplacian to Simplicial Maps</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2023.37">10.4230/LIPIcs.SoCG.2023.37</a>
</li>
<li>
<span class="authors">Pepijn Roos Hoefgeest and Lucas Slot</span>
<span class="title">The Christoffel-Darboux Kernel for Topological Data Analysis</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2023.38">10.4230/LIPIcs.SoCG.2023.38</a>
</li>
<li>
<span class="authors">Michael Hoffmann and Meghana M. Reddy</span>
<span class="title">The Number of Edges in Maximal 2-Planar Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2023.39">10.4230/LIPIcs.SoCG.2023.39</a>
</li>
<li>
<span class="authors">Jacob Holm, Ivor van der Hoog, and Eva Rotenberg</span>
<span class="title">Worst-Case Deterministic Fully-Dynamic Biconnectivity in Changeable Planar Embeddings</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2023.40">10.4230/LIPIcs.SoCG.2023.40</a>
</li>
<li>
<span class="authors">Alfredo Hubard and Andrew Suk</span>
<span class="title">Disjoint Faces in Drawings of the Complete Graph and Topological Heilbronn Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2023.41">10.4230/LIPIcs.SoCG.2023.41</a>
</li>
<li>
<span class="authors">Kristóf Huszár and Jonathan Spreer</span>
<span class="title">On the Width of Complicated JSJ Decompositions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2023.42">10.4230/LIPIcs.SoCG.2023.42</a>
</li>
<li>
<span class="authors">Takehiro Ito, Yuni Iwamasa, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, and Kenta Ozeki</span>
<span class="title">Reconfiguration of Colorings in Triangulations of the Sphere</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2023.43">10.4230/LIPIcs.SoCG.2023.43</a>
</li>
<li>
<span class="authors">Rahul Jain, Marco Ricci, Jonathan Rollin, and André Schulz</span>
<span class="title">On the Geometric Thickness of 2-Degenerate Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2023.44">10.4230/LIPIcs.SoCG.2023.44</a>
</li>
<li>
<span class="authors">Michael Kerber and Matthias Söls</span>
<span class="title">The Localized Union-Of-Balls Bifiltration</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2023.45">10.4230/LIPIcs.SoCG.2023.45</a>
</li>
<li>
<span class="authors">Arindam Khan, Aditya Lonkar, Saladi Rahul, Aditya Subramanian, and Andreas Wiese</span>
<span class="title">Online and Dynamic Algorithms for Geometric Set Cover and Hitting Set</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2023.46">10.4230/LIPIcs.SoCG.2023.46</a>
</li>
<li>
<span class="authors">Hung Le, Lazar Milenković, and Shay Solomon</span>
<span class="title">Sparse Euclidean Spanners with Optimal Diameter: A General and Robust Lower Bound via a Concave Inverse-Ackermann Function</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2023.47">10.4230/LIPIcs.SoCG.2023.47</a>
</li>
<li>
<span class="authors">Maarten Löffler, Tim Ophelders, Rodrigo I. Silveira, and Frank Staals</span>
<span class="title">Shortest Paths in Portalgons</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2023.48">10.4230/LIPIcs.SoCG.2023.48</a>
</li>
<li>
<span class="authors">Anna Lubiw and Anurag Murty Naredla</span>
<span class="title">The Geodesic Edge Center of a Simple Polygon</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2023.49">10.4230/LIPIcs.SoCG.2023.49</a>
</li>
<li>
<span class="authors">Corentin Lunel and Arnaud de Mesmay</span>
<span class="title">A Structural Approach to Tree Decompositions of Knots and Spatial Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2023.50">10.4230/LIPIcs.SoCG.2023.50</a>
</li>
<li>
<span class="authors">Facundo Mémoli and Ling Zhou</span>
<span class="title">Ephemeral Persistence Features and the Stability of Filtered Chain Complexes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2023.51">10.4230/LIPIcs.SoCG.2023.51</a>
</li>
<li>
<span class="authors">Evanthia Papadopoulou</span>
<span class="title">Abstract Voronoi-Like Graphs: Extending Delaunay’s Theorem and Applications</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2023.52">10.4230/LIPIcs.SoCG.2023.52</a>
</li>
<li>
<span class="authors">Ioannis Psarros and Dennis Rohde</span>
<span class="title">Random Projections for Curves in High Dimensions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2023.53">10.4230/LIPIcs.SoCG.2023.53</a>
</li>
<li>
<span class="authors">Benjamin Qi and Richard Qi</span>
<span class="title">New Approximation Algorithms for Touring Regions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2023.54">10.4230/LIPIcs.SoCG.2023.54</a>
</li>
<li>
<span class="authors">Patrick Schnider and Pablo Soberón</span>
<span class="title">Combinatorial Depth Measures for Hyperplane Arrangements</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2023.55">10.4230/LIPIcs.SoCG.2023.55</a>
</li>
<li>
<span class="authors">Luis Scoccola and Jose A. Perea</span>
<span class="title">FibeRed: Fiberwise Dimensionality Reduction of Topologically Complex Data with Vector Bundles</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2023.56">10.4230/LIPIcs.SoCG.2023.56</a>
</li>
<li>
<span class="authors">Luis Scoccola, Hitesh Gakhar, Johnathan Bush, Nikolas Schonsheck, Tatum Rask, Ling Zhou, and Jose A. Perea</span>
<span class="title">Toroidal Coordinates: Decorrelating Circular Coordinates with Lattice Reduction</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2023.57">10.4230/LIPIcs.SoCG.2023.57</a>
</li>
<li>
<span class="authors">Jack Stade and Jamie Tucker-Foltz</span>
<span class="title">Topological Universality of the Art Gallery Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2023.58">10.4230/LIPIcs.SoCG.2023.58</a>
</li>
<li>
<span class="authors">Andrew Suk and Ji Zeng</span>
<span class="title">On Higher Dimensional Point Sets in General Position</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2023.59">10.4230/LIPIcs.SoCG.2023.59</a>
</li>
<li>
<span class="authors">Hubert Wagner</span>
<span class="title">Slice, Simplify and Stitch: Topology-Preserving Simplification Scheme for Massive Voxel Data</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2023.60">10.4230/LIPIcs.SoCG.2023.60</a>
</li>
<li>
<span class="authors">Honglin Zhu and Hyuk Jun Kweon</span>
<span class="title">Maximum Overlap Area of a Convex Polyhedron and a Convex Polygon Under Translation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2023.61">10.4230/LIPIcs.SoCG.2023.61</a>
</li>
<li>
<span class="authors">Richard Berger, Vincent Ha, David Kratz, Michael Lin, Jeremy Moyer, and Christopher J. Tralie</span>
<span class="title">Godzilla Onions: A Skit and Applet to Explain Euclidean Half-Plane Fractional Cascading (Media Exposition)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2023.62">10.4230/LIPIcs.SoCG.2023.62</a>
</li>
<li>
<span class="authors">Alexandra Camero and Ileana Streinu</span>
<span class="title">Interactive 2D Periodic Graphs (Media Exposition)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2023.63">10.4230/LIPIcs.SoCG.2023.63</a>
</li>
<li>
<span class="authors">Oliver A. Chubet, Paul Macnichol, Parth Parikh, Donald R. Sheehy, and Siddharth S. Sheth</span>
<span class="title">Greedy Permutations and Finite Voronoi Diagrams (Media Exposition)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2023.64">10.4230/LIPIcs.SoCG.2023.64</a>
</li>
<li>
<span class="authors">Donald R. Sheehy</span>
<span class="title">The Sum of Squares in Polycubes (Media Exposition)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2023.65">10.4230/LIPIcs.SoCG.2023.65</a>
</li>
<li>
<span class="authors">Mikkel Abrahamsen, William Bille Meyling, and André Nusser</span>
<span class="title">Constructing Concise Convex Covers via Clique Covers (CG Challenge)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2023.66">10.4230/LIPIcs.SoCG.2023.66</a>
</li>
<li>
<span class="authors">Guilherme D. da Fonseca</span>
<span class="title">Shadoks Approach to Convex Covering (CG Challenge)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2023.67">10.4230/LIPIcs.SoCG.2023.67</a>
</li>
</ul>
The metadata provided by Dagstuhl Publishing on its webpages, as well as their export formats (such as XML or BibTeX) available at our website, is released under the CC0 1.0 Public Domain Dedication license. That is, you are free to copy, distribute, use, modify, transform, build upon, and produce derived works from our data, even for commercial purposes, all without asking permission. Of course, we are always happy if you provide a link to us as the source of the data.
Read the full CC0 1.0 legal code for the exact terms that apply: https://creativecommons.org/publicdomain/zero/1.0/legalcode
Feedback for Dagstuhl Publishing