2. WALCOM 2008: Dhaka, Bangladesh

Invited Talks

• Satoshi Fujita:
  Vertex Domination in Dynamic Networks. 1-12
  Electronic Edition (link) BibTeX
• Reza Dorrigiv, Alejandro López-Ortiz:
  Closing the Gap Between Theory and Practice: New Measures for On-Line Algorithm Analysis. 13-24
  Electronic Edition (link) BibTeX
• Ryuhei Uehara:
  Simple Geometrical Intersection Graphs. 25-33
  Electronic Edition (link) BibTeX

Bioinformatics Algorithms

• Sébastien Angibaud, Guillaume Fertin, Irena Rusu:
  On the Approximability of Comparing Genomes with Duplicates. 34-45
  Electronic Edition (link) BibTeX
• Costas S. Iliopoulos, M. Sohel Rahman:
  Indexing Circular Patterns. 46-57
  Electronic Edition (link) BibTeX
• Md. Abdur Razzaque, Choong Seon Hong, M. Abdullah-Al-Wadud, Oksam Chae:
  A Fast Algorithm to Calculate Powers of a Boolean Matrix for Diameter Computation of Random Graphs. 58-69
  Electronic Edition (link) BibTeX

Computational Geometry and Graph Drawing

• Kensuke Onishi, Mamoru Hoshi:
  Cover Ratio of Absolute Neighbor. 70-80
  Electronic Edition (link) BibTeX
• Md. Abul Hassan Samee, Mohammad Tanvir Irfan, Md. Saidur Rahman:
  Computing beta -Drawings of 2-Outerplane Graphs in Linear Time. 81-87
  Electronic Edition (link) BibTeX
• Md. Jawaherul Alam, Md. Abul Hassan Samee, Md. Mashfiqui Rabbi, Md. Saidur Rahman:
  Upward Drawings of Trees on the Minimum Number of Layers. 88-99
  Electronic Edition (link) BibTeX
• Arindam Karmakar, Sasanka Roy, Sandip Das:
  Guarding Exterior Region of a Simple Polygon. 100-110
  Electronic Edition (link) BibTeX
• Muhammad Ashraful Alam, Masud Hasan:
  Computing Nice Projections of Convex Polyhedra. 111-119
  Electronic Edition (link) BibTeX

Graph Algorithms I

• Katsuhisa Yamanaka, Shin-Ichi Nakano:
  A Compact Encoding of Plane Triangulations with Efficient Query Supports. 120-131
  Electronic Edition (link) BibTeX
• Md. Rezaul Karim, Md. Saidur Rahman:
  Four-Connected Spanning Subgraphs of Doughnut Graphs. 132-143
  Electronic Edition (link) BibTeX
• Henning Fernau, Daniel Raible:
  Exact Algorithms for Maximum Acyclic Subgraph on a Superclass of Cubic Graphs. 144-156
  Electronic Edition (link) BibTeX

Algorithm Engineering

• Andrzej Lingas, Agnieszka Wasylewicz, Pawel Zylinski:
  Linear-Time 3-Approximation Algorithm for the r -Star Covering Problem. 157-168
  Electronic Edition (link) BibTeX
• Hiro Ito, Mike Paterson, Kenya Sugihara:
  Multi-commodity Source Location Problems and Price of Greed. 169-179
  Electronic Edition (link) BibTeX
• Yerim Chung, Jean-François Culus, Marc Demange:
  Inverse Booking Problem: Inverse Chromatic Number Problem in Interval Graphs. 180-187
  Electronic Edition (link) BibTeX
• Dimitrios Koukopoulos, Stavros D. Nikolopoulos, Leonidas Palios, Paul G. Spirakis:
  Optimal Algorithms for Detecting Network Stability. 188-199
  Electronic Edition (link) BibTeX
• Reza Dorrigiv, Alejandro López-Ortiz:
  On Certain New Models for Paging with Locality of Reference. 200-209
  Electronic Edition (link) BibTeX

Graph Algorithms II

• Katsuhisa Yamanaka, Shin-Ichi Nakano:
  Listing All Plane Graphs. 210-221
  Electronic Edition (link) BibTeX
• Muhammad Nur Yanhaona, K. S. M. Tozammel Hossain, Md. Saidur Rahman:
  Pairwise Compatibility Graphs. 222-233
  Electronic Edition (link) BibTeX
• Riadh Khennoufa, Olivier Togni:
  Multilevel Bandwidth and Radio Labelings of Graphs. 234-239
  Electronic Edition (link) BibTeX