| 2026 | On Integer Programs That Look Like Paths. | Marcin Brianski, Alexandra Lassota, Kristna Pekrkov, Michal Pilipczuk, Janina Reuter |
| 2026 | A PTAS for Weighted Triangle-Free 2-Matching. | Miguel Bosch-Calvo, Fabrizio Grandoni, Yusuke Kobayashi, Takashi Noguchi |
| 2026 | An Efficient Algorithm for Minimizing Ordered Norms in Fractional Load Balancing. | Daniel Blankenburg, Antonia Ellerbrock, Thomas Kesselheim, Jens Vygen |
| 2026 | s,t-Separating Principal Partition Sequence of Submodular Functions. | Kristf Brczi, Karthekeyan Chandrasekaran, Tams Kirly, Daniel P. Szabo |
| 2026 | Degree Realization with Minimum Dominating Set. | Amotz Bar-Noy, Igor Kalinichev, David Peleg, Dror Rawitz |
| 2026 | On Lattice Diameter Segments: Algorithms and Structure. | Gennadiy Averkov, Anouk E. Brose, Jess A. De Loera, Gyivan Lopez-Campos, Antonio J. Torres |
| 2026 | Efficiently Coloring the Intersection of a General Matroid and Combinatorial Matroids. | Stephen Arndt, Benjamin Moseley, Kirk Pruhs, Michael Zlatin |
| 2026 | The Local Dyadic Conjecture. | Mahtab Alghasi, Bertrand Guenin, Levent Tunel |
| 2025 | Space-Efficient Algorithm for Integer Programming with Few Constraints. | Lars Rohwedder, Karol Wegrzycki |
| 2025 | A Simple and Fast Algorithm for Fair Cuts. | Jason Li, Owen Li |
| 2025 | The Augmented Factorization Bound for Maximum-Entropy Sampling. | Yongchun Li |
| 2025 | Sparse Approximation in Lattices and Semigroups. | Stefan Kuhlmann, Timm Oertel, Robert Weismantel |
| 2025 | Totally $\varDelta $-Modular IPs with Two Non-zeros in Most Rows. | Stefan Kober |
| 2025 | Generalized Assignment and Knapsack Problems in the Random-Order Model. | Max Klimm, Martin Knaack |
| 2025 | A Black-Box Approach for Exogenous Replenishment in Online Resource Allocation. | Suho Kang, Ziyang Liu, Rajan Udwani |
| 2025 | An O(log n)-Approximation Algorithm for (p, q)-Flexible Graph Connectivity via Independent Rounding. | Sharat Ibrahimpur, Lszl A. Vgh |
| 2025 | (Near)-Optimal Algorithms for Sparse Separable Convex Integer Programs. | Christoph Hunkenschrder, Martin Kouteck, Asaf Levin, Tung Anh Vu |
| 2025 | Implied Integrality in Mixed-Integer Optimization. | Rolf van der Hulst, Matthias Walter |
| 2025 | Sequential Testing with Subadditive Costs. | Blake Harris, Viswanath Nagarajan, Rayen Tan |
| 2025 | Semirandom Planted Clique via 1-Norm Isometry Property. | Venkatesan Guruswami, Hsin-Po Wang |
| 2025 | Completeness in the Polynomial Hierarchy for Many Natural Problems in Bilevel and Robust Optimization. | Christoph Grne, Lasse Wulf |
| 2025 | Separating Coverage and Submodular: Maximization Subject to a Cardinality Constraint. | Yuval Filmus, Roy Schwartz, Alexander V. Smal |
| 2025 | Non-distributive Lattices, Stable Matchings, and Linear Optimization. | Christopher En, Yuri Faenza |
| 2025 | An Unconditional Lower Bound for the Active-Set Method on the Hypercube. | Yann Disser, Nils Mosis |
| 2025 | Reducing the Large Set Threshold for Oertel's Conjecture on the Mixed-Integer Volume. | Andrs Cristi, David Salas |