WALCOM: Algorithms and Computation

1. Front Matter

   Pages I-XX

   PDF

2. A Simple Algorithm for r-gatherings on the Line

   • Shin-ichi Nakano

   Pages 1-7

3. Enumeration of Nonisomorphic Interval Graphs and Nonisomorphic Permutation Graphs

   • Kazuaki Yamazaki, Toshiki Saitoh, Masashi Kiyomi, Ryuhei Uehara

   Pages 8-19

4. Secret Key Amplification from Uniformly Leaked Key Exchange Complete Graph

   • Tatsuya Sasaki, Bateh Mathias Agbor, Shingo Masuda, Yu-ichi Hayashi, Takaaki Mizuki, Hideaki Sone

   Pages 20-31

5. Approximating Partially Bounded Degree Deletion on Directed Graphs

   • Toshihiro Fujito, Kei Kimura, Yuki Mizuno

   Pages 32-43

6. Minimum-Width Annulus with Outliers: Circular, Square, and Rectangular Cases

   • Hee-Kap Ahn, Taehoon Ahn, Sang Won Bae, Jongmin Choi, Mincheol Kim, Eunjin Oh et al.

   Pages 44-55

7. Minimum-Width Square Annulus Intersecting Polygons

   • Hee-Kap Ahn, Taehoon Ahn, Jongmin Choi, Mincheol Kim, Eunjin Oh

   Pages 56-67

8. Two New Schemes in the Bitprobe Model

   • Mirza Galib Anwarul Husain Baig, Deepanjan Kesh

   Pages 68-79

9. Faster Network Algorithms Based on Graph Decomposition

   • Manas Jyoti Kashyop, Tsunehiko Nagayama, Kunihiko Sadakane

   Pages 80-92

10. An Improvement of the Algorithm of Hertli for the Unique 3SAT Problem

    • Tong Qin, Osamu Watanabe

    Pages 93-105

11. Random Popular Matchings with Incomplete Preference Lists

    • Suthee Ruangwises, Toshiya Itoh

    Pages 106-118

12. Scheduling Batch Processing in Flexible Flowshop with Job Dependent Buffer Requirements: Lagrangian Relaxation Approach

    • Hanyu Gu, Julia Memar, Yakov Zinder

    Pages 119-131

13. Computing Periods\(\ldots \)

    • Junhee Cho, Sewon Park, Martin Ziegler

    Pages 132-143

14. A Note on Online Colouring Problems in Overlap Graphs and Their Complements

    • Marc Demange, Martin Olsen

    Pages 144-155

15. Online Facility Assignment

    • Abu Reyan Ahmed, Md. Saidur Rahman, Stephen Kobourov

    Pages 156-168

16. Fault-Tolerant Complete Visibility for Asynchronous Robots with Lights Under One-Axis Agreement

    • Aisha Aljohani, Pavan Poudel, Gokarna Sharma

    Pages 169-182

17. A Simple, Fast, Filter-Based Algorithm for Circular Sequence Comparison

    • Md. Aashikur Rahman Azim, Mohimenul Kabir, M. Sohel Rahman

    Pages 183-194

18. Boosting over Non-deterministic ZDDs

    • Takahiro Fujita, Kohei Hatano, Eiji Takimoto

    Pages 195-206

19. On Multiple Longest Common Subsequence and Common Motifs with Gaps (Extended Abstract)

    • Suri Dipannita Sayeed, M. Sohel Rahman, Atif Rahman

    Pages 207-215

20. FPT Algorithms Exploiting Carving Decomposition for Eulerian Orientations and Ice-Type Models

    • Shinya Shiroshita, Tomoaki Ogasawara, Hidefumi Hiraishi, Hiroshi Imai

    Pages 216-227

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