WALCOM: Algorithms and Computation

1. On Structural Parameterizations of Happy Coloring, Empire Coloring and Boxicity

   • Jayesh Choudhari, I. Vinod Reddy

   Pages 228-239

2. Complexity of the Maximum k-Path Vertex Cover Problem

   • Eiji Miyano, Toshiki Saitoh, Ryuhei Uehara, Tsuyoshi Yagita, Tom C. van der Zanden

   Pages 240-251

3. On the Parallel Parameterized Complexity of the Graph Isomorphism Problem

   • Bireswar Das, Murali Krishna Enduri, I. Vinod Reddy

   Pages 252-264

4. Back Matter

   Pages 265-265

   PDF

This book constitutes the proceedings of the 12th International Workshop on Algorithms and Computation, WALCOM 2018, held in Dhaka, Bangladesh, in March 2018.


The 22 full papers presented were carefully reviewed and selected from 50 submissions. The papers cover diverse areas of algorithms and computation, such as approximation algorithms, computational geometry, combinatorial algorithms, computational biology, computational complexity, data structures, graph and network algorithms, and online algorithms.

• approximation algorithms
• artificial intelligence
• combinatorial optimization
• computational complexity
• data structures
• graph algorithms
• graph theory
• heuristic methods
• learning algorithms
• linear programming
• machine learning
• problem solving
• randomized algorithms
• algorithm analysis and problem complexity

• Bangladesh University of Engineering and Technology, Dhaka, Bangladesh

  M. Sohel Rahman

• National University of Singapore , Singapore, Singapore

  Wing-Kin Sung

• Japan Advanced Institute of Science and Technology, Ishikawa, Japan

  Ryuhei Uehara

Policies and ethics