| 2026 | Separating Geodesic Structure and Product Structure. | Laura Merker, Lena Scherzer, Samuel Schneider |
| 2026 | Dichotomies for #CSP on Graphs That Forbid a Clique as a Minor. | Boning Meng, Yicheng Pan |
| 2026 | Small Independent Sets Versus Small Separator in Geometric Intersection Graphs. | Malory Marin, Rmi Watrigant |
| 2026 | High-Quality Multi-Constraint Hypergraph Partitioning via Greedy Rebalancing. | Nikolai Maas |
| 2026 | On Estimating Operator Norm Distance, with Optimal Trace Distance Estimation When One State Is Pure. | Yupan Liu, Qisheng Wang, Zhan Yu |
| 2026 | Online Flow Time Minimization with Gradually Revealed Jobs. | Alexander Lindermayr, Guido Schfer, Jens Schlter, Leen Stougie |
| 2026 | Deterministic Online Embedding of Metric Spaces into Low Dimensional Spaces. | Noam Licht, Ilan Newman, Yuri Rabinovich |
| 2026 | An LCA for Approximated MST in General Bounded-Degree Graphs. | Reut Levi, Moti Medina, Daniel Prigan |
| 2026 | Pure Nash Equilibria in Graphical Games of Bounded Width Revisited. | Michael Lampis, Yiren Lu |
| 2026 | History Independence as an Algorithmic Tool (Invited Talk). | William Kuszmaul |
| 2026 | Practical Bit Vectors Supporting Constant Time Rank and Select in Optimal Space. | Florian Kurpicz, Niccol Rigi-Luperti, Peter Sanders |
| 2026 | Covering Points with Rectangular Boundaries. | Madhumita Kundu, Daniel Lokshtanov, Soumi Nandi, Saket Saurabh, Kushal Singanporia |
| 2026 | Fast Metric Decompositions in High Dimension. | Robert Krauthgamer, Asaf Petruschka, Nir Petruschka |
| 2026 | A Faster Polynomial-Space Algorithm for Hamiltonian Cycle Parameterized by Treedepth. | Stefan Kratsch |
| 2026 | Theoretical Analysis of Byte-Pair Encoding. | Lszl Kozma, Johannes Voderholzer |
| 2026 | Compact Representations of Pattern-Avoiding Permutations. | Lszl Kozma, Michal Opler |
| 2026 | On the Assadi-Liu-Tarjan Auction Algorithm for Bipartite Matching: Simplification, Alternative Analysis, and Hard Instance. | Christian Konrad, Kheeran K. Naidu, Archie Walton, Eric Wang |
| 2026 | Proofs of Useful Work from Arbitrary Matrix Multiplication (Invited Talk). | Ilan Komargodski, Omri Weinstein |
| 2026 | Non-Minimal k-Perfect Hashing: Tight Lower Bounds and an Application to Fast Static Hash Tables. | Ragnar Groot Koerkamp, Stefan Hermann, Peter Sanders, Stefan Walzer |
| 2026 | An Approximation Algorithm for 2-Vertex-Connectivity via Cycle-Restricted 2-Edge-Covers. | Yusuke Kobayashi, Takashi Noguchi |
| 2026 | Kernelization for H-Packing Revisited. | Tomohiro Koana, Soh Kumabe |
| 2026 | Exploiting Spanning Trees for Directed Acyclicity. | Sergei Khargeliia, Danil Sagunov |
| 2026 | On the Adversarial Robustness of Online Importance Sampling. | Yotam Kenneth-Mordoch, Shay Sapir |
| 2026 | A Computer-Assisted Proof of the Optimal Density Bound for Pinwheel Covering. | Akitoshi Kawamura, Yusuke Kobayashi |
| 2026 | Matching in Geometric Uniform Hypergraphs. | Matthew J. Katz, Yuval Nidam, Rachel Saban, Micha Sharir |