Accepted Papers

WALCOM 2024 Accepted Papers

Csaba Toth. Plane Multigraphs with One-Bend and Circular-Arc Edges of a Fixed Angle
Gordon Hoi, Sanjay Jain, Ammar Fathin Sabili and Frank Stephan. A bisection approach to subcubic maximum induced matching
Shin-Ichi Nakano. (t, s)-completely Independent Spanning Trees
Tatsuya Gima, Soh Kumabe, Kazuhiro Kurita, Yuto Okada and Yota Otachi. Dichotomies for Tree Minor Containment with Structural Parameters
Guilherme D. Da Fonseca, Yan Gerard and Bastien Rivier. Short Flip Sequences to Untangle Segments in the Plane
Yuya Yamada, Mutsunori Banbara, Katsumi Inoue, Torsten Schaub and Ryuhei Uehara. Combinatorial Reconfiguration with Answer Set Programming: Algorithms, Encodings, and Empirical Analysis
Carolina Haase and Philipp Kindermann. On Layered Area-Proportional Rectangle Contact Representations
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
T-H. Hubert Chan, Gramoz Goranci, Shaofeng H.-C. Jiang, Bo Wang and Quan Xue. Fully Dynamic Algorithms for Euclidean Steiner Tree
Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Ryota Murai, Hirotaka Ono and Yota Otachi. Structural Parameterizations of Vertex Integrity
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
Julien Courtiel, Paul Dorbec, Tatsuya Gima, Romain Lecoq and Yota Otachi. Orientable Burning Number of Graphs
Adri Bhattacharya, Giuseppe Francesco Italiano and Partha Sarathi Mandal. Black Hole Search in Dynamic Cactus Graph
Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Fabrizio Grosso and Maurizio Patrignani. Efficient Enumeration of Drawings and Combinatorial Structures for Maximal Planar Graphs
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
Jeffrey Kam, Shahin Kamali, Avery Miller and Naomi Nishimura. Reconfiguration of Multisets with Applications to Bin Packing
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
Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Yota Otachi, Tomohito Shirai, Akira Suzuki, Yuma Tamura and Xiao Zhou. On the Complexity of List $\mathcal H$-Packing for Sparse Graph Classes
Arturo Merino, Aaron Williams and Namrata. On the Hardness of Gray Code Problems for Combinatorial Objects