<h2>LIPIcs, Volume 173, ESA 2020</h2>
<ul>
<li>
<span class="authors">Fabrizio Grandoni, Grzegorz Herman, and Peter Sanders</span>
<span class="title">LIPIcs, Volume 173, ESA 2020, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2020">10.4230/LIPIcs.ESA.2020</a>
</li>
<li>
<span class="authors">Fabrizio Grandoni, Grzegorz Herman, and Peter Sanders</span>
<span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2020.0">10.4230/LIPIcs.ESA.2020.0</a>
</li>
<li>
<span class="authors">A. Karim Abu-Affash, Sujoy Bhore, Paz Carmi, and Joseph S. B. Mitchell</span>
<span class="title">Planar Bichromatic Bottleneck Spanning Trees</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2020.1">10.4230/LIPIcs.ESA.2020.1</a>
</li>
<li>
<span class="authors">Umut A. Acar, Daniel Anderson, Guy E. Blelloch, Laxman Dhulipala, and Sam Westrick</span>
<span class="title">Parallel Batch-Dynamic Trees via Change Propagation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2020.2">10.4230/LIPIcs.ESA.2020.2</a>
</li>
<li>
<span class="authors">Ramtin Afshar, Michael T. Goodrich, Pedro Matias, and Martha C. Osegueda</span>
<span class="title">Reconstructing Biological and Digital Phylogenetic Trees in Parallel</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2020.3">10.4230/LIPIcs.ESA.2020.3</a>
</li>
<li>
<span class="authors">Reyan Ahmed, Faryad Darabi Sahneh, Keaton Hamm, Stephen Kobourov, and Richard Spence</span>
<span class="title">Kruskal-Based Approximation Algorithm for the Multi-Level Steiner Tree Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2020.4">10.4230/LIPIcs.ESA.2020.4</a>
</li>
<li>
<span class="authors">Amihood Amir, Itai Boneh, Michael Itzhaki, and Eitan Kondratovsky</span>
<span class="title">Analysis of the Period Recovery Error Bound</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2020.5">10.4230/LIPIcs.ESA.2020.5</a>
</li>
<li>
<span class="authors">Eugenio Angriman, Maria Predari, Alexander van der Grinten, and Henning Meyerhenke</span>
<span class="title">Approximation of the Diagonal of a Laplacian’s Pseudoinverse for Complex Network Analysis</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2020.6">10.4230/LIPIcs.ESA.2020.6</a>
</li>
<li>
<span class="authors">Esther M. Arkin, Rathish Das, Jie Gao, Mayank Goswami, Joseph S. B. Mitchell, Valentin Polishchuk, and Csaba D. Tóth</span>
<span class="title">Cutting Polygons into Small Pieces with Chords: Laser-Based Localization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2020.7">10.4230/LIPIcs.ESA.2020.7</a>
</li>
<li>
<span class="authors">Yossi Azar, Ashish Chiplunkar, Shay Kutten, and Noam Touitou</span>
<span class="title">Set Cover with Delay - Clairvoyance Is Not Required</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2020.8">10.4230/LIPIcs.ESA.2020.8</a>
</li>
<li>
<span class="authors">Sayan Bandyapadhyay</span>
<span class="title">Improved Bounds for Metric Capacitated Covering Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2020.9">10.4230/LIPIcs.ESA.2020.9</a>
</li>
<li>
<span class="authors">Amotz Bar-Noy, Keerti Choudhary, Avi Cohen, David Peleg, and Dror Rawitz</span>
<span class="title">Minimum Neighboring Degree Realization in Graphs and Trees</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2020.10">10.4230/LIPIcs.ESA.2020.10</a>
</li>
<li>
<span class="authors">Siddharth Barman, Umang Bhaskar, Anand Krishna, and Ranjani G. Sundaram</span>
<span class="title">Tight Approximation Algorithms for p-Mean Welfare Under Subadditive Valuations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2020.11">10.4230/LIPIcs.ESA.2020.11</a>
</li>
<li>
<span class="authors">Surender Baswana, Shiv Gupta, and Till Knollmann</span>
<span class="title">Mincut Sensitivity Data Structures for the Insertion of an Edge</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2020.12">10.4230/LIPIcs.ESA.2020.12</a>
</li>
<li>
<span class="authors">Jesse Beisegel, Ekkehard Köhler, Robert Scheffler, and Martin Strehler</span>
<span class="title">Linear Time LexDFS on Chordal Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2020.13">10.4230/LIPIcs.ESA.2020.13</a>
</li>
<li>
<span class="authors">Rémy Belmonte, Eun Jung Kim, Michael Lampis, Valia Mitsou, and Yota Otachi</span>
<span class="title">Grundy Distinguishes Treewidth from Pathwidth</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2020.14">10.4230/LIPIcs.ESA.2020.14</a>
</li>
<li>
<span class="authors">Jason W. Bentley, Daniel Gibney, and Sharma V. Thankachan</span>
<span class="title">On the Complexity of BWT-Runs Minimization via Alphabet Reordering</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2020.15">10.4230/LIPIcs.ESA.2020.15</a>
</li>
<li>
<span class="authors">Petra Berenbrink, David Hammer, Dominik Kaaser, Ulrich Meyer, Manuel Penschuck, and Hung Tran</span>
<span class="title">Simulating Population Protocols in Sub-Constant Time per Interaction</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2020.16">10.4230/LIPIcs.ESA.2020.16</a>
</li>
<li>
<span class="authors">Daniel Bertschinger, Johannes Lengler, Anders Martinsson, Robert Meier, Angelika Steger, Miloš Trujić, and Emo Welzl</span>
<span class="title">An Optimal Decentralized (Δ + 1)-Coloring Algorithm</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2020.17">10.4230/LIPIcs.ESA.2020.17</a>
</li>
<li>
<span class="authors">Anup Bhattacharya, Jan Eube, Heiko Röglin, and Melanie Schmidt</span>
<span class="title">Noisy, Greedy and Not so Greedy k-Means++</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2020.18">10.4230/LIPIcs.ESA.2020.18</a>
</li>
<li>
<span class="authors">Sujoy Bhore, Guangping Li, and Martin Nöllenburg</span>
<span class="title">An Algorithmic Study of Fully Dynamic Independent Sets for Map Labeling</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2020.19">10.4230/LIPIcs.ESA.2020.19</a>
</li>
<li>
<span class="authors">Johannes Blum and Sabine Storandt</span>
<span class="title">Lower Bounds and Approximation Algorithms for Search Space Sizes in Contraction Hierarchies</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2020.20">10.4230/LIPIcs.ESA.2020.20</a>
</li>
<li>
<span class="authors">Thomas Bläsius, Tobias Friedrich, and Martin Schirneck</span>
<span class="title">The Minimization of Random Hypergraphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2020.21">10.4230/LIPIcs.ESA.2020.21</a>
</li>
<li>
<span class="authors">Jan Bok, Nikola Jedlic̆ková, Barnaby Martin, Daniël Paulusma, and Siani Smith</span>
<span class="title">Acyclic, Star and Injective Colouring: A Complexity Picture for H-Free Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2020.22">10.4230/LIPIcs.ESA.2020.22</a>
</li>
<li>
<span class="authors">Édouard Bonnet, Stéphan Thomassé, Xuan Thang Tran, and Rémi Watrigant</span>
<span class="title">An Algorithmic Weakening of the Erdős-Hajnal Conjecture</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2020.23">10.4230/LIPIcs.ESA.2020.23</a>
</li>
<li>
<span class="authors">Nicolas Bousquet, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Paul Ouvrard, Akira Suzuki, and Kunihiro Wasa</span>
<span class="title">Reconfiguration of Spanning Trees with Many or Few Leaves</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2020.24">10.4230/LIPIcs.ESA.2020.24</a>
</li>
<li>
<span class="authors">Karl Bringmann, Marvin Künnemann, and André Nusser</span>
<span class="title">When Lipschitz Walks Your Dog: Algorithm Engineering of the Discrete Fréchet Distance Under Translation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2020.25">10.4230/LIPIcs.ESA.2020.25</a>
</li>
<li>
<span class="authors">Peter A. Brooksbank, Yinan Li, Youming Qiao, and James B. Wilson</span>
<span class="title">Improved Algorithms for Alternating Matrix Space Isometry: From Theory to Practice</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2020.26">10.4230/LIPIcs.ESA.2020.26</a>
</li>
<li>
<span class="authors">Kevin Buchin, Sariel Har-Peled, and Dániel Oláh</span>
<span class="title">Sometimes Reliable Spanners of Almost Linear Size</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2020.27">10.4230/LIPIcs.ESA.2020.27</a>
</li>
<li>
<span class="authors">Parinya Chalermsook and Wanchote Po Jiamjitrak</span>
<span class="title">New Binary Search Tree Bounds via Geometric Inversions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2020.28">10.4230/LIPIcs.ESA.2020.28</a>
</li>
<li>
<span class="authors">Timothy M. Chan and Qizheng He</span>
<span class="title">More on Change-Making and Related Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2020.29">10.4230/LIPIcs.ESA.2020.29</a>
</li>
<li>
<span class="authors">Karthekeyan Chandrasekaran, Elena Grigorescu, Gabriel Istrate, Shubhang Kulkarni, Young-San Lin, and Minshen Zhu</span>
<span class="title">The Maximum Binary Tree Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2020.30">10.4230/LIPIcs.ESA.2020.30</a>
</li>
<li>
<span class="authors">Panagiotis Charalampopoulos and Adam Karczmarz</span>
<span class="title">Single-Source Shortest Paths and Strong Connectivity in Dynamic Planar Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2020.31">10.4230/LIPIcs.ESA.2020.31</a>
</li>
<li>
<span class="authors">Panagiotis Charalampopoulos, Jakub Radoszewski, Wojciech Rytter, Tomasz Waleń, and Wiktor Zuba</span>
<span class="title">The Number of Repetitions in 2D-Strings</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2020.32">10.4230/LIPIcs.ESA.2020.32</a>
</li>
<li>
<span class="authors">Lin Chen, Martin Koutecký, Lei Xu, and Weidong Shi</span>
<span class="title">New Bounds on Augmenting Steps of Block-Structured Integer Programs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2020.33">10.4230/LIPIcs.ESA.2020.33</a>
</li>
<li>
<span class="authors">Man-Kwun Chiu, Matias Korman, Martin Suderland, and Takeshi Tokuyama</span>
<span class="title">Distance Bounds for High Dimensional Consistent Digital Rays and 2-D Partially-Consistent Digital Rays</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2020.34">10.4230/LIPIcs.ESA.2020.34</a>
</li>
<li>
<span class="authors">Maria Chudnovsky, Jason King, Michał Pilipczuk, Paweł Rzążewski, and Sophie Spirkl</span>
<span class="title">Finding Large H-Colorable Subgraphs in Hereditary Graph Classes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2020.35">10.4230/LIPIcs.ESA.2020.35</a>
</li>
<li>
<span class="authors">Philipp Czerner and Harald Räcke</span>
<span class="title">Compact Oblivious Routing in Weighted Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2020.36">10.4230/LIPIcs.ESA.2020.36</a>
</li>
<li>
<span class="authors">Shichuan Deng, Jian Li, and Yuval Rabani</span>
<span class="title">Approximation Algorithms for Clustering with Dynamic Points</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2020.37">10.4230/LIPIcs.ESA.2020.37</a>
</li>
<li>
<span class="authors">Hu Ding</span>
<span class="title">A Sub-Linear Time Framework for Geometric Optimization with Outliers in High Dimensions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2020.38">10.4230/LIPIcs.ESA.2020.38</a>
</li>
<li>
<span class="authors">Patrick Dinklage, Johannes Fischer, Alexander Herlez, Tomasz Kociumaka, and Florian Kurpicz</span>
<span class="title">Practical Performance of Space Efficient Data Structures for Longest Common Extensions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2020.39">10.4230/LIPIcs.ESA.2020.39</a>
</li>
<li>
<span class="authors">Jan Dreier, Philipp Kuinke, and Peter Rossmanith</span>
<span class="title">First-Order Model-Checking in Random Graphs and Complex Networks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2020.40">10.4230/LIPIcs.ESA.2020.40</a>
</li>
<li>
<span class="authors">Franziska Eberle, Nicole Megow, and Kevin Schewior</span>
<span class="title">Optimally Handling Commitment Issues in Online Throughput Maximization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2020.41">10.4230/LIPIcs.ESA.2020.41</a>
</li>
<li>
<span class="authors">Eduard Eiben and William Lochet</span>
<span class="title">A Polynomial Kernel for Line Graph Deletion</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2020.42">10.4230/LIPIcs.ESA.2020.42</a>
</li>
<li>
<span class="authors">Friedrich Eisenbrand and Moritz Venzin</span>
<span class="title">Approximate CVP_p in Time 2^{0.802 n}</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2020.43">10.4230/LIPIcs.ESA.2020.43</a>
</li>
<li>
<span class="authors">Yaron Fairstein, Ariel Kulik, Joseph (Seffi) Naor, Danny Raz, and Hadas Shachnai</span>
<span class="title">A (1-e^{-1}-ε)-Approximation for the Monotone Submodular Multiple Knapsack Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2020.44">10.4230/LIPIcs.ESA.2020.44</a>
</li>
<li>
<span class="authors">Chenglin Fan and Benjamin Raichel</span>
<span class="title">Linear Expected Complexity for Directional and Multiplicative Voronoi Diagrams</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2020.45">10.4230/LIPIcs.ESA.2020.45</a>
</li>
<li>
<span class="authors">Andreas Emil Feldmann and David Saulpic</span>
<span class="title">Polynomial Time Approximation Schemes for Clustering in Low Highway Dimension Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2020.46">10.4230/LIPIcs.ESA.2020.46</a>
</li>
<li>
<span class="authors">Alejandro Flores-Velazco and David M. Mount</span>
<span class="title">Coresets for the Nearest-Neighbor Rule</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2020.47">10.4230/LIPIcs.ESA.2020.47</a>
</li>
<li>
<span class="authors">Fedor V. Fomin and Petr A. Golovach</span>
<span class="title">Kernelization of Whitney Switches</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2020.48">10.4230/LIPIcs.ESA.2020.48</a>
</li>
<li>
<span class="authors">Fedor V. Fomin and Petr A. Golovach</span>
<span class="title">Subexponential Parameterized Algorithms and Kernelization on Almost Chordal Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2020.49">10.4230/LIPIcs.ESA.2020.49</a>
</li>
<li>
<span class="authors">Fedor V. Fomin, Petr Golovach, Pranabendu Misra, and M. S. Ramanujan</span>
<span class="title">On the Complexity of Recovering Incidence Matrices</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2020.50">10.4230/LIPIcs.ESA.2020.50</a>
</li>
<li>
<span class="authors">Fedor V. Fomin, Petr A. Golovach, Giannos Stamoulis, and Dimitrios M. Thilikos</span>
<span class="title">An Algorithmic Meta-Theorem for Graph Modification to Planarity and FOL</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2020.51">10.4230/LIPIcs.ESA.2020.51</a>
</li>
<li>
<span class="authors">Zachary Friggstad and Chaitanya Swamy</span>
<span class="title">A Constant-Factor Approximation for Directed Latency in Quasi-Polynomial Time</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2020.52">10.4230/LIPIcs.ESA.2020.52</a>
</li>
<li>
<span class="authors">Henry Förster and Michael Kaufmann</span>
<span class="title">On Compact RAC Drawings</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2020.53">10.4230/LIPIcs.ESA.2020.53</a>
</li>
<li>
<span class="authors">Younan Gao, Meng He, and Yakov Nekrich</span>
<span class="title">Fast Preprocessing for Optimal Orthogonal Range Reporting and Range Successor with Applications to Text Indexing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2020.54">10.4230/LIPIcs.ESA.2020.54</a>
</li>
<li>
<span class="authors">Naveen Garg and Nikhil Kumar</span>
<span class="title">Dual Half-Integrality for Uncrossable Cut Cover and Its Application to Maximum Half-Integral Flow</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2020.55">10.4230/LIPIcs.ESA.2020.55</a>
</li>
<li>
<span class="authors">Martin Held and Stefan de Lorenzo</span>
<span class="title">An Efficient, Practical Algorithm and Implementation for Computing Multiplicatively Weighted Voronoi Diagrams</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2020.56">10.4230/LIPIcs.ESA.2020.56</a>
</li>
<li>
<span class="authors">Monika Henzinger and Sagar Kale</span>
<span class="title">Fully-Dynamic Coresets</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2020.57">10.4230/LIPIcs.ESA.2020.57</a>
</li>
<li>
<span class="authors">Monika Henzinger, Shahbaz Khan, Richard Paul, and Christian Schulz</span>
<span class="title">Dynamic Matching Algorithms in Practice</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2020.58">10.4230/LIPIcs.ESA.2020.58</a>
</li>
<li>
<span class="authors">Monika Henzinger, Alexander Noe, Christian Schulz, and Darren Strash</span>
<span class="title">Finding All Global Minimum Cuts in Practice</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2020.59">10.4230/LIPIcs.ESA.2020.59</a>
</li>
<li>
<span class="authors">Eva-Maria C. Hols, Stefan Kratsch, and Astrid Pieterse</span>
<span class="title">Approximate Turing Kernelization for Problems Parameterized by Treewidth</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2020.60">10.4230/LIPIcs.ESA.2020.60</a>
</li>
<li>
<span class="authors">Gary Hoppenworth, Jason W. Bentley, Daniel Gibney, and Sharma V. Thankachan</span>
<span class="title">The Fine-Grained Complexity of Median and Center String Problems Under Edit Distance</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2020.61">10.4230/LIPIcs.ESA.2020.61</a>
</li>
<li>
<span class="authors">Tanmay Inamdar and Kasturi Varadarajan</span>
<span class="title">Capacitated Sum-Of-Radii Clustering: An FPT Approximation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2020.62">10.4230/LIPIcs.ESA.2020.62</a>
</li>
<li>
<span class="authors">Bart M. P. Jansen and Michał Włodarczyk</span>
<span class="title">Optimal Polynomial-Time Compression for Boolean Max CSP</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2020.63">10.4230/LIPIcs.ESA.2020.63</a>
</li>
<li>
<span class="authors">Mamadou Moustapha Kanté, Christophe Paul, and Dimitrios M. Thilikos</span>
<span class="title">A Linear Fixed Parameter Tractable Algorithm for Connected Pathwidth</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2020.64">10.4230/LIPIcs.ESA.2020.64</a>
</li>
<li>
<span class="authors">Tomohiro Koana, Christian Komusiewicz, and Frank Sommer</span>
<span class="title">Exploiting c-Closure in Kernelization Algorithms for Graph Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2020.65">10.4230/LIPIcs.ESA.2020.65</a>
</li>
<li>
<span class="authors">Łukasz Kowalik, Shaohua Li, Wojciech Nadara, Marcin Smulewicz, and Magnus Wahlström</span>
<span class="title">Many Visits TSP Revisited</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2020.66">10.4230/LIPIcs.ESA.2020.66</a>
</li>
<li>
<span class="authors">Hung Le and Shay Solomon</span>
<span class="title">Light Euclidean Spanners with Steiner Points</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2020.67">10.4230/LIPIcs.ESA.2020.67</a>
</li>
<li>
<span class="authors">Victor Lecomte and Omri Weinstein</span>
<span class="title">Settling the Relationship Between Wilber’s Bounds for Dynamic Optimality</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2020.68">10.4230/LIPIcs.ESA.2020.68</a>
</li>
<li>
<span class="authors">Lily Li and Aleksandar Nikolov</span>
<span class="title">On the Computational Complexity of Linear Discrepancy</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2020.69">10.4230/LIPIcs.ESA.2020.69</a>
</li>
<li>
<span class="authors">Bogdan-Adrian Manghiuc, Pan Peng, and He Sun</span>
<span class="title">Augmenting the Algebraic Connectivity of Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2020.70">10.4230/LIPIcs.ESA.2020.70</a>
</li>
<li>
<span class="authors">Dániel Marx</span>
<span class="title">Chordless Cycle Packing Is Fixed-Parameter Tractable</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2020.71">10.4230/LIPIcs.ESA.2020.71</a>
</li>
<li>
<span class="authors">Dániel Marx and R. B. Sandeep</span>
<span class="title">Incompressibility of H-Free Edge Modification Problems: Towards a Dichotomy</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2020.72">10.4230/LIPIcs.ESA.2020.72</a>
</li>
<li>
<span class="authors">Zeev Nutov</span>
<span class="title">Approximating k-Connected m-Dominating Sets</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2020.73">10.4230/LIPIcs.ESA.2020.73</a>
</li>
<li>
<span class="authors">Karolina Okrasa, Marta Piecyk, and Paweł Rzążewski</span>
<span class="title">Full Complexity Classification of the List Homomorphism Problem for Bounded-Treewidth Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2020.74">10.4230/LIPIcs.ESA.2020.74</a>
</li>
<li>
<span class="authors">Georg Osang, Mael Rouxel-Labbé, and Monique Teillaud</span>
<span class="title">Generalizing CGAL Periodic Delaunay Triangulations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2020.75">10.4230/LIPIcs.ESA.2020.75</a>
</li>
<li>
<span class="authors">Ioannis Panagiotas and Bora Uçar</span>
<span class="title">Engineering Fast Almost Optimal Algorithms for Bipartite Graph Matching</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2020.76">10.4230/LIPIcs.ESA.2020.76</a>
</li>
<li>
<span class="authors">Jakub Radoszewski and Juliusz Straszyński</span>
<span class="title">Efficient Computation of 2-Covers of a String</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2020.77">10.4230/LIPIcs.ESA.2020.77</a>
</li>
<li>
<span class="authors">Rajiv Raman and Saurabh Ray</span>
<span class="title">Improved Approximation Algorithm for Set Multicover with Non-Piercing Regions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2020.78">10.4230/LIPIcs.ESA.2020.78</a>
</li>
<li>
<span class="authors">Hanlin Ren</span>
<span class="title">Improved Distance Sensitivity Oracles with Subcubic Preprocessing Time</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2020.79">10.4230/LIPIcs.ESA.2020.79</a>
</li>
<li>
<span class="authors">Philipp Schepper</span>
<span class="title">Fine-Grained Complexity of Regular Expression Pattern Matching and Membership</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2020.80">10.4230/LIPIcs.ESA.2020.80</a>
</li>
<li>
<span class="authors">Ben Strasser, Dorothea Wagner, and Tim Zeitz</span>
<span class="title">Space-Efficient, Fast and Exact Routing in Time-Dependent Road Networks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2020.81">10.4230/LIPIcs.ESA.2020.81</a>
</li>
<li>
<span class="authors">Hanrui Zhang</span>
<span class="title">Improved Prophet Inequalities for Combinatorial Welfare Maximization with (Approximately) Subadditive Agents</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2020.82">10.4230/LIPIcs.ESA.2020.82</a>
</li>
<li>
<span class="authors">Xianghui Zhong</span>
<span class="title">On the Approximation Ratio of the k-Opt and Lin-Kernighan Algorithm for Metric and Graph TSP</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2020.83">10.4230/LIPIcs.ESA.2020.83</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