| 2025 | On the Existence of a Subgroup Magic Rectangle. | S. Karthik, Aruna Venkatesan, Krishnan Paramasivam |
| 2025 | Guarding Terrains with Guards on a Line. | Byeonguk Kang, Hwi Kim, Hee-Kap Ahn |
| 2025 | Bicriteria FPT-Approximation Algorithms for Vertex Deletion to Bounded Degeneracy Graphs. | Tanmay Inamdar, Lawqueen Kanesh, R. Krithika, Harshil Mittal, Saket Saurabh |
| 2025 | Exact Set Packing in Multimodal Transportation with Ridesharing System for First/Last Mile. | Qian-Ping Gu, Jiajian Leo Liang |
| 2025 | Exact Learning of Weighted Graphs Using Composite Queries. | Michael T. Goodrich, Songyu Liu, Ioannis Panageas |
| 2025 | Covering Vertices by 4 | Mingyang Gong, Guangting Chen, Guohui Lin, Eiji Miyano, Abbinash Ranjitkar |
| 2025 | Streaming Algorithms for Scheduling Jobs with Priorities. | Bin Fu, Yumei Huo, Hairong Zhao |
| 2025 | Minimum-Complexity Graph Simplification Under the Frchet-Like Distance. | Omrit Filtser, Majid Mirzanezhad, Carola Wenk |
| 2025 | The Closed Geodetic Game: Algorithms and Strategies. | Antoine Dailly, Harmender Gahlawat, Zin Mar Myint |
| 2025 | Fast Pattern Matching with Epsilon Transitions. | Nicola Cotumaccio |
| 2025 | Linear Search with Probabilistic Detection and Variable Speeds. | Jared Coleman, Oscar Morales-Ponce |
| 2025 | Drawing Reeb Graphs. | Erin W. Chambers, Brittany Terese Fasy, Erfan Hosseini Sereshgi, Maarten Lffler |
| 2025 | Permanent of Bipartite Graphs in Terms of Determinants. | Surabhi Chakrabartty, Ranveer Singh |
| 2025 | ETH Lower Bounds for n-Queens: Time Waits for Nobody. | Josh Brunner, Erik D. Demaine, Timothy Gomez, Markus Hecher, Meryl Zhang |
| 2025 | Optimal Random Bit Complexity in Efficient Sampling of Set Partition-Like Structures. | Olivier Bodini, Francis Durand |
| 2025 | Parameterized Algorithms for Power Edge Set and Zero Forcing Set. | Sriram Bhyravarapu, Lawqueen Kanesh, Madhumita Kundu, Daniel Lokshtanov, Saket Saurabh |
| 2025 | Tile-Based Knot Assembly with Celtic! | Divya Bajaj, Ryan Knobel, Juan Manuel Perez, Rene Reyes, Ramiro Santos, Tim Wylie |
| 2025 | Average Sensitivity of Breadth-First Search Algorithms on Grids. | Ryan Assari, Qian-Ping Gu |
| 2025 | Bicluster Editing with Overlaps: A Vertex Splitting Approach. | Faisal N. Abu-Khzam, Lucas Isenmann, Zeina Merchad |
| 2024 | Computing Longest Common Subsequence Under Cartesian-Tree Matching Model. | Taketo Tsujimoto, Hiroki Shibata, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga |
| 2024 | Efficient Computation of Crossing Components and Shortcut Hulls. | Nikolas Alexander Schwarz, Sabine Storandt |
| 2024 | Perfect Roman Domination: Aspects of Enumeration and Parameterization. | Kevin Mann, Henning Fernau |
| 2024 | The Hamiltonian Cycle Problem and Monotone Classes. | Vadim V. Lozin |
| 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 | Approximating Spanning Tree Congestion on Graphs with Polylog Degree. | Petr Kolman |