<h2>LIPIcs, Volume 87, ESA 2017</h2>
<ul>
<li>
<span class="authors">Kirk Pruhs and Christian Sohler</span>
<span class="title">LIPIcs, Volume 87, ESA'17, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2017">10.4230/LIPIcs.ESA.2017</a>
</li>
<li>
<span class="authors">Kirk Pruhs and Christian Sohler</span>
<span class="title">Front Matter, Table of Contents, Preface, Programm Commitees, External Reviewers</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2017.0">10.4230/LIPIcs.ESA.2017.0</a>
</li>
<li>
<span class="authors">David P. Woodruff</span>
<span class="title">Sketching for Geometric Problems (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2017.1">10.4230/LIPIcs.ESA.2017.1</a>
</li>
<li>
<span class="authors">Peyman Afshani and Ingo van Duijn</span>
<span class="title">Permuting and Batched Geometric Lower Bounds in the I/O Model</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2017.2">10.4230/LIPIcs.ESA.2017.2</a>
</li>
<li>
<span class="authors">Peyman Afshani and Zhewei Wei</span>
<span class="title">Independent Range Sampling, Revisited</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2017.3">10.4230/LIPIcs.ESA.2017.3</a>
</li>
<li>
<span class="authors">Pankaj K. Agarwal, Natan Rubin, and Micha Sharir</span>
<span class="title">Approximate Nearest Neighbor Search Amid Higher-Dimensional Flats</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2017.4">10.4230/LIPIcs.ESA.2017.4</a>
</li>
<li>
<span class="authors">Dror Aiger, Haim Kaplan, and Micha Sharir</span>
<span class="title">Output Sensitive Algorithms for Approximate Incidences and Their Applications</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2017.5">10.4230/LIPIcs.ESA.2017.5</a>
</li>
<li>
<span class="authors">Hassene Aissi, Ali Ridha Mahjoub, and R. Ravi</span>
<span class="title">Randomized Contractions for Multiobjective Minimum Cuts</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2017.6">10.4230/LIPIcs.ESA.2017.6</a>
</li>
<li>
<span class="authors">Susanne Albers and Sebastian Schraink</span>
<span class="title">Tight Bounds for Online Coloring of Basic Graph Classes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2017.7">10.4230/LIPIcs.ESA.2017.7</a>
</li>
<li>
<span class="authors">Daniel Antunes, Claire Mathieu, and Nabil H. Mustafa</span>
<span class="title">Combinatorics of Local Search: An Optimal 4-Local Hall's Theorem for Planar Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2017.8">10.4230/LIPIcs.ESA.2017.8</a>
</li>
<li>
<span class="authors">Michael Axtmann, Sascha Witt, Daniel Ferizovic, and Peter Sanders</span>
<span class="title">In-Place Parallel Super Scalar Samplesort (IPSSSSo)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2017.9">10.4230/LIPIcs.ESA.2017.9</a>
</li>
<li>
<span class="authors">Janos Balogh, Jozsef Bekesi, Gyorgy Dosa, Leah Epstein, and Asaf Levin</span>
<span class="title">Online Bin Packing with Cardinality Constraints Resolved</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2017.10">10.4230/LIPIcs.ESA.2017.10</a>
</li>
<li>
<span class="authors">Moritz Baum, Julian Dibbelt, Dorothea Wagner, and Tobias Zündorf</span>
<span class="title">Modeling and Engineering Constrained Shortest Path Algorithms for Battery Electric Vehicles</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2017.11">10.4230/LIPIcs.ESA.2017.11</a>
</li>
<li>
<span class="authors">Amariah Becker, Philip N. Klein, and David Saulpic</span>
<span class="title">A Quasi-Polynomial-Time Approximation Scheme for Vehicle Routing on Planar and Bounded-Genus Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2017.12">10.4230/LIPIcs.ESA.2017.12</a>
</li>
<li>
<span class="authors">Kristof Berczi and Yusuke Kobayashi</span>
<span class="title">The Directed Disjoint Shortest Paths Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2017.13">10.4230/LIPIcs.ESA.2017.13</a>
</li>
<li>
<span class="authors">Stéphane Bessy, Marin Bougeret, and Jocelyn Thiebaut</span>
<span class="title">Triangle Packing in (Sparse) Tournaments: Approximation and Kernelization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2017.14">10.4230/LIPIcs.ESA.2017.14</a>
</li>
<li>
<span class="authors">Sayan Bhattacharya, Manoj Gupta, and Divyarthi Mohan</span>
<span class="title">Improved Algorithm for Dynamic b-Matching</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2017.15">10.4230/LIPIcs.ESA.2017.15</a>
</li>
<li>
<span class="authors">Philip Bille, Anders Roy Christiansen, Mikko Berggren Ettienne, and Inge Li Gørtz</span>
<span class="title">Fast Dynamic Arrays</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2017.16">10.4230/LIPIcs.ESA.2017.16</a>
</li>
<li>
<span class="authors">Vittorio Bilò and Cosimo Vinci</span>
<span class="title">On the Impact of Singleton Strategies in Congestion Games</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2017.17">10.4230/LIPIcs.ESA.2017.17</a>
</li>
<li>
<span class="authors">Marthe Bonamy, Lukasz Kowalik, Michal Pilipczuk, Arkadiusz Socala, and Marcin Wrochna</span>
<span class="title">Tight Lower Bounds for the Complexity of Multicoloring</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2017.18">10.4230/LIPIcs.ESA.2017.18</a>
</li>
<li>
<span class="authors">Thomas Bosman and Neil Olver</span>
<span class="title">Exploring the Tractability of the Capped Hose Model</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2017.19">10.4230/LIPIcs.ESA.2017.19</a>
</li>
<li>
<span class="authors">Karl Bringmann, Ralph Keusch, and Johannes Lengler</span>
<span class="title">Sampling Geometric Inhomogeneous Random Graphs in Linear Time</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2017.20">10.4230/LIPIcs.ESA.2017.20</a>
</li>
<li>
<span class="authors">Gerth Stølting Brodal and Konstantinos Mampentzidis</span>
<span class="title">Cache Oblivious Algorithms for Computing the Triplet Distance Between Trees</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2017.21">10.4230/LIPIcs.ESA.2017.21</a>
</li>
<li>
<span class="authors">Niv Buchbinder, Danny Segev, and Yevgeny Tkach</span>
<span class="title">Online Algorithms for Maximum Cardinality Matching with Edge Arrivals</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2017.22">10.4230/LIPIcs.ESA.2017.22</a>
</li>
<li>
<span class="authors">Benjamin Burton, Erin Chambers, Marc van Kreveld, Wouter Meulemans, Tim Ophelders, and Bettina Speckmann</span>
<span class="title">Computing Optimal Homotopies over a Spiked Plane with Polygonal Boundary</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2017.23">10.4230/LIPIcs.ESA.2017.23</a>
</li>
<li>
<span class="authors">T.-H. Hubert Chan, Shaofeng H.-C. Jiang, Zhihao Gavin Tang, and Xiaowei Wu</span>
<span class="title">Online Submodular Maximization Problem with Vector Packing Constraint</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2017.24">10.4230/LIPIcs.ESA.2017.24</a>
</li>
<li>
<span class="authors">Timothy M. Chan and Dimitrios Skrepetos</span>
<span class="title">Faster Approximate Diameter and Distance Oracles in Planar Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2017.25">10.4230/LIPIcs.ESA.2017.25</a>
</li>
<li>
<span class="authors">Vaggos Chatziafratis, Tim Roughgarden, and Jan Vondrak</span>
<span class="title">Stability and Recovery for Independence Systems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2017.26">10.4230/LIPIcs.ESA.2017.26</a>
</li>
<li>
<span class="authors">Peter Chini, Jonathan Kolberg, Andreas Krebs, Roland Meyer, and Prakash Saivasan</span>
<span class="title">On the Complexity of Bounded Context Switching</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2017.27">10.4230/LIPIcs.ESA.2017.27</a>
</li>
<li>
<span class="authors">Aruni Choudhary, Michael Kerber, and Sharath Raghvendra</span>
<span class="title">Improved Approximate Rips Filtrations with Shifted Integer Lattices</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2017.28">10.4230/LIPIcs.ESA.2017.28</a>
</li>
<li>
<span class="authors">Graham Cormode, Hossein Jowhari, Morteza Monemizadeh, and S. Muthukrishnan</span>
<span class="title">The Sparse Awakens: Streaming Algorithms for Matching Size Estimation in Sparse Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2017.29">10.4230/LIPIcs.ESA.2017.29</a>
</li>
<li>
<span class="authors">Marek Cygan, Lukasz Kowalik, and Arkadiusz Socala</span>
<span class="title">Improving TSP Tours Using Dynamic Programming over Tree Decompositions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2017.30">10.4230/LIPIcs.ESA.2017.30</a>
</li>
<li>
<span class="authors">Syamantak Das and Andreas Wiese</span>
<span class="title">On Minimizing the Makespan When Some Jobs Cannot Be Assigned on the Same Machine</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2017.31">10.4230/LIPIcs.ESA.2017.31</a>
</li>
<li>
<span class="authors">Constantinos Daskalakis and Yasushi Kawase</span>
<span class="title">Optimal Stopping Rules for Sequential Hypothesis Testing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2017.32">10.4230/LIPIcs.ESA.2017.32</a>
</li>
<li>
<span class="authors">William E. Devanny, Jeremy T. Fineman, Michael T. Goodrich, and Tsvi Kopelowitz</span>
<span class="title">The Online House Numbering Problem: Min-Max Online List Labeling</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2017.33">10.4230/LIPIcs.ESA.2017.33</a>
</li>
<li>
<span class="authors">Tamal K. Dey, Alfred Rossi, and Anastasios Sidiropoulos</span>
<span class="title">Temporal Clustering</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2017.34">10.4230/LIPIcs.ESA.2017.34</a>
</li>
<li>
<span class="authors">Alon Eden, Tomer Ezra, and Michal Feldman</span>
<span class="title">Pricing Social Goods</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2017.35">10.4230/LIPIcs.ESA.2017.35</a>
</li>
<li>
<span class="authors">Katherine Edwards, Irene Muzi, and Paul Wollan</span>
<span class="title">Half-Integral Linkages in Highly Connected Directed Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2017.36">10.4230/LIPIcs.ESA.2017.36</a>
</li>
<li>
<span class="authors">Tobias Friedrich, Anton Krohmer, Ralf Rothenberger, Thomas Sauerwald, and Andrew M. Sutton</span>
<span class="title">Bounds on the Satisfiability Threshold for Power Law Distributed Random SAT</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2017.37">10.4230/LIPIcs.ESA.2017.37</a>
</li>
<li>
<span class="authors">Travis Gagie, Giovanni Manzini, and Rossano Venturini</span>
<span class="title">An Encoding for Order-Preserving Matching</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2017.38">10.4230/LIPIcs.ESA.2017.38</a>
</li>
<li>
<span class="authors">Kshitij Gajjar and Jaikumar Radhakrishnan</span>
<span class="title">Distance-Preserving Subgraphs of Interval Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2017.39">10.4230/LIPIcs.ESA.2017.39</a>
</li>
<li>
<span class="authors">Pawel Gawrychowski, Nadav Krasnopolsky, Shay Mozes, and Oren Weimann</span>
<span class="title">Dispersion on Trees</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2017.40">10.4230/LIPIcs.ESA.2017.40</a>
</li>
<li>
<span class="authors">Shay Golan and Ely Porat</span>
<span class="title">Real-Time Streaming Multi-Pattern Search for Constant Alphabet</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2017.41">10.4230/LIPIcs.ESA.2017.41</a>
</li>
<li>
<span class="authors">Omer Gold and Micha Sharir</span>
<span class="title">Improved Bounds for 3SUM, k-SUM, and Linear Degeneracy</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2017.42">10.4230/LIPIcs.ESA.2017.42</a>
</li>
<li>
<span class="authors">Sreenivas Gollapudi, Kostas Kollias, Debmalya Panigrahi, and Venetia Pliatsika</span>
<span class="title">Profit Sharing and Efficiency in Utility Games</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2017.43">10.4230/LIPIcs.ESA.2017.43</a>
</li>
<li>
<span class="authors">Gramoz Goranci, Monika Henzinger, and Pan Peng</span>
<span class="title">Improved Guarantees for Vertex Sparsification in Planar Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2017.44">10.4230/LIPIcs.ESA.2017.44</a>
</li>
<li>
<span class="authors">Gramoz Goranci, Monika Henzinger, and Pan Peng</span>
<span class="title">The Power of Vertex Sparsifiers in Dynamic Graph Algorithms</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2017.45">10.4230/LIPIcs.ESA.2017.45</a>
</li>
<li>
<span class="authors">Guru Guruganesh, Jennifer Iglesias, R. Ravi, and Laura Sanita</span>
<span class="title">Single-Sink Fractionally Subadditive Network Design</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2017.46">10.4230/LIPIcs.ESA.2017.46</a>
</li>
<li>
<span class="authors">Gregory Gutin, M. S. Ramanujan, Felix Reidl, and Magnus Wahlström</span>
<span class="title">Path-Contractions, Edge Deletions and Connectivity Preservation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2017.47">10.4230/LIPIcs.ESA.2017.47</a>
</li>
<li>
<span class="authors">Monika Henzinger, Dariusz Leniowski, and Claire Mathieu</span>
<span class="title">Dynamic Clustering to Minimize the Sum of Radii</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2017.48">10.4230/LIPIcs.ESA.2017.48</a>
</li>
<li>
<span class="authors">John Hershberger, Neeraj Kumar, and Subhash Suri</span>
<span class="title">Shortest Paths in the Plane with Obstacle Violations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2017.49">10.4230/LIPIcs.ESA.2017.49</a>
</li>
<li>
<span class="authors">Jacob Holm, Giuseppe F. Italiano, Adam Karczmarz, Jakub Lacki, Eva Rotenberg, and Piotr Sankowski</span>
<span class="title">Contracting a Planar Graph Efficiently</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2017.50">10.4230/LIPIcs.ESA.2017.50</a>
</li>
<li>
<span class="authors">Sungjin Im, Benjamin Moseley, Kirk Pruhs, and Clifford Stein</span>
<span class="title">Minimizing Maximum Flow Time on Related Machines via Dynamic Posted Pricing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2017.51">10.4230/LIPIcs.ESA.2017.51</a>
</li>
<li>
<span class="authors">Haim Kaplan, Sasanka Roy, and Micha Sharir</span>
<span class="title">Finding Axis-Parallel Rectangles of Fixed Perimeter or Area Containing the Largest Number of Points</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2017.52">10.4230/LIPIcs.ESA.2017.52</a>
</li>
<li>
<span class="authors">Dominik Kempa and Dmitry Kosolobov</span>
<span class="title">LZ-End Parsing in Linear Time</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2017.53">10.4230/LIPIcs.ESA.2017.53</a>
</li>
<li>
<span class="authors">Dusan Knop, Martin Koutecky, and Matthias Mnich</span>
<span class="title">Combinatorial n-fold Integer Programming and Applications</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2017.54">10.4230/LIPIcs.ESA.2017.54</a>
</li>
<li>
<span class="authors">Gilad Kutiel and Dror Rawitz</span>
<span class="title">Local Search Algorithms for Maximum Carpool Matching</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2017.55">10.4230/LIPIcs.ESA.2017.55</a>
</li>
<li>
<span class="authors">Zhijiang Li and Norbert Zeh</span>
<span class="title">Computing Maximum Agreement Forests without Cluster Partitioning is Folly</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2017.56">10.4230/LIPIcs.ESA.2017.56</a>
</li>
<li>
<span class="authors">Daniel Lokshtanov, M. S. Ramanujan, and Saket Saurabh</span>
<span class="title">A Linear-Time Parameterized Algorithm for Node Unique Label Cover</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2017.57">10.4230/LIPIcs.ESA.2017.57</a>
</li>
<li>
<span class="authors">Tobias Maier and Peter Sanders</span>
<span class="title">Dynamic Space Efficient Hashing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2017.58">10.4230/LIPIcs.ESA.2017.58</a>
</li>
<li>
<span class="authors">Dániel Marx and Marcin Pilipczuk</span>
<span class="title">Subexponential Parameterized Algorithms for Graphs of Polynomial Growth</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2017.59">10.4230/LIPIcs.ESA.2017.59</a>
</li>
<li>
<span class="authors">Daniel Neuen and Pascal Schweitzer</span>
<span class="title">Benchmark Graphs for Practical Graph Isomorphism</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2017.60">10.4230/LIPIcs.ESA.2017.60</a>
</li>
<li>
<span class="authors">Zeev Nutov</span>
<span class="title">On the Tree Augmentation Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2017.61">10.4230/LIPIcs.ESA.2017.61</a>
</li>
<li>
<span class="authors">Alice Paul, Daniel Freund, Aaron Ferber, David B. Shmoys, and David P. Williamson</span>
<span class="title">Prize-Collecting TSP with a Budget Constraint</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2017.62">10.4230/LIPIcs.ESA.2017.62</a>
</li>
<li>
<span class="authors">Marc Roth</span>
<span class="title">Counting Restricted Homomorphisms via Möbius Inversion over Matroid Lattices</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2017.63">10.4230/LIPIcs.ESA.2017.63</a>
</li>
<li>
<span class="authors">Ori Rottenstreich, Haim Kaplan, and Avinatan Hassidim</span>
<span class="title">Clustering in Hypergraphs to Minimize Average Edge Service Time</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2017.64">10.4230/LIPIcs.ESA.2017.64</a>
</li>
<li>
<span class="authors">Thomas Schibler and Subhash Suri</span>
<span class="title">K-Dominance in Multidimensional Data: Theory and Applications</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2017.65">10.4230/LIPIcs.ESA.2017.65</a>
</li>
<li>
<span class="authors">Martin R. Schuster and Maciej Liskiewicz</span>
<span class="title">New Abilities and Limitations of Spectral Graph Bisection</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2017.66">10.4230/LIPIcs.ESA.2017.66</a>
</li>
<li>
<span class="authors">Yoshimasa Takabatake, Tomohiro I, and Hiroshi Sakamoto</span>
<span class="title">A Space-Optimal Grammar Compression</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2017.67">10.4230/LIPIcs.ESA.2017.67</a>
</li>
<li>
<span class="authors">Hisao Tamaki</span>
<span class="title">Positive-Instance Driven Dynamic Programming for Treewidth</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2017.68">10.4230/LIPIcs.ESA.2017.68</a>
</li>
<li>
<span class="authors">Antonis Thomas</span>
<span class="title">Exponential Lower Bounds for History-Based Simplex Pivot Rules on Abstract Cubes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2017.69">10.4230/LIPIcs.ESA.2017.69</a>
</li>
<li>
<span class="authors">Michael Wegner, Oskar Taubert, Alexander Schug, and Henning Meyerhenke</span>
<span class="title">Maxent-Stress Optimization of 3D Biomolecular Models</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2017.70">10.4230/LIPIcs.ESA.2017.70</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