<h2>LIPIcs, Volume 112, ESA 2018</h2>
<ul>
<li>
<span class="authors">Yossi Azar, Hannah Bast, and Grzegorz Herman</span>
<span class="title">LIPIcs, Volume 112, ESA'18, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2018">10.4230/LIPIcs.ESA.2018</a>
</li>
<li>
<span class="authors">Yossi Azar, Hannah Bast, and Grzegorz Herman</span>
<span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2018.0">10.4230/LIPIcs.ESA.2018.0</a>
</li>
<li>
<span class="authors">Sara Ahmadian, Umang Bhaskar, Laura Sanità, and Chaitanya Swamy</span>
<span class="title">Algorithms for Inverse Optimization Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2018.1">10.4230/LIPIcs.ESA.2018.1</a>
</li>
<li>
<span class="authors">Amihood Amir, Gad M. Landau, Shoshana Marcus, and Dina Sokol</span>
<span class="title">Two-Dimensional Maximal Repetitions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2018.2">10.4230/LIPIcs.ESA.2018.2</a>
</li>
<li>
<span class="authors">Sunil Arya, Guilherme D. da Fonseca, and David M. Mount</span>
<span class="title">Approximate Convex Intersection Detection with Applications to Width and Minkowski Sums</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2018.3">10.4230/LIPIcs.ESA.2018.3</a>
</li>
<li>
<span class="authors">Nicolas Auger, Vincent Jugé, Cyril Nicaud, and Carine Pivoteau</span>
<span class="title">On the Worst-Case Complexity of TimSort</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2018.4">10.4230/LIPIcs.ESA.2018.4</a>
</li>
<li>
<span class="authors">János Balogh, József Békési, György Dósa, Leah Epstein, and Asaf Levin</span>
<span class="title">A New and Improved Algorithm for Online Bin Packing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2018.5">10.4230/LIPIcs.ESA.2018.5</a>
</li>
<li>
<span class="authors">Max Bannach and Sebastian Berndt</span>
<span class="title">Practical Access to Dynamic Programming on Tree Decompositions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2018.6">10.4230/LIPIcs.ESA.2018.6</a>
</li>
<li>
<span class="authors">Luca Becchetti, Andrea Clementi, Pasin Manurangsi, Emanuele Natale, Francesco Pasquale, Prasad Raghavendra, and Luca Trevisan</span>
<span class="title">Average Whenever You Meet: Opportunistic Protocols for Community Detection</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2018.7">10.4230/LIPIcs.ESA.2018.7</a>
</li>
<li>
<span class="authors">Amariah Becker, Philip N. Klein, and David Saulpic</span>
<span class="title">Polynomial-Time Approximation Schemes for k-center, k-median, and Capacitated Vehicle Routing in Bounded Highway Dimension</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2018.8">10.4230/LIPIcs.ESA.2018.8</a>
</li>
<li>
<span class="authors">Sebastian Brandt, Seth Pettie, and Jara Uitto</span>
<span class="title">Fine-grained Lower Bounds on Cops and Robbers</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2018.9">10.4230/LIPIcs.ESA.2018.9</a>
</li>
<li>
<span class="authors">Yixin Cao, Ashutosh Rai, R. B. Sandeep, and Junjie Ye</span>
<span class="title">A Polynomial Kernel for Diamond-Free Editing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2018.10">10.4230/LIPIcs.ESA.2018.10</a>
</li>
<li>
<span class="authors">Corrie Jacobien Carstens, Michael Hamann, Ulrich Meyer, Manuel Penschuck, Hung Tran, and Dorothea Wagner</span>
<span class="title">Parallel and I/O-efficient Randomisation of Massive Networks using Global Curveball Trades</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2018.11">10.4230/LIPIcs.ESA.2018.11</a>
</li>
<li>
<span class="authors">Diptarka Chakraborty, Debarati Das, Michal Koucký, and Nitin Saurabh</span>
<span class="title">Space-Optimal Quasi-Gray Codes with Logarithmic Read Complexity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2018.12">10.4230/LIPIcs.ESA.2018.12</a>
</li>
<li>
<span class="authors">Sankardeep Chakraborty, Anish Mukherjee, Venkatesh Raman, and Srinivasa Rao Satti</span>
<span class="title">A Framework for In-place Graph Algorithms</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2018.13">10.4230/LIPIcs.ESA.2018.13</a>
</li>
<li>
<span class="authors">Cameron Chalk, Austin Luchsinger, Robert Schweller, and Tim Wylie</span>
<span class="title">Self-Assembly of Any Shape with Constant Tile Types using High Temperature</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2018.14">10.4230/LIPIcs.ESA.2018.14</a>
</li>
<li>
<span class="authors">T-H. Hubert Chan, Haotian Jiang, and Shaofeng H.-C. Jiang</span>
<span class="title">A Unified PTAS for Prize Collecting TSP and Steiner Tree Problem in Doubling Metrics</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2018.15">10.4230/LIPIcs.ESA.2018.15</a>
</li>
<li>
<span class="authors">Hsien-Chih Chang, Pawel Gawrychowski, Shay Mozes, and Oren Weimann</span>
<span class="title">Near-Optimal Distance Emulator for Planar Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2018.16">10.4230/LIPIcs.ESA.2018.16</a>
</li>
<li>
<span class="authors">Steven Chaplick, Minati De, Alexander Ravsky, and Joachim Spoerhase</span>
<span class="title">Approximation Schemes for Geometric Coverage Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2018.17">10.4230/LIPIcs.ESA.2018.17</a>
</li>
<li>
<span class="authors">Yun Kuen Cheung and Richard Cole</span>
<span class="title">Amortized Analysis of Asynchronous Price Dynamics</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2018.18">10.4230/LIPIcs.ESA.2018.18</a>
</li>
<li>
<span class="authors">Markus Chimani and Tilo Wiedera</span>
<span class="title">Cycles to the Rescue! Novel Constraints to Compute Maximum Planar Subgraphs Fast</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2018.19">10.4230/LIPIcs.ESA.2018.19</a>
</li>
<li>
<span class="authors">Rajesh Chitnis, Andreas Emil Feldmann, and Pasin Manurangsi</span>
<span class="title">Parameterized Approximation Algorithms for Bidirected Steiner Network Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2018.20">10.4230/LIPIcs.ESA.2018.20</a>
</li>
<li>
<span class="authors">Marek Cygan, Artur Czumaj, Marcin Mucha, and Piotr Sankowski</span>
<span class="title">Online Facility Location with Deletions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2018.21">10.4230/LIPIcs.ESA.2018.21</a>
</li>
<li>
<span class="authors">Nicolas Bonichon, Prosenjit Bose, Jean-Lou De Carufel, Vincent Despré, Darryl Hill, and Michiel Smid</span>
<span class="title">Improved Routing on the Delaunay Triangulation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2018.22">10.4230/LIPIcs.ESA.2018.22</a>
</li>
<li>
<span class="authors">Hu Ding and Manni Liu</span>
<span class="title">On Geometric Prototype and Applications</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2018.23">10.4230/LIPIcs.ESA.2018.23</a>
</li>
<li>
<span class="authors">Dani Dorfman, Haim Kaplan, László Kozma, Seth Pettie, and Uri Zwick</span>
<span class="title">Improved Bounds for Multipass Pairing Heaps and Path-Balanced Binary Search Trees</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2018.24">10.4230/LIPIcs.ESA.2018.24</a>
</li>
<li>
<span class="authors">Hicham El-Zein, Meng He, J. Ian Munro, and Bryce Sandlund</span>
<span class="title">Improved Time and Space Bounds for Dynamic Range Mode</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2018.25">10.4230/LIPIcs.ESA.2018.25</a>
</li>
<li>
<span class="authors">Matthias Englert, David Mezlaf, and Matthias Westermann</span>
<span class="title">Online Makespan Scheduling with Job Migration on Uniform Machines</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2018.26">10.4230/LIPIcs.ESA.2018.26</a>
</li>
<li>
<span class="authors">Alon Eden, Michal Feldman, Amos Fiat, and Tzahi Taub</span>
<span class="title">Truthful Prompt Scheduling for Minimizing Sum of Completion Times</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2018.27">10.4230/LIPIcs.ESA.2018.27</a>
</li>
<li>
<span class="authors">Johannes K. Fichte, Markus Hecher, Stefan Woltran, and Markus Zisser</span>
<span class="title">Weighted Model Counting on the GPU by Exploiting Small Treewidth</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2018.28">10.4230/LIPIcs.ESA.2018.28</a>
</li>
<li>
<span class="authors">Arnold Filtser and Ofer Neiman</span>
<span class="title">Light Spanners for High Dimensional Norms via Stochastic Decompositions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2018.29">10.4230/LIPIcs.ESA.2018.29</a>
</li>
<li>
<span class="authors">Fedor V. Fomin, Petr A. Golovach, and Jean-Florent Raymond</span>
<span class="title">On the Tractability of Optimization Problems on H-Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2018.30">10.4230/LIPIcs.ESA.2018.30</a>
</li>
<li>
<span class="authors">Fedor V. Fomin, Fahad Panolan, M. S. Ramanujan, and Saket Saurabh</span>
<span class="title">On the Optimality of Pseudo-polynomial Algorithms for Integer Programming</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2018.31">10.4230/LIPIcs.ESA.2018.31</a>
</li>
<li>
<span class="authors">Waldo Gálvez, José A. Soto, and José Verschae</span>
<span class="title">Symmetry Exploitation for Online Machine Covering with Bounded Migration</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2018.32">10.4230/LIPIcs.ESA.2018.32</a>
</li>
<li>
<span class="authors">Michal Ganczorz, Pawel Gawrychowski, Artur Jez, and Tomasz Kociumaka</span>
<span class="title">Edit Distance with Block Operations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2018.33">10.4230/LIPIcs.ESA.2018.33</a>
</li>
<li>
<span class="authors">Shilpa Garg and Tobias Mömke</span>
<span class="title">A QPTAS for Gapless MEC</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2018.34">10.4230/LIPIcs.ESA.2018.34</a>
</li>
<li>
<span class="authors">Arijit Ghosh, Sudeshna Kolay, and Gopinath Mishra</span>
<span class="title">FPT Algorithms for Embedding into Low Complexity Graphic Metrics</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2018.35">10.4230/LIPIcs.ESA.2018.35</a>
</li>
<li>
<span class="authors">Dimitrios Gkenosis, Nathaniel Grammel, Lisa Hellerstein, and Devorah Kletenik</span>
<span class="title">The Stochastic Score Classification Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2018.36">10.4230/LIPIcs.ESA.2018.36</a>
</li>
<li>
<span class="authors">Isaac Goldstein, Moshe Lewenstein, and Ely Porat</span>
<span class="title">Improved Space-Time Tradeoffs for kSUM</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2018.37">10.4230/LIPIcs.ESA.2018.37</a>
</li>
<li>
<span class="authors">Mordecai Golin, John Iacono, Stefan Langerman, J. Ian Munro, and Yakov Nekrich</span>
<span class="title">Dynamic Trees with Almost-Optimal Access Cost</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2018.38">10.4230/LIPIcs.ESA.2018.38</a>
</li>
<li>
<span class="authors">Gramoz Goranci, Monika Henzinger, and Dariusz Leniowski</span>
<span class="title">A Tree Structure For Dynamic Facility Location</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2018.39">10.4230/LIPIcs.ESA.2018.39</a>
</li>
<li>
<span class="authors">Gramoz Goranci, Monika Henzinger, and Pan Peng</span>
<span class="title">Dynamic Effective Resistances and Approximate Schur Complement on Separable Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2018.40">10.4230/LIPIcs.ESA.2018.40</a>
</li>
<li>
<span class="authors">Mayank Goswami, Dzejla Medjedovic, Emina Mekic, and Prashant Pandey</span>
<span class="title">Buffered Count-Min Sketch on SSD: Theory and Experiments</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2018.41">10.4230/LIPIcs.ESA.2018.41</a>
</li>
<li>
<span class="authors">Alexander van der Grinten, Elisabetta Bergamini, Oded Green, David A. Bader, and Henning Meyerhenke</span>
<span class="title">Scalable Katz Ranking Computation in Large Static and Dynamic Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2018.42">10.4230/LIPIcs.ESA.2018.42</a>
</li>
<li>
<span class="authors">Roberto Grossi and Luca Versari</span>
<span class="title">Round-Hashing for Data Storage: Distributed Servers and External-Memory Tables</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2018.43">10.4230/LIPIcs.ESA.2018.43</a>
</li>
<li>
<span class="authors">Yan Gu, Yihan Sun, and Guy E. Blelloch</span>
<span class="title">Algorithmic Building Blocks for Asymmetric Memories</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2018.44">10.4230/LIPIcs.ESA.2018.44</a>
</li>
<li>
<span class="authors">Xiaoyu He, Neng Huang, and Xiaoming Sun</span>
<span class="title">On the Decision Tree Complexity of String Matching</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2018.45">10.4230/LIPIcs.ESA.2018.45</a>
</li>
<li>
<span class="authors">Jacob Holm, Giuseppe F. Italiano, Adam Karczmarz, Jakub Lacki, and Eva Rotenberg</span>
<span class="title">Decremental SPQR-trees for Planar Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2018.46">10.4230/LIPIcs.ESA.2018.46</a>
</li>
<li>
<span class="authors">Bart M. P. Jansen and Jesper Nederlof</span>
<span class="title">Computing the Chromatic Number Using Graph Decompositions via Matrix Rank</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2018.47">10.4230/LIPIcs.ESA.2018.47</a>
</li>
<li>
<span class="authors">Bart M. P. Jansen and Astrid Pieterse</span>
<span class="title">Polynomial Kernels for Hitting Forbidden Minors under Structural Parameterizations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2018.48">10.4230/LIPIcs.ESA.2018.48</a>
</li>
<li>
<span class="authors">Michael Jarret, Stacey Jeffery, Shelby Kimmel, and Alvaro Piedrafita</span>
<span class="title">Quantum Algorithms for Connectivity and Related Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2018.49">10.4230/LIPIcs.ESA.2018.49</a>
</li>
<li>
<span class="authors">Vít Jelínek, Michal Opler, and Pavel Valtr</span>
<span class="title">Generalized Coloring of Permutations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2018.50">10.4230/LIPIcs.ESA.2018.50</a>
</li>
<li>
<span class="authors">Iyad Kanj, Christian Komusiewicz, Manuel Sorge, and Erik Jan van Leeuwen</span>
<span class="title">Solving Partition Problems Almost Always Requires Pushing Many Vertices Around</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2018.51">10.4230/LIPIcs.ESA.2018.51</a>
</li>
<li>
<span class="authors">Dominik Kempa, Alberto Policriti, Nicola Prezza, and Eva Rotenberg</span>
<span class="title">String Attractors: Verification and Optimization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2018.52">10.4230/LIPIcs.ESA.2018.52</a>
</li>
<li>
<span class="authors">Viatcheslav Korenwein, André Nichterlein, Rolf Niedermeier, and Philipp Zschoche</span>
<span class="title">Data Reduction for Maximum Matching on Real-World Graphs: Theory and Experiments</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2018.53">10.4230/LIPIcs.ESA.2018.53</a>
</li>
<li>
<span class="authors">Lucas Boczkowski, Amos Korman, and Yoav Rodeh</span>
<span class="title">Searching a Tree with Permanently Noisy Advice</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2018.54">10.4230/LIPIcs.ESA.2018.54</a>
</li>
<li>
<span class="authors">Stefan Kratsch and Florian Nelles</span>
<span class="title">Efficient and Adaptive Parameterized Algorithms on Modular Decompositions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2018.55">10.4230/LIPIcs.ESA.2018.55</a>
</li>
<li>
<span class="authors">Marvin Künnemann</span>
<span class="title">On Nondeterministic Derandomization of Freivalds' Algorithm: Consequences, Avenues and Algorithmic Progress</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2018.56">10.4230/LIPIcs.ESA.2018.56</a>
</li>
<li>
<span class="authors">Euiwoong Lee and Sahil Singla</span>
<span class="title">Optimal Online Contention Resolution Schemes via Ex-Ante Prophet Inequalities</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2018.57">10.4230/LIPIcs.ESA.2018.57</a>
</li>
<li>
<span class="authors">Umang Bhaskar and Phani Raj Lolakapuri</span>
<span class="title">Equilibrium Computation in Atomic Splittable Routing Games</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2018.58">10.4230/LIPIcs.ESA.2018.58</a>
</li>
<li>
<span class="authors">Giorgio Lucarelli, Benjamin Moseley, Nguyen Kim Thang, Abhinav Srivastav, and Denis Trystram</span>
<span class="title">Online Non-Preemptive Scheduling to Minimize Weighted Flow-time on Unrelated Machines</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2018.59">10.4230/LIPIcs.ESA.2018.59</a>
</li>
<li>
<span class="authors">Tung Mai and Vijay V. Vazirani</span>
<span class="title">Finding Stable Matchings That Are Robust to Errors in the Input</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2018.60">10.4230/LIPIcs.ESA.2018.60</a>
</li>
<li>
<span class="authors">Barnaby Martin, Daniël Paulusma, and Erik Jan van Leeuwen</span>
<span class="title">Disconnected Cuts in Claw-free Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2018.61">10.4230/LIPIcs.ESA.2018.61</a>
</li>
<li>
<span class="authors">Michael Matheny and Jeff M. Phillips</span>
<span class="title">Practical Low-Dimensional Halfspace Range Space Sampling</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2018.62">10.4230/LIPIcs.ESA.2018.62</a>
</li>
<li>
<span class="authors">J. Ian Munro and Sebastian Wild</span>
<span class="title">Nearly-Optimal Mergesorts: Fast, Practical Sorting Methods That Optimally Adapt to Existing Runs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2018.63">10.4230/LIPIcs.ESA.2018.63</a>
</li>
<li>
<span class="authors">Nabil H. Mustafa and Saurabh Ray</span>
<span class="title">On a Problem of Danzer</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2018.64">10.4230/LIPIcs.ESA.2018.64</a>
</li>
<li>
<span class="authors">Michal Pilipczuk, Erik Jan van Leeuwen, and Andreas Wiese</span>
<span class="title">Quasi-Polynomial Time Approximation Schemes for Packing and Covering Problems in Planar Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2018.65">10.4230/LIPIcs.ESA.2018.65</a>
</li>
<li>
<span class="authors">Gábor Ivanyos, Anupam Prakash, and Miklos Santha</span>
<span class="title">On Learning Linear Functions from Subset and Its Applications in Quantum Computing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2018.66">10.4230/LIPIcs.ESA.2018.66</a>
</li>
<li>
<span class="authors">Jean-Daniel Boissonnat, Siddharth Pritam, and Divyansh Pareek</span>
<span class="title">Strong Collapse for Persistence</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2018.67">10.4230/LIPIcs.ESA.2018.67</a>
</li>
<li>
<span class="authors">Maximilian Probst</span>
<span class="title">On the Complexity of the (Approximate) Nearest Colored Node Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2018.68">10.4230/LIPIcs.ESA.2018.68</a>
</li>
<li>
<span class="authors">Rajiv Raman and Saurabh Ray</span>
<span class="title">Planar Support for Non-piercing Regions and Applications</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2018.69">10.4230/LIPIcs.ESA.2018.69</a>
</li>
<li>
<span class="authors">Daniel R. Schmidt, Bernd Zey, and François Margot</span>
<span class="title">An Exact Algorithm for the Steiner Forest Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2018.70">10.4230/LIPIcs.ESA.2018.70</a>
</li>
<li>
<span class="authors">Michael Dinitz, Michael Schapira, and Gal Shahaf</span>
<span class="title">Large Low-Diameter Graphs are Good Expanders</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2018.71">10.4230/LIPIcs.ESA.2018.71</a>
</li>
<li>
<span class="authors">Shay Solomon and Nicole Wein</span>
<span class="title">Improved Dynamic Graph Coloring</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2018.72">10.4230/LIPIcs.ESA.2018.72</a>
</li>
<li>
<span class="authors">Bo Zhou, Yi-Jen Chiang, and Chee Yap</span>
<span class="title">Soft Subdivision Motion Planning for Complex Planar Robots</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2018.73">10.4230/LIPIcs.ESA.2018.73</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