| WALCOM 2024 Schedule | ||
| March 17 | Registration 16:00-18:00 | |
| March 18 | Registration 9:00-17:00 | |
| Session 1 (Invited Talk 1: Chair Ryuhei Uehara) 9:30-10:30 | ||
| Recent Research Activities on Algorithmic Foundations for Social Advancement | Shin-ichi Minato | |
| Coffee Break 10:30-11:00 | ||
| Session 2 (Graph Drawing: Chair Shin-ichi Nakano) 11:00-11:50 | ||
| Plane Multigraphs with One-Bend and Circular-Arc Edges of a Fixed Angle | Csaba Toth | |
| [Best student paper] Quantum Graph Drawing | Susanna Caroppo, Giordano Da Lozzo and Giuseppe Di Battista | |
| Lunch on your own 11:50-13:30 | ||
| Session 3 (Geometric graphs: Chair Kazuhiro Kurita) 13:30-14:45 | ||
| Simultaneous Drawing of Layered Trees | Axel Kuckuk, Julia Katheder, Stephen Kobourov, Maximilian Pfister and Johannes Zink | |
| Fully Dynamic Algorithms for Euclidean Steiner Tree | T-H. Hubert Chan, Gramoz Goranci, Shaofeng H.-C. Jiang, Bo Wang and Quan Xue | |
| The Parameterized Complexity of Terminal Monitoring Set | N R Aravind and Roopam Saxena | |
| Break 14:45-15:00 | ||
| Session 4 (Gray codes and MAX-SAT: Chair Katsuhisa Yamanaka) 15:00-16:15 | ||
| Generating cyclic 2-Gray codes for Fibonacci q-decreasing words | Dennis Wong, Bowie Liu, Chan-Tong Lam and Marcus Im | |
| On the Hardness of Gray Code Problems for Combinatorial Objects | Arturo Merino, Aaron Williams and Namrata | |
| On MAX–SAT with Cardinality Constraint | Fahad Panolan and Hannane Yaghoubizade | |
| Coffee Break 16:15-16:45 | ||
| Session 5 (Computational Geometry: Chair Akira Suzuki) 16:45-18:00 | ||
| Minimizing Corners in Colored Rectilinear Grids | Thomas Depian, Alexander Dobler, Christoph Kern and Jules Wulms | |
| On Layered Area-Proportional Rectangle Contact Representations | Carolina Haase and Philipp Kindermann | |
| Short Flip Sequences to Untangle Segments in the Plane | Guilherme D. Da Fonseca, Yan Gerard and Bastien Rivier | |
| March 19 | Registration 9:00-17:00 | |
| Session 6 (Invited Talk 2: Chair Takehiro Ito) 9:30-10:30 | ||
| Reasons to Fall (More) in Love with Combinatorial Reconfiguration | Naomi Nishimura | |
| Coffee Break 10:30-11:00 | ||
| Session 7 (Approximation Algorithms: Chair Mingyu Xiao) 11:00-11:50 | ||
| Improved Approximation Algorithms for Cycle and Path Packings | Jingyang Zhao and Mingyu Xiao | |
| Exact and Approximate Hierarchical Hub Labeling | Ruoying Li and Sabine Storandt | |
| Group photo 11:50-12:00 | ||
| Lunch on your own 12:00-13:30 | ||
| Session 8 (Combinatorial Reconfiguration: Chair Yushi Uno) 13:30-14:45 | ||
| Reconfiguration of Multisets with Applications to Bin Packing | Jeffrey Kam, Shahin Kamali, Avery Miller and Naomi Nishimura | |
| The Shortest Path Reconfiguration Problem Based on Relaxation of Reconfiguration Rules | Naoki Domon, Akira Suzuki, Yuma Tamura and Xiao Zhou | |
| Combinatorial Reconfiguration with Answer Set Programming: Algorithms, Encodings, and Empirical Analysis | Yuya Yamada, Mutsunori Banbara, Katsumi Inoue, Torsten Schaub and Ryuhei Uehara | |
| Break 14:45-15:00 | ||
| Session 9 (Graph Algorithms 1: Chair Yota Otachi) 15:00-16:15 | ||
| A bisection approach to subcubic maximum induced matching | Gordon Hoi, Sanjay Jain, Ammar Fathin Sabili and Frank Stephan | |
| Stable and Dynamic Minimum Cuts | Andrés López Martínez, Mark de Berg and Frits Spieksma | |
| Black Hole Search in Dynamic Cactus Graph | Adri Bhattacharya, Giuseppe Francesco Italiano and Partha Sarathi Mandal | |
| Coffee Break 16:15-16:45 | ||
| Session 10 (Graphs and Matrices: Chair Yoshio Okamoto) 16:45-18:00 | ||
| Recognition and Isomorphism of Proper H-graphs for unicyclic H in FPT-time | Deniz Ağaoğlu Çağırıcı and Peter Zeman | |
| Canonization of a random circulant graph by counting walks | Oleg Verbitsky and Maksim Zhukovskii | |
| Counting Vanishing Matrix-Vector Products | Cornelius Brand, Viktoriia Korchemna, Michael Skotnica and Kirill Simonov | |
| Banquet and Business Meeting (Tokyu Hotel) 18:30-20:30 | ||
| March 20 | Registration 9:00-12:00 | |
| Session 11 (Graph Algorithms 2: Chair Hirotaka Ono) 9:30-10:45 | ||
| Efficient Enumeration of Drawings and Combinatorial Structures for Maximal Planar Graphs | Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Fabrizio Grosso and Maurizio Patrignani | |
| (t,s)-completely Independent Spanning Trees | Shin-Ichi Nakano | |
| Orientable Burning Number of Graphs | Julien Courtiel, Paul Dorbec, Tatsuya Gima, Romain Lecoq and Yota Otachi | |
| Break 10:45-11:00 | ||
| Session 12 (Graph Algorithms 3: Chair Toshiki Saitoh) 11:00-12:15 | ||
| Dichotomies for Tree Minor Containment with Structural Parameters | Tatsuya Gima, Soh Kumabe, Kazuhiro Kurita, Yuto Okada and Yota Otachi | |
| [Best paper] Structural Parameterizations of Vertex Integrity | Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Ryota Murai, Hirotaka Ono and Yota Otachi | |
| On the Complexity of List H-Packing for Sparse Graph Classes | Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Yota Otachi, Tomohito Shirai, Akira Suzuki, Yuma Tamura and Xiao Zhou | |
| Closing 12:15-12:30 | ||