WALCOM: Algorithms and Computation

5th International Workshop, WALCOM 2011, New Delhi, India, February 18-20, 2011. Proceedings

  • Naoki Katoh
  • Amit Kumar

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

Table of contents

  1. Front Matter
  2. Invited Talks

    1. Tamal Krishna Dey
      Pages 1-1
    2. Ken-ichi Kawarabayashi
      Pages 2-7
    3. Kurt Mehlhorn
      Pages 8-8
  3. Approximation Algorithms

    1. Mrinal Kumar, Sounaka Mishra, N. Safina Devi, Saket Saurabh
      Pages 21-32
    2. Srivathsan Srinivasagopalan, Costas Busch, S. Sitharama Iyengar
      Pages 33-44
  4. Hardness

    1. David Duris, Yann Strozecki
      Pages 45-56
    2. Mourad El Ouali, Antje Fretwurst, Anand Srivastav
      Pages 57-69
    3. Martin Harrigan, Patrick Healy
      Pages 70-76
  5. Algorithm Engineering

    1. Annabell Berger, Matthias Müller-Hannemann, Steffen Rechner, Alexander Zock
      Pages 77-88
  6. Computational Geometry

    1. Aritra Banik, Bhaswar B. Bhattacharya, Sandip Das
      Pages 98-109
    2. Saladi Rahul, Prosenjit Gupta, Ravi Janardan, K. S. Rajan
      Pages 110-121
    3. Saladi Rahul, Ananda Swarup Das, K. S. Rajan, Kannan Srinathan
      Pages 122-133
  7. Approximation Algorithms

    1. A. Karim Abu-Affash, Paz Carmi, Matthew J. Katz, Gila Morgenstern
      Pages 134-145
    2. Gautam K. Das, Robert Fraser, Alejandro Lòpez-Ortiz, Bradford G. Nickerson
      Pages 146-157
    3. Neelima Gupta, Aditya Pancholi, Yogish Sabharwal
      Pages 158-169
  8. String Algorithms

    1. Sebastian Kniesburges, Christian Scheideler
      Pages 170-181
    2. Joe Sawada, Brett Stevens, Aaron Williams
      Pages 182-190

About these proceedings

Introduction

This book constitutes the proceedings of the 5th International Workshop on Algorithms and Computation, WALCOM 2011, held in New Delhi, India, in February 2011.
The 20 papers presented in this volume were carefully reviewed and selected from 57 submissions.  The papers are grouped in topical sections on approximation algorithms, hardness, algorithm engineering, computational geometry, string algorithms, and graph algorithms.

Keywords

approximation algorithms biconvex graphs complexity computational geometry data structures dynamic programming lattice reduction longest path problem moving points peer-to-peer systems planar graphs polynomial algorithm probabilistic methods shortest path tree drawing

Editors and affiliations

  • Naoki Katoh
    • 1
  • Amit Kumar
    • 2
  1. 1.Department of Architecture and Architectural EngineeringKyoto UniversityNishikyo-kuJapan
  2. 2.Department of Computer Science and Engineering, Hauz KhasIndian Institute of TechnologyNew DelhiIndia

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-642-19094-0
  • Copyright Information Springer Berlin Heidelberg 2011
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-642-19093-3
  • Online ISBN 978-3-642-19094-0
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book