| 2026 | Smooth Trade-off for Tensor PCA via Sharp Bounds for Kikuchi Matrices. | Pravesh K. Kothari, Jeff Xu |
| 2026 | Space-Efficient k-Mismatch Text Indexes. | Tomasz Kociumaka, Jakub Radoszewski |
| 2026 | A Classification of Long-Refinement Graphs for Colour Refinement. | Sandra Kiefer, T. Devini de Mel |
| 2026 | Sparse Navigable Graphs for Nearest Neighbor Search: Algorithms and Hardness. | Sanjeev Khanna, Ashwin Padaki, Erik Waingarten |
| 2026 | All-Pairs Minimum Cut using (n | Yotam Kenneth-Mordoch, Robert Krauthgamer |
| 2026 | Explaining the Inherent Tradeoffs for Suffix Array Functionality: Equivalences between String Problems and Prefix Range Queries. | Dominik Kempa, Tomasz Kociumaka |
| 2026 | Tight Lower Bounds for Central String Queries in Compressed Space. | Dominik Kempa, Tomasz Kociumaka |
| 2026 | Networked Information Aggregation via Machine Learning. | Michael Kearns, Aaron Roth, Emily Ryu |
| 2026 | Rumour Spreading Depends on the Latent Geometry and Degree Distribution in Social Network Models. | Marc Kaufmann, Kostas Lakis, Johannes Lengler, Raghu Raman Ravi, Ulysse Schaller, Konstantin Sturm |
| 2026 | Selfish, Local and Online Scheduling via Vector Fitting. | Danish Kashaev |
| 2026 | Strongly Polynomial Parallel Work-Depth Tradeoffs for Directed SSSP. | Adam Karczmarz, Wojciech Nadara, Marek Sokolowski |
| 2026 | Sublinear Time Low-Rank Approximation of Hankel Matrices. | Michael Kapralov, Cameron Musco, Kshiteej Sheth |
| 2026 | Spectral clustering in birthday paradox time. | Michael Kapralov, Ekaterina Kochetkova, Weronika Wrzos-Kaminska |
| 2026 | Finite Pinwheel Scheduling: the k-Visits Problem. | Sotiris Kanellopoulos, Christos Pergaminelis, Maria Kokkou, Euripides Markou, Aris Pagourtzis |
| 2026 | New Oracles and Labeling Schemes for Vertex Cut Queries. | Yonggang Jiang, Merav Parter, Asaf Petruschka |
| 2026 | Minimum | Yonggang Jiang, Danupon Nanongkai, Pachara Sawettamalya |
| 2026 | Local Search for Clustering in Almost-linear Time. | Shaofeng H.-C. Jiang, Yaonan Jin, Jianing Lou, Pinyan Lu |
| 2026 | Three-edge-coloring (Tait coloring) cubic graphs and nowhere-zero 4-flow for graphs on the torus. | Yuta Inoue, Ken-ichi Kawarabayashi, Atsuyuki Miyashita, Bojan Mohar, Tomohiro Sonobe |
| 2026 | Faster negative length shortest paths by bootstrapping hop reducers. | Yufan Huang, Peter Jin, Kent Quanrud |
| 2026 | Sparsifying Cayley Graphs on Every Group. | Jun-Ting Hsieh, Daniel Z. Lee, Sidhanth Mohanty, Aaron Putterman, Rachel Yun Zhang |
| 2026 | Coloring 3-Colorable Graphs with Low Threshold Rank. | Jun-Ting Hsieh |
| 2026 | A quasi-polynomial bound for the minimal excluded minors for a surface. | Sarah Houdaigoui, Ken-ichi Kawarabayashi |
| 2026 | A Better-Than-5/4-Approximation for Two-Edge Connectivity. | Felix Hommelsheim, Alexander Lindermayr, Zhenwei Liu |
| 2026 | Centered colorings in minor-closed graph classes. | Jedrzej Hodor, Hoang La, Piotr Micek, Clment Rambaud |
| 2026 | Optimization Modulo Integer Linear-Exponential Programs. | S. Hitarth, Alessio Mansutti, Guruprerana Shabadi |