| 2026 | Optimal Union Probability Interval Is NP-Hard. | Petteri Kaski, Heikki Mannila, Chandra Kanta Mohapatra |
| 2026 | Strongly Polynomial Parallel Maximum Flow Revisited. | Adam Karczmarz, Pawel Pilarski |
| 2026 | Streaming with Catalytic Memory. | Tamara Kaplan, Nimrod Kaplan, Haim Kaplan |
| 2026 | Optimality-Preserving Data Reduction for Maximum k-Cut. | Michael Kaibel, Petra Mutzel |
| 2026 | Tighter Bounds for Weighted and Unweighted Shortest Cycle Approximation. | Avi Kadria, Liam Roditty, Virginia Vassilevska Williams |
| 2026 | Improved Approximation Algorithms for n-Pairs Shortest Paths. | Avi Kadria, Liam Roditty, Virginia Vassilevska Williams |
| 2026 | Smallest Convex Hulls of Polygons. | Mook Kwon Jung, Hee-Kap Ahn |
| 2026 | A Strongly-Subquadratic (3+ε)-Approximation for the Frchet Distance for Paths in Metric Spaces. | Thijs van der Horst, Tim Ophelders |
| 2026 | The Presort Hierarchy for Geometric Problems. | Ivor van der Hoog, Eva Rotenberg, Jack Spalding-Jamieson, Lasse Wulf |
| 2026 | Tight Better-Than-Worst-Case Bounds for Element Distinctness and Set Intersection. | Ivor van der Hoog, Eva Rotenberg, Daniel Rutschmann |
| 2026 | Near-Optimal Working-Set Heaps and Dijkstra on Pointer Machines. | Ivor van der Hoog, John Iacono, Eva Rotenberg, Daniel Rutschmann |
| 2026 | Edge Geography is XNLP-hard for Pathwidth and in XP for Tree-Partition Width. | Thobias Kvalvik Hivik, Erlend Raa Vgset |
| 2026 | Conflict-Free Coloring Planar Graphs with 4 Colors. | Petr Hlinen, Luks Mlik |
| 2026 | No Time to Interact: Simulating Population Protocols at Scale. | Lukas Hintze, Manuel Penschuck |
| 2026 | Optimal Stochastic Online Sorting. | Daniel Anker Hermansen |
| 2026 | Deconstructed "Learned" Indexes and Their Smoothed Analysis. | Stefan Hermann, Mattia Odorisio, Peter Sanders, Stefan Walzer |
| 2026 | The Prophet and the Voronoi Diagram. | Sariel Har-Peled |
| 2026 | The Complexity of Stackelberg Pricing Games. | Christoph Grne, Dorothee Henke, Eva Rotenberg, Lasse Wulf |
| 2026 | Algorithms for Standard-Form ILP Problems via Komls' Discrepancy Setting. | Dmitry V. Gribanov, Tagir Khayaleyev, Mikhail Cherniavskii, Maxim Klimenko, Dmitriy S. Malyshev, Stanislav Moiseev |
| 2026 | The Price of Being Partial: Complexity of Partial Generalized Dominating Set on Bounded-Treewidth Graphs. | Jakob Greilhuber, Dniel Marx |
| 2026 | Persistent Homology on GPU for 1d and 2d Cubical Filtrations. | Marc Glisse |
| 2026 | Indexing Integer Strings Using Local Difference Bounds. | Daniel Gibney, Kaamil Kaka, Sharma V. Thankachan |
| 2026 | The Power of the Score Sequence of a Tournament. | Prantar Ghosh, Sahil Kuchlous, Shravan Mehra, Sagnik Mukhopadhyay |
| 2026 | Where Treewidth and Pathwidth Diverge: Towards a Uniform Kernel for Pathwidth-η Deletion. | Ahmed Ghazy, Jakob Greilhuber, Tim A. Hartmann, Roohani Sharma |
| 2026 | Reducing CMSO to Unbreakable Graphs Cannot Be Computable. | Colin Geniet, Roohani Sharma |