Algorithms - ESA 2014

22th Annual European Symposium, Wroclaw, Poland, September 8-10, 2014. Proceedings

  • Andreas S. Schulz
  • Dorothea Wagner
Conference proceedings ESA 2014

DOI: 10.1007/978-3-662-44777-2

Part of the Lecture Notes in Computer Science book series (LNCS, volume 8737)

Table of contents (69 papers)

  1. Front Matter
  2. Losing Weight by Gaining Edges
    Amir Abboud, Kevin Lewi, Ryan Williams
    Pages 1-12
  3. Optimal Coordination Mechanisms for Multi-job Scheduling Games
    Fidaa Abed, José R. Correa, Chien-Chung Huang
    Pages 13-24
  4. Theory and Practice of Chunked Sequences
    Umut A. Acar, Arthur Charguéraud, Mike Rainey
    Pages 25-36
  5. Convex Hulls under Uncertainty
    Pankaj K. Agarwal, Sariel Har-Peled, Subhash Suri, Hakan Yıldız, Wuzhou Zhang
    Pages 37-48
  6. Distribution-Sensitive Construction of the Greedy Spanner
    Sander P. A. Alewijnse, Quirijn W. Bouts, Alex P. Ten Brink
    Pages 61-73
  7. Recognizing Shrinkable Complexes Is NP-Complete
    Dominique Attali, Olivier Devillers, Marc Glisse, Sylvain Lazard
    Pages 74-86
  8. Improved Approximation Algorithms for Box Contact Representations
    Michael A. Bekos, Thomas C. van Dijk, Martin Fink, Philipp Kindermann, Stephen Kobourov, Sergey Pupyrev et al.
    Pages 87-99
  9. Minimum Partial-Matching and Hausdorff RMS-Distance under Translation: Combinatorics and Algorithms
    Rinat Ben-Avraham, Matthias Henze, Rafel Jaume, Balázs Keszegh, Orit E. Raz, Micha Sharir et al.
    Pages 100-111
  10. The Batched Predecessor Problem in External Memory
    Michael A. Bender, Martín Farach-Colton, Mayank Goswami, Dzejla Medjedovic, Pablo Montes, Meng-Tsung Tsai
    Pages 112-124
  11. Polynomial Decompositions in Polynomial Time
    Arnab Bhattacharyya
    Pages 125-136
  12. Fault-Tolerant Approximate Shortest-Path Trees
    Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
    Pages 137-148
  13. Fast Witness Extraction Using a Decision Oracle
    Andreas Björklund, Petteri Kaski, Łukasz Kowalik
    Pages 149-160
  14. Complexity of Higher-Degree Orthogonal Graph Embedding in the Kandinsky Model
    Thomas Bläsius, Guido Brückner, Ignaz Rutter
    Pages 161-172
  15. A Subexponential Parameterized Algorithm for Proper Interval Completion
    Ivan Bliznets, Fedor V. Fomin, Marcin Pilipczuk, Michał Pilipczuk
    Pages 173-184
  16. Computing Persistent Homology with Various Coefficient Fields in a Single Pass
    Jean-Daniel Boissonnat, Clément Maria
    Pages 185-196
  17. De-anonymization of Heterogeneous Random Graphs in Quasilinear Time
    Karl Bringmann, Tobias Friedrich, Anton Krohmer
    Pages 197-208
  18. Competitive Algorithms for Restricted Caching and Matroid Caching
    Niv Buchbinder, Shahar Chen, Joseph (Seffi) Naor
    Pages 209-221
  19. Improved Algorithms for Resource Allocation under Varying Capacity
    Venkatesan T. Chakaravarthy, Anamitra R. Choudhury, Shalmoli Gupta, Sambuddha Roy, Yogish Sabharwal
    Pages 222-234

About these proceedings

Introduction

This book constitutes the refereed proceedings of the 22st Annual European Symposium on Algorithms, ESA 2014, held in Wrocław, Poland, in September 2014, as part of ALGO 2014. The 69 revised full papers presented were carefully reviewed and selected from 269 initial submissions: 57 out of 221 in Track A, Design and Analysis, and 12 out of 48 in Track B, Engineering and Applications. The papers present original research in the areas of design and mathematical analysis of algorithms; engineering, experimental analysis, and real-world applications of algorithms and data structures.

Keywords

algorithm engineering algorithmic aspects of networks algorithmic game theory approximation algorithms combinatorial optimization computational biology computational geometry data compression distributed and parallel computing graph algorithms heuristics and meta-heuristics mathematical programming mobile computing online algorithms parameterized complexity pattern matching quantum computing randomized algorithms scheduling and resource allocation problems streaming algorithms

Editors and affiliations

  • Andreas S. Schulz
    • 1
  • Dorothea Wagner
    • 2
  1. 1.Massachusetts Institute of TechnologyCambridgeUSA
  2. 2.Karlsruhe Institute of Technology (KIT)KarlsruheGermany

Bibliographic information

  • Copyright Information Springer-Verlag Berlin Heidelberg 2014
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-662-44776-5
  • Online ISBN 978-3-662-44777-2
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349