| 2026 | Efficient Uniform Negative Edge Weights. | Lukas Geis, Daniel Allendorf, Thomas Blsius, Alexander Leonhardt, Ulrich Meyer, Manuel Penschuck, Hung Tran |
| 2026 | Hardness of Multi-Agent Path Finding on Trees: A Unified Approach. | Tzvika Geft |
| 2026 | Near-Optimal and Efficient Encoding for Two-Dimensional Range Minimum Queries. | Pawel Gawrychowski, Adam Grkiewicz, Srinivasa Rao Satti |
| 2026 | Strong ILP Formulations for the p-Regions Problem. | Daniel Faber, Jan-Henrik Haunert, Petra Mutzel |
| 2026 | New Algorithms and Hardness Results for Connected Clustering. | Jan Eube, Heiko Rglin |
| 2026 | Approximation Algorithms for the Traveling Thief Problem. | Jan Eube, Kelin Luo, Heiko Rglin, Sarah Sturm |
| 2026 | Minimizing Total Travel Time for Collaborative Package Delivery with Heterogeneous Drones. | Thomas Erlebach, Kelin Luo, Wen Zhang |
| 2026 | FPT Algorithms over Linear Delta-Matroids with Applications. | Eduard Eiben, Tomohiro Koana, Magnus Wahlstrm |
| 2026 | Dimension Reduction for Curves: Simplified and Generalized. | Matthijs Ebbens, Jie Lu, Alexander Munteanu |
| 2026 | Beyond Trees: The Weighted Center Problem on Gromov Hyperbolic Graphs. | Guillaume Ducoffe |
| 2026 | Time Series Decomposition Using the Frchet Distance. | Anne Driemel, Jan Hckendorff, Ioannis Psarros, Christian Sohler |
| 2026 | Improved Bounds for Strategy Improvement Algorithms for Energy Games. | Dani Dorfman, Haim Kaplan, Uri Zwick |
| 2026 | Faster Exponential Algorithms for Multi-Machine Scheduling Problems. | Anubhav Dhar, Anita Drr, Ahmed Ghazy, Jakob Greilhuber, Karol Wegrzycki |
| 2026 | Revisiting Graph Modification via Disk Scaling: From One Radius to Interval-Based Radii. | Thomas Depian, Frank Sommer |
| 2026 | Maximizing Reachability via Shifting of Temporal Paths. | Argyrios Deligkas, Michelle Dring, Eduard Eiben, George Skretas, Georg Tennigkeit |
| 2026 | Hardness of Frequency-Related Queries on Compressed Strings. | Rajat De, Dominik Kempa |
| 2026 | An FPT Algorithm for Diverse Minimum s-t Cuts. | Krishnan Dehaleesan, Pl Grns Drange, Fedor V. Fomin, Petr A. Golovach, Laure Morelle |
| 2026 | On the Complexity of Multipacking. | Sandip Das, Sk Samim Islam, Daniel Lokshtanov |
| 2026 | Approximate Single Source Dual Fault Tolerant Distance Oracle. | Koustav Das, Manoj Gupta |
| 2026 | Dynamic Detours. | Daniel Dadush, Michal Pilipczuk, Amadeus Reinald, Marek Sokolowski, Michal Wlodarczyk |
| 2026 | Primal-Dual Online Algorithms for the Parking Permit Problem. | Christian Coester, Alexander Turoczy |
| 2026 | Faster Exponential-Time Approximate Counting via Bounded Self-Reductions. | Katie Clinch, Serge Gaspers, Simon Mackenzie, Qi Wang |
| 2026 | Incongruity-Sensitive Access to Highly Compressed Strings. | Ferdinando Cicalese, Travis Gagie, Zsuzsanna Liptk, Gonzalo Navarro, Nicola Prezza, Cristian Urbina |
| 2026 | Parameterized Approximation of Rectangle Stabbing. | Huairui Chu, Ajaykrishnan E. S., Daniel Lokshtanov, Anikait Mundhra, Thomas Schibler, Xiaoyang Xu, Jie Xue |
| 2026 | Unimodal-Cost k-Median on a Line. | Yike Chen, Chao Xu |