Skip to main content
SpringerLink
Log in

Algorithms - ESA 2014

22th Annual European Symposium, Wrocław, Poland, September 8-10, 2014. Proceedings

  • Conference proceedings
  • © 2014

Overview

Editors:
  1. Andreas S. Schulz

    1. Massachusetts Institute of Technology, Cambridge, USA

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Dorothea Wagner

    1. Karlsruhe Institute of Technology (KIT), Karlsruhe, Germany

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

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

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Included in the following conference series:

Conference proceedings info: ESA 2014.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (69 papers)

  1. Front Matter

    Download chapter PDF

  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. The Space-Stretch-Time Tradeoff in Distance Oracles

    • Rachit Agarwal
    Pages 49-60

  7. Distribution-Sensitive Construction of the Greedy Spanner

    • Sander P. A. Alewijnse, Quirijn W. Bouts, Alex P. Ten Brink
    Pages 61-73

  8. Recognizing Shrinkable Complexes Is NP-Complete

    • Dominique Attali, Olivier Devillers, Marc Glisse, Sylvain Lazard
    Pages 74-86

  9. 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

  10. 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

  11. 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

  12. Polynomial Decompositions in Polynomial Time

    • Arnab Bhattacharyya
    Pages 125-136

  13. Fault-Tolerant Approximate Shortest-Path Trees

    • Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
    Pages 137-148

  14. Fast Witness Extraction Using a Decision Oracle

    • Andreas Björklund, Petteri Kaski, Łukasz Kowalik
    Pages 149-160

  15. Complexity of Higher-Degree Orthogonal Graph Embedding in the Kandinsky Model

    • Thomas Bläsius, Guido Brückner, Ignaz Rutter
    Pages 161-172

  16. A Subexponential Parameterized Algorithm for Proper Interval Completion

    • Ivan Bliznets, Fedor V. Fomin, Marcin Pilipczuk, Michał Pilipczuk
    Pages 173-184

  17. Computing Persistent Homology with Various Coefficient Fields in a Single Pass

    • Jean-Daniel Boissonnat, Clément Maria
    Pages 185-196

  18. De-anonymization of Heterogeneous Random Graphs in Quasilinear Time

    • Karl Bringmann, Tobias Friedrich, Anton Krohmer
    Pages 197-208

  19. Competitive Algorithms for Restricted Caching and Matroid Caching

    • Niv Buchbinder, Shahar Chen, Joseph (Seffi) Naor
    Pages 209-221

  20. Improved Algorithms for Resource Allocation under Varying Capacity

    • Venkatesan T. Chakaravarthy, Anamitra R. Choudhury, Shalmoli Gupta, Sambuddha Roy, Yogish Sabharwal
    Pages 222-234
Back to top

Other volumes

  1. Algorithms - ESA 2014

Keywords

About this book

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.

Editors and Affiliations

  • Massachusetts Institute of Technology, Cambridge, USA

    Andreas S. Schulz

  • Karlsruhe Institute of Technology (KIT), Karlsruhe, Germany

    Dorothea Wagner

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation