Free online access to the WALCOM 2021 proceedings

Click here for a free online access to the WALCOM 2021 proceedings for a period of 4 weeks. (If you have any troubles to free access, please contact to walcom2021-staff@ml.jaist.ac.jp .)

Schedule of WALCOM 2021

Note: Time zone is in Myanmar (MMT).

February 28 (Sunday)

10:20-10:30 Opening
10:30-11:30 Graph Algorithms 1 (Chair: Ryuhei Uehara) [discussions after talks] Algorithms for Diameters of Unicycle Graphs and Diameter-Optimally Augmenting Trees [Video] Haitao Wang and Yiming Zhao On Short Fastest Paths in Temporal Graphs [Video] Umesh Sandeep Danda, G. Ramakrishna, Jens M. Schmidt and M. Srikanth Minmax Regret 1-Sink Location Problems on Dynamic Flow Path Networks with Parametric Weights [Video] Tetsuya Fujie, Yuya Higashikawa, Naoki Katoh, Junichi Teruyama and Yuki Tokuini
13:00-14:00 Randomized algorithm, online algorithm, data structures (Chair: Kunihiko Sadakane) [discussions after talks] The Bike Sharing Problem [Video] Jurek Czyzowicz, Konstantinos Georgiou, Ryan Killick, Evangelos Kranakis, Danny Krizanc, Lata Narayanan, Jaroslav Opatrny and Denis Pankratov Efficient Generation of a Card-based Uniformly Distributed Random Derangement [Video] Soma Murata, Daiki Miyahara, Takaaki Mizuki and Hideaki Sone Compact Data Structures for Dedekind Groups and Finite Rings [Video] Bireswar Das and Shivdutt Sharma
14:30-15:30 Computational Geometry 1 (Chair: Takeshi Tokuyama) [discussions after talks] Competitive Location Problems: Balanced Facility Location and the One-Round Manhattan Voronoi Game [Video] Thomas Byrne, Sándor Fekete, Jörg Kalcsics and Linda Kleist Faster Multi-Sided One-Bend Boundary Labelling [Video] Prosenjit Bose, Saeed Mehrabi and Debajyoti Mondal On the Geometric Red-Blue Set Cover Problem [Video] Raghunath Reddy Madireddy, Subhas C. Nandy and Supantha Pandit
16:00-17:00 Invited talk by Mohammad Kaykobad (Chair: Md. Saidur Rahman) Majority Spanning Trees, Cotrees and Their Applications [LIVE] March 1 (Monday) 09:00-10:00 Graph Algorithms 2 (Chair: Giovanni Viglietta) [discussions after talks] Fixed-Treewidth-Efficient Algorithms for Edge-Deletion to Interval Graph Classes [Video] Toshiki Saitoh, Ryo Yoshinaka and Hans L. Bodlaender r-Gathering Problems on Spiders: Hardness, FPT Algorithms, and PTASes [Video] Soh Kumabe and Takanori Maehara An Improvement of Reed's Treewidth Approximation [Video] Mahdi Belbasi and Martin Fürer 10:30-11:30 Graph Algorithms 3 (Chair: Toshiki Saitoh) [discussions after talks] Homomorphisms to Digraphs with Large Girth and Oriented Colorings of Minimal Series-Parallel Digraphs [Video] Frank Gurski, Dominique Komander and Marvin Lindemann Overall and Delay Complexity of the CLIQUES and Bron-Kerbosch Algorithms [Video] Alessio Conte and Etsuji Tomita Computing L(p,1)-Labeling with Combined Parameters [Video] Tesshu Hanaka, Kazuma Kawai and Hirotaka Ono 13:00-14:00 Intived talk by Tetsuo Asano (JST 15:30-16:30) (Chair: Subhas C. Nandy) A New Transportation Problem on a Graph with Sending and Bringing-Back Operations [Video] 14:30-15:30 Computational Geometry 2 (Chair: Sándor P. Fekete) [discussions after talks] On Compatible Matchings (Best paper) [Video] Oswin Aichholzer, Alan Arroyo, Zuzana Masárová, Irene Parada, Daniel Perz, Alexander Pilz, Josef Tkadlec and Birgit Vogtenhuber Upward Point Set Embeddings of Paths and Trees [Video] Elena Arseneva, Pilar Cano, Linda Kleist, Tamara Mchedlidze, Saeed Mehrabi, Irene Parada and Pavel Valtr 2-colored Point-Set Embeddings of Partial 2-trees [Video] Emilio Di Giacomo, Jaroslav Hančl Jr. and Giuseppe Liotta 16:00-17:00 Graph Algorithms 4 (Chair: Takashi Horiyama) [discussions after talks] Better Approximation Algorithms for Maximum Weight Internal Spanning Trees in Cubic Graphs and Claw-free Graphs [Video] Ahmad Biniaz APX-Hardness and Approximation for the k-Burning Number Problem [Video] Debajyoti Mondal, Parthiban Natarajan, Kavitha Venkatachalam and Indra Rajasingh Efficient Enumeration of Non-isomorphic Distance-Hereditary Graphs and Ptolemaic Graphs [Video] Kazuaki Yamazaki, Mengze Qian and Ryuhei Uehara 17:30-18:00 Business Meeting [Video] March 2 (Tuesday)
09:00-10:00 Intived talk by Erik Demaine (EST 21:30-22:30) (Chair: Ryuhei Uehara) Understanding the Complexity of Motion Planning [LIVE]
10:30-11:30 Games, Puzzles, and Complexity (Chair: Yushi Uno) [discussions after talks] Physical Zero-Knowledge Proof for Ripple Effect [Video] Suthee Ruangwises and Toshiya Itoh Cyclic Shift Problems on Graphs [Video] Kwon Kham Sai, Giovanni Viglietta, and Ryuhei Uehara Mathematical Characterizations and Computational Complexity of Anti-Slide Puzzles [Video] Ko Minamisawa, Ryuhei Uehara and Masao Hara Maintained by R.Uehara (uehara@jaist.ac.jp)