<h2>LIPIcs, Volume 144, ESA 2019</h2>
<ul>
<li>
<span class="authors">Michael A. Bender, Ola Svensson, and Grzegorz Herman</span>
<span class="title">LIPIcs, Volume 144, ESA'19, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2019">10.4230/LIPIcs.ESA.2019</a>
</li>
<li>
<span class="authors">Michael A. Bender, Ola Svensson, 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.2019.0">10.4230/LIPIcs.ESA.2019.0</a>
</li>
<li>
<span class="authors">Marek Adamczyk, Jarosław Byrka, Jan Marcinkowski, Syed M. Meesum, and Michał Włodarczyk</span>
<span class="title">Constant-Factor FPT Approximation for Capacitated k-Median</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2019.1">10.4230/LIPIcs.ESA.2019.1</a>
</li>
<li>
<span class="authors">Peyman Afshani, Rolf Fagerberg, David Hammer, Riko Jacob, Irina Kostitsyna, Ulrich Meyer, Manuel Penschuck, and Nodari Sitchinava</span>
<span class="title">Fragile Complexity of Comparison-Based Algorithms</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2019.2">10.4230/LIPIcs.ESA.2019.2</a>
</li>
<li>
<span class="authors">Hugo A. Akitaya, Esther M. Arkin, Mirela Damian, Erik D. Demaine, Vida Dujmović, Robin Flatland, Matias Korman, Belen Palop, Irene Parada, André van Renssen, and Vera Sacristán</span>
<span class="title">Universal Reconfiguration of Facet-Connected Modular Robots by Pivots: The O(1) Musketeers</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2019.3">10.4230/LIPIcs.ESA.2019.3</a>
</li>
<li>
<span class="authors">Stephen Alstrup, Søren Dahlgaard, Arnold Filtser, Morten Stöckel, and Christian Wulff-Nilsen</span>
<span class="title">Constructing Light Spanners Deterministically in Near-Linear Time</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2019.4">10.4230/LIPIcs.ESA.2019.4</a>
</li>
<li>
<span class="authors">Amihood Amir, Itai Boneh, Panagiotis Charalampopoulos, and Eitan Kondratovsky</span>
<span class="title">Repetition Detection in a Dynamic String</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2019.5">10.4230/LIPIcs.ESA.2019.5</a>
</li>
<li>
<span class="authors">Amihood Amir, Panagiotis Charalampopoulos, Solon P. Pissis, and Jakub Radoszewski</span>
<span class="title">Longest Common Substring Made Fully Dynamic</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2019.6">10.4230/LIPIcs.ESA.2019.6</a>
</li>
<li>
<span class="authors">Haris Angelidakis, Pranjal Awasthi, Avrim Blum, Vaggos Chatziafratis, and Chen Dan</span>
<span class="title">Bilu-Linial Stability, Certified Algorithms and the Independent Set Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2019.7">10.4230/LIPIcs.ESA.2019.7</a>
</li>
<li>
<span class="authors">Antonios Antoniadis, Felix Biermeier, Andrés Cristi, Christoph Damerius, Ruben Hoeksma, Dominik Kaaser, Peter Kling, and Lukas Nölke</span>
<span class="title">On the Complexity of Anchored Rectangle Packing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2019.8">10.4230/LIPIcs.ESA.2019.8</a>
</li>
<li>
<span class="authors">Simon Apers</span>
<span class="title">Quantum Walk Sampling by Growing Seed Sets</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2019.9">10.4230/LIPIcs.ESA.2019.9</a>
</li>
<li>
<span class="authors">Martin Aumüller, Tobias Christiani, Rasmus Pagh, and Michael Vesterli</span>
<span class="title">PUFFINN: Parameterless and Universally Fast FInding of Nearest Neighbors</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2019.10">10.4230/LIPIcs.ESA.2019.10</a>
</li>
<li>
<span class="authors">Evripidis Bampis, Bruno Escoffier, Kevin Schewior, and Alexandre Teiller</span>
<span class="title">Online Multistage Subset Maximization Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2019.11">10.4230/LIPIcs.ESA.2019.11</a>
</li>
<li>
<span class="authors">Sayan Bandyapadhyay, Tanmay Inamdar, Shreyas Pai, and Kasturi Varadarajan</span>
<span class="title">A Constant Approximation for Colorful k-Center</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2019.12">10.4230/LIPIcs.ESA.2019.12</a>
</li>
<li>
<span class="authors">Ulrich Bauer, Abhishek Rathod, and Jonathan Spreer</span>
<span class="title">Parametrized Complexity of Expansion Height</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2019.13">10.4230/LIPIcs.ESA.2019.13</a>
</li>
<li>
<span class="authors">Moritz Baum, Valentin Buchhold, Jonas Sauer, Dorothea Wagner, and Tobias Zündorf</span>
<span class="title">UnLimited TRAnsfers for Multi-Modal Route Planning: An Efficient Solution</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2019.14">10.4230/LIPIcs.ESA.2019.14</a>
</li>
<li>
<span class="authors">Soheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi, Marina Knittel, and Hamed Saleh</span>
<span class="title">Streaming and Massively Parallel Algorithms for Edge Coloring</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2019.15">10.4230/LIPIcs.ESA.2019.15</a>
</li>
<li>
<span class="authors">Aleksandrs Belovs</span>
<span class="title">Quantum Algorithms for Classical Probability Distributions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2019.16">10.4230/LIPIcs.ESA.2019.16</a>
</li>
<li>
<span class="authors">Benjamin Bergougnoux and Mamadou Moustapha Kanté</span>
<span class="title">More Applications of the d-Neighbor Equivalence: Connectivity and Acyclicity Constraints</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2019.17">10.4230/LIPIcs.ESA.2019.17</a>
</li>
<li>
<span class="authors">Sebastian Berndt, Leah Epstein, Klaus Jansen, Asaf Levin, Marten Maack, and Lars Rohwedder</span>
<span class="title">Online Bin Covering with Limited Migration</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2019.18">10.4230/LIPIcs.ESA.2019.18</a>
</li>
<li>
<span class="authors">Juan José Besa, Giordano Da Lozzo, and Michael T. Goodrich</span>
<span class="title">Computing k-Modal Embeddings of Planar Digraphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2019.19">10.4230/LIPIcs.ESA.2019.19</a>
</li>
<li>
<span class="authors">Georgios Birmpas, Evangelos Markakis, and Guido Schäfer</span>
<span class="title">Cost Sharing over Combinatorial Domains: Complement-Free Cost Functions and Beyond</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2019.20">10.4230/LIPIcs.ESA.2019.20</a>
</li>
<li>
<span class="authors">Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann, Ulrich Meyer, Manuel Penschuck, and Christopher Weyand</span>
<span class="title">Efficiently Generating Geometric Inhomogeneous and Hyperbolic Random Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2019.21">10.4230/LIPIcs.ESA.2019.21</a>
</li>
<li>
<span class="authors">Jean-Daniel Boissonnat, Olivier Devillers, Kunal Dutta, and Marc Glisse</span>
<span class="title">Randomized Incremental Construction of Delaunay Triangulations of Nice Point Sets</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2019.22">10.4230/LIPIcs.ESA.2019.22</a>
</li>
<li>
<span class="authors">Édouard Bonnet, Yoichi Iwata, Bart M. P. Jansen, and Łukasz Kowalik</span>
<span class="title">Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSP</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2019.23">10.4230/LIPIcs.ESA.2019.23</a>
</li>
<li>
<span class="authors">Nicolas Bousquet and Valentin Bartier</span>
<span class="title">Linear Transformations Between Colorings in Chordal Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2019.24">10.4230/LIPIcs.ESA.2019.24</a>
</li>
<li>
<span class="authors">Cornelius Brand</span>
<span class="title">Patching Colors with Tensors</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2019.25">10.4230/LIPIcs.ESA.2019.25</a>
</li>
<li>
<span class="authors">Karl Bringmann, Sándor Kisfaludi-Bak, Michał Pilipczuk, and Erik Jan van Leeuwen</span>
<span class="title">On Geometric Set Cover for Orthants</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2019.26">10.4230/LIPIcs.ESA.2019.26</a>
</li>
<li>
<span class="authors">Deeparnab Chakrabarty and Chaitanya Swamy</span>
<span class="title">Simpler and Better Algorithms for Minimum-Norm Load Balancing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2019.27">10.4230/LIPIcs.ESA.2019.27</a>
</li>
<li>
<span class="authors">Jiehua Chen, Danny Hermelin, and Manuel Sorge</span>
<span class="title">On Computing Centroids According to the p-Norms of Hamming Distance Vectors</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2019.28">10.4230/LIPIcs.ESA.2019.28</a>
</li>
<li>
<span class="authors">Jing Chen, Samuel McCauley, and Shikha Singh</span>
<span class="title">Non-Cooperative Rational Interactive Proofs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2019.29">10.4230/LIPIcs.ESA.2019.29</a>
</li>
<li>
<span class="authors">Markus Chimani and Tilo Wiedera</span>
<span class="title">Stronger ILPs for the Graph Genus Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2019.30">10.4230/LIPIcs.ESA.2019.30</a>
</li>
<li>
<span class="authors">Maria Chudnovsky, Shenwei Huang, Paweł Rzążewski, Sophie Spirkl, and Mingxian Zhong</span>
<span class="title">Complexity of C_k-Coloring in Hereditary Classes of Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2019.31">10.4230/LIPIcs.ESA.2019.31</a>
</li>
<li>
<span class="authors">Jinhee Chun, Kenya Kikuchi, and Takeshi Tokuyama</span>
<span class="title">Consistent Digital Curved Rays and Pseudoline Arrangements</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2019.32">10.4230/LIPIcs.ESA.2019.32</a>
</li>
<li>
<span class="authors">Vincent Cohen-Addad, Marcin Pilipczuk, and Michał Pilipczuk</span>
<span class="title">Efficient Approximation Schemes for Uniform-Cost Clustering Problems in Planar Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2019.33">10.4230/LIPIcs.ESA.2019.33</a>
</li>
<li>
<span class="authors">Wojciech Czerwiński, Wojciech Nadara, and Marcin Pilipczuk</span>
<span class="title">Improved Bounds for the Excluded-Minor Approximation of Treedepth</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2019.34">10.4230/LIPIcs.ESA.2019.34</a>
</li>
<li>
<span class="authors">Jurek Czyzowicz, Dariusz Dereniowski, and Andrzej Pelc</span>
<span class="title">Building a Nest by an Automaton</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2019.35">10.4230/LIPIcs.ESA.2019.35</a>
</li>
<li>
<span class="authors">Rami Daknama, Konstantinos Panagiotou, and Simon Reisser</span>
<span class="title">Robustness of Randomized Rumour Spreading</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2019.36">10.4230/LIPIcs.ESA.2019.36</a>
</li>
<li>
<span class="authors">Erik D. Demaine, Timothy D. Goodrich, Kyle Kloster, Brian Lavallee, Quanquan C. Liu, Blair D. Sullivan, Ali Vakilian, and Andrew van der Poel</span>
<span class="title">Structural Rounding: Approximation Algorithms for Graphs Near an Algorithmically Tractable Class</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2019.37">10.4230/LIPIcs.ESA.2019.37</a>
</li>
<li>
<span class="authors">Martin Dietzfelbinger and Stefan Walzer</span>
<span class="title">Dense Peelable Random Uniform Hypergraphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2019.38">10.4230/LIPIcs.ESA.2019.38</a>
</li>
<li>
<span class="authors">Martin Dietzfelbinger and Stefan Walzer</span>
<span class="title">Efficient Gauss Elimination for Near-Quadratic Matrices with One Short Random Block per Row, with Applications</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2019.39">10.4230/LIPIcs.ESA.2019.39</a>
</li>
<li>
<span class="authors">Hu Ding, Haikuo Yu, and Zixiu Wang</span>
<span class="title">Greedy Strategy Works for k-Center Clustering with Outliers and Coreset Construction</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2019.40">10.4230/LIPIcs.ESA.2019.40</a>
</li>
<li>
<span class="authors">Patrick Dinklage, Jonas Ellert, Johannes Fischer, Dominik Köppl, and Manuel Penschuck</span>
<span class="title">Bidirectional Text Compression in External Memory</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2019.41">10.4230/LIPIcs.ESA.2019.41</a>
</li>
<li>
<span class="authors">Eduard Eiben, Daniel Lokshtanov, and Amer E. Mouawad</span>
<span class="title">Bisection of Bounded Treewidth Graphs by Convolutions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2019.42">10.4230/LIPIcs.ESA.2019.42</a>
</li>
<li>
<span class="authors">Khaled Elbassioni and Kazuhisa Makino</span>
<span class="title">Oracle-Based Primal-Dual Algorithms for Packing and Covering Semidefinite Programs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2019.43">10.4230/LIPIcs.ESA.2019.43</a>
</li>
<li>
<span class="authors">Yuval Emek, Adam Goldbraikh, and Erez Kantor</span>
<span class="title">Online Disjoint Set Cover Without Prior Knowledge</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2019.44">10.4230/LIPIcs.ESA.2019.44</a>
</li>
<li>
<span class="authors">Yuval Emek, Shay Kutten, Ron Lavi, and Yangguang Shi</span>
<span class="title">Bayesian Generalized Network Design</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2019.45">10.4230/LIPIcs.ESA.2019.45</a>
</li>
<li>
<span class="authors">Diodato Ferraioli, Adrian Meier, Paolo Penna, and Carmine Ventre</span>
<span class="title">Obviously Strategyproof Mechanisms for Machine Scheduling</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2019.46">10.4230/LIPIcs.ESA.2019.46</a>
</li>
<li>
<span class="authors">Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, and Meirav Zehavi</span>
<span class="title">Going Far From Degeneracy</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2019.47">10.4230/LIPIcs.ESA.2019.47</a>
</li>
<li>
<span class="authors">Robert Ganian, Sebastian Ordyniak, and C. S. Rahul</span>
<span class="title">Group Activity Selection with Few Agent Types</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2019.48">10.4230/LIPIcs.ESA.2019.48</a>
</li>
<li>
<span class="authors">Barbara Geissmann, Stefano Leucci, Chih-Hung Liu, and Paolo Penna</span>
<span class="title">Optimal Sorting with Persistent Comparison Errors</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2019.49">10.4230/LIPIcs.ESA.2019.49</a>
</li>
<li>
<span class="authors">Loukas Georgiadis, Konstantinos Giannis, Giuseppe F. Italiano, Aikaterini Karanasiou, and Luigi Laura</span>
<span class="title">Dynamic Dominators and Low-High Orders in DAGs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2019.50">10.4230/LIPIcs.ESA.2019.50</a>
</li>
<li>
<span class="authors">Daniel Gibney and Sharma V. Thankachan</span>
<span class="title">On the Hardness and Inapproximability of Recognizing Wheeler Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2019.51">10.4230/LIPIcs.ESA.2019.51</a>
</li>
<li>
<span class="authors">Lars Gottesbüren, Michael Hamann, and Dorothea Wagner</span>
<span class="title">Evaluation of a Flow-Based Hypergraph Bipartitioning Algorithm</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2019.52">10.4230/LIPIcs.ESA.2019.52</a>
</li>
<li>
<span class="authors">Fabrizio Grandoni, Stefan Kratsch, and Andreas Wiese</span>
<span class="title">Parameterized Approximation Schemes for Independent Set of Rectangles and Geometric Knapsack</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2019.53">10.4230/LIPIcs.ESA.2019.53</a>
</li>
<li>
<span class="authors">Fabrizio Grandoni and Andreas Wiese</span>
<span class="title">Packing Cars into Narrow Roads: PTASs for Limited Supply Highway</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2019.54">10.4230/LIPIcs.ESA.2019.54</a>
</li>
<li>
<span class="authors">Sascha Gritzbach, Torsten Ueckerdt, Dorothea Wagner, Franziska Wegner, and Matthias Wolf</span>
<span class="title">Engineering Negative Cycle Canceling for Wind Farm Cabling</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2019.55">10.4230/LIPIcs.ESA.2019.55</a>
</li>
<li>
<span class="authors">Arash Haddadan and Alantha Newman</span>
<span class="title">Towards Improving Christofides Algorithm for Half-Integer TSP</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2019.56">10.4230/LIPIcs.ESA.2019.56</a>
</li>
<li>
<span class="authors">Yael Hitron and Merav Parter</span>
<span class="title">Counting to Ten with Two Fingers: Compressed Counting with Spiking Neurons</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2019.57">10.4230/LIPIcs.ESA.2019.57</a>
</li>
<li>
<span class="authors">Michael Hoffmann and Boris Klemz</span>
<span class="title">Triconnected Planar Graphs of Maximum Degree Five are Subhamiltonian</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2019.58">10.4230/LIPIcs.ESA.2019.58</a>
</li>
<li>
<span class="authors">Lorenz Hübschle-Schneider and Peter Sanders</span>
<span class="title">Parallel Weighted Random Sampling</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2019.59">10.4230/LIPIcs.ESA.2019.59</a>
</li>
<li>
<span class="authors">John Iacono, Riko Jacob, and Konstantinos Tsakalidis</span>
<span class="title">External Memory Priority Queues with Decrease-Key and Applications to Graph Algorithms</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2019.60">10.4230/LIPIcs.ESA.2019.60</a>
</li>
<li>
<span class="authors">Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, and Yoshio Okamoto</span>
<span class="title">Shortest Reconfiguration of Perfect Matchings via Alternating Cycles</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2019.61">10.4230/LIPIcs.ESA.2019.61</a>
</li>
<li>
<span class="authors">Klaus Jansen and Malin Rau</span>
<span class="title">Closing the Gap for Pseudo-Polynomial Strip Packing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2019.62">10.4230/LIPIcs.ESA.2019.62</a>
</li>
<li>
<span class="authors">Michael Jünger and Sven Mallach</span>
<span class="title">Odd-Cycle Separation for Maximum Cut and Binary Quadratic Optimization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2019.63">10.4230/LIPIcs.ESA.2019.63</a>
</li>
<li>
<span class="authors">Haim Kaplan, Katharina Klost, Wolfgang Mulzer, Liam Roditty, Paul Seiferth, and Micha Sharir</span>
<span class="title">Triangles and Girth in Disk Graphs and Transmission Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2019.64">10.4230/LIPIcs.ESA.2019.64</a>
</li>
<li>
<span class="authors">Adam Karczmarz and Jakub Łącki</span>
<span class="title">Reliable Hubs for Partially-Dynamic All-Pairs Shortest Paths in Directed Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2019.65">10.4230/LIPIcs.ESA.2019.65</a>
</li>
<li>
<span class="authors">Adam Karczmarz and Piotr Sankowski</span>
<span class="title">Min-Cost Flow in Unit-Capacity Planar Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2019.66">10.4230/LIPIcs.ESA.2019.66</a>
</li>
<li>
<span class="authors">Mees van de Kerkhof, Irina Kostitsyna, Maarten Löffler, Majid Mirzanezhad, and Carola Wenk</span>
<span class="title">Global Curve Simplification</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2019.67">10.4230/LIPIcs.ESA.2019.67</a>
</li>
<li>
<span class="authors">Akshay Krishnamurthy, Arya Mazumdar, Andrew McGregor, and Soumyabrata Pal</span>
<span class="title">Trace Reconstruction: Generalized and Parameterized</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2019.68">10.4230/LIPIcs.ESA.2019.68</a>
</li>
<li>
<span class="authors">Ariel Kulik, Kanthi Sarpatwar, Baruch Schieber, and Hadas Shachnai</span>
<span class="title">Generalized Assignment via Submodular Optimization with Reserved Capacity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2019.69">10.4230/LIPIcs.ESA.2019.69</a>
</li>
<li>
<span class="authors">Stefano Leucci, Chih-Hung Liu, and Simon Meierhans</span>
<span class="title">Resilient Dictionaries for Randomly Unreliable Memory</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2019.70">10.4230/LIPIcs.ESA.2019.70</a>
</li>
<li>
<span class="authors">Huan Li, He Sun, and Luca Zanetti</span>
<span class="title">Hermitian Laplacians and a Cheeger Inequality for the Max-2-Lin Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2019.71">10.4230/LIPIcs.ESA.2019.71</a>
</li>
<li>
<span class="authors">Tomáš Masařík, Irene Muzi, Marcin Pilipczuk, Paweł Rzążewski, and Manuel Sorge</span>
<span class="title">Packing Directed Circuits Quarter-Integrally</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2019.72">10.4230/LIPIcs.ESA.2019.72</a>
</li>
<li>
<span class="authors">Marcin Mucha, Jesper Nederlof, Jakub Pawlewicz, and Karol Węgrzycki</span>
<span class="title">Equal-Subset-Sum Faster Than the Meet-in-the-Middle</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2019.73">10.4230/LIPIcs.ESA.2019.73</a>
</li>
<li>
<span class="authors">Rasmus Pagh, Nina Mesing Stausholm, and Mikkel Thorup</span>
<span class="title">Hardness of Bichromatic Closest Pair with Jaccard Similarity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2019.74">10.4230/LIPIcs.ESA.2019.74</a>
</li>
<li>
<span class="authors">Harald Räcke and Stefan Schmid</span>
<span class="title">Compact Oblivious Routing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2019.75">10.4230/LIPIcs.ESA.2019.75</a>
</li>
<li>
<span class="authors">Marcel Radermacher and Ignaz Rutter</span>
<span class="title">Geometric Crossing-Minimization - A Scalable Randomized Approach</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2019.76">10.4230/LIPIcs.ESA.2019.76</a>
</li>
<li>
<span class="authors">M. S. Ramanujan</span>
<span class="title">An Approximate Kernel for Connected Feedback Vertex Set</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2019.77">10.4230/LIPIcs.ESA.2019.77</a>
</li>
<li>
<span class="authors">R. Ravi and Oleksandr Rudenko</span>
<span class="title">Multicommodity Multicast, Wireless and Fast</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2019.78">10.4230/LIPIcs.ESA.2019.78</a>
</li>
<li>
<span class="authors">Jonathan Rollin, Lena Schlipf, and André Schulz</span>
<span class="title">Recognizing Planar Laman Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2019.79">10.4230/LIPIcs.ESA.2019.79</a>
</li>
<li>
<span class="authors">Ignaz Rutter, Darren Strash, Peter Stumpf, and Michael Vollmer</span>
<span class="title">Simultaneous Representation of Proper and Unit Interval Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2019.80">10.4230/LIPIcs.ESA.2019.80</a>
</li>
<li>
<span class="authors">Barna Saha and Sanjay Subramanian</span>
<span class="title">Correlation Clustering with Same-Cluster Queries Bounded by Optimal Cost</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2019.81">10.4230/LIPIcs.ESA.2019.81</a>
</li>
<li>
<span class="authors">Roy Schwartz and Ran Yeheskel</span>
<span class="title">Graph Balancing with Orientation Costs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2019.82">10.4230/LIPIcs.ESA.2019.82</a>
</li>
<li>
<span class="authors">Elena Farahbakhsh Touli and Yusu Wang</span>
<span class="title">FPT-Algorithms for Computing Gromov-Hausdorff and Interleaving Distances Between Trees</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2019.83">10.4230/LIPIcs.ESA.2019.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