| 2024 | An Improved Bound for Equitable Proper Labellings. Julien Bensmail, Pierre-Marie Marcille |
| 2024 | Approximate Cycle Double Cover. Babak Ghanbari, Robert Sámal |
| 2024 | Approximate Realizations for Outerplanaric Degree Sequences. Amotz Bar-Noy, Toni Böhnlein, David Peleg, Yingli Ran, Dror Rawitz |
| 2024 | Approximating Spanning Tree Congestion on Graphs with Polylog Degree. Petr Kolman |
| 2024 | Approximation Algorithms for Node-Weighted Directed Steiner Problems. Gianlorenzo D'Angelo, Esmaeil Delfaraz |
| 2024 | Broadcasting in Stars of Cliques. Akash Ambashankar, Hovhannes A. Harutyunyan |
| 2024 | Combinatorial Algorithms - 35th International Workshop, IWOCA 2024, Ischia, Italy, July 1-3, 2024, Proceedings Adele Anna Rescigno, Ugo Vaccaro |
| 2024 | Complexity Framework for Forbidden Subgraphs IV: The Steiner Forest Problem. Hans L. Bodlaender, Matthew Johnson, Barnaby Martin, Jelle J. Oostveen, Sukanya Pandey, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen |
| 2024 | Computing Longest Common Subsequence Under Cartesian-Tree Matching Model. Taketo Tsujimoto, Hiroki Shibata, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga |
| 2024 | Computing Maximal Palindromes in Non-standard Matching Models. Mitsuru Funakoshi, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2024 | Computing Minimal Absent Words and Extended Bispecial Factors with CDAWG Space. Shunsuke Inenaga, Takuya Mieno, Hiroki Arimura, Mitsuru Funakoshi, Yuta Fujishige |
| 2024 | Convex-Geometric k-Planar Graphs Are Convex-Geometric (k+1)-Quasiplanar. Todor Antic |
| 2024 | Detecting K Clément Dallard, Maël Dumas, Claire Hilaire, Martin Milanic, Anthony Perez, Nicolas Trotignon |
| 2024 | Directed Path Partition Problem on Directed Acyclic Graphs. Hiroshi Eto, Shunsuke Kawaharada, Guohui Lin, Eiji Miyano, Tugce Ozdemir |
| 2024 | Dominance for Enclosure Problems. Waseem Akram, Sanjeev Saxena |
| 2024 | Efficient Algorithms for Decomposing Integers as Sums of Few Tetrahedral Numbers. Tong-Nong Lin, Yu-Cheng Lin, Cheng-Chen Tsai, Meng-Tsung Tsai, Shih-Yu Tsai |
| 2024 | Efficient Computation of Crossing Components and Shortcut Hulls. Nikolas Alexander Schwarz, Sabine Storandt |
| 2024 | Enumerating Minimal Vertex Covers and Dominating Sets with Capacity and/or Connectivity Constraints. Yasuaki Kobayashi, Kazuhiro Kurita, Yasuko Matsui, Hirotaka Ono |
| 2024 | Hypergraph Dualization with FPT-delay Parameterized by the Degeneracy and Dimension. Valentin Bartier, Oscar Defrain, Fionn Mc Inerney |
| 2024 | Improving Online Bin Covering with Little Advice. Andrej Brodnik, Bengt J. Nilsson, Gordana Vujovic |
| 2024 | Linear Search for an Escaping Target with Unknown Speed. Jared Coleman, Dmitry Ivanov, Evangelos Kranakis, Danny Krizanc, Oscar Morales-Ponce |
| 2024 | Lower Bounds for Leaf Rank of Leaf Powers. Svein Høgemo |
| 2024 | Making the Interval Membership Width of Temporal Graphs Connected and Bidirectional. Filippos Christodoulou, Pierluigi Crescenzi, Andrea Marino, Ana Silva, Dimitrios M. Thilikos |
| 2024 | Matchings in Hypercubes Extend to Long Cycles. Jirí Fink, Torsten Mütze |
| 2024 | Maximizing Minimum Cycle Bases Intersection. Ylène Aboulfath, Dimitri Watel, Marc-Antoine Weisser, Thierry Mautor, Dominique Barth |
| 2024 | Minimizing Distances Between Vertices and Edges Through Tree t-Spanners. Fernanda Couto, Luís Felipe I. Cunha, Edmundo Pinto, Daniel Posner |
| 2024 | On Computing Sets of Integers with Maximum Number of Pairs Summing to Powers of 2. Max A. Alekseyev |
| 2024 | On the Finiteness of k-Vertex-Critical 2P Melvin Adekanye, Christopher Bury, Ben Cameron, Thaler Knodel |
| 2024 | On the Structure of Hamiltonian Graphs with Small Independence Number. Nikola Jedlicková, Jan Kratochvíl |
| 2024 | Output-Sensitive Enumeration of Potential Maximal Cliques in Polynomial Space. Caroline Brosse, Alessio Conte, Vincent Limouzy, Giulia Punzi, Davide Rucci |
| 2024 | Parameterized Complexity of Paired Domination. Nikita Andreev, Ivan Bliznets, Madhumita Kundu, Saket Saurabh, Vikash Tripathi, Shaily Verma |
| 2024 | Parameterized Upper Bounds for Path-Consistent Hub Labeling. Stefan Funke, Sabine Storandt |
| 2024 | Perfect Roman Domination: Aspects of Enumeration and Parameterization. Kevin Mann, Henning Fernau |
| 2024 | Resolving Sets in Temporal Graphs. Jan Bok, Antoine Dailly, Tuomo Lehtilä |
| 2024 | Resolving Unresolved Resolved and Unresolved Triplets Consistency Problems. Daniel J. Harvey, Jesper Jansson, Mikolaj Marciniak, Yukihiro Murakami |
| 2024 | Simple Random Sampling of Binary Forests with Fixed Number of Nodes and Trees. Stoyan Dimitrov |
| 2024 | Star-Forest Decompositions of Complete Graphs. Todor Antic, Jelena Glisic, Milan Milivojcevic |
| 2024 | The Bottom-Left Algorithm for the Strip Packing Problem. Stefan Hougardy, Bart Zondervan |
| 2024 | The Hamiltonian Cycle Problem and Monotone Classes. Vadim V. Lozin |
| 2024 | The Minimum Algorithm Size of k-Grouping by Silent Oblivious Robots. Paola Flocchini, Debasish Pattanayak, Nicola Santoro, Masafumi Yamashita |
| 2024 | Weighted Group Search on the Disk and Improved LP-Based Lower Bounds for Priority Evacuation. Konstantinos Georgiou, Xin Wang |