| 2024 | (t, s)-Completely Independent Spanning Trees. Shin-Ichi Nakano |
| 2024 | A Bisection Approach to Subcubic Maximum Induced Matching. Gordon Hoi, Sanjay Jain, Ammar Fathin Sabili, Frank Stephan |
| 2024 | Black Hole Search in Dynamic Cactus Graph. Adri Bhattacharya, Giuseppe F. Italiano, Partha Sarathi Mandal |
| 2024 | Canonization of a Random Circulant Graph by Counting Walks. Oleg Verbitsky, Maksim Zhukovskii |
| 2024 | Combinatorial Reconfiguration with Answer Set Programming: Algorithms, Encodings, and Empirical Analysis. Yuya Yamada, Mutsunori Banbara, Katsumi Inoue, Torsten Schaub, Ryuhei Uehara |
| 2024 | Counting Vanishing Matrix-Vector Products. Cornelius Brand, Viktoriia Korchemna, Kirill Simonov, Michael Skotnica |
| 2024 | Dichotomies for Tree Minor Containment with Structural Parameters. Tatsuya Gima, Soh Kumabe, Kazuhiro Kurita, Yuto Okada, Yota Otachi |
| 2024 | Efficient Enumeration of Drawings and Combinatorial Structures for Maximal Planar Graphs. Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Fabrizio Grosso, Maurizio Patrignani |
| 2024 | Exact and Approximate Hierarchical Hub Labeling. Ruoying Li, Sabine Storandt |
| 2024 | Fully Dynamic Algorithms for Euclidean Steiner Tree. T.-H. Hubert Chan, Gramoz Goranci, Shaofeng H.-C. Jiang, Bo Wang, Quan Xue |
| 2024 | Generating Cyclic 2-Gray Codes for Fibonacci q-Decreasing Words. Dennis Wong, Bowie Liu, Chan-Tong Lam, Marcus Im |
| 2024 | Improved Approximation Algorithms for Cycle and Path Packings. Jingyang Zhao, Mingyu Xiao |
| 2024 | Minimizing Corners in Colored Rectilinear Grids. Thomas Depian, Alexander Dobler, Christoph Kern, Jules Wulms |
| 2024 | On Layered Area-Proportional Rectangle Contact Representations. Carolina Haase, Philipp Kindermann |
| 2024 | On MAX-SAT with Cardinality Constraint. Fahad Panolan, Hannane Yaghoubizade |
| 2024 | 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, Xiao Zhou |
| 2024 | On the Hardness of Gray Code Problems for Combinatorial Objects. Arturo Merino, Namrata, Aaron Williams |
| 2024 | Orientable Burning Number of Graphs. Julien Courtiel, Paul Dorbec, Tatsuya Gima, Romain Lecoq, Yota Otachi |
| 2024 | Plane Multigraphs with One-Bend and Circular-Arc Edges of a Fixed Angle. Csaba D. Tóth |
| 2024 | Quantum Graph Drawing. Susanna Caroppo, Giordano Da Lozzo, Giuseppe Di Battista |
| 2024 | Reasons to Fall (More) in Love with Combinatorial Reconfiguration. Naomi Nishimura |
| 2024 | Recent Research Activities on Algorithmic Foundations for Social Advancement. Shin-ichi Minato |
| 2024 | Recognition and Isomorphism of Proper $\boldsymbol{H}$-Graphs for Unicyclic $\boldsymbol{H}$ in FPT-Time. Deniz Agaoglu Çagirici, Peter Zeman |
| 2024 | Reconfiguration of Multisets with Applications to Bin Packing. Jeffrey Kam, Shahin Kamali, Avery Miller, Naomi Nishimura |
| 2024 | Short Flip Sequences to Untangle Segments in the Plane. Guilherme Dias da Fonseca, Yan Gerard, Bastien Rivier |
| 2024 | Simultaneous Drawing of Layered Trees. Julia Katheder, Stephen G. Kobourov, Axel Kuckuk, Maximilian Pfister, Johannes Zink |
| 2024 | Stable and Dynamic Minimum Cuts. Mark de Berg, Andrés López Martínez, Frits C. R. Spieksma |
| 2024 | Structural Parameterizations of Vertex Integrity. Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Ryota Murai, Hirotaka Ono, Yota Otachi |
| 2024 | The Parameterized Complexity of Terminal Monitoring Set. N. R. Aravind, Roopam Saxena |
| 2024 | The Shortest Path Reconfiguration Problem Based on Relaxation of Reconfiguration Rules. Naoki Domon, Akira Suzuki, Yuma Tamura, Xiao Zhou |
| 2024 | WALCOM: Algorithms and Computation - 18th International Conference and Workshops on Algorithms and Computation, WALCOM 2024, Kanazawa, Japan, March 18-20, 2024, Proceedings Ryuhei Uehara, Katsuhisa Yamanaka, Hsu-Chun Yen |