Skip to main content
  • Conference proceedings
  • © 2005

Algorithms – ESA 2005

13th Annual European Symposium, Palma de Mallorca, Spain, October 3-6, 2005, Proceedings

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

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

Conference series link(s): ESA: European Symposium on Algorithms

Conference proceedings info: ESA 2005.

Buy it now

Buying options

eBook USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 109.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

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

Table of contents (78 papers)

  1. Front Matter

  2. Designing Reliable Algorithms in Unreliable Memories

    • Irene Finocchi, Fabrizio Grandoni, Giuseppe F. Italiano
    Pages 1-8
  3. Exploring an Unknown Graph Efficiently

    • Rudolf Fleischer, Gerhard Trippen
    Pages 11-22
  4. Relax-and-Cut for Capacitated Network Design

    • Georg Kliewer, Larissa Timajev
    Pages 47-58
  5. The Complexity of Games on Highly Regular Graphs

    • Konstantinos Daskalakis, Christos H. Papadimitriou
    Pages 71-82
  6. Computing Equilibrium Prices: Does Theory Meet Practice?

    • Bruno Codenotti, Benton McCune, Rajiv Raman, Kasturi Varadarajan
    Pages 83-94
  7. Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Branch Decompositions

    • Frederic Dorn, Eelko Penninkx, Hans L. Bodlaender, Fedor V. Fomin
    Pages 95-106
  8. Linear-Time Enumeration of Isolated Cliques

    • Hiro Ito, Kazuo Iwama, Tsuyoshi Osumi
    Pages 119-130
  9. Delineating Boundaries for Imprecise Regions

    • Iris Reinbacher, Marc Benkert, Marc van Kreveld, Joseph S. B. Mitchell, Alexander Wolff
    Pages 143-154
  10. Exacus: Efficient and Exact Algorithms for Curves and Surfaces

    • Eric Berberich, Arno Eigenwillig, Michael Hemmer, Susan Hert, Lutz Kettner, Kurt Mehlhorn et al.
    Pages 155-166
  11. Min Sum Clustering with Penalties

    • Refael Hassin, Einat Or
    Pages 167-178
  12. Improved Approximation Algorithms for Metric Max TSP

    • Zhi-Zhong Chen, Takayuki Nagoya
    Pages 179-190
  13. Unbalanced Graph Cuts

    • Ara Hayrapetyan, David Kempe, Martin Pál, Zoya Svitkina
    Pages 191-202

Other Volumes

  1. Algorithms – ESA 2005

Editors and Affiliations

  • BRICS, MADALGO, Department of Computer Science, University of Aarhus, Denmark

    Gerth Stølting Brodal

  • University of Rome “La Sapienza”, Rome, Italy

    Stefano Leonardi

Bibliographic Information

Buy it now

Buying options

eBook USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 109.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