19:00  ---21:30  

Registration and Reception

February 7, 2008

Venue: Council Bhaban, BUET

8:00 – 9:00

Registration

9:00 – 10:30

Inaugural Session  Chair:  Mohammad Kaykobad

• Welcome Address: Naiyyum Choudhury (Secretary, BAS)

•  WALCOM Introduction: Md. Saidur Rahman

•  WALCOM 2008 PC activities: Shin-ichi Nakano

•  Address of Chief Guest: M. Shamsher Ali  (President of BAS)

•  Address of Special Guest: A. M. M. Safiullah (Vice-chancellor, BUET)

•  Address of Organizing Chair: Mohammad Kaykobad

10:30 – 11:20

Refreshment

11:20 – 11:50

Invited Talk I Chair: Shin-ichi Nakano

• Satoshi Fujita, Vertex domination in dynamic networks

11:50 – 13:15

Bioinformatics Algorithms Chair: Ryuhei Uehara

• Sébastien Angibaud, Guillaume Fertin and Irena Rusu. On the Approximability of Comparing Genomes with Duplicates (Paper Id: 50)

• Costas Iliopoulos and M Sohel Rahman. Indexing Circular Patterns (Paper Id: 37)

• Md. Abdur Razzaque, Choong Seon Hong, Mohammad Abdullah-Al- Wadud and Oksam Chae. A Fast Algorithm to Calculate Powers of a Boolean Matrix for Diameter Computation of Random Graphs (Paper Id: 13)

13:15 – 14:30

Lunch Break

14:30 – 16:35

Computational Geometry and Graph Drawing Chair: Subir Ghosh

• Kensuke Onishi and Mamoru Hoshi. Cover Ratio of Absolute Neighbor (Paper Id: 36)

• Md. Abul Hassan Samee, Mohammad Tanvir Irfan and Md. Saidur Rahman. Computing $\beta$-Drawings of 2-Outerplane Graphs in Linear Time (Paper Id: 30)

• Md. Jawaherul Alam, Md. Abul Hassan Samee, Md. Mashfiqui Rabbi and Md. Saidur Rahman. Upward Drawings of Trees on the Minimum Number of Layers (Paper Id: 38)

• Arindam Karmakar, Sasanka Roy and Sandip Das. Guarding Exterior Region of a Simple Polygon (Paper Id: 48)

• Md. Ashraful Alam and Masud Hasan. Computing Nice Projections of Convex Polyhedra (Paper Id: 23)

16:35 -17:00

Tea Break

17:00 -17:30

Invited Talk II  Chair: Md. Abul Kashem

• Alejandro Lopez-Ortiz, Closing the gap between theory and practice: new measures for online algorithms.

19:30 – 21:30

Workshop Dinner

February 8, 2008

Venue: Council Bhaban, BUET

9:00 – 10:15

Graph Algorithms I Chair: Alejandro Lopez-Ortiz

• Katsuhisa Yamanaka and Shin-Ichi Nakano. A Compact Encoding of Plane Triangulations with Efficient Query Supports (Paper Id: 10)

• Md. Rezaul Karim and Md. Saidur Rahman. Four-Connected Spanning Subgraphs of Doughnut Graphs (Paper Id: 24)

• Daniel Raible and Henning Fernau. Exact Algorithms for Maximum Acyclic Subgraph on a Superclass of Cubic Graphs (Paper Id: 14)

10:15 --  10:35

Tea Break

10:35 – 12:40

Algorithm Engineering Chair: Satoshi Fujita

• Andrzej Lingas, Agnieszka Wasylewicz and Pawel Zylinski. Linear-time 3-approximation algorithm for the r-star covering problem (Paper Id: 3)

• Hiro Ito, Mike Paterson and Kenya Sugihara. Multi-Commodity Source Location Problems and Price of Greed (Paper Id: 44)

• Yerim Chung, Jean-François Culus and Marc Demange. Inverse booking problem: inverse chromatic number problem in interval graphs (Paper Id: 56)

• Dimitrios Koukopoulos, Stavros Nikolopoulos, Leonidas Palios and Pavlos Spirakis. Optimal Algorithms for Detecting Network Stability (Paper Id: 17)

• Alejandro Lopez-Ortiz and Reza Dorrigiv. On Certain New Models for Paging with Locality of Reference (Paper Id: 16)

12:40 – 15:00

Friday Prayer and Lunch Break

15:00 – 15:30

Invited Talk III Chair: Md. Saidur Rahman

• Ryuhei Uehara, Simple geometrical intersection graphs.

15:30 – 16 :45

Graph Algorithms II Chair: Sandip Das

• Katsuhisa Yamanaka and Shin-Ichi Nakano. Listing All Plane Graphs (Paper Id: 9)

• Muhammad Nur Yanhaona, K. S. M. Tozammel Hossain and Md. Saidur Rahman. Pairwise Compatibility Graphs (Paper Id: 21)

• Riadh Khennoufa and Olivier Togni. Multilevel Bandwidth and Radio Labelings of Graphs (Paper Id: 19)

19:00 – 21:30

Workshop Dinner and Closing