WALCOM 2024 Accepted Papers
Csaba Toth. Plane Multigraphs with One-Bend and Circular-Arc Edges of a Fixed Angle
Tatsuya Gima, Soh Kumabe, Kazuhiro Kurita, Yuto Okada and Yota Otachi. Dichotomies for Tree Minor Containment with Structural Parameters
Jingyang Zhao and Mingyu Xiao. Improved Approximation Algorithms for Cycle and Path Packings
Naoki Domon, Akira Suzuki, Yuma Tamura and Xiao Zhou. The Shortest Path Reconfiguration Problem Based on Relaxation of Reconfiguration Rules
Deniz Ağaoğlu Çağırıcı and Peter Zeman. Recognition and Isomorphism of Proper $\boldsymbol{H}$-graphs for unicyclic $\boldsymbol{H}$ in \emph{FPT}-time
Adri Bhattacharya, Giuseppe Francesco Italiano and Partha Sarathi Mandal. Black Hole Search in Dynamic Cactus Graph
Dennis Wong, Bowie Liu, Chan-Tong Lam and Marcus Im. Generating cyclic 2-Gray codes for Fibonacci q-decreasing words
Cornelius Brand, Viktoriia Korchemna, Michael Skotnica and Kirill Simonov. Counting Vanishing Matrix-Vector Products
Ruoying Li and Sabine Storandt. Exact and Approximate Hierarchical Hub Labeling
Oleg Verbitsky and Maksim Zhukovskii. Canonization of a random circulant graph by counting walks
Andrés López Martínez, Mark de Berg and Frits Spieksma. Stable and Dynamic Minimum Cuts
Thomas Depian, Alexander Dobler, Christoph Kern and Jules Wulms. Minimizing Corners in Colored Rectilinear Grids
Fahad Panolan and Hannane Yaghoubizade. On MAX–SAT with Cardinality Constraint
N R Aravind and Roopam Saxena. The Parameterized Complexity of Terminal Monitoring Set
Axel Kuckuk, Julia Katheder, Stephen Kobourov, Maximilian Pfister and Johannes Zink. Simultaneous Drawing of Layered Trees