<h2>LIPIcs, Volume 57, ESA 2016</h2>
<ul>
<li>
<span class="authors">Piotr Sankowski and Christos Zaroliagis</span>
<span class="title">LIPIcs, Volume 57, ESA'16, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2016">10.4230/LIPIcs.ESA.2016</a>
</li>
<li>
<span class="authors">Piotr Sankowski and Christos Zaroliagis</span>
<span class="title">Front Matter, Table of Contents, Preface, Programm Commitee, External Reviewers</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2016.0">10.4230/LIPIcs.ESA.2016.0</a>
</li>
<li>
<span class="authors">Loukas Georgiadis, Giuseppe F. Italiano, and Nikos Parotsidis</span>
<span class="title">2-Connectivity in Directed Graphs (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2016.1">10.4230/LIPIcs.ESA.2016.1</a>
</li>
<li>
<span class="authors">Ola Svensson</span>
<span class="title">Algorithms with Provable Guarantees for Clustering (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2016.2">10.4230/LIPIcs.ESA.2016.2</a>
</li>
<li>
<span class="authors">Melika Abolhassani, T.-H. Hubert Chan, Fei Chen, Hossein Esfandiari, MohammadTaghi Hajiaghayi, Mahini Hamid, and Xiaowei Wu</span>
<span class="title">Beating Ratio 0.5 for Weighted Oblivious Matching Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2016.3">10.4230/LIPIcs.ESA.2016.3</a>
</li>
<li>
<span class="authors">Mikkel Abrahamsen and Bartosz Walczak</span>
<span class="title">Outer Common Tangents and Nesting of Convex Hulls in Linear Time and Constant Workspace</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2016.4">10.4230/LIPIcs.ESA.2016.4</a>
</li>
<li>
<span class="authors">Stephen Alstrup, Søren Dahlgaard, Mathias Bæk Tejs Knudsen, and Ely Porat</span>
<span class="title">Sublinear Distance Labeling</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2016.5">10.4230/LIPIcs.ESA.2016.5</a>
</li>
<li>
<span class="authors">Tobias Arndt, Danijar Hafner, Thomas Kellermeier, Simon Krogmann, Armin Razmjou, Martin S. Krejca, Ralf Rothenberger, and Tobias Friedrich</span>
<span class="title">Probabilistic Routing for On-Street Parking Search</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2016.6">10.4230/LIPIcs.ESA.2016.6</a>
</li>
<li>
<span class="authors">Moritz Baum, Thomas Bläsius, Andreas Gemsa, Ignaz Rutter, and Franziska Wegner</span>
<span class="title">Scalable Exact Visualization of Isocontours in Road Networks via Minimum-Link Paths</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2016.7">10.4230/LIPIcs.ESA.2016.7</a>
</li>
<li>
<span class="authors">Xiaohui Bei, Jugal Garg, Martin Hoefer, and Kurt Mehlhorn</span>
<span class="title">Computing Equilibria in Markets with Budget-Additive Utilities</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2016.8">10.4230/LIPIcs.ESA.2016.8</a>
</li>
<li>
<span class="authors">Huck Bennett, Daniel Dadush, and Noah Stephens-Davidowitz</span>
<span class="title">On the Lattice Distortion Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2016.9">10.4230/LIPIcs.ESA.2016.9</a>
</li>
<li>
<span class="authors">Petra Berenbrink, Tom Friedetzky, Peter Kling, Frederik Mallmann-Trenn, and Chris Wastell</span>
<span class="title">Plurality Consensus in Arbitrary Graphs: Lessons Learned from Load Balancing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2016.10">10.4230/LIPIcs.ESA.2016.10</a>
</li>
<li>
<span class="authors">Arnab Bhattacharyya, Ameet Gadekar, Suprovat Ghoshal, and Rishi Saket</span>
<span class="title">On the Hardness of Learning Sparse Parities</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2016.11">10.4230/LIPIcs.ESA.2016.11</a>
</li>
<li>
<span class="authors">Marcin Bienkowski, Martin Böhm, Jaroslaw Byrka, Marek Chrobak, Christoph Dürr, Lukas Folwarczny, Lukasz Jez, Jiri Sgall, Nguyen Kim Thang, and Pavel Vesely</span>
<span class="title">Online Algorithms for Multi-Level Aggregation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2016.12">10.4230/LIPIcs.ESA.2016.12</a>
</li>
<li>
<span class="authors">Davide Bilo, Luciano Guala, Stefano Leucci, and Guido Proietti</span>
<span class="title">Compact and Fast Sensitivity Oracles for Single-Source Distances</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2016.13">10.4230/LIPIcs.ESA.2016.13</a>
</li>
<li>
<span class="authors">Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gibbons, Yan Gu, and Julian Shun</span>
<span class="title">Efficient Algorithms with Asymmetric Read and Write Costs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2016.14">10.4230/LIPIcs.ESA.2016.14</a>
</li>
<li>
<span class="authors">Thomas Bläsius, Tobias Friedrich, and Anton Krohmer</span>
<span class="title">Hyperbolic Random Graphs: Separators and Treewidth</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2016.15">10.4230/LIPIcs.ESA.2016.15</a>
</li>
<li>
<span class="authors">Thomas Bläsius, Tobias Friedrich, Anton Krohmer, and Sören Laue</span>
<span class="title">Efficient Embedding of Scale-Free Graphs in the Hyperbolic Plane</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2016.16">10.4230/LIPIcs.ESA.2016.16</a>
</li>
<li>
<span class="authors">Greg Bodwin and Sebastian Krinninger</span>
<span class="title">Fully Dynamic Spanners with Worst-Case Update Time</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2016.17">10.4230/LIPIcs.ESA.2016.17</a>
</li>
<li>
<span class="authors">Édouard Bonnet, László Egri, and Dániel Marx</span>
<span class="title">Fixed-Parameter Approximability of Boolean MinCSPs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2016.18">10.4230/LIPIcs.ESA.2016.18</a>
</li>
<li>
<span class="authors">Édouard Bonnet and Tillmann Miltzow</span>
<span class="title">Parameterized Hardness of Art Gallery Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2016.19">10.4230/LIPIcs.ESA.2016.19</a>
</li>
<li>
<span class="authors">Michele Borassi and Emanuele Natale</span>
<span class="title">KADABRA is an ADaptive Algorithm for Betweenness via Random Approximation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2016.20">10.4230/LIPIcs.ESA.2016.20</a>
</li>
<li>
<span class="authors">Ralf Borndörfer, Heide Hoppmann, and Marika Karbstein</span>
<span class="title">Separation of Cycle Inequalities for the Periodic Timetabling Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2016.21">10.4230/LIPIcs.ESA.2016.21</a>
</li>
<li>
<span class="authors">Quirijn W. Bouts, Irina Irina Kostitsyna, Marc van Kreveld, Wouter Meulemans, Willem Sonke, and Kevin Verbeek</span>
<span class="title">Mapping Polygons to the Grid with Small Hausdorff and Fréchet Distance</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2016.22">10.4230/LIPIcs.ESA.2016.22</a>
</li>
<li>
<span class="authors">Karl Bringmann, László Kozma, Shay Moran, and N. S. Narayanaswamy</span>
<span class="title">Hitting Set for Hypergraphs of Low VC-dimension</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2016.23">10.4230/LIPIcs.ESA.2016.23</a>
</li>
<li>
<span class="authors">Brian Brubach, Karthik Abinav Sankararaman, Aravind Srinivasan, and Pan Xu</span>
<span class="title">New Algorithms, Better Bounds, and a Novel Model for Online Stochastic Matching</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2016.24">10.4230/LIPIcs.ESA.2016.24</a>
</li>
<li>
<span class="authors">Jean Cardinal, John Iacono, and Aurélien Ooms</span>
<span class="title">Solving k-SUM Using Few Linear Queries</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2016.25">10.4230/LIPIcs.ESA.2016.25</a>
</li>
<li>
<span class="authors">Cameron Chalk, Eric Martinez, Robert Schweller, Luis Vega, Andrew Winslow, and Tim Wylie</span>
<span class="title">Optimal Staged Self-Assembly of General Shapes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2016.26">10.4230/LIPIcs.ESA.2016.26</a>
</li>
<li>
<span class="authors">Erin Chambers, Irina Kostitsyna, Maarten Löffler, and Frank Staals</span>
<span class="title">Homotopy Measures for Representative Trajectories</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2016.27">10.4230/LIPIcs.ESA.2016.27</a>
</li>
<li>
<span class="authors">Krishnendu Chatterjee, Rasmus Rasmus Ibsen-Jensen, and Andreas Pavlogiannis</span>
<span class="title">Optimal Reachability and a Space-Time Tradeoff for Distance Queries in Constant-Treewidth Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2016.28">10.4230/LIPIcs.ESA.2016.28</a>
</li>
<li>
<span class="authors">Markus Chimani and Tilo Wiedera</span>
<span class="title">An ILP-based Proof System for the Crossing Number Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2016.29">10.4230/LIPIcs.ESA.2016.29</a>
</li>
<li>
<span class="authors">George Christodoulou, Martin Gairing, Sotiris Nikoletseas, Christoforos Raptopoulos, and Paul Spirakis</span>
<span class="title">Strategic Contention Resolution with Limited Feedback</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2016.30">10.4230/LIPIcs.ESA.2016.30</a>
</li>
<li>
<span class="authors">Raphaël Clifford, Markus Jalsenius, and Benjamin Sach</span>
<span class="title">Cell-Probe Lower Bounds for Bit Stream Computation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2016.31">10.4230/LIPIcs.ESA.2016.31</a>
</li>
<li>
<span class="authors">Michael Crouch, Andrew McGregor, Gregory Valiant, and David P. Woodruff</span>
<span class="title">Stochastic Streams: Sample Complexity vs. Space Complexity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2016.32">10.4230/LIPIcs.ESA.2016.32</a>
</li>
<li>
<span class="authors">Radu Curticapean</span>
<span class="title">Counting Matchings with k Unmatched Vertices in Planar Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2016.33">10.4230/LIPIcs.ESA.2016.33</a>
</li>
<li>
<span class="authors">Jean-Lou De Carufel, Matthew J. Katz, Matias Korman, André van Renssen, Marcel Roeloffzen, and Shakhar Smorodinsky</span>
<span class="title">On Interference Among Moving Sensors and Related Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2016.34">10.4230/LIPIcs.ESA.2016.34</a>
</li>
<li>
<span class="authors">Tamal K. Dey, Dayu Shi, and Yusu Wang</span>
<span class="title">SimBa: An Efficient Tool for Approximating Rips-Filtration Persistence via Simplicial Batch-Collapse</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2016.35">10.4230/LIPIcs.ESA.2016.35</a>
</li>
<li>
<span class="authors">Andrew Drucker, Jesper Nederlof, and Rahul Santhanam</span>
<span class="title">Exponential Time Paradigms Through the Polynomial Time Lens</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2016.36">10.4230/LIPIcs.ESA.2016.36</a>
</li>
<li>
<span class="authors">Christoph Dürr, Christian Konrad, and Marc Renault</span>
<span class="title">On the Power of Advice and Randomization for Online Bipartite Matching</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2016.37">10.4230/LIPIcs.ESA.2016.37</a>
</li>
<li>
<span class="authors">Stefan Edelkamp and Armin Weiss</span>
<span class="title">BlockQuicksort: Avoiding Branch Mispredictions in Quicksort</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2016.38">10.4230/LIPIcs.ESA.2016.38</a>
</li>
<li>
<span class="authors">Eduard Eiben, Robert Ganian, Kustaa Kangas, and Sebastian Ordyniak</span>
<span class="title">Counting Linear Extensions: Parameterizations by Treewidth</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2016.39">10.4230/LIPIcs.ESA.2016.39</a>
</li>
<li>
<span class="authors">Guy Even, Moti Medina, and Adi Rosén</span>
<span class="title">A Constant Approximation Algorithm for Scheduling Packets on Line Networks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2016.40">10.4230/LIPIcs.ESA.2016.40</a>
</li>
<li>
<span class="authors">Moran Feldman, Moshe Tennenholtz, and Omri Weinstein</span>
<span class="title">Distributed Signaling Games</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2016.41">10.4230/LIPIcs.ESA.2016.41</a>
</li>
<li>
<span class="authors">Krzysztof Fleszar, Matthias Mnich, and Joachim Spoerhase</span>
<span class="title">New Algorithms for Maximum Disjoint Paths Based on Tree-Likeness</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2016.42">10.4230/LIPIcs.ESA.2016.42</a>
</li>
<li>
<span class="authors">Nathanaël François, Frédéric Magniez, Michel de Rougemont, and Olivier Serre</span>
<span class="title">Streaming Property Testing of Visibly Pushdown Languages</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2016.43">10.4230/LIPIcs.ESA.2016.43</a>
</li>
<li>
<span class="authors">Shay Golan, Tsvi Kopelowitz, and Ely Porat</span>
<span class="title">Streaming Pattern Matching with d Wildcards</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2016.44">10.4230/LIPIcs.ESA.2016.44</a>
</li>
<li>
<span class="authors">Isaac Goldstein, Tsvi Kopelowitz, Moshe Lewenstein, and Ely Porat</span>
<span class="title">How Hard is it to Find (Honest) Witnesses?</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2016.45">10.4230/LIPIcs.ESA.2016.45</a>
</li>
<li>
<span class="authors">Gramoz Goranci, Monika Henzinger, and Mikkel Thorup</span>
<span class="title">Incremental Exact Min-Cut in Poly-logarithmic Amortized Update Time</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2016.46">10.4230/LIPIcs.ESA.2016.46</a>
</li>
<li>
<span class="authors">Sathish Govindarajan, Rajiv Raman, Saurabh Ray, and Aniket Basu Roy</span>
<span class="title">Packing and Covering with Non-Piercing Regions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2016.47">10.4230/LIPIcs.ESA.2016.47</a>
</li>
<li>
<span class="authors">Monika Henzinger and Stefan Neumann</span>
<span class="title">Incremental and Fully Dynamic Subgraph Connectivity For Emergency Planning</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2016.48">10.4230/LIPIcs.ESA.2016.48</a>
</li>
<li>
<span class="authors">Chien-Chung Huang and Sebastian Ott</span>
<span class="title">A Combinatorial Approximation Algorithm for Graph Balancing with Light Hyper Edges</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2016.49">10.4230/LIPIcs.ESA.2016.49</a>
</li>
<li>
<span class="authors">Lingxiao Huang, Jian Li, Jeff M. Phillips, and Haitao Wang</span>
<span class="title">epsilon-Kernel Coresets for Stochastic Points</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2016.50">10.4230/LIPIcs.ESA.2016.50</a>
</li>
<li>
<span class="authors">Hiro Ito</span>
<span class="title">Every Property Is Testable on a Natural Class of Scale-Free Multigraphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2016.51">10.4230/LIPIcs.ESA.2016.51</a>
</li>
<li>
<span class="authors">Matti Karppa, Petteri Kaski, Jukka Kohonen, and Padraig Ó Catháin</span>
<span class="title">Explicit Correlation Amplifiers for Finding Outlier Correlations in Deterministic Subquadratic Time</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2016.52">10.4230/LIPIcs.ESA.2016.52</a>
</li>
<li>
<span class="authors">Casper Kejlberg-Rasmussen, Tsvi Kopelowitz, Seth Pettie, and Mikkel Thorup</span>
<span class="title">Faster Worst Case Deterministic Dynamic Connectivity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2016.53">10.4230/LIPIcs.ESA.2016.53</a>
</li>
<li>
<span class="authors">Thomas Kesselheim and Andreas Tönnis</span>
<span class="title">Think Eternally: Improved Algorithms for the Temp Secretary Problem and Extensions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2016.54">10.4230/LIPIcs.ESA.2016.54</a>
</li>
<li>
<span class="authors">Subhash Khot and Rishi Saket</span>
<span class="title">Hardness of Bipartite Expansion</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2016.55">10.4230/LIPIcs.ESA.2016.55</a>
</li>
<li>
<span class="authors">Lasse Kliemann, Christian Schielke, and Anand Srivastav</span>
<span class="title">A Streaming Algorithm for the Undirected Longest Path Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2016.56">10.4230/LIPIcs.ESA.2016.56</a>
</li>
<li>
<span class="authors">Pavel Kolev and Kurt Mehlhorn</span>
<span class="title">A Note On Spectral Clustering</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2016.57">10.4230/LIPIcs.ESA.2016.57</a>
</li>
<li>
<span class="authors">Lukasz Kowalik, Juho Lauri, and Arkadiusz Socala</span>
<span class="title">On the Fine-Grained Complexity of Rainbow Coloring</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2016.58">10.4230/LIPIcs.ESA.2016.58</a>
</li>
<li>
<span class="authors">Stefan Kratsch</span>
<span class="title">A Randomized Polynomial Kernelization for Vertex Cover with a Smaller Parameter</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2016.59">10.4230/LIPIcs.ESA.2016.59</a>
</li>
<li>
<span class="authors">Adam Kunysz</span>
<span class="title">The Strongly Stable Roommates Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2016.60">10.4230/LIPIcs.ESA.2016.60</a>
</li>
<li>
<span class="authors">Juha Kärkkäinen and Dominik Kempa</span>
<span class="title">Faster External Memory LCP Array Construction</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2016.61">10.4230/LIPIcs.ESA.2016.61</a>
</li>
<li>
<span class="authors">Jian Li and Wei Zhan</span>
<span class="title">Almost All Even Yao-Yao Graphs Are Spanners</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2016.62">10.4230/LIPIcs.ESA.2016.62</a>
</li>
<li>
<span class="authors">Giorgio Lucarelli, Nguyen Kim Thang, Abhinav Srivastav, and Denis Trystram</span>
<span class="title">Online Non-Preemptive Scheduling in a Resource Augmentation Model Based on Duality</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2016.63">10.4230/LIPIcs.ESA.2016.63</a>
</li>
<li>
<span class="authors">Clément Maria and Jonathan Spreer</span>
<span class="title">Admissible Colourings of 3-Manifold Triangulations for Turaev-Viro Type Invariants</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2016.64">10.4230/LIPIcs.ESA.2016.64</a>
</li>
<li>
<span class="authors">Ruta Mehta, Ioannis Panageas, Georgios Piliouras, and Sadra Yazdanbod</span>
<span class="title">The Computational Complexity of Genetic Diversity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2016.65">10.4230/LIPIcs.ESA.2016.65</a>
</li>
<li>
<span class="authors">Tillmann Miltzow, Lothar Narins, Yoshio Okamoto, Günter Rote, Antonis Thomas, and Takeaki Uno</span>
<span class="title">Approximation and Hardness of Token Swapping</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2016.66">10.4230/LIPIcs.ESA.2016.66</a>
</li>
<li>
<span class="authors">Matthias Mnich, Virginia Vassilevska Williams, and László A. Végh</span>
<span class="title">A 7/3-Approximation for Feedback Vertex Sets in Tournaments</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2016.67">10.4230/LIPIcs.ESA.2016.67</a>
</li>
<li>
<span class="authors">Riley Murray, Megan Chao, and Samir Khuller</span>
<span class="title">Scheduling Distributed Clusters of Parallel Machines: Primal-Dual and LP-based Approximation Algorithms</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2016.68">10.4230/LIPIcs.ESA.2016.68</a>
</li>
<li>
<span class="authors">Jesper Nederlof</span>
<span class="title">Finding Large Set Covers Faster via the Representation Method</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2016.69">10.4230/LIPIcs.ESA.2016.69</a>
</li>
<li>
<span class="authors">Daniel Neuen</span>
<span class="title">Graph Isomorphism for Unit Square Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2016.70">10.4230/LIPIcs.ESA.2016.70</a>
</li>
<li>
<span class="authors">Alantha Newman, Heiko Röglin, and Johanna Seif</span>
<span class="title">The Alternating Stock Size Problem and the Gasoline Puzzle</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2016.71">10.4230/LIPIcs.ESA.2016.71</a>
</li>
<li>
<span class="authors">Ely Porat, Eduard Shahbazian, and Roei Tov</span>
<span class="title">New Parameterized Algorithms for APSP in Directed Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2016.72">10.4230/LIPIcs.ESA.2016.72</a>
</li>
<li>
<span class="authors">Dror Rawitz and Adi Rosén</span>
<span class="title">Online Budgeted Maximum Coverage</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2016.73">10.4230/LIPIcs.ESA.2016.73</a>
</li>
<li>
<span class="authors">Andreas S. Schulz and José Verschae</span>
<span class="title">Min-Sum Scheduling Under Precedence Constraints</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2016.74">10.4230/LIPIcs.ESA.2016.74</a>
</li>
<li>
<span class="authors">Chris Schwiegelshohn and Uwe Schwiegelshohn</span>
<span class="title">The Power of Migration for Online Slack Scheduling</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2016.75">10.4230/LIPIcs.ESA.2016.75</a>
</li>
<li>
<span class="authors">Kiril Solovey and Dan Halperin</span>
<span class="title">Sampling-Based Bottleneck Pathfinding with Applications to Fréchet Matching</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2016.76">10.4230/LIPIcs.ESA.2016.76</a>
</li>
<li>
<span class="authors">Haitao Wang</span>
<span class="title">On the Geodesic Centers of Polygonal Domains</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2016.77">10.4230/LIPIcs.ESA.2016.77</a>
</li>
<li>
<span class="authors">Tim Roughgarden and Joshua R. Wang</span>
<span class="title">The Complexity of the k-means Method</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2016.78">10.4230/LIPIcs.ESA.2016.78</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