| # | Title | Authors |
| 233 | Maximal distortion of geodesic diameters in polygonal domains | Adrian Dumitrescu and Csaba Toth |
| 297 | Generating cyclic rotation Gray codes for stamp foldings and semi-meanders | Bowie Liu and Dennis Wong |
| 597 | Budget-Constrained Cost-Covering Job Assignment for a Total Contribution-Maximizing Platform | Chi-Hao Wang, Chi-Jen Lu, Ming-Tat Ko, Po-An Chen and Chuang-Chieh Lin |
| 732 | Cosecure Domination: Hardness Results and Algorithms | Kusum and Arti Pandey |
| 1419 | On Integer Linear Programs for Treewidth based on Perfect Elimination Orderings. | Sven Mallach |
| 1547 | Point Enclosure Problem for Homothetic Polygons | Waseem Akram and Sanjeev Saxena |
| 2004 | Improved Analysis of two Algorithms for Min-Weighted Sum Bin Packing | Guillaume Sagnol |
| 2133 | Capacity-Preserving Subgraphs of Directed Flow Networks | Markus Chimani and Max Ilsen |
| 2538 | Computing the Center of Uncertain Points on Cactus Graphs | Ran Hu, Divy Kanani and Jingru Zhang |
| 2578 | Reconfiguration and Enumeration of Optimal Cyclic Ladder Lotteries | Yuta Nozaki, Kunihiro Wasa and Katsuhisa Yamanaka |
| 2609 | Optimal cost-based allocations under two-sided preferences | Girija Limaye and Meghana Nasre |
| 2955 | Minimum Surgical Probing with Convexity Constraints | Toni Böhnlein, Niccolo Di Marco and Andrea Frosini |
| 3684 | A Polynomial-Time Approximation Scheme for Thief Orienteering on Directed Acyclic Graphs | Andrew Bloch-Hansen, Daniel Page and Roberto Solis-Oba |
| 3794 | Best student paper Make a Graph Singly Connected By Edge Orientations | Tim A. Hartmann and Komal Muluk |
| 4489 | Best paper Finding Small Complete Subgraphs Efficiently | Adrian Dumitrescu and Andrzej Lingas |
| 4581 | Partial-Adaptive Submodular Maximization | Shaojie Tang and Jing Yuan |
| 5278 | A Linear Delay Algorithm for Enumeration of 2-Edge/Vertex-connected Induced Subgraphs | Takumi Tada and Kazuya Haraguchi |
| 5844 | On Computing Large Temporal (Unilateral) Connected Components | Isnard Lopes Costa, Raul Lopes, Andrea Marino and Ana Silva |
| 6431 | Deterministic Performance Guarantees for Bidirectional BFS on Real-World Networks | Thomas Bläsius and Marcus Wilhelm |
| 6552 | A linear algorithm for radio k-coloring powers of paths having small diameter | Dipayan Chakraborty, Soumen Nandi, Sagnik Sen and D K Supraja |
| 6792 | Timeline Cover in Temporal Graphs: Exact and Approximation Algorithms | Riccardo Dondi and Alexandru Popa |
| 7195 | Parameterized algorithms for Eccentricity Shortest Path Problem | Sriram Bhyravarapu, Satyabrata Jana, Lawqueen Kanesh, Saket Saurabh and Shaily Verma |
| 7463 | Sorting and Ranking of Self-Delimiting Numbers with Applications to Tree Isomorphism | Andrej Sajenko, Frank Kammer and Johannes Meintrup. |
| 7528 | On 2-strong connectivity orientations of mixed graphs and related problems | Loukas Georgiadis, Dionysios Kefallinos and Evangelos Kosinas |
| 7538 | Finding Perfect Matching Cuts Faster | Neeldhara Misra and Yash More |
| 7573 | Online Knapsack with Removal and Recourse | Hans-Joachim Böckenhauer, Ralf Klasing, Tobias Mömke, Peter Rossmanith, Moritz Stocker and David Wehner. |
| 8084 | Advice Complexity Bounds for Online Delayed F-Node-, H-Node- and H-Edge-Deletion Problems | Niklas Berndt and Henri Lotze |
| 8124 | Burn and Win | Pradeesha Ashok, Sayani Das, Lawqueen Kanesh, Saket Saurabh, Avi Tomar and Shaily Verma |
| 8166 | Connected Feedback Vertex Set on AT-Free graphs | Joydeep Mukherjee and Tamojit Saha |
| 8265 | A Polyhedral Perspective on Tropical Convolutions | Cornelius Brand, Martin Koutecky and Alexandra Lassota |
| 8838 | Hardness of Balanced Mobiles | Virginia Ardévol Martínez, Romeo Rizzi and Florian Sikora |
| 9714 | Multi-Priority Graph Sparsification | Reyan Ahmed, Keaton Hamm, Stephen Kobourov, Mohammad Javad Latifi Jebelli, Faryad Sahneh and Richard Spence |
| 9856 | Min-Max Relative Regret for Scheduling to Minimize Maximum Lateness | Imad Assayakh, Imed Kacem and Giorgio Lucarelli |