| 2026 | Closing the Gap: Efficient Algorithms for Discrete Wasserstein Barycenters. | Jiaqi Wang, Weijun Xie |
| 2026 | The Integrality Gap of the Traveling Salesman Problem is $\frac{4}{3}$ if the LP Solution Has at Most n + 6 Non-Zero Components. | Tullio Villa, Eleonora Vercesi, Jnos Barta, Monaldo Mastrolilli |
| 2026 | Complexity of Bilevel Linear Programming with a Single Upper-Level Variable. | Nagisa Sugishita, Margarida Carvalho |
| 2026 | O(log n)-Approximation Algorithms for Bipartiteness Ratio. | Tasuku Soma, Mingquan Ye, Yuichi Yoshida |
| 2026 | Approximation Schemes for Planar Graph Connectivity Problems. | Meike Neuwohner, Vera Traub, Rico Zenklusen |
| 2026 | On the Complexity of the Odd-Red Bipartite Perfect Matching Polytope. | Martin Ngele, Christian Nbel, Rico Zenklusen |
| 2026 | Stronger Hardness for Maximum Robust Flow and Randomized Network Interdiction. | Jannik Matuschke |
| 2026 | Lattice Structure and Efficient Basis Construction for Strongly Connected Orientations. | Siyue Liu, Olha Silina |
| 2026 | Polytope Scheduling with Groups: Unified Models and Optimal Guarantees. | Alexander Lindermayr, Zhenwei Liu, Nicole Megow |
| 2026 | Solving 4-Block Integer Linear Programs Faster Using Affine Decompositions of the Right-Hand Sides. | Alexandra Lassota, Koen Ligthart |
| 2026 | A Threshold Phenomenon for the Shortest Lattice Vector Problem in the Infinity Norm. | Stefan Kuhlmann, Robert Weismantel |
| 2026 | Structure-Preserving Symmetry Presolving for Mixed-Binary Linear Problems. | Annika Jger, Marc E. Pfetsch |
| 2026 | Polynomial Kernels with Reachability for Weighted d-Matroid Intersection. | Chien-Chung Huang, Naonori Kakimura, Yusuke Kobayashi, Tatsuya Terao |
| 2026 | A Framework for Handling and Exploiting Symmetry in Benders Decomposition. | Christopher Hojny, Cdric Roy |
| 2026 | Arithmetic Circuits and Neural Networks for Regular Matroids. | Christoph Hertrich, Stefan Kober, Georg Loho |
| 2026 | The Strength of Root Cuts in an Extended Abstract Branch-and-Cut Model. | Boyang Han, Aleksandr M. Kazachkov |
| 2026 | Bayesian Probing on Graphs. | Anupam Gupta, Benjamin Moseley, Rudy Zhou |
| 2026 | Approximating Multiple-Depot Capacitated Vehicle Routing via LP Rounding. | Zachary Friggstad, Tobias Mmke |
| 2026 | 1.64-Approximation for Chromatic Correlation Clustering via Chromatic Cluster LP. | Chenglin Fan, Dahoon Lee, Euiwoong Lee |
| 2026 | Linear Programming Hierarchies Collapse Under Symmetry. | Yuri Faenza, Victor Verdugo, Jos Verschae, Matas Villagra |
| 2026 | Stochastic Load Balancing with Machine Reservations. | David Alemn Espinosa, Naveen Garg, Sharat Ibrahimpur, Neil Olver, Chaitanya Swamy |
| 2026 | A Weighted-to-Unweighted Reduction for Matroid Intersection. | Aditi Dudeja, Mara Grilnberger |
| 2026 | On Circuit Diameter and Straight Line Complexity. | Daniel Dadush, Stefan Kober, Zhuan Khye Koh |
| 2026 | Improved Approximation Algorithms for Orthogonally Constrained Problems Using Semidefinite Optimization. | Ryan Cory-Wright, Jean Pauphilet |
| 2026 | Hedgegraph Polymatroids. | Karthekeyan Chandrasekaran, Chandra Chekuri, Weihang Wang, Weihao Zhu |