WALCOM: Algorithms and Computation

1. Front Matter

   Pages I-XIX

   PDF

2. Invited Talk

   1. Front Matter

      Pages 1-1

      PDF

   2. Popping Superbubbles and Discovering Clumps: Recent Developments in Biological Sequence Analysis

      • Costas S. Iliopoulos, Ritu Kundu, Manal Mohamed, Fatima Vayani

      Pages 3-14

3. Graphs Coloring

   1. Front Matter

      Pages 15-15

      PDF

   2. Tropical Dominating Sets in Vertex-Coloured Graphs

      • Jean-Alexandre Anglès d’Auriac, Csilia Bujtás, Hakim El Maftouhi, Marek Karpinski, Yannis Manoussakis, Leandro Montero et al.

      Pages 17-27

   3. On Hamiltonian Colorings of Block Graphs

      • Devsi Bantva

      Pages 28-39

   4. Vertex-Coloring with Star-Defects

      • Patrizio Angelini, Michael A. Bekos, Michael Kaufmann, Vincenzo Roselli

      Pages 40-51

4. Graphs Exploration

   1. Front Matter

      Pages 53-53

      PDF

   2. Lower Bounds for Graph Exploration Using Local Policies

      • Aditya Kumar Akash, Sándor P. Fekete, Seoung Kyou Lee, Alejandro López-Ortiz, Daniela Maftuleac, James McLurkin

      Pages 55-67

   3. Optimal Distributed Searching in the Plane with and Without Uncertainty

      • Alejandro López-Ortiz, Daniela Maftuleac

      Pages 68-79

   4. Formation of General Position by Asynchronous Mobile Robots Under One-Axis Agreement

      • Subhash Bhagat, Sruti Gan Chaudhuri, Krishnendu Mukhopadhyaya

      Pages 80-91

5. Graphs Algorithms

   1. Front Matter

      Pages 93-93

      PDF

   2. On Aligned Bar 1-Visibility Graphs

      • Franz J. Brandenburg, Alexander Esch, Daniel Neuwirth

      Pages 95-106

   3. A Necessary Condition and a Sufficient Condition for Pairwise Compatibility Graphs

      • Md. Iqbal Hossain, Sammi Abida Salma, Md. Saidur Rahman

      Pages 107-113

   4. Mixing Times of Markov Chains of 2-Orientations

      • Stefan Felsner, Daniel Heldt

      Pages 114-127

6. Computational Geometry

   1. Front Matter

      Pages 129-129

      PDF

   2. Computing a Minimum-Width Square Annulus in Arbitrary Orientation

      • Sang Won Bae

      Pages 131-142

   3. A General Framework for Searching on a Line

      • Prosenjit Bose, Jean-Lou De Carufel

      Pages 143-153

   4. An Optimal Algorithm for Computing the Integer Closure of UTVPI Constraints

      • K. Subramani, Piotr Wojciechowski

      Pages 154-165

   5. Covering Points with Convex Sets of Minimum Size

      • Hwan-Gue Cho, William Evans, Noushin Saeedi, Chan-Su Shin

      Pages 166-178

This book constitutes the proceedings of the 10th International Workshop on Algorithms and Computation, WALCOM 2016, held in Kathmandu, Nepal, in March 2016.


The 27 full papers presented together with 4 invited talks were carefully reviewed and selected from 68 submissions. The papers cover a wide range of topics such as approximation algorithms, computational complexity, computational geometry, data structures, graph algorithms, graph coloring, graph exploration, and online algorithms.

• approximation algorithms
• computational complexity
• data structures
• graph algorithms
• online algorithms
• analysis of algorithms
• combinatorial
• algorithms
• combinatorial optimization
• computational geometry
• distributed algorithms
• fully dynamic graphs
• graph coloring
• graph drawing
• graph exploration
• oblivious
• parameterized complexity
• recursion
• relaxation
• stringology

• Dept. of Computer Science and Engin., Bangladesh Univ. of Engin. & Technol., Dhaka, Bangladesh

  Mohammad Kaykobad

• Dept. of Computer Science, Sapienza University of Rome, Rome, Italy

  Rossella Petreschi

Policies and ethics