| 2024 | Enumerating Minimal Vertex Covers and Dominating Sets with Capacity and/or Connectivity Constraints. | Yasuaki Kobayashi, Kazuhiro Kurita, Yasuko Matsui, Hirotaka Ono |
| 2024 | On the Structure of Hamiltonian Graphs with Small Independence Number. | Nikola Jedlickov, Jan Kratochvl |
| 2024 | Computing Minimal Absent Words and Extended Bispecial Factors with CDAWG Space. | Shunsuke Inenaga, Takuya Mieno, Hiroki Arimura, Mitsuru Funakoshi, Yuta Fujishige |
| 2024 | The Bottom-Left Algorithm for the Strip Packing Problem. | Stefan Hougardy, Bart Zondervan |
| 2024 | Lower Bounds for Leaf Rank of Leaf Powers. | Svein Hgemo |
| 2024 | Resolving Unresolved Resolved and Unresolved Triplets Consistency Problems. | Daniel J. Harvey, Jesper Jansson, Mikolaj Marciniak, Yukihiro Murakami |
| 2024 | Approximate Cycle Double Cover. | Babak Ghanbari, Robert Smal |
| 2024 | Weighted Group Search on the Disk and Improved LP-Based Lower Bounds for Priority Evacuation. | Konstantinos Georgiou, Xin Wang |
| 2024 | Parameterized Upper Bounds for Path-Consistent Hub Labeling. | Stefan Funke, Sabine Storandt |
| 2024 | Computing Maximal Palindromes in Non-standard Matching Models. | Mitsuru Funakoshi, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2024 | The Minimum Algorithm Size of k-Grouping by Silent Oblivious Robots. | Paola Flocchini, Debasish Pattanayak, Nicola Santoro, Masafumi Yamashita |
| 2024 | Matchings in Hypercubes Extend to Long Cycles. | Jir Fink, Torsten Mtze |
| 2024 | Directed Path Partition Problem on Directed Acyclic Graphs. | Hiroshi Eto, Shunsuke Kawaharada, Guohui Lin, Eiji Miyano, Tugce Ozdemir |
| 2024 | Simple Random Sampling of Binary Forests with Fixed Number of Nodes and Trees. | Stoyan Dimitrov |
| 2024 | Approximation Algorithms for Node-Weighted Directed Steiner Problems. | Gianlorenzo D'Angelo, Esmaeil Delfaraz |
| 2024 | Detecting K | Clment Dallard, Mal Dumas, Claire Hilaire, Martin Milanic, Anthony Perez, Nicolas Trotignon |
| 2024 | Minimizing Distances Between Vertices and Edges Through Tree t-Spanners. | Fernanda Couto, Lus Felipe I. Cunha, Edmundo Pinto, Daniel Posner |
| 2024 | Linear Search for an Escaping Target with Unknown Speed. | Jared Coleman, Dmitry Ivanov, Evangelos Kranakis, Danny Krizanc, Oscar Morales-Ponce |
| 2024 | Making the Interval Membership Width of Temporal Graphs Connected and Bidirectional. | Filippos Christodoulou, Pierluigi Crescenzi, Andrea Marino, Ana Silva, Dimitrios M. Thilikos |
| 2024 | Output-Sensitive Enumeration of Potential Maximal Cliques in Polynomial Space. | Caroline Brosse, Alessio Conte, Vincent Limouzy, Giulia Punzi, Davide Rucci |
| 2024 | Improving Online Bin Covering with Little Advice. | Andrej Brodnik, Bengt J. Nilsson, Gordana Vujovic |
| 2024 | Resolving Sets in Temporal Graphs. | Jan Bok, Antoine Dailly, Tuomo Lehtil |
| 2024 | Complexity Framework for Forbidden Subgraphs IV: The Steiner Forest Problem. | Hans L. Bodlaender, Matthew Johnson, Barnaby Martin, Jelle J. Oostveen, Sukanya Pandey, Danil Paulusma, Siani Smith, Erik Jan van Leeuwen |
| 2024 | An Improved Bound for Equitable Proper Labellings. | Julien Bensmail, Pierre-Marie Marcille |
| 2024 | Hypergraph Dualization with FPT-delay Parameterized by the Degeneracy and Dimension. | Valentin Bartier, Oscar Defrain, Fionn Mc Inerney |