Venue

Venue

Institute for Mathematical Sciences, NUS

Institute for Mathematical Sciences, NUS

Institute for Mathematical Sciences, 3 Prince George's Park, Singapore 118402

 



Registration

Registration

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).

Early Bird Register by 25 Nov 2019* Regular Register by 13 Jan 2020*
Participants and/or students SGD600 SGD750

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.

 

 


Organizing Team

Organizing Team

  • Ho Siew Foong (National University of Singapore)
  • Zaini Mohd (National University of Singapore)
  • Kwok Pui Choi (National University of Singapore)
  • Vaibhav Rajan (National University of Singapore)
  • Wing-Kin Sung, Ken (National University of Singapore)

More people will be on board soon


Steering Committee

Steering Committee

  • Kyung-Yong Chwa (KAIST, Korea)
  • Costas S. Iliopoulos (KCL, UK)
  • M. Kaykobad (BUET, Bangladesh)
  • Petra Mutzel (TU Dortmund, Germany)
  • Shin-ichi Nakano (Gunma University, Japan)
  • Subhas Chandra Nandy (Indian Statistical Institute, Kolkata, India)
  • Takao Nishizeki (Tohoku University, Japan)
  • C. Pandu Rangan (IIT, Madras, India)
  • Md. Saidur Rahman (BUET, Bangladesh)


Program Committee

Program Committee

  • Hee-Kap Ahn (POSTECH)
  • Md. Shamsuzzoha Bayzid (BUET, Bangladesh)
  • Guillaume Blin (Universiti de Bordeaux)
  • Hans Bodlaender (Utrecht University)
  • Gautam K Das (Indian Institute of Technology Guwahati)
  • Jackie Daykin (Royal Holloway College)
  • Mark de Berg (Eindhoven University of Technology)
  • Wing-Kai Hon (Nation Tsing Hua University)
  • Seok-Hee Hong (University of Sydney, AUSTRALIA)
  • Jesper Jansson (The Hong Kong Polytechnic University)
  • Ralf Klasing (CNRS and University of Bordeaux)
  • Gad M. Landau (University of Haifa and NYU)
  • Inbok Lee (Korea Aerospace University)
  • Giuseppe Liotta (University of Perugia)
  • Takaaki Mizuki (Tohoku University)
  • Debajyoti Mondal (University of Saskatchewan)
  • Krishnendu Mukhopadhyaya (Indian Statistical Institute)
  • Shin-Ichi Nakano (Gunma University)
  • Solon Pissis (CWI)
  • Simon Puglisi (University of Helsinki)
  • Tomasz Radzik (King's College London)
  • M. Sohel Rahman (Bangladesh University of Engineering and Technology), Chair
  • Atif Rahman (CSE, BUET)
  • Wojciech Rytter (Warsaw University)
  • Kunihiko Sadakane (The University of Tokyo), Chair
  • William F. Smyth (McMaster University)
  • Paul Spirakis (University of Liverpool)
  • Wing-Kin Sung (Nuational University of Singapore), Chair
  • Etsuji Tomita (The University of Electro-Communications)
  • Ryuhei Uehara (Japan Advanced Institute of Science and Technology)
  • Bruce Watson (Stellenbosch University)
  • Sue Whitesides (University of Victoria)
  • Hsu-Chun Yen (National Taiwan University)


Invited Speakers

Invited Speakers

 

 Prof. Osamu Watanabe, Tokyo Tech
 Prof. Louxin Zhang, NUS
 Prof. Md. Saidur Rahman, BUET

 


Proposed Programme

Proposed Programme

  DAY 1 ( 30 MAR 2020 ):
  • Tutorials from invited speakers on a Special Topic Related Combinatorial Methods for String and Graph

  Day 2-4 ( 31 Mar – 2 Apr 2020 ): WALCOM 2020
  • 1 night conference banquet
  • ~3 keynotes
  • Contributed paper presentations

 


Call for Papers

Call for Papers

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 Papers

Accepted Papers

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


Accommodation

Accommodation

  Visitors can stay in hotels near NUS

 

Park Avenue Rochester Hotel
31 Rochester Dr, Singapore 138637
TEL: +65 6808 8600 

Citadines Fusionopolis Singapore
Symbiosis Tower, 3 Fusionopolis Way, 138633
TEL: +65 6248 3333 

Santa Grand Hotel West Coast
428 Pasir Panjang Rd, Singapore 118769
TEL: +65 6778 6788 

Ibis Budget Singapore West Coast
418 Pasir Panjang Rd, Singapore 118759
TEL: +65 6778 6788 

Pasir Panjang Inn
404 Pasir Panjang Rd, Singapore 118741
TEL: +65 6778 8511 

 

 

  In addition, reasonable price accommodations are available in Kent Vale (within campus) on a first-come-first-serve basis.
  Note: may need to share room



Contact Us

Contact Us

Wing-Kin Sung

Professor of Computer Science

National University of Singapore

E-mail: ksung@comp.nus.edu.sg

http://www.comp.nus.edu.sg/~ksung

 

 

 

 

 




Why Singapore?

Why Singapore?