| 2025 | Lagrangian Dual for Integer Optimization with Zero Duality Gap that Admits Decomposition. | Diego Cifuentes, Santanu S. Dey, Jingye Xu |
| 2025 | Approximate Cut & Packing Ratios for Multi-commodity Arborescences. | Parinya Chalermsook, Chien-Chung Huang |
| 2025 | The Differentiable Feasibility Pump. | Matteo Cacciola, Alexandre Forel, Antonio Frangioni, Andrea Lodi |
| 2025 | On the Bidirected Cut Relaxation for Steiner Forest. | Jaroslaw Byrka, Fabrizio Grandoni, Vera Traub |
| 2025 | Online Matching on 3-Uniform Hypergraphs. | Sander Borst, Danish Kashaev, Zhuan Khye Koh |
| 2025 | Valid Cuts for the Design of Potential-Based Flow Networks. | Pascal Brner, Max Klimm, Annette Lutz, Marc E. Pfetsch, Martin Skutella, Lea Strubberg |
| 2025 | Exponential Lower Bounds for Many Pivot Rules for the Simplex Method. | Alexander E. Black |
| 2025 | Monotone Submodular Multiway Partition. | Richard Bi, Karthekeyan Chandrasekaran, Soham Joshi |
| 2025 | Matroid Secretary via Labeling Schemes. | Kristf Brczi, Vasilis Livanos, Jos A. Soto, Victor Verdugo |
| 2025 | A Global Analysis of the Primal-Dual Method for Edge Augmentation Problems. | Ishan Bansal |
| 2025 | A Constant-Factor Approximation for Pairwise Fair k-Center Clustering. | Sayan Bandyapadhyay, Tianzhi Chen, Zachary Friggstad, Mahya Jamshidian |
| 2025 | On the Approximability of Unsplittable Flow on a Path with Time Windows. | Alexander Armbruster, Fabrizio Grandoni, Edin Husic, Antoine Tinguely, Andreas Wiese |
| 2025 | Integer and Unsplittable Multiflows in Series-Parallel Digraphs. | Mohammed Majthoub Almoghrabi, Martin Skutella, Philipp Warode |
| 2025 | Unsplittable Multicommodity Flows in Outerplanar Graphs. | David Alemn-Espinosa, Nikhil Kumar |
| 2025 | Prize-Collecting Forest with Submodular Penalties: Improved Approximation. | Ali Ahmadi, Iman Gholami, MohammadTaghi Hajiaghayi, Peyman Jabbarzade, Mohammad Mahdavi |
| 2025 | Strongly Connected Orientations and Integer Lattices. | Ahmad Abdi, Grard Cornujols, Siyue Liu, Olha Silina |
| 2024 | Online Algorithms for Spectral Hypergraph Sparsification. | Tasuku Soma, Kam Chuen Tung, Yuichi Yoshida |
| 2024 | Relaxation Strength for Multilinear Optimization: McCormick Strikes Back. | Emily Schutte, Matthias Walter |
| 2024 | Lower Bounds on the Complexity of Mixed-Integer Programs for Stable Set and Knapsack. | Jamico Schade, Makrand Sinha, Stefan Weltge |
| 2024 | A New Branching Rule for Range Minimization Problems. | Bart T. C. van Rossum, Rui Chen, Andrea Lodi |
| 2024 | Network Flow Problems with Electric Vehicles. | Haripriya Pulyassary, Kostas Kollias, Aaron Schild, David B. Shmoys, Manxi Wu |
| 2024 | Extending the Primal-Dual 2-Approximation Algorithm Beyond Uncrossable Set Families. | Zeev Nutov |
| 2024 | A $\nicefrac {4}{3}$-Approximation for the Maximum Leaf Spanning Arborescence Problem in DAGs. | Meike Neuwohner |
| 2024 | Polynomial Algorithms to Minimize 2/3-Submodular Functions. | Ryuhei Mizutani, Yuki Yoshida |
| 2024 | Decomposing Probability Marginals Beyond Affine Requirements. | Jannik Matuschke |