3. WALCOM 2009:
Kolkata, India
Sandip Das, Ryuhei Uehara (Eds.):
WALCOM: Algorithms and Computation, Third International Workshop, WALCOM 2009, Kolkata, India, February 18-20, 2009. Proceedings.
Lecture Notes in Computer Science 5431 Springer 2009, ISBN 978-3-642-00201-4 
Invited Talks
Computational Geometry
- Subir Kumar Ghosh, Partha P. Goswami, Anil Maheshwari, Subhas C. Nandy, Sudebkumar Prasant Pal, Swami Sarvattomananda:
Algorithms for Computing Diffuse Reflection Paths in Polygons.
47-58
- Mustaq Ahmed, Anna Lubiw, Anil Maheshwari:
Shortest Gently Descending Paths.
59-70
- Sang Won Bae, Matias Korman, Takeshi Tokuyama:
All Farthest Neighbors in the Presence of Highways and Obstacles.
71-82
- Gautam K. Das, Debapriyay Mukhopadhyay, Subhas C. Nandy:
Improved Algorithm for a Widest 1-Corner Corridor.
83-92
- Md. Muhibur Rasheed, Masud Hasan, M. Sohel Rahman:
Maximum Neighbour Voronoi Games.
93-104
- Sang Won Bae, Chunseok Lee, Sunghee Choi:
On Exact Solutions to the Euclidean Bottleneck Steiner Tree Problem.
105-116
Graph Algorithms
- Kyriaki Ioannidou, Stavros D. Nikolopoulos:
Colinear Coloring on Graphs.
117-128
- Mahdieh Hasheminezhad, Brendan D. McKay, Tristan Reeves:
Recursive Generation of 5-Regular Planar Graphs.
129-140
- Katsuhisa Yamanaka, Yota Otachi, Shin-Ichi Nakano:
Efficient Enumeration of Ordered Trees with kLeaves (Extended Abstract).
141-150
- Mohammad Tanvir Parvez, Md. Saidur Rahman, Shin-Ichi Nakano:
Generating All Triangulations of Plane Graphs (Extended Abstract).
151-164
- Alessandro Borri, Tiziana Calamoneri, Rossella Petreschi:
Recognition of Unigraphs through Superposition of Graphs (Extended Abstract).
165-176
- Toshiki Saitoh, Katsuhisa Yamanaka, Masashi Kiyomi, Ryuhei Uehara:
Random Generation and Enumeration of Proper Interval Graphs.
177-189
- Louis Ibarra:
A Fully Dynamic Graph Algorithm for Recognizing Proper Interval Graphs.
190-201
- Seigo Karakawa, Ehab Morsy, Hiroshi Nagamochi:
Minmax Tree Cover in the Euclidean Space.
202-213
- Takuro Fukunaga, Hiroshi Nagamochi:
Network Design with Weighted Degree Constraints.
214-225
- Michael Brinkmeier:
Minimum Cuts of Simple Graphs in Almost Always Linear Time.
226-237
- Brian C. Dean, Namrata Swar:
The Generalized Stable Allocation Problem.
238-249
- Tamara Mchedlidze, Antonios Symvonis:
Crossing-Optimal Acyclic Hamiltonian Path Completion and Its Application to Upward Topological Book Embeddings.
250-261
- Balasubramanian Sivan, S. Harini, C. Pandu Rangan:
Core and Conditional Core Path of Specified Length in Special Classes of Graphs.
262-273
Complexity
Graph Drawing
- Muhammad Rezaul Karim, Md. Jawaherul Alam, Md. Saidur Rahman:
Straight-Line Grid Drawings of Label-Constrained Outerplanar Graphs with O(nlogn) Area (Extended Abstract).
310-321
- Luca Grilli, Seok-Hee Hong, Giuseppe Liotta, Henk Meijer, Stephen K. Wismath:
Matched Drawability of Graph Pairs and of Graph Triples.
322-333
- Sarmad Abbasi, Patrick Healy, Aimal Rextin:
An Improved Upward Planarity Testing Algorithm and Related Applications.
334-344
- Mahdieh Hasheminezhad, S. Mehdi Hashemi, Brendan D. McKay:
Spherical-Rectangular Drawings.
345-356
Approximation Algorithms
Randomized Algorithms
Last update Sat May 18 19:55:14 2013
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
