Registration Method

Online registration is required for every participant. Registration will close on 13 Jan 2020*. We DO NOT accept onsite cash payment.
 

Fee Structure

All prices are in Singapore Dollars (SGD), and is inclusive of 7% Goods and Services Tax (GST).


Additional ticket for the conference dinner/accompanying person SGD 150.

Notes:
1. Registration fees paid includes a conference dinner for one person.
2. There is no reduced registration fee even if you do not wish to attend the dinner.
3. Please purchase additional ticket if you have any accompanying person.

Click to Register!

 

 

 

 

 

• 09:30-10:15 Registration
• 10:15-10:30 Opening
• 10:30-11:00 Session 1 (3 papers)
• 11:00-11:30 Tea
• 11:30-12:30 Invited talk 1
• 12:30-14:00 Lunch
• 14:00-16:00 Session 2 (4 papers)
• 16:00-16:30 Tea
• 16:30-17:30 WALCOM Business Meeting

  Day 2: 1 Apr 2020 (Wed)

• 09:00-10:30 Session 3 (3 papers)
• 10:30-11:00 Tea
• 11:00-12:00 Invited talk 2
• 12:00-13:30 Lunch
• 13:30-15:30 Session 4 (4 papers)
• 15:30-16:00 Tea
• 16:00-17:30 Session 5 (3 papers)

• 09:00-10:30 Session 6 (3 papers)
• 10:30-11:00 Tea
• 11:00-12:00 Invited talk 3
• 12:00-13:30 Lunch
• 13:30-15:00 Session 7 (4 papers)
• 15:00-15:30 Tea
• 15:30-17:00 Session 8 (3 papers)
• 17:00-17:30 Closing

 

• Invited talk 1 (Sada)
• Osamu Watanabe: Space Efficient Separator Algorithms for Planar Graphs
•  
• Invited talk 2 (Sohel Rahman)
• Md. Saidur Rahman: Drawing Planar Graphs.
•  
• Invited talk 3 (Wing-Kin Sung)
• Louxin Zhang: Recent progresses in the combinatorial and algorithmic study of phylogenetic networks.

 

• Session 1: Complexity (Osamu Watnabe)
• 1. William Evans, Ellen Gethner, Jack Spalding-Jamieson and Alexander Wolff: Angle Covers: Algorithms and Complexity
  2. Chuzo Iwamoto and Tatsuaki Ibusuki: Computational Complexity of the Chromatic Art Gallery Problem for Orthogonal Polygons
  3. Christian Scheffer: Train Scheduling: Hardness and Algorithms (short)
•  
• Session 2: String (Tetsuo Shibuya)
• 1. Diptarama Hendrian: Generalized Dictionary Matching under Substring Consistent Equivalence Relations
  2. Maxime Crochemore, Costas Iliopoulos, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszyński, Tomasz Walen and Wiktor Zuba: Shortest Covers of All Cyclic Shifts of a String.
  3. Geonmo Gu, Siwoo Song, Simone Faro, Thierry Lecroq and Kunsoo Park: Fast Multiple Pattern Cartesian Tree Matching
  4. Youhei Yoshimoto, Masaharu Kataoka, Yoshimasa Takabatake, Tomohiro I, Kilho Shin and Hiroshi Sakamoto: Faster Privacy-Preserving Computation of Edit Distance with Moves
•  
• Session 3: Robot or routing (Sohel Rahman)
• 1. Ajay Kshemkalyani, Anisur Rahaman Molla and Gokarna Sharma: Dispersion of Mobile Robots on Grids
  2. Subhash Bhagat: Optimum Algorithm for the Mutual Visibility Problem
  3. Man Kwun Chiu, Jonas Cleve, Katharina Klost, Matias Korman, Wolfgang Mulzer, André van Renssen, Marcel Roeloffzen and Max Willert: Routing in Histograms
•  
• Session 4: Graph (and graph drawing) (Md. Saidur Rahman)
• 1. Julliano Rosa Nascimento, Uéverton Souza and Jayme Szwarcfiter: Partitioning a graph into complementary subgraphs
  2. Duc A. Hoang, Akira Suzuki and Tsuyoshi Yagita: Reconfiguring $k$-path vertex covers
  3. Yuichi Asahiro, Hiroshi Eto, Tesshu Hanaka, Guohui Lin, Eiji Miyano and Ippei Terabaru: Parameterized Algorithms for the Happy Set Problem (short)
  4. Joseph Mitchell and Supantha Pandit: Packing and Covering with Segments
•  
• Session 5: Planar graph (Marek Chrobak)
• 1. Felice De Luca, Emilio Di Giacomo, Seok-Hee Hong, Stephen Kobourov, William Lenhart, Giuseppe Liotta, Henk Meijer, Alessandra Tappini and Steve Wismath: Packing Trees into 1-planar Graphs
  2. Michael Kaufmann, Jan Kratochvil, Fabian Lipp, Fabrizio Montecchiani, Chrysanthi Raftopoulou and Pavel Valtr: The Stub Resolution of $1$-planar Graphs
  3. Carla Binucci, Walter Didimo and Fabrizio Montecchiani: An Experimental Study of a 1-planarity Testing and Embedding Algorithm (short)
•  
• Session 6: Graph 2 (Wing-Kin Sung)
• 1. Dat Hoang Tran and Ryuhei Uehara: Efficient Enumeration of Non-isomorphic Ptolemaic Graphs
  2. Yu Nakahata, Jun Kawahara, Takashi Horiyama and Shin-Ichi Minato: Implicit Enumeration of Topological-Minor-Embeddings and Its Application to Planar Subgraph Enumeration
  3. Hirofumi Suzuki, Masakazu Ishihata and Shin-Ichi Minato: Designing Survivable Networks with Zero-suppressed Binary Decision Diagrams
•  
• Session 7: Bipartite graph (Louxin Zhang)
• 1. Yuma Tamura, Takehiro Ito and Xiao Zhou: Approximability of the Independent Feedback Vertex Set Problem for Bipartite Graphs
  2. Cam Ly Nguyen, Vorapong Suppakitpaisarn, Athasit Surarerks and Phanu Vajanopath: On the Maximum Edge-Pair Embedding Bipartite Matching
  3. Ajay Saju Jacob and R. Krithika: Packing Arc-Disjoint Cycles in Bipartite Tournaments
  4. Satyabrata Jana, Anil Maheshwari, Saeed Mehrabi and Sasanka Roy: Maximum Bipartite Subgraph of Geometric Intersection Graphs
•  
• Session 8: Algorithm (Ryuhei Uehara)
• 1. Miguel Coviello Gonzalez and Marek Chrobak: A Waste-Efficient Algorithm for Single-Droplet Sample Preparation on Microfluidic Chips
  2. Carlos Seara, Josué Corujo, David Flores-Pe?aloza, Clemens Huemer and Pablo Pérez-Lantero: Matching random colored points with rectangles
  3. Kei Kimura and Akira Suzuki: Trichotomy for the reconfiguration problem of integer linear systems (short)

 

The 14th International Conference and Workshop on Algorithms and Computation (WALCOM) is intended to provide an international forum for researchers working in the areas of algorithms and computation. WALCOM 2020 will be held during March 31 - April 02, 2020 at National University of Singapore, Singapore. It is being organized in cooperation between Institute of Mathematical Sciences (NUS), School of Computing (NUS), The Special Interest Group for ALgorithms (SIGAL) of the Information Processing Society of Japan (IPSJ), and Technical Committees on Theoretical Foundations of Computing (COMP) of The Institute of Electronics, Information and Communication Engineers (IEICE).

SCOPE 

The range of topics within the scope of WALCOM includes but is not limited to:

• Approximation Algorithms
• Algorithmic Graph Theory and Combinatorics
• Combinatorial Algorithms
• Combinatorial Optimization
• Computational Biology
• Computational Complexity
• Computational Geometry
• Discrete Geometry
• Data Structures
• Experimental Algorithm Methodologies
• Graph Algorithms
• Graph Drawing
• Parallel and Distributed Algorithms
• Parameterized Algorithms
• Parameterized Complexity
• Network Optimization
• Online Algorithms
• Randomized Algorithms
• String Algorithms

AUTHOR INSTRUCTIONS

Authors are invited to submit papers (extended abstracts) describing original research of theoretical or practical significance to algorithms and computation. Papers should not exceed 12 pages in LNCS style. Papers significantly shorter than 12 pages are also welcome. If the authors feel that more details are essential to substantiate the main claim of the paper, they may include a clearly marked appendix that will be read at the discretion of the Program Committee. Only electronic submissions via Easychair will be allowed (https://easychair.org/conferences/?conf=walcom2020). Papers submitted for review should represent original, previously unpublished work and surveys of important results. At the time the paper is submitted to WALCOM 2020, and for the entire review period, the paper (or essentially the same paper) should not be under review by any other conference with published proceedings or by a scientific journal. At least one author of each accepted paper will be expected to attend the conference and present the paper.

AWARDS 

Two awards, namely, "The Best Paper" and "The Best Student Paper" will be awarded. A paper is eligible for the Best Student Paper if the paper is presented by an author, who is a full-time student.

PROCEEDINGS AND SPECIAL ISSUE

Accepted papers will be published in the conference proceedings. Following the tradition of the previous editions of WALCOM the proceedings will be included in the Springer-Verlag series, Lecture Notes in Computer Science. Authors of selected papers will be invited to submit extended versions of their papers to Journal special issues in Theoretical Computer Science (TCS) and Journal of Graph Algorithms and Applications (JGAA).

IMPORTANT DATES

Paper submission deadline : September 15, 2019 (Anywhere on Earth)
Notification of Acceptance/Rejection: October 28, 2019
Camera-ready Submission and Author Registration: November 08, 2019
Conference Dates: March 31-April 02, 2020

Contact: ksung@comp.nus.edu.sg.
Conference website: https://www.comp.nus.edu.sg/~walcom20
Submission link: https://easychair.org/conferences/?conf=walcom2020

Click for PDF 

Accepted Full Papers

1. Julliano Rosa Nascimento, Uéverton Souza and Jayme Szwarcfiter. Partitioning a graph into complementary subgraphs
2. Diptarama Hendrian. Generalized Dictionary Matching under Substring Consistent Equivalence Relations
3. Chuzo Iwamoto and Tatsuaki Ibusuki. Computational Complexity of the Chromatic Art Gallery Problem for Orthogonal Polygons
4. Miguel Coviello Gonzalez and Marek Chrobak. A Waste-Efficient Algorithm for Single-Droplet Sample Preparation on Microfluidic Chips
5. Yuma Tamura, Takehiro Ito and Xiao Zhou. Approximability of the Independent Feedback Vertex Set Problem for Bipartite Graphs
6. Dat Hoang Tran and Ryuhei Uehara. Efficient Enumeration of Non-isomorphic Ptolemaic Graphs
7. Michael Kaufmann, Jan Kratochvil, Fabian Lipp, Fabrizio Montecchiani, Chrysanthi Raftopoulou and Pavel Valtr. The Stub Resolution of $1$-planar Graphs
8. Carlos Seara, Josué Corujo, David Flores-Peñaloza, Clemens Huemer and Pablo Pérez-Lantero. Matching random colored points with rectangles
9. Geonmo Gu, Siwoo Song, Simone Faro, Thierry Lecroq and Kunsoo Park. Fast Multiple Pattern Cartesian Tree Matching
10. Man Kwun Chiu, Jonas Cleve, Katharina Klost, Matias Korman, Wolfgang Mulzer, André van Renssen, Marcel Roeloffzen and Max Willert. Routing in Histograms
11. Ajay Saju Jacob and R. Krithika. Packing Arc-Disjoint Cycles in Bipartite Tournaments
12. Hirofumi Suzuki, Masakazu Ishihata and Shin-Ichi Minato. Designing Survivable Networks with Zero-suppressed Binary Decision Diagrams
13. Felice De Luca, Emilio Di Giacomo, Seok-Hee Hong, Stephen Kobourov, William Lenhart, Giuseppe Liotta, Henk Meijer, Alessandra Tappini and Steve Wismath. Packing Trees into 1-planar Graphs
14. Joseph Mitchell and Supantha Pandit. Packing and Covering with Segments
15. Satyabrata Jana, Anil Maheshwari, Saeed Mehrabi and Sasanka Roy. Maximum Bipartite Subgraph of Geometric Intersection Graphs
16. William Evans, Ellen Gethner, Jack Spalding-Jamieson and Alexander Wolff. Angle Covers: Algorithms and Complexity
17. Yu Nakahata, Jun Kawahara, Takashi Horiyama and Shin-Ichi Minato. Implicit Enumeration of Topological-Minor-Embeddings and Its Application to Planar Subgraph Enumeration
18. Ajay Kshemkalyani, Anisur Rahaman Molla and Gokarna Sharma. Dispersion of Mobile Robots on Grids
19. Duc A. Hoang, Akira Suzuki and Tsuyoshi Yagita. Reconfiguring $k$-path vertex covers
20. Cam Ly Nguyen, Vorapong Suppakitpaisarn, Athasit Surarerks and Phanu Vajanopath. On the Maximum Edge-Pair Embedding Bipartite Matching
21. Subhash Bhagat. Optimum Algorithm for the Mutual Visibility Problem
22. Youhei Yoshimoto, Masaharu Kataoka, Yoshimasa Takabatake, Tomohiro I, Kilho Shin and Hiroshi Sakamoto. Faster Privacy-Preserving Computation of Edit Distance with Moves
23. Maxime Crochemore, Costas Iliopoulos, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszyński, Tomasz Walen and Wiktor Zuba. Shortest Covers of All Cyclic Shifts of a String.

Accepted Short Papers

1. Kei Kimura and Akira Suzuki. Trichotomy for the reconfiguration problem of integer linear systems
2. Yuichi Asahiro, Hiroshi Eto, Tesshu Hanaka, Guohui Lin, Eiji Miyano and Ippei Terabaru. Parameterized Algorithms for the Happy Set Problem
3. Christian Scheffer. Train Scheduling: Hardness and Algorithms
4. Carla Binucci, Walter Didimo and Fabrizio Montecchiani. An Experimental Study of a 1-planarity Testing and Embedding Algorithm

Best Paper

1. Maxime Crochemore, Costas Iliopoulos, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszyński, Tomasz Walen and Wiktor Zuba.
   Shortest Covers of All Cyclic Shifts of a String.

Best Student Paper

1. Yuma Tamura, Takehiro Ito and Xiao Zhou.
   Approximability of the Independent Feedback Vertex Set Problem for Bipartite Graphs.

 

  Note: may need to share room

ksung@comp.nus.edu.sg

 

 

 

 

 

 

• WALCOM 2019
• WALCOM 2018
• WALCOM 2017
• WALCOM 2016
• WALCOM 2015
• WALCOM 2014
• WALCOM 2013
• WALCOM 2012
• WALCOM 2011
• WALCOM 2010
• WALCOM 2009
• WALCOM 2008
• WALCOM 2007