<h2>LIPIcs, Volume 248, ISAAC 2022</h2>
<ul>
<li>
<span class="authors">Sang Won Bae and Heejin Park</span>
<span class="title">LIPIcs, Volume 248, ISAAC 2022, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2022">10.4230/LIPIcs.ISAAC.2022</a>
</li>
<li>
<span class="authors">Sang Won Bae and Heejin Park</span>
<span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2022.0">10.4230/LIPIcs.ISAAC.2022.0</a>
</li>
<li>
<span class="authors">Kunihiko Sadakane</span>
<span class="title">Succinct Representations of Graphs (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2022.1">10.4230/LIPIcs.ISAAC.2022.1</a>
</li>
<li>
<span class="authors">Jeff Erickson</span>
<span class="title">The Tragedy of Being Almost but Not Quite Planar (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2022.2">10.4230/LIPIcs.ISAAC.2022.2</a>
</li>
<li>
<span class="authors">Lisa Hellerstein, Thomas Lidbetter, and R. Teal Witter</span>
<span class="title">A Local Search Algorithm for the Min-Sum Submodular Cover Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2022.3">10.4230/LIPIcs.ISAAC.2022.3</a>
</li>
<li>
<span class="authors">Soichiro Fujii, Yuni Iwamasa, Kei Kimura, and Akira Suzuki</span>
<span class="title">Algorithms for Coloring Reconfiguration Under Recolorability Digraphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2022.4">10.4230/LIPIcs.ISAAC.2022.4</a>
</li>
<li>
<span class="authors">Sabine Storandt</span>
<span class="title">Algorithms for Landmark Hub Labeling</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2022.5">10.4230/LIPIcs.ISAAC.2022.5</a>
</li>
<li>
<span class="authors">Atsuya Hasegawa and François Le Gall</span>
<span class="title">An Optimal Oracle Separation of Classical and Quantum Hybrid Schemes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2022.6">10.4230/LIPIcs.ISAAC.2022.6</a>
</li>
<li>
<span class="authors">Julián Mestre and Sergey Pupyrev</span>
<span class="title">Approximating the Minimum Logarithmic Arrangement Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2022.7">10.4230/LIPIcs.ISAAC.2022.7</a>
</li>
<li>
<span class="authors">Zachary Friggstad and Ramin Mousavi</span>
<span class="title">Bi-Criteria Approximation Algorithms for Bounded-Degree Subset TSP</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2022.8">10.4230/LIPIcs.ISAAC.2022.8</a>
</li>
<li>
<span class="authors">Gianlorenzo D'Angelo, Esmaeil Delfaraz, and Hugo Gilbert</span>
<span class="title">Budgeted Out-Tree Maximization with Submodular Prizes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2022.9">10.4230/LIPIcs.ISAAC.2022.9</a>
</li>
<li>
<span class="authors">Kyle Fox, Hongyao Huang, and Benjamin Raichel</span>
<span class="title">Clustering with Faulty Centers</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2022.10">10.4230/LIPIcs.ISAAC.2022.10</a>
</li>
<li>
<span class="authors">Jan Dreier, Nikolas Mählmann, Amer E. Mouawad, Sebastian Siebertz, and Alexandre Vigny</span>
<span class="title">Combinatorial and Algorithmic Aspects of Monadic Stability</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2022.11">10.4230/LIPIcs.ISAAC.2022.11</a>
</li>
<li>
<span class="authors">Dibyayan Chakraborty, Antoine Dailly, Sandip Das, Florent Foucaud, Harmender Gahlawat, and Subir Kumar Ghosh</span>
<span class="title">Complexity and Algorithms for ISOMETRIC PATH COVER on Chordal Graphs and Beyond</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2022.12">10.4230/LIPIcs.ISAAC.2022.12</a>
</li>
<li>
<span class="authors">Kyle Fox and Thomas Stanley</span>
<span class="title">Computation of Cycle Bases in Surface Embedded Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2022.13">10.4230/LIPIcs.ISAAC.2022.13</a>
</li>
<li>
<span class="authors">Michał Dębski, Zbigniew Lonc, Karolina Okrasa, Marta Piecyk, and Paweł Rzążewski</span>
<span class="title">Computing Homomorphisms in Hereditary Graph Classes: The Peculiar Case of the 5-Wheel and Graphs with No Long Claws</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2022.14">10.4230/LIPIcs.ISAAC.2022.14</a>
</li>
<li>
<span class="authors">Takuya Mieno, Mitsuru Funakoshi, and Shunsuke Inenaga</span>
<span class="title">Computing Palindromes on a Trie in Linear Time</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2022.15">10.4230/LIPIcs.ISAAC.2022.15</a>
</li>
<li>
<span class="authors">Yossi Azar, Eldad Peretz, and Noam Touitou</span>
<span class="title">Distortion-Oblivious Algorithms for Scheduling on Multiple Machines</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2022.16">10.4230/LIPIcs.ISAAC.2022.16</a>
</li>
<li>
<span class="authors">Sándor P. Fekete, Peter Kramer, Christian Rieck, Christian Scheffer, and Arne Schmidt</span>
<span class="title">Efficiently Reconfiguring a Connected Swarm of Labeled Robots</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2022.17">10.4230/LIPIcs.ISAAC.2022.17</a>
</li>
<li>
<span class="authors">Maciej Skorski</span>
<span class="title">Entropy Matters: Understanding Performance of Sparse Random Embeddings</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2022.18">10.4230/LIPIcs.ISAAC.2022.18</a>
</li>
<li>
<span class="authors">Konstantinos Georgiou, Nikos Giachoudis, and Evangelos Kranakis</span>
<span class="title">Evacuation from a Disk for Robots with Asymmetric Communication</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2022.19">10.4230/LIPIcs.ISAAC.2022.19</a>
</li>
<li>
<span class="authors">Tatsuya Gima and Yota Otachi</span>
<span class="title">Extended MSO Model Checking via Small Vertex Integrity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2022.20">10.4230/LIPIcs.ISAAC.2022.20</a>
</li>
<li>
<span class="authors">Rathish Das, John Iacono, and Yakov Nekrich</span>
<span class="title">External-Memory Dictionaries with Worst-Case Update Cost</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2022.21">10.4230/LIPIcs.ISAAC.2022.21</a>
</li>
<li>
<span class="authors">Felicia Lucke, Daniël Paulusma, and Bernard Ries</span>
<span class="title">Finding Matching Cuts in H-Free Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2022.22">10.4230/LIPIcs.ISAAC.2022.22</a>
</li>
<li>
<span class="authors">Michael A. Bekos, Giordano Da Lozzo, Petr Hliněný, and Michael Kaufmann</span>
<span class="title">Graph Product Structure for h-Framed Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2022.23">10.4230/LIPIcs.ISAAC.2022.23</a>
</li>
<li>
<span class="authors">Tatiana Belova and Ivan Bliznets</span>
<span class="title">Hardness of Approximation for H-Free Edge Modification Problems: Towards a Dichotomy</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2022.24">10.4230/LIPIcs.ISAAC.2022.24</a>
</li>
<li>
<span class="authors">Peyman Afshani, Rasmus Killmann, and Kasper Green Larsen</span>
<span class="title">Hierarchical Categories in Colored Searching</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2022.25">10.4230/LIPIcs.ISAAC.2022.25</a>
</li>
<li>
<span class="authors">Junbin Fang, Dominique Unruh, Jun Yan, and Dehua Zhou</span>
<span class="title">How to Base Security on the Perfect/Statistical Binding Property of Quantum Bit Commitment?</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2022.26">10.4230/LIPIcs.ISAAC.2022.26</a>
</li>
<li>
<span class="authors">Shay Mozes, Nathan Wallheimer, and Oren Weimann</span>
<span class="title">Improved Compression of the Okamura-Seymour Metric</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2022.27">10.4230/LIPIcs.ISAAC.2022.27</a>
</li>
<li>
<span class="authors">Ya-Chun Liang, Kazuo Iwama, and Chung-Shou Liao</span>
<span class="title">Improving the Bounds of the Online Dynamic Power Management Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2022.28">10.4230/LIPIcs.ISAAC.2022.28</a>
</li>
<li>
<span class="authors">Kazuyuki Amano</span>
<span class="title">Integer Complexity and Mixed Binary-Ternary Representation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2022.29">10.4230/LIPIcs.ISAAC.2022.29</a>
</li>
<li>
<span class="authors">Pavel Dvořák, Tomáš Masařík, Jana Novotná, Monika Krawczyk, Paweł Rzążewski, and Aneta Żuk</span>
<span class="title">List Locally Surjective Homomorphisms in Hereditary Graph Classes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2022.30">10.4230/LIPIcs.ISAAC.2022.30</a>
</li>
<li>
<span class="authors">Narmina Baghirova, Carolina Lucía Gonzalez, Bernard Ries, and David Schindl</span>
<span class="title">Locally Checkable Problems Parameterized by Clique-Width</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2022.31">10.4230/LIPIcs.ISAAC.2022.31</a>
</li>
<li>
<span class="authors">Lily Chung, Erik D. Demaine, Dylan Hendrickson, and Jayson Lynch</span>
<span class="title">Lower Bounds on Retroactive Data Structures</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2022.32">10.4230/LIPIcs.ISAAC.2022.32</a>
</li>
<li>
<span class="authors">Xiangyu Guo, Kelin Luo, Shi Li, and Yuhao Zhang</span>
<span class="title">Minimizing the Maximum Flow Time in the Online Food Delivery Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2022.33">10.4230/LIPIcs.ISAAC.2022.33</a>
</li>
<li>
<span class="authors">Sujoy Bhore, Fabian Klute, Maarten Löffler, Martin Nöllenburg, Soeren Terziadis, and Anaïs Villedieu</span>
<span class="title">Minimum Link Fencing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2022.34">10.4230/LIPIcs.ISAAC.2022.34</a>
</li>
<li>
<span class="authors">Pankaj K. Agarwal, Tzvika Geft, Dan Halperin, and Erin Taylor</span>
<span class="title">Multi-Robot Motion Planning for Unit Discs with Revolving Areas</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2022.35">10.4230/LIPIcs.ISAAC.2022.35</a>
</li>
<li>
<span class="authors">Nairen Cao, Jeremy T. Fineman, Shi Li, Julián Mestre, Katina Russell, and Seeun William Umboh</span>
<span class="title">Nested Active-Time Scheduling</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2022.36">10.4230/LIPIcs.ISAAC.2022.36</a>
</li>
<li>
<span class="authors">Szilárd Zsolt Fazekas, Hwee Kim, Ryuichi Matsuoka, Shinnosuke Seki, and Hinano Takeuchi</span>
<span class="title">On Algorithmic Self-Assembly of Squares by Co-Transcriptional Folding</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2022.37">10.4230/LIPIcs.ISAAC.2022.37</a>
</li>
<li>
<span class="authors">Ferdinando Cicalese, Clément Dallard, and Martin Milanič</span>
<span class="title">On Constrained Intersection Representations of Graphs and Digraphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2022.38">10.4230/LIPIcs.ISAAC.2022.38</a>
</li>
<li>
<span class="authors">Akanksha Agrawal, Soumita Hait, and Amer E. Mouawad</span>
<span class="title">On Finding Short Reconfiguration Sequences Between Independent Sets</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2022.39">10.4230/LIPIcs.ISAAC.2022.39</a>
</li>
<li>
<span class="authors">Maël Dumas, Florent Foucaud, Anthony Perez, and Ioan Todinca</span>
<span class="title">On Graphs Coverable by k Shortest Paths</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2022.40">10.4230/LIPIcs.ISAAC.2022.40</a>
</li>
<li>
<span class="authors">Benjamin Qi</span>
<span class="title">On Maximizing Sums of Non-Monotone Submodular and Linear Functions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2022.41">10.4230/LIPIcs.ISAAC.2022.41</a>
</li>
<li>
<span class="authors">Pankaj K. Agarwal, Matthew J. Katz, and Micha Sharir</span>
<span class="title">On Reverse Shortest Paths in Geometric Proximity Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2022.42">10.4230/LIPIcs.ISAAC.2022.42</a>
</li>
<li>
<span class="authors">Jakob Dyrseth and Paloma T. Lima</span>
<span class="title">On the Complexity of Rainbow Vertex Colouring Diametral Path Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2022.43">10.4230/LIPIcs.ISAAC.2022.43</a>
</li>
<li>
<span class="authors">Tatsuya Akutsu, Tomoya Mori, Naotoshi Nakamura, Satoshi Kozawa, Yuhei Ueno, and Thomas N. Sato</span>
<span class="title">On the Complexity of Tree Edit Distance with Variables</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2022.44">10.4230/LIPIcs.ISAAC.2022.44</a>
</li>
<li>
<span class="authors">Sandip Das and Harmender Gahlawat</span>
<span class="title">On the Cop Number of String Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2022.45">10.4230/LIPIcs.ISAAC.2022.45</a>
</li>
<li>
<span class="authors">Naoto Ohsaka</span>
<span class="title">On the Parameterized Intractability of Determinant Maximization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2022.46">10.4230/LIPIcs.ISAAC.2022.46</a>
</li>
<li>
<span class="authors">Yusuke Kobayashi and Tatsuya Terao</span>
<span class="title">One-Face Shortest Disjoint Paths with a Deviation Terminal</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2022.47">10.4230/LIPIcs.ISAAC.2022.47</a>
</li>
<li>
<span class="authors">Eunou Lee</span>
<span class="title">Optimizing Quantum Circuit Parameters via SDP</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2022.48">10.4230/LIPIcs.ISAAC.2022.48</a>
</li>
<li>
<span class="authors">Thomas Erlebach, Kelin Luo, and Frits C.R. Spieksma</span>
<span class="title">Package Delivery Using Drones with Restricted Movement Areas</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2022.49">10.4230/LIPIcs.ISAAC.2022.49</a>
</li>
<li>
<span class="authors">Jianqi Zhou, Peihua Li, and Jiong Guo</span>
<span class="title">Parameterized Approximation Algorithms for TSP</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2022.50">10.4230/LIPIcs.ISAAC.2022.50</a>
</li>
<li>
<span class="authors">Miriam Münch, Ignaz Rutter, and Peter Stumpf</span>
<span class="title">Partial and Simultaneous Transitive Orientations via Modular Decompositions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2022.51">10.4230/LIPIcs.ISAAC.2022.51</a>
</li>
<li>
<span class="authors">Vladimir Podolskii and Nikolay V. Proskurin</span>
<span class="title">Polynomial Threshold Functions for Decision Lists</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2022.52">10.4230/LIPIcs.ISAAC.2022.52</a>
</li>
<li>
<span class="authors">Paul Lapey and Aaron Williams</span>
<span class="title">Pop & Push: Ordered Tree Iteration in 𝒪(1)-Time</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2022.53">10.4230/LIPIcs.ISAAC.2022.53</a>
</li>
<li>
<span class="authors">Kushagra Chatterjee and Prajakta Nimbhorkar</span>
<span class="title">Popular Edges with Critical Nodes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2022.54">10.4230/LIPIcs.ISAAC.2022.54</a>
</li>
<li>
<span class="authors">Yusuke Kobayashi and Ryoga Mahara</span>
<span class="title">Proportional Allocation of Indivisible Goods up to the Least Valued Good on Average</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2022.55">10.4230/LIPIcs.ISAAC.2022.55</a>
</li>
<li>
<span class="authors">Prosenjit Bose, Jean-Lou De Carufel, and Thomas Shermer</span>
<span class="title">Pursuit-Evasion in Graphs: Zombies, Lazy Zombies and a Survivor</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2022.56">10.4230/LIPIcs.ISAAC.2022.56</a>
</li>
<li>
<span class="authors">Shangqi Lu and Yufei Tao</span>
<span class="title">Range Updates and Range Sum Queries on Multidimensional Points with Monoid Weights</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2022.57">10.4230/LIPIcs.ISAAC.2022.57</a>
</li>
<li>
<span class="authors">Kevin Buchin, Bram Custers, Ivor van der Hoog, Maarten Löffler, Aleksandr Popov, Marcel Roeloffzen, and Frank Staals</span>
<span class="title">Segment Visibility Counting Queries in Polygons</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2022.58">10.4230/LIPIcs.ISAAC.2022.58</a>
</li>
<li>
<span class="authors">Rathish Das, Meng He, Eitan Kondratovsky, J. Ian Munro, Anurag Murty Naredla, and Kaiyu Wu</span>
<span class="title">Shortest Beer Path Queries in Interval Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2022.59">10.4230/LIPIcs.ISAAC.2022.59</a>
</li>
<li>
<span class="authors">Sungmin Kim, Sang-Ki Ko, and Yo-Sub Han</span>
<span class="title">Simon’s Congruence Pattern Matching</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2022.60">10.4230/LIPIcs.ISAAC.2022.60</a>
</li>
<li>
<span class="authors">Sung-Hwan Kim and Hwan-Gue Cho</span>
<span class="title">Simple Order-Isomorphic Matching Index with Expected Compact Space</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2022.61">10.4230/LIPIcs.ISAAC.2022.61</a>
</li>
<li>
<span class="authors">Frank Kammer and Johannes Meintrup</span>
<span class="title">Space-Efficient Graph Coarsening with Applications to Succinct Planar Encodings</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2022.62">10.4230/LIPIcs.ISAAC.2022.62</a>
</li>
<li>
<span class="authors">Ta-Wei Tu</span>
<span class="title">Subquadratic Weighted Matroid Intersection Under Rank Oracles</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2022.63">10.4230/LIPIcs.ISAAC.2022.63</a>
</li>
<li>
<span class="authors">Joel D. Day, Maria Kosche, Florin Manea, and Markus L. Schmid</span>
<span class="title">Subsequences with Gap Constraints: Complexity Bounds for Matching and Analysis Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2022.64">10.4230/LIPIcs.ISAAC.2022.64</a>
</li>
<li>
<span class="authors">William L. Holland</span>
<span class="title">Succinct List Indexing in Optimal Time</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2022.65">10.4230/LIPIcs.ISAAC.2022.65</a>
</li>
<li>
<span class="authors">Artur Ignatiev, Ivan Mihajlin, and Alexander Smal</span>
<span class="title">Super-Cubic Lower Bound for Generalized Karchmer-Wigderson Games</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2022.66">10.4230/LIPIcs.ISAAC.2022.66</a>
</li>
<li>
<span class="authors">Christian Rieck and Christian Scheffer</span>
<span class="title">The Dispersive Art Gallery Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2022.67">10.4230/LIPIcs.ISAAC.2022.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