Table of contents for WALCOM : algorithms and computation : second international workshop, WALCOM 2008, Dhaka, Bangladesh, February 7-8, 2008 : proceedings / Shin-ichi Nakano, Md. Saidur Rahman (eds.).


Bibliographic record and links to related information available from the Library of Congress catalog
Note: Electronic data is machine generated. May be incomplete or contain other coding.


Counter
Invited Talks
Vertex Domination in Dynamic Networks .....................  ......  1
Satoshi Fujita
Closing the Gap Between Theory and Practice: New Measures for
On-Line Algorithm Analysis .......................................  13
Reza Dorrigiv and Alejandro Ldpez-Ortiz
Simple Geometrical Intersection Graphs ............................  25
Ryuhei Uehara
Bioinformatics Algorithms
On the Approximability of Comparing Genomes with Duplicates .......  34
S6bastien Angibaud, Guillaume Fertin, and Irena Rusu
Indexing Circular Patterns .......................................  46
Costas S. Iliopoulos and M. Sohel Rahman
A Fast Algorithm to Calculate Powers of a Boolean Matrix for
Diameter Computation of Random Graphs ..........................   58
Md. Abdur Razzaque, Choong Seon Hong,
M. Abdullah-Al-Wadud, and Oksam Chae
Computational Geometry and Graph Drawing
Cover Ratio of Absolute Neighbor .................................  70
Kensuke Onishi and Mamoru Hoshi
Computing 3-Drawings of 2-Outerplane Graphs in Linear Time ........  81
Md. Abul Hassan Samee, Mohammad Tanvir Irfan, and
Md. Saidur Rahman
Upward Drawings of Trees on the Minimum Number of Layers .........  88
Md. Jawaherul Alam, Md. Abul Hassan Samee,
Md. Mashfiqui Rabbi, and Md. Saidur Rahman
Guarding Exterior Region of a Simple Polygon ......................  100
Arindam Karmakar, Sasanka Roy, and Sandip Das
Computing Nice Projections of Convex Polyhedra ....................  111
Md. Ashraful Alam and Masud Hasan
Graph Algorithms I
A Compact Encoding of Plane Triangulations with Efficient Query
Supports ...................................................      120
Katsuhisa Yamanaka and Shin-ichi Nakano
Four-Connected Spanning Subgraphs of Doughnut Graphs ............  132
Md. Rezaul Karim and Md. Saidur Rahman
Exact Algorithms for Maximum Acyclic Subgraph on a Superclass of
Cubic Graphs ..................    .............................  144
Henning Fernau and Daniel Raible
Algorithm Engineering
Linear-Time 3-Approximation Algorithm for the r-Star Covering
Problem ................................................... 157
Andrzej Lingas, Agnieszka Wasylewicz, and Pawel Zyliriski
Multi-commodity Source Location Problems and Price of Greed .......  169
Hiro Ito, Mike Paterson, and Kenya Sugihara
Inverse Booking Problem: Inverse Chromatic Number Problem in
Interval Graphs ...........................     ....... .... .........  180
Yerim Chung, Jean-Prancois Culus, and Marc Demange
Optimal Algorithms for Detecting Network Stability ..................  188
Dimitrios Koukopoulos, Stavros D. Nikolopoulos,
Leonidas Palios, and Paul G. Spirakis
On Certain New Models for Paging with Locality of Reference .........  200
Reza Dorrigiv and Alejandro Ldpez-Ortiz
Graph Algorithms II
Listing All Plane Graphs................................  .......  210
Katsuhisa Yamanaka and Shin-ichi Nakano
Pairwise Compatibility Graphs ..................................  222
Muhammad Nur Yanhaona, K.S.M. Tozammel Hossain, and
Md. Saidur Rahman
Multilevel Bandwidth and Radio Labelings of Graphs ............... .  234
Riadh Khennoufa and Olivier Togni



Library of Congress subject headings for this publication: Computer algorithms Congresses, Data structures (Computer science) Congresses, Graph theory Congresses