| 2023 | Maximal Distortion of Geodesic Diameters in Polygonal Domains. | Adrian Dumitrescu, Csaba D. Tth |
| 2023 | Finding Small Complete Subgraphs Efficiently. | Adrian Dumitrescu, Andrzej Lingas |
| 2023 | Timeline Cover in Temporal Graphs: Exact and Approximation Algorithms. | Riccardo Dondi, Alexandru Popa |
| 2023 | On Computing Large Temporal (Unilateral) Connected Components. | Isnard Lopes Costa, Raul Lopes, Andrea Marino, Ana Silva |
| 2023 | Capacity-Preserving Subgraphs of Directed Flow Networks. | Markus Chimani, Max Ilsen |
| 2023 | A Linear Algorithm for Radio k-Coloring Powers of Paths Having Small Diameter. | Dipayan Chakraborty, Soumen Nandi, Sagnik Sen, D. K. Supraja |
| 2023 | A Polyhedral Perspective on Tropical Convolutions. | Cornelius Brand, Martin Kouteck, Alexandra Lassota |
| 2023 | Minimum Surgical Probing with Convexity Constraints. | Toni Bhnlein, Niccol Di Marco, Andrea Frosini |
| 2023 | Online Knapsack with Removal and Recourse. | Hans-Joachim Bckenhauer, Ralf Klasing, Tobias Mmke, Peter Rossmanith, Moritz Stocker, David Wehner |
| 2023 | A Polynomial-Time Approximation Scheme for Thief Orienteering on Directed Acyclic Graphs. | Andrew Bloch-Hansen, Daniel R. Page, Roberto Solis-Oba |
| 2023 | Deterministic Performance Guarantees for Bidirectional BFS on Real-World Networks. | Thomas Blsius, Marcus Wilhelm |
| 2023 | Parameterized Algorithms for Eccentricity Shortest Path Problem. | Sriram Bhyravarapu, Satyabrata Jana, Lawqueen Kanesh, Saket Saurabh, Shaily Verma |
| 2023 | Advice Complexity Bounds for Online Delayed ℱ-Node-, H-Node- and H-Edge-Deletion Problems. | Niklas Berndt, Henri Lotze |
| 2023 | Min-Max Relative Regret for Scheduling to Minimize Maximum Lateness. | Imad Assayakh, Imed Kacem, Giorgio Lucarelli |
| 2023 | Burn and Win. | Pradeesha Ashok, Sayani Das, Lawqueen Kanesh, Saket Saurabh, Avi Tomar, Shaily Verma |
| 2023 | Point Enclosure Problem for Homothetic Polygons. | Waseem Akram, Sanjeev Saxena |
| 2023 | Multi-priority Graph Sparsification. | Abu Reyan Ahmed, Keaton Hamm, Stephen G. Kobourov, Mohammad Javad Latifi Jebelli, Faryad Darabi Sahneh, Richard Spence |
| 2022 | Winner Determination Algorithms for Graph Games with Matching Structures. | Kanae Yoshiwatari, Hironori Kiya, Tesshu Hanaka, Hirotaka Ono |
| 2022 | On Critical Node Problems with Vulnerable Vertices. | Jannik Schestag, Niels Grttemeier, Christian Komusiewicz, Frank Sommer |
| 2022 | Linear Time Construction of Indexable Elastic Founder Graphs. | Nicola Rizzo, Veli Mkinen |
| 2022 | Computing a Minimum Subset Feedback Vertex Set on Chordal Graphs Parameterized by Leafage. | Charis Papadopoulos, Spyridon Tzimas |
| 2022 | Exact Polynomial Time Algorithm for the Response Time Analysis of Harmonic Tasks. | Thi Huyen Chau Nguyen, Werner Grass, Klaus Jansen |
| 2022 | On Relative Clique Number of Triangle-Free Planar Colored Mixed Graphs. | Soumen Nandi, Sagnik Sen, S. Taruni |
| 2022 | Shortest Unique Palindromic Substring Queries in Semi-dynamic Settings. | Takuya Mieno, Mitsuru Funakoshi |
| 2022 | Using Edge Contractions and Vertex Deletions to Reduce the Independence Number and the Clique Number. | Felicia Lucke, Felix Mann |