WALCOM: Algorithms and Computation

Third International Workshop, WALCOM 2009, Kolkata, India, February 18-20, 2009. Proceedings

  • Sandip Das
  • Ryuhei Uehara

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

Table of contents

  1. Front Matter
  2. Invited Talks

    1. Chee K. Yap, Jihun Yu
      Pages 15-31
    2. Sandeep Sen
      Pages 32-43
    3. Otfried Cheong
      Pages 44-46
  3. Computational Geometry

    1. Subir Kumar Ghosh, Partha Pratim Goswami, Anil Maheshwari, Subhas Chandra Nandy, Sudebkumar Prasant Pal, Swami Sarvattomananda
      Pages 47-58
    2. Mustaq Ahmed, Anna Lubiw, Anil Maheshwari
      Pages 59-70
    3. Sang Won Bae, Matias Korman, Takeshi Tokuyama
      Pages 71-82
    4. Gautam K. Das, Debapriyay Mukhopadhyay, Subhas C. Nandy
      Pages 83-92
    5. Md. Muhibur Rasheed, Masud Hasan, M. Sohel Rahman
      Pages 93-104
    6. Sang Won Bae, Chunseok Lee, Sunghee Choi
      Pages 105-116
  4. Graph Algorithms

    1. Kyriaki Ioannidou, Stavros D. Nikolopoulos
      Pages 117-128
    2. Mahdieh Hasheminezhad, Brendan D. McKay, Tristan Reeves
      Pages 129-140
    3. Katsuhisa Yamanaka, Yota Otachi, Shin-ichi Nakano
      Pages 141-150
    4. Mohammad Tanvir Parvez, Md. Saidur Rahman, Shin-ichi Nakano
      Pages 151-164
    5. Alessandro Borri, Tiziana Calamoneri, Rossella Petreschi
      Pages 165-176
    6. Toshiki Saitoh, Katsuhisa Yamanaka, Masashi Kiyomi, Ryuhei Uehara
      Pages 177-189
    7. Seigo Karakawa, Ehab Morsy, Hiroshi Nagamochi
      Pages 202-213
    8. Takuro Fukunaga, Hiroshi Nagamochi
      Pages 214-225

About these proceedings

Introduction

This book constitutes the refereed proceedings of the Third International Workshop on Algorithms and Computation, WALCOM 2009, held in Kolkata, India, in February 2009.

The 30 revised full papers presented together with 4 invited papers were carefully reviewed and selected from 102 submissions. The papers feature original research in the areas of design and analysis of algorithms, computational geometry, graph drawing and graph algorithms. The papers are organized in topical sections on computational geometry, graph algorithms, complexity, graph drawing, approximation algorithms, and randomized algorithms.

Keywords

algorithms approximation bioinformatics caching classification combinatorial optimization complexity computational biology computational complexity computational geometry computational graph theory distributed algorithms dynamic programming

Editors and affiliations

  • Sandip Das
    • 1
  • Ryuhei Uehara
    • 2
  1. 1.Indian Statistical InstituteKolkataIndia
  2. 2.Japan Advanced Institute of Science and TechnologyIshikawaJapan

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-642-00202-1
  • Copyright Information Springer-Verlag Berlin Heidelberg 2009
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-642-00201-4
  • Online ISBN 978-3-642-00202-1
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book