The 15th International Conference and Workshops on Algorithms and Computing (WALCOM-2021)

Call for Paper

The 15^th 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 2021 will be held during February 28 – March 2, 2021 at University of Information Technology, Yangon, Myanmar. It is being organized in cooperation between University of Information Technology and Japan Advanced Institute of Science and Technology.

We, the organizers of WALCOM 2021, are fully aware of the potential impact on the COVID-19 pandemic. We fully understand that it will be difficult for some authors to travel due to various restrictions. To ensure the safety of all our participants, the WALCOM 2021 organizing committee has therefore decided to hold the conference “FULLY ONLINE”.

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

Submission Guideline

Award

“The Best Paper” and “The Best Student Paper” will be awarded.

Proceedings and Special Issues

The proceedings will be included in the Springer-Verlag series, Lecture Notes in Computer Science. Special issues dedicated to WALCOM 2021 will be published at theJournal of Graph Algorithms and Applications and Theoretical Computer Science, Elsevier.

Important Dates

Submission Deadline	September 22, 2020 October 2, 2020 (Anywhere on Earth)
Acceptance/ Rejection Notification	November 2, 2020 November 9, 2020
Deadline Camera Ready	November 23, 2020 November 30,2020
Deadline Registration	December 15, 2020 (Hybrid Style)
Deadline Registration	February 21, 2021 (Free Online Attendee)

Authors are invited to submit papers describing original research of theoretical or practical significance to algorithms and computation and must not simultaneously submit it to another journal or conference. Papers should not exceed 12 pages in LNCS style. It can be downloaded from here. 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 [link]. Papers submitted for review should represent original, previously unpublished work and surveys of important results. At the time the paper is submitted to WALCOM 2021, 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 join the conference and present the paper. We are now planning to hold the WALCOM 2021 ” FULLY ONLINE“.

Advisory Board

Dr. Mohammad Kaykobad, Distinguished Professor, CSE Department, BRAC University
Takao Nishizeki, Tohoku University, Japan
C. Pandu Rangan, IIT, Madras, India

STEERING COMMITTEE

Tamal Dey, The Ohio State University, USA
Seok-Hee Hong, University of Sydney, Australia
Costas S. Iliopoulos, KCL, UK
Giuseppe Liotta, University of Perugia, Italy
Petra Mutzel, University of Bonn, Germany
Shin-ichi Nakano, Gunma University, Japan
Subhas Chandra Nandy, Indian Statistical Institute, Kolkata, India
Md. Saidur Rahman, BUET, Bangladesh
Ryuhei Uehara, Japan Advanced Institute of Science and Technology, Japan

PROGRAM COMMITTEE

Hee-Kap Ahn (Pohang University of Science and Technology)
Shamsuzzoha Bayzid (Bangladesh University of Engineering and Technology)
Guillaume Blin (University of Bordeaux)
Hans Bodlaender (Utrecht University)
Gautam Das (Indian Institute of Technology Guwahati)
Jesper Jansson (Hong Kong Polytechnic University)
Wing-Kai Hon (National Tsing Hua University)
Seok-Hee Hong (University of Sydney, AUSTRALIA), Chair
Ralf Klasing (University of Bordeaux)
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)
Subhas C. Nandy (Indian Statistical Institute), Chair
Solon Pissis (Centrum Wiskunde & Informatica)
Simon Puglisi (University of Helsinki)
Tomasz Radzik (King’s College London)
Atif Rahman (Bangladesh University of Engineering and Technology)
Mohammad Sohel Rahman (Bangladesh University of Engineering and Technology)
Kunihiko Sadakane (University of Tokyo)
Slamin (University of Jember)
William F. Smyth (McMaster University)
Paul Spirakis (University of Liverpool)
Wing-Kin Sung (National University of Singapore)
Ryuhei Uehara (Japan Advanced Institute of Science and Technology), Chair
Bruce Watson (Stellenbosch University)
Hsu-Chun Yen (National Taiwan University)

ORGANIZING COMMITTEE

Prof. Saw Sand Aye, UIT, Myanmar
Prof. Ryuhei Uehara, JAIST, Japan
Prof. Wint Thida Zaw, UIT, Myanmar
Prof. Myat Thida Mon, UIT, Myanmar
Prof. Swe Zin Hlaing, UIT, Myanmar
Prof. Ei Chaw Htoon, UIT, Myanmar
Prof. Swe Swe Kyaw, UIT, Myanmar
Prof. Aye Theingi, UIT, Myanmar
Prof. Win Win Myo, UIT, Myanmar

INVITED SPEAKERS

Dr. Mohammad Kaykobad, Distinguished Professor, CSE Department, BRAC University

Emeritus Prof. Tetsuo Asano, JAIST

Prof. Erik Demaine, MIT

Accepted Papers

The Springer copyright form to publish Lecture Notes in Computer Science can be downloaded here.

Umesh Sandeep Danda, G. Ramakrishna, Jens M. Schmidt and M. Srikanth. “On Short Fastest Paths in Temporal Graphs”

Soh Kumabe and Takanori Maehara. r-Gathering Problems on Spiders: Hardness, FPT Algorithms, and PTASes

Kazuaki Yamazaki, Mengze Qian and Ryuhei Uehara. Efficient Enumeration of Non-isomorphic Distance-Hereditary Graphs and Ptolemaic Graphs

Oswin Aichholzer, Alan Arroyo, Zuzana Masárová, Irene Parada, Daniel Perz, Alexander Pilz, Josef Tkadlec and Birgit Vogtenhuber. On Compatible Matchings

Haitao Wang and Yiming Zhao. Algorithms for Diameters of Unicycle Graphs and Diameter-Optimally Augmenting Trees

Suthee Ruangwises and Toshiya Itoh. Physical Zero-Knowledge Proof for Ripple Effect

Toshiki Saitoh, Ryo Yoshinaka and Hans L. Bodlaender. Fixed-Treewidth-Efficient Algorithms for Edge-Deletion to Interval Graph Classes

Alessio Conte and Etsuji Tomita. Overall and delay complexity of the CLIQUESand Bron-Kerbosch algorithms

Jurek Czyzowicz, Konstantinos Georgiou, Ryan Killick, Evangelos Kranakis, Danny Krizanc, Lata Narayanan, Jaroslav Opatrny and Denis Pankratov. The Bike Sharing Problem

Thomas Byrne, Sándor Fekete, Jörg Kalcsics and Linda Kleist. Competitive Location Problems: Balanced Facility Location and the One-Round Manhattan Voronoi Game

Elena Arseneva, Pilar Cano, Linda Kleist, Tamara Mchedlidze, Saeed Mehrabi, Irene Parada and Pavel Valtr. Upward Point Set Embeddings of Paths and Trees

Giovanni Viglietta, Ryuhei Uehara and Kwon Kham Sai. Cyclic Shift Problems on Graphs

Frank Gurski, Dominique Komander and Marvin Lindemann. Homomorphisms to digraphs with large girth and oriented colorings of minimal series-parallel digraphs

Soma Murata, Daiki Miyahara, Takaaki Mizuki and Hideaki Sone. Efficient Generation of a Card-based Uniformly Distributed Random Derangement

Ahmad Biniaz. Better approximation algorithms for maximum weight internal spanning trees in cubic graphs and claw-free graphs

Emilio Di Giacomo, Jaroslav Hančl and Giuseppe Liotta. 2-colored Point-set Embeddings of Partial 2-trees

Debajyoti Mondal, Parthiban Natarajan, Kavitha Venkatachalam and Indra Rajasingh. APX-Hardness and Approximation for the k-Burning Number Problem

Mahdi Belbasi and Martin Fürer. An Improvement of Reed’s Treewidth Approximation

Tesshu Hanaka, Kazuma Kawai and Hirotaka Ono. Computing L(p,1)-Labeling with Combined Parameters

Raghunath Reddy Madireddy, Subhas Nandy and Supantha Pandit. Geometric Red-Blue Set Cover Problem

Tetsuya Fujie, Yuya Higashikawa, Naoki Katoh, Junichi Teruyama and Yuki Tokuini. Minmax Regret 1-Sink Location Problems on Dynamic Flow Path Networks with Parametric Weights

Ko Minamisawa, Ryuhei Uehara and Masao Hara. Mathematical Characterizations and Computational Complexity of Anti-Slide Puzzles

Prosenjit Bose, Saeed Mehrabi and Debajyoti Mondal. Faster Multi-Sided Boundary Labelling

Bireswar Das and Shivdutt Sharma. Compact Data Structures for Dedekind Groups and Finite Rings

Best Papers

On Compatible Matchings

Oswin Aichholzer, Alan Arroyo, Zuzana Masárová, Irene Parada, Daniel Perz, Alexander Pilz, Josef Tkadlec and Birgit Vogtenhuber.

Programme

WALCOM 2021 Program

WALCOM-2021-Program

Registration

Each participant needs to register for WALCOM 2021. Registration of Category A and Category B will close on 15 December 2020. Registration of Category C will close on 21 February 2021. We DO NOT accept onsite cash payment.

Category	Participants	Fees
A	Full registration (LNCS volume, souvenirs, and meals onsite)	USD 50
B	Student registration (LNCS volume, souvenirs, and meals onsite)	USD 25
C	Just to be as an audience	No Fee