Bangladesh Academy of Sciences

Dept. of CSE, BUET





Therap Services

Program of WALCOM 2012
19:00 – 21:30 Registration and Reception Venue: Dept. of CSE, New Academic Building
8:30 – 9:30 Registration Venue : Council Bhaban


9:30 – 10:30

9:30 – 9:35

9:35 – 9:40

9:40 – 9:50

9:50 – 9:55

9:55 – 10:00

10:00 – 10:05

10:05 – 10:10

10:10 – 10:20

10:20 – 10:30

– 10:35

Inaugural Session Venue : Council Bhaban
Chair: S. M. Nazrul Islam

Recitation from Holy Quran

Welcome Address
M. Kaykobad (Head, CSE, BUET)

A Presentation on International Mother Language Day

WALCOM 2012 Program Committee Activities
Shin-ichi Nakano (Program Committee Co-chair, WALCOM 2012)

Address of  Guest of Honor
Naiyyum Choudhury (Secretary, BAS)

Address of Guest of Honor
M. Habibur Rahman (Pro-Vice-Chancellor, BUET)

Address of the Special Guest
M. Shamsher Ali (President, BAS)

Address of the Chief Guest
Yeafesh Osman (Honorable State Minister, Ministry of Science & Technology,
The People’s Republic of Bangladesh)

Address of the Chair
S. M. Nazrul Islam (Vice-Chancellor, BUET)

Vote of Thanks
Md. Saidur Rahman (Program Committee Co-chair, WALCOM 2012)

10:35 – 11:30 Refreshment & Change of Venue to IAC
11:30 – 12:20 Invited Talk                                                   Chair: M. Kaykobad

Peter Widmayer, Combinatorial Optimization with Noisy Inputs: How Can We Separate the Wheat from the Chaff?

12:20 –13:10 Graph Algorithms I                                                   Chair: Md. Sohel Rahman
Takeaki Uno, Ryuhei Uehara and Shin-Ichi Nakano. Bounding the number of reduced trees, cographs, and series-parallel graphs by compression (Id: 43)
N.S. Narayanaswamy and R. Krithika. Generalized Above Guarantee Vertex Cover and r-Partization (Id: 49) 
13:10 – 15:00 Lunch Break
15:00 – 16:15 Computational Geometry                                                 Chair: Masud Hasan

Sang Won Bae and Kyung-Yong Chwa. Farthest Voronoi Diagrams under Travel Time Metrics (Id: 8)

Sang Won Bae. Tight Bound for Farthest-Color Voronoi Diagrams of Line Segments (Id: 26)

Ananda Swarup Das, Prosenjit Gupta, Anil Kishore Kalavagattu, Kannan Srinathan, Kishore Kothapalli and Jatin Agarwal. Range Aggregate Maximal Points in the Plane (Id: 39)
16:15 – 17:00 Tea Break
17:00 – 18:15 Approximation Algorithms                                                  Chair: Sudebkumar Prasant Pal

Trivikram Dokka, Frits Spieksma and Anastasia Kouvela. Approximating the multi-level bottleneck assignment problem (Id: 14)

Nicolas Boria, Jerome Monnot and Vangelis Paschos. Reoptimization of the maximum weight \textsc{$P_k$-free subgraph} under vertex insertion (Id: 15)

Franz Josef Brandenburg, Andreas Gleißner and Andreas Hofmeier. Comparing and Aggregating Partial Orders with Kendall Tau Distances (Id: 29)
20:00 – 21:30 Dinner
9:30 – 10:45 Graph Algorithms I I                                                  Chair: Subir Kumar Ghosh

Biing-Feng Wang, Jhih-Hong Ye and Pei-Jung Chen. On the round-trip 1-center and 1-median problems (Id: 3)

 Sammi Abida Salma and Md. Saidur Rahman. Triangle-Free Outer Planar 3-Graphs are Pairwise Compatibility Graphs (Id: 21)

Tiziana Calamoneri, Rossella Petreschi and Blerina Sinaimeri. On relaxing the constraints in pairwise compatibility graphs (Id: 38)

10:45 – 11:10 Tea Break
11:10 – 12:00 Invited Talk                                                  Chair: Shin-ichi Nakano

Kazuo Iwama, Approximability of Stable Matching Problems

12:00 – 12:50 Graph Drawing I                                                  Chair: Peter Widmayer
Md. Iqbal Hossain, Debajyoti Mondal, Md. Saidur Rahman and Sammi Abida Salma. Universal Line-Sets for Drawing Planar 3-Trees (Id: 19)

Stephane Durocher and Debajyoti Mondal. On the Hardness of Point-Set Embeddability (Id: 34)

12:50 – 14:40 Lunch Break
14:40 – 15:30 Invited Talk                                                  Chair: Md. Saidur Rahman

Sue Whitesides, On Three-Dimensional Graph Drawing and Embedding

15:30 – 16:20 String and Data Structure                                                  Chair: Rossella Petreschi

Dr.M.Sohel Rahman, Sumaiya Nazeen, Rezwana Reaz and Tanaeem Moosa. Linear Time Inference of Strings from Cover Arrays using a Binary Alphabet (Id: 25)

Amr Elmasry and Jyrki Katajainen. Fat Heaps Without Regular Counters (Id: 31)
16:20 – 16:40 Tea Break
16:40 – 18:00 Open Problem Session                                                   Chair: Sue Whitesides

Subir Kumar Ghosh, On triangulation of high connectivity

Andreas Gleißner, Random Connected Graphs

Rahnuma Islam Nishat, Approximation Algorithm for Minimum-Segment Drawings

Debajyoti Mondal, Approximate Point-Set Embeddings

Rossella Petreschi, Are Split Matrogenic Graphs PCGs?
18:00 – 18:30 Declaration of Next WALCOM
20:00 – 21:30 Workshop Dinner
9:30 – 10:40 Graph Drawing II                                                  Chair: Shin-ichi Nakano

Martin Fink, Jan-Henrik Haunert, Tamara Mchedlidze, Joachim Spoerhase and Alexander Wolff. Drawing Graphs with Vertices at Specified Positions and Crossings at Large Angles (Id: 22)

Christian Bachmaier and Marco Matzeder. Drawing Unordered Trees on k-Grids (Id: 40)

Emilio Di Giacomo, Walter Didimo, Luca Grilli, Giuseppe Liotta and Salvatore Agostino Romeo. Heuristics for the Maximum 2-Layer RAC Subgraph Problem (Id: 9)

10:40 – 11:00 Tea break
11:00 – 11:50 Games and Cryptography                                                   Chair: Kazuo Iwama
Yasushi Kawase and Kazuhisa Makino. Nash Equilibria with Minimum Potential in Undirected Broadcast Games (Id: 12)

Vorapong Suppakitpaisarn, Masato Edahiro and Hiroshi Imai. Calculating Average Joint Hamming Weight for Minimal Weight Conversion of d Integers (Id: 50)
11:50 – 12:10 Concluding Remarks
12:30 – 15:00 Lunch


WALCOM '12 Organizing Committee