Skip to main content
SpringerLink
Log in

WALCOM: Algorithms and Computation

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

  • Conference proceedings
  • © 2009
Download book PDF

Overview

Editors:
  1. Sandip Das

    1. Indian Statistical Institute, Kolkata, India

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Ryuhei Uehara

    1. Japan Advanced Institute of Science and Technology, Ishikawa, Japan

    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 5431)

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

Included in the following conference series:

Conference proceedings info: WALCOM 2009.

Buy print copy

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

Table of contents (34 papers)

  1. Front Matter

    Download chapter PDF

  3. Computational Geometry

    1. Algorithms for Computing Diffuse Reflection Paths in Polygons

      • Subir Kumar Ghosh, Partha Pratim Goswami, Anil Maheshwari, Subhas Chandra Nandy, Sudebkumar Prasant Pal, Swami Sarvattomananda
      Pages 47-58
      Download chapter PDF

    2. Shortest Gently Descending Paths

      • Mustaq Ahmed, Anna Lubiw, Anil Maheshwari
      Pages 59-70
      Download chapter PDF

    3. All Farthest Neighbors in the Presence of Highways and Obstacles

      • Sang Won Bae, Matias Korman, Takeshi Tokuyama
      Pages 71-82
      Download chapter PDF

    4. Improved Algorithm for a Widest 1-Corner Corridor

      • Gautam K. Das, Debapriyay Mukhopadhyay, Subhas C. Nandy
      Pages 83-92
      Download chapter PDF

    5. Maximum Neighbour Voronoi Games

      • Md. Muhibur Rasheed, Masud Hasan, M. Sohel Rahman
      Pages 93-104
      Download chapter PDF

    6. On Exact Solutions to the Euclidean Bottleneck Steiner Tree Problem

      • Sang Won Bae, Chunseok Lee, Sunghee Choi
      Pages 105-116
      Download chapter PDF

  4. Graph Algorithms

    1. Colinear Coloring on Graphs

      • Kyriaki Ioannidou, Stavros D. Nikolopoulos
      Pages 117-128
      Download chapter PDF

    2. Recursive Generation of 5-Regular Planar Graphs

      • Mahdieh Hasheminezhad, Brendan D. McKay, Tristan Reeves
      Pages 129-140
      Download chapter PDF

    3. Efficient Enumeration of Ordered Trees with k Leaves (Extended Abstract)

      • Katsuhisa Yamanaka, Yota Otachi, Shin-ichi Nakano
      Pages 141-150
      Download chapter PDF

    4. Generating All Triangulations of Plane Graphs (Extended Abstract)

      • Mohammad Tanvir Parvez, Md. Saidur Rahman, Shin-ichi Nakano
      Pages 151-164
      Download chapter PDF

    5. Recognition of Unigraphs through Superposition of Graphs (Extended Abstract)

      • Alessandro Borri, Tiziana Calamoneri, Rossella Petreschi
      Pages 165-176
      Download chapter PDF

    6. Random Generation and Enumeration of Proper Interval Graphs

      • Toshiki Saitoh, Katsuhisa Yamanaka, Masashi Kiyomi, Ryuhei Uehara
      Pages 177-189
      Download chapter PDF

    7. A Fully Dynamic Graph Algorithm for Recognizing Proper Interval Graphs

      • Louis Ibarra
      Pages 190-201
      Download chapter PDF

    8. Minmax Tree Cover in the Euclidean Space

      • Seigo Karakawa, Ehab Morsy, Hiroshi Nagamochi
      Pages 202-213
      Download chapter PDF

    9. Network Design with Weighted Degree Constraints

      • Takuro Fukunaga, Hiroshi Nagamochi
      Pages 214-225
      Download chapter PDF
Back to top

Other volumes

  1. WALCOM: Algorithms and Computation

Keywords

About this book

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.

Editors and Affiliations

  • Indian Statistical Institute, Kolkata, India

    Sandip Das

  • Japan Advanced Institute of Science and Technology, Ishikawa, Japan

    Ryuhei Uehara

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation