<h2>LIPIcs, Volume 77, SoCG 2017</h2>
<ul>
<li>
<span class="authors">Boris Aronov and Matthew J. Katz</span>
<span class="title">LIPIcs, Volume 77, SoCG'17, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2017">10.4230/LIPIcs.SoCG.2017</a>
</li>
<li>
<span class="authors">Boris Aronov and Matthew J. Katz</span>
<span class="title">Front Matter, Table of Contents, Foreword, Conference Organization, External Reviewers, Sponsors</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2017.0">10.4230/LIPIcs.SoCG.2017.0</a>
</li>
<li>
<span class="authors">Vanessa Robins</span>
<span class="title">The Geometry and Topology of Crystals: From Sphere-Packing to Tiling, Nets, and Knots (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2017.1">10.4230/LIPIcs.SoCG.2017.1</a>
</li>
<li>
<span class="authors">Micha Sharir</span>
<span class="title">The Algebraic Revolution in Combinatorial and Computational Geometry: State of the Art (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2017.2">10.4230/LIPIcs.SoCG.2017.2</a>
</li>
<li>
<span class="authors">Mikkel Abrahamsen, Anna Adamaszek, and Tillmann Miltzow</span>
<span class="title">Irrational Guards are Sometimes Needed</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2017.3">10.4230/LIPIcs.SoCG.2017.3</a>
</li>
<li>
<span class="authors">Mikkel Abrahamsen, Mark de Berg, Kevin Buchin, Mehran Mehr, and Ali D. Mehrabi</span>
<span class="title">Minimum Perimeter-Sum Partitions in the Plane</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2017.4">10.4230/LIPIcs.SoCG.2017.4</a>
</li>
<li>
<span class="authors">Mikkel Abrahamsen, Mark de Berg, Kevin Buchin, Mehran Mehr, and Ali D. Mehrabi</span>
<span class="title">Range-Clustering Queries</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2017.5">10.4230/LIPIcs.SoCG.2017.5</a>
</li>
<li>
<span class="authors">Mikkel Abrahamsen, Jacob Holm, Eva Rotenberg, and Christian Wulff-Nilsen</span>
<span class="title">Best Laid Plans of Lions and Men</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2017.6">10.4230/LIPIcs.SoCG.2017.6</a>
</li>
<li>
<span class="authors">Pankaj K. Agarwal, Kyle Fox, Debmalya Panigrahi, Kasturi R. Varadarajan, and Allen Xiao</span>
<span class="title">Faster Algorithms for the Geometric Transportation Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2017.7">10.4230/LIPIcs.SoCG.2017.7</a>
</li>
<li>
<span class="authors">Oswin Aichholzer, Martin Balko, Thomas Hackl, Jan Kyncl, Irene Parada, Manfred Scheucher, Pavel Valtr, and Birgit Vogtenhuber</span>
<span class="title">A Superlinear Lower Bound on the Number of 5-Holes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2017.8">10.4230/LIPIcs.SoCG.2017.8</a>
</li>
<li>
<span class="authors">Patrizio Angelini, Michael A. Bekos, Giuseppe Liotta, and Fabrizio Montecchiani</span>
<span class="title">A Universal Slope Set for 1-Bend Planar Drawings</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2017.9">10.4230/LIPIcs.SoCG.2017.9</a>
</li>
<li>
<span class="authors">Sunil Arya, Guilherme D. da Fonseca, and David M. Mount</span>
<span class="title">Near-Optimal epsilon-Kernel Construction and Related Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2017.10">10.4230/LIPIcs.SoCG.2017.10</a>
</li>
<li>
<span class="authors">Pradeesha Ashok, Fedor V. Fomin, Sudeshna Kolay, Saket Saurabh, and Meirav Zehavi</span>
<span class="title">Exact Algorithms for Terrain Guarding</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2017.11">10.4230/LIPIcs.SoCG.2017.11</a>
</li>
<li>
<span class="authors">Martin Balko, Josef Cibulka, and Pavel Valtr</span>
<span class="title">Covering Lattice Points by Subspaces and Counting Point-Hyperplane Incidences</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2017.12">10.4230/LIPIcs.SoCG.2017.12</a>
</li>
<li>
<span class="authors">Luis Barba, Jean Cardinal, John Iacono, Stefan Langerman, Aurélien Ooms, and Noam Solomon</span>
<span class="title">Subquadratic Algorithms for Algebraic Generalizations of 3SUM</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2017.13">10.4230/LIPIcs.SoCG.2017.13</a>
</li>
<li>
<span class="authors">Lukas Barth, Benjamin Niedermann, Ignaz Rutter, and Matthias Wolf</span>
<span class="title">Towards a Topology-Shape-Metrics Framework for Ortho-Radial Drawings</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2017.14">10.4230/LIPIcs.SoCG.2017.14</a>
</li>
<li>
<span class="authors">Abdul Basit, Zeev Dvir, Shubhangi Saraf, and Charles Wolf</span>
<span class="title">On the Number of Ordinary Lines Determined by Sets in Complex Space</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2017.15">10.4230/LIPIcs.SoCG.2017.15</a>
</li>
<li>
<span class="authors">Michael A. Bekos, Michael Kaufmann, and Chrysanthi N. Raftopoulou</span>
<span class="title">On Optimal 2- and 3-Planar Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2017.16">10.4230/LIPIcs.SoCG.2017.16</a>
</li>
<li>
<span class="authors">Daniel Binham, Pedro Machado Manhaes de Castro, and Antoine Vigneron</span>
<span class="title">Reachability in a Planar Subdivision with Direction Constraints</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2017.17">10.4230/LIPIcs.SoCG.2017.17</a>
</li>
<li>
<span class="authors">Csaba Biró, Édouard Bonnet, Dániel Marx, Tillmann Miltzow, and Pawel Rzazewski</span>
<span class="title">Fine-Grained Complexity of Coloring Unit Disks and Balls</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2017.18">10.4230/LIPIcs.SoCG.2017.18</a>
</li>
<li>
<span class="authors">Jean-Daniel Boissonnat, Mael Rouxel-Labbé, and Mathijs Wintraecken</span>
<span class="title">Anisotropic Triangulations via Discrete Riemannian Voronoi Diagrams</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2017.19">10.4230/LIPIcs.SoCG.2017.19</a>
</li>
<li>
<span class="authors">Édouard Bonnet and Tillmann Miltzow</span>
<span class="title">An Approximation Algorithm for the Art Gallery Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2017.20">10.4230/LIPIcs.SoCG.2017.20</a>
</li>
<li>
<span class="authors">Prosenjit Bose, Irina Kostitsyna, and Stefan Langerman</span>
<span class="title">Self-Approaching Paths in Simple Polygons</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2017.21">10.4230/LIPIcs.SoCG.2017.21</a>
</li>
<li>
<span class="authors">Karl Bringmann, Sergio Cabello, and Michael T. M. Emmerich</span>
<span class="title">Maximum Volume Subset Selection for Anchored Boxes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2017.22">10.4230/LIPIcs.SoCG.2017.22</a>
</li>
<li>
<span class="authors">Mickael Buchet, Tamal K. Dey, Jiayuan Wang, and Yusu Wang</span>
<span class="title">Declutter and Resample: Towards Parameter Free Denoising</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2017.23">10.4230/LIPIcs.SoCG.2017.23</a>
</li>
<li>
<span class="authors">Karthik C. S. and Arpan Saha</span>
<span class="title">Ham Sandwich is Equivalent to Borsuk-Ulam</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2017.24">10.4230/LIPIcs.SoCG.2017.24</a>
</li>
<li>
<span class="authors">Mathieu Carrière and Steve Oudot</span>
<span class="title">Local Equivalence and Intrinsic Metrics between Reeb Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2017.25">10.4230/LIPIcs.SoCG.2017.25</a>
</li>
<li>
<span class="authors">Timothy M. Chan</span>
<span class="title">Applications of Chebyshev Polynomials to Low-Dimensional Computational Geometry</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2017.26">10.4230/LIPIcs.SoCG.2017.26</a>
</li>
<li>
<span class="authors">Timothy M. Chan</span>
<span class="title">Orthogonal Range Searching in Moderate Dimensions: k-d Trees and Range Trees Strike Back</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2017.27">10.4230/LIPIcs.SoCG.2017.27</a>
</li>
<li>
<span class="authors">Timothy M. Chan and Konstantinos Tsakalidis</span>
<span class="title">Dynamic Orthogonal Range Searching on the RAM, Revisited</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2017.28">10.4230/LIPIcs.SoCG.2017.28</a>
</li>
<li>
<span class="authors">Yi-Jun Chang and Hsu-Chun Yen</span>
<span class="title">On Bend-Minimized Orthogonal Drawings of Planar 3-Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2017.29">10.4230/LIPIcs.SoCG.2017.29</a>
</li>
<li>
<span class="authors">Siu-Wing Cheng and Man-Kit Lau</span>
<span class="title">Adaptive Planar Point Location</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2017.30">10.4230/LIPIcs.SoCG.2017.30</a>
</li>
<li>
<span class="authors">Man-Kwun Chiu and Matias Korman</span>
<span class="title">High Dimensional Consistent Digital Segments</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2017.31">10.4230/LIPIcs.SoCG.2017.31</a>
</li>
<li>
<span class="authors">Gui Citovsky, Tyler Mayer, and Joseph S. B. Mitchell</span>
<span class="title">TSP With Locational Uncertainty: The Adversarial Model</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2017.32">10.4230/LIPIcs.SoCG.2017.32</a>
</li>
<li>
<span class="authors">Giordano Da Lozzo, Anthony D'Angelo, and Fabrizio Frati</span>
<span class="title">On Planar Greedy Drawings of 3-Connected Planar Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2017.33">10.4230/LIPIcs.SoCG.2017.33</a>
</li>
<li>
<span class="authors">Erik D. Demaine and Tomohiro Tachi</span>
<span class="title">Origamizer: A Practical Algorithm for Folding Any Polyhedron</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2017.34">10.4230/LIPIcs.SoCG.2017.34</a>
</li>
<li>
<span class="authors">Vincent Despré and Francis Lazarus</span>
<span class="title">Computing the Geometric Intersection Number of Curves</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2017.35">10.4230/LIPIcs.SoCG.2017.35</a>
</li>
<li>
<span class="authors">Tamal K. Dey, Facundo Mémoli, and Yusu Wang</span>
<span class="title">Topological Analysis of Nerves, Reeb Spaces, Mappers, and Multiscale Mappers</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2017.36">10.4230/LIPIcs.SoCG.2017.36</a>
</li>
<li>
<span class="authors">Anne Driemel and Francesco Silvestri</span>
<span class="title">Locality-Sensitive Hashing of Curves</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2017.37">10.4230/LIPIcs.SoCG.2017.37</a>
</li>
<li>
<span class="authors">Kunal Dutta, Arijit Ghosh, Bruno Jartoux, and Nabil H. Mustafa</span>
<span class="title">Shallow Packings, Semialgebraic Set Systems, Macbeath Regions, and Polynomial Partitioning</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2017.38">10.4230/LIPIcs.SoCG.2017.38</a>
</li>
<li>
<span class="authors">Herbert Edelsbrunner and Hubert Wagner</span>
<span class="title">Topological Data Analysis with Bregman Divergences</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2017.39">10.4230/LIPIcs.SoCG.2017.39</a>
</li>
<li>
<span class="authors">Khaled Elbassioni</span>
<span class="title">Finding Small Hitting Sets in Infinite Range Spaces of Bounded VC-Dimension</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2017.40">10.4230/LIPIcs.SoCG.2017.40</a>
</li>
<li>
<span class="authors">Esther Ezra and Micha Sharir</span>
<span class="title">A Nearly Quadratic Bound for the Decision Tree Complexity of k-SUM</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2017.41">10.4230/LIPIcs.SoCG.2017.41</a>
</li>
<li>
<span class="authors">Chenglin Fan and Benjamin Raichel</span>
<span class="title">Computing the Fréchet Gap Distance</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2017.42">10.4230/LIPIcs.SoCG.2017.42</a>
</li>
<li>
<span class="authors">Jacob Fox, János Pach, and Andrew Suk</span>
<span class="title">Erdös-Hajnal Conjecture for Graphs with Bounded VC-Dimension</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2017.43">10.4230/LIPIcs.SoCG.2017.43</a>
</li>
<li>
<span class="authors">Iordan Iordanov and Monique Teillaud</span>
<span class="title">Implementing Delaunay Triangulations of the Bolza Surface</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2017.44">10.4230/LIPIcs.SoCG.2017.44</a>
</li>
<li>
<span class="authors">Assimakis Kattis and Aleksandar Nikolov</span>
<span class="title">Lower Bounds for Differential Privacy from Gaussian Width</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2017.45">10.4230/LIPIcs.SoCG.2017.45</a>
</li>
<li>
<span class="authors">Michael Kerber, Robert Tichy, and Mario Weitzer</span>
<span class="title">Constrained Triangulations, Volumes of Polytopes, and Unit Equations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2017.46">10.4230/LIPIcs.SoCG.2017.46</a>
</li>
<li>
<span class="authors">Balázs Keszegh and Dömötör Pálvölgyi</span>
<span class="title">Proper Coloring of Geometric Hypergraphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2017.47">10.4230/LIPIcs.SoCG.2017.47</a>
</li>
<li>
<span class="authors">Maarten Kleinhans, Marc van Kreveld, Tim Ophelders, Willem Sonke, Bettina Speckmann, and Kevin Verbeek</span>
<span class="title">Computing Representative Networks for Braided Rivers</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2017.48">10.4230/LIPIcs.SoCG.2017.48</a>
</li>
<li>
<span class="authors">Anna Lubiw, Zuzana Masárová, and Uli Wagner</span>
<span class="title">A Proof of the Orbit Conjecture for Flipping Edge-Labelled Triangulations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2017.49">10.4230/LIPIcs.SoCG.2017.49</a>
</li>
<li>
<span class="authors">Assaf Naor</span>
<span class="title">A Spectral Gap Precludes Low-Dimensional Embeddings</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2017.50">10.4230/LIPIcs.SoCG.2017.50</a>
</li>
<li>
<span class="authors">Eunjin Oh and Hee-Kap Ahn</span>
<span class="title">Dynamic Geodesic Convex Hulls in Dynamic Simple Polygons</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2017.51">10.4230/LIPIcs.SoCG.2017.51</a>
</li>
<li>
<span class="authors">Eunjin Oh and Hee-Kap Ahn</span>
<span class="title">Voronoi Diagrams for a Moderate-Sized Point-Set in a Simple Polygon</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2017.52">10.4230/LIPIcs.SoCG.2017.52</a>
</li>
<li>
<span class="authors">Srinivasan Parthasarathy, David Sivakoff, Minghao Tian, and Yusu Wang</span>
<span class="title">A Quest to Unravel the Metric Structure Behind Perturbed Networks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2017.53">10.4230/LIPIcs.SoCG.2017.53</a>
</li>
<li>
<span class="authors">Alexander Pilz, Emo Welzl, and Manuel Wettstein</span>
<span class="title">From Crossing-Free Graphs on Wheel Sets to Embracing Simplices and Polytopes with Few Vertices</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2017.54">10.4230/LIPIcs.SoCG.2017.54</a>
</li>
<li>
<span class="authors">Saladi Rahul</span>
<span class="title">Approximate Range Counting Revisited</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2017.55">10.4230/LIPIcs.SoCG.2017.55</a>
</li>
<li>
<span class="authors">Alexandre Rok and Bartosz Walczak</span>
<span class="title">Coloring Curves That Cross a Fixed Curve</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2017.56">10.4230/LIPIcs.SoCG.2017.56</a>
</li>
<li>
<span class="authors">Michael Kerber and Hannah Schreiber</span>
<span class="title">Barcodes of Towers and a Streaming Algorithm for Persistent Homology</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2017.57">10.4230/LIPIcs.SoCG.2017.57</a>
</li>
<li>
<span class="authors">Anastasios Sidiropoulos and Vijay Sridhar</span>
<span class="title">Algorithmic Interpretations of Fractal Dimension</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2017.58">10.4230/LIPIcs.SoCG.2017.58</a>
</li>
<li>
<span class="authors">János Pach, Gábor Tardos, and Géza Tóth</span>
<span class="title">Disjointness Graphs of Segments</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2017.59">10.4230/LIPIcs.SoCG.2017.59</a>
</li>
<li>
<span class="authors">Haitao Wang</span>
<span class="title">Bicriteria Rectilinear Shortest Paths among Rectilinear Obstacles in the Plane</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2017.60">10.4230/LIPIcs.SoCG.2017.60</a>
</li>
<li>
<span class="authors">Haitao Wang</span>
<span class="title">Quickest Visibility Queries in Polygonal Domains</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2017.61">10.4230/LIPIcs.SoCG.2017.61</a>
</li>
<li>
<span class="authors">Aaron T. Becker, Mustapha Debboun, Sándor P. Fekete, Dominik Krupke, and An Nguyen</span>
<span class="title">Zapping Zika with a Mosquito-Managing Drone: Computing Optimal Flight Patterns with Minimum Turn Cost (Multimedia Contribution)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2017.62">10.4230/LIPIcs.SoCG.2017.62</a>
</li>
<li>
<span class="authors">Sander Beekhuis, Kevin Buchin, Thom Castermans, Thom Hurks, and Willem Sonke</span>
<span class="title">Ruler of the Plane - Games of Geometry (Multimedia Contribution)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2017.63">10.4230/LIPIcs.SoCG.2017.63</a>
</li>
<li>
<span class="authors">Kevin Buchin, Jinhee Chun, Maarten Löffler, Aleksandar Markovic, Wouter Meulemans, Yoshio Okamoto, and Taichi Shiitada</span>
<span class="title">Folding Free-Space Diagrams: Computing the Fréchet Distance between 1-Dimensional Curves (Multimedia Contribution)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2017.64">10.4230/LIPIcs.SoCG.2017.64</a>
</li>
<li>
<span class="authors">Chao Chen, Dimitris Metaxas, Yusu Wang, and Pengxiang Wu</span>
<span class="title">Cardiac Trabeculae Segmentation: an Application of Computational Topology (Multimedia Contribution)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2017.65">10.4230/LIPIcs.SoCG.2017.65</a>
</li>
<li>
<span class="authors">Michael Joswig, Georg Loho, Benjamin Lorenz, and Rico Raber</span>
<span class="title">MatchTheNet - An Educational Game on 3-Dimensional Polytopes (Multimedia Contribution)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2017.66">10.4230/LIPIcs.SoCG.2017.66</a>
</li>
<li>
<span class="authors">Frank Nielsen and Laetitia Shao</span>
<span class="title">On Balls in a Hilbert Polygonal Geometry (Multimedia Contribution)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2017.67">10.4230/LIPIcs.SoCG.2017.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