4. WALCOM 2010: Dhaka, Bangladesh

Md. Saidur Rahman, Satoshi Fujita (Eds.): WALCOM: Algorithms and Computation, 4th International Workshop, WALCOM 2010, Dhaka, Bangladesh, February 10-12, 2010. Proceedings. Lecture Notes in Computer Science 5942 Springer 2010, ISBN 978-3-642-11439-7

Invited Talks

Jacob Fox, Fabrizio Frati, János Pach, Rom Pinchasi:
Crossings between Curves with Many Tangencies. 1-8
Tetsuo Asano, Wolfgang Mulzer, Yajun Wang:
Constant-Work-Space Algorithm for a Shortest Path in a Simple Polygon. 9-20
Subir Kumar Ghosh:
Approximation Algorithms for Art Gallery Problems in Polygons and Terrains. 21-34
Emilio Di Giacomo, Giuseppe Liotta:
The Hamiltonian Augmentation Problem and Its Applications to Graph Drawing. 35-46

Xiao Zhou, Takashi Hikino, Takao Nishizeki:
Small Grid Drawings of Planar Graphs with Balanced Bipartition. 47-57
Carla Binucci, Emilio Di Giacomo, Walter Didimo, Aimal Rextin:
Switch-Regular Upward Planar Embeddings of Trees. 58-69
Christian Bachmaier, Franz-Josef Brandenburg, Wolfgang Brunner, Ferdinand Hübner:
A Global k-Level Crossing Reduction Algorithm. 70-81

Binay K. Bhattacharya, Arijit Bishnu, Otfried Cheong, Sandip Das, Arindam Karmakar, Jack Snoeyink:
Computation of Non-dominated Points Using Compact Voronoi Diagrams. 82-93
Syed Ishtiaque Ahmed, Masud Hasan, Md. Ariful Islam:
Cutting a Convex Polyhedron Out of a Sphere. 94-101
Arijit Bishnu, Sandip Das, Subhas C. Nandy, Bhargab B. Bhattacharya:
A Simple Algorithm for Approximate Partial Point Set Pattern Matching under Rigid Motion. 102-112

Patrizio Angelini, Fabrizio Frati:
Acyclically 3-Colorable Planar Graphs. 113-124
Masashi Kiyomi, Toshiki Saitoh, Ryuhei Uehara:
Reconstruction Algorithm for Permutation Graphs. 125-135
Kyriaki Ioannidou, Stavros D. Nikolopoulos:
Harmonious Coloring on Subclasses of Colinear Graphs. 136-148

Guillaume Blin, Sylvie Hamel, Stéphane Vialette:
Comparing RNA Structures with Biologically Relevant Operations Cannot Be Done without Strong Combinatorial Restrictions. 149-160
Jesun Sahariar Firoz, Masud Hasan, Ashik Zinnat Khan, M. Sohel Rahman:
The 1.375 Approximation Algorithm for Sorting by Transpositions Can Run in O(nlogn) Time. 161-166
Saverio Caminiti, Rossella Petreschi:
Parallel Algorithms for Encoding and Decoding Blob Code. 167-178

Naoki Katoh, Shin-ichi Tanigawa:
A Rooted-Forest Partition with Uniform Vertex Demand. 179-190
Etsuji Tomita, Yoichi Sutani, Takanori Higashi, Shinya Takahashi, Mitsuo Wakatsuki:
A Simple and Faster Branch-and-Bound Algorithm for Finding a Maximum Clique. 191-203

Ling-Ju Hung, Ton Kloks:
On Some Simple Widths. 204-215
Takeya Shigezumi, Yushi Uno, Osamu Watanabe:
A New Model for a Scale-Free Hierarchical Structure of Isolated Cliques. 216-227

Sandeep Sen, V. N. Muralidhara:
The Covert Set-Cover Problem with Application to Network Discovery. 228-239
T. V. Thirumala Reddy, D. Sai Krishna, C. Pandu Rangan:
Variants of Spreading Messages. 240-251
Syed Ishtiaque Ahmed, Md. Mansurul Alam Bhuiyan, Masud Hasan, Ishita Kamal Khan:
On Finding a Better Position of a Convex Polygon Inside a Circle to Minimize the Cutting Cost. 252-262
Ming Xu, Liangyu Chen, Zhenbing Zeng, Zhi-bin Li:
Real Root Isolation of Multi-Exponential Polynomials with Application. 263-268

Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh, Somnath Sikdar:
FPT Algorithms for Connected Feedback Vertex Set. 269-280
Mingyu Xiao:
A Simple and Fast Algorithm for Maximum Independent Set in 3-Degree Graphs. 281-292
D. Sai Krishna, T. V. Thirumala Reddy, B. Sai Shashank, C. Pandu Rangan:
Pathwidth and Searching in Parameterized Threshold Graphs. 293-304

Last update Thu May 24 04:46:53 2012 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page