| 2026 | Improving Lagarias-Odlyzko Algorithm for Average-Case Subset Sum: Modular Arithmetic Approach. | Antoine Joux, Karol Wegrzycki |
| 2026 | A Practical 73/50 Approximation for Contiguous Monotone Moldable Job Scheduling. | Klaus Jansen, Felix Ohnesorge |
| 2026 | A 13/6-Approximation for Strip Packing via the Bottom-Left Algorithm. | Stefan Hougardy, Bart Zondervan |
| 2026 | Maximum Reachability Orientation of Mixed Graphs. | Florian Hrsch |
| 2026 | Upper and Lower Bounds for the Linear Ordering Principle. | Edward A. Hirsch, Ilya Volkovich |
| 2026 | Structural Parameterization of Steiner Tree Packing. | Niko Hastrich, Kirill Simonov |
| 2026 | A Polynomial Kernel for Face Cover on Non-Embedded Planar Graphs. | Thekla Hamm, Sukanya Pandey, Krisztina Szilgyi |
| 2026 | 2D Minimal Graph Rigidity is in NC for One-Crossing-Minor-Free Graphs. | Rohit Gurjar, Kilian Rothmund, Thomas Thierauf |
| 2026 | Polynomial Complementation of Nondeterministic Two-Way Finite Automata by 1-Limited Automata. | Bruno Guillon, Luca Prigioniero, Javad Taheri |
| 2026 | Query Languages for Machine-Learning Models (Invited Talk). | Martin Grohe |
| 2026 | On the Hardness of the One-Sided Code Sparsifier Problem. | Elena Grigorescu, Alice Moayyedi |
| 2026 | Smaller Circuits for Bit Addition. | Mikhail Goncharov, Alexander S. Kulikov, Georgie Levtsov |
| 2026 | The Complexity of Homomorphism Reconstruction Revisited. | Timo Gervens, Martin Grohe, Louis Hrtel, Philipp da Silva Fonseca |
| 2026 | Optimal Average Disk-Inspection via Fermat's Principle. | Konstantinos Georgiou |
| 2026 | Stealing from the Dragon's Hoard: Online Unbounded Knapsack With Removal. | Matthias Gehnen, Moritz Stocker |
| 2026 | Computing Twin-Width via Treedepth and Vertex Integrity. | Robert Ganian, Mathis Rocton |
| 2026 | On the Complexity of Computing Strahler Numbers. | Moses Ganardi, Markus Lohrey |
| 2026 | Maker-Maker Games of Rank 4 Are PSPACE-Complete. | Florian Galliot, Jonas Snizergues |
| 2026 | Planting and MCMC Sampling from the Potts Model. | Andreas Galanis, Leslie Ann Goldberg, Paulina Smolarova |
| 2026 | Fully Dynamic Spectral Sparsification for Directed Hypergraphs. | Sebastian Forster, Gramoz Goranci, Ali Momeni |
| 2026 | Random Models and Guarded Logic. | Oskar Fiuk |
| 2026 | Time-Optimal Construction of String Synchronizing Sets. | Jonas Ellert, Tomasz Kociumaka |
| 2026 | A Quantum Pigeonhole Principle and Two Semidefinite Relaxations of Communication Complexity. | Pavel Dvork, Bruno Loff, Suhail Sherif |
| 2026 | Higher Hardness Results for the Reconfiguration of Odd Matchings. | Joseph Dorfer |
| 2026 | Optimal Verification of a Minimum-Weight Basis in an Uncertainty Matroid. | Haya Diwan, Lisa Hellerstein, Nicole Megow, Jens Schlter |