| 2026 | On the Size Complexity of Two-Way Finite Automata with Drop-Once Pebbles. | Georgy Kipriyanov, Alexander Okhotin |
| 2026 | Exact Cut Complexity of Equal-Length Proportional Cake Cutting. | Yasushi Kawase, Mohammad Azharuddin Sanpui |
| 2026 | Maximum Matchings and Short Voting Paths. | Telikepalli Kavitha |
| 2026 | Efficient Algorithms for the Bottleneck Path Problem in Geometric Graphs. | Matthew J. Katz, Rachel Saban, Micha Sharir |
| 2026 | Burning Graph Powers and Branching Trees. | Jesper Jansson, Shashanka Kulamarva, Yukihiro Murakami, Nikolaas Verhulst |
| 2026 | Upper Clique Transversal on Interval Graphs and Beyond. | Lars Jaffke, Paloma Thom de Lima, Amir Nikabadi |
| 2026 | Satisfiability of Multivalued Circuits with Lists. | Pawel M. Idziak, Piotr Kawalek, Jacek Krzaczkowski, Armin Wei |
| 2026 | Eve-Positional Languages: Putting Order into Bchi Automata. | Olivier Idir |
| 2026 | Online Firefighting on Cactus Graphs. | Max Hugen, Bob Krekelberg, Alison Hsiang-Hsuan Liu |
| 2026 | A Framework for Ruling out Quantum Speedups. | Thomas Huffstutler, Upendra Kapshikar, David Miloschewsky, Supartha Podder |
| 2026 | Multi-Head Finite-State Dimension. | Xiang Huang, Xiaoyuan Li, Jack H. Lutz, Neil Lutz |
| 2026 | Increasing Arc-Connectivity by Bounded- and Fixed-Size Inversions. | Florian Hrsch, Lucas Picasarri-Arrieta |
| 2026 | On the Complexity of Locally Dense Lattices. | Shuichi Hirahara, Kazuki Ogitsuka |
| 2026 | Setwise Distinguishable Permutations. | Ishay Haviv |
| 2026 | Kernelization Bounds for Constrained Coloring. | Ishay Haviv |
| 2026 | The Complexity of Edge-Induced Greedy Subgraph Building Algorithms Within P. | Zohair Raza Hassan, Edith Hemaspaandra |
| 2026 | The Polynomial Hierarchy and ω-Categorical CSPs. | Santiago Guzmn-Pro, Jakub Rydval |
| 2026 | A Dividing Line for Structural Kernelization of Component Order Connectivity via Distance to Bounded Pathwidth. | Jakob Greilhuber, Roohani Sharma |
| 2026 | Hypergraphs for Compact Closed Categories. | Alessandro Di Giorgio, Callum Reader |
| 2026 | Order-Invariant Cluster First-Order Logic on Graph Classes of Bounded Degree. | Fatemeh Ghasemi, Julien Grange |
| 2026 | Hardness of Approximation for Ground State Problems. | Sevag Gharibian, Carsten Hecht |
| 2026 | A Near-Linear-Time Algorithm for Finding a Well-Spread Perfect Matching in Bridgeless Cubic Graphs. | Babak Ghanbari, Robert Smal |
| 2026 | Improved Results for Knapsack with Removal. | Matthias Gehnen, Kbra Gven, Valentin Hchler, Dennis Komm, Richard Krlovic |
| 2026 | Parameterized Complexity of Efficient Sortation. | Robert Ganian, Hung P. Hoang, Simon Wietheger |
| 2026 | A Slightly Improved Upper Bound for Quantum Statistical Zero-Knowledge. | Franois Le Gall, Yupan Liu, Qisheng Wang |