| 2022 | A Constant-Factor Approximation for Generalized Malleable Scheduling Under $M^\natural $-Concave Processing Speeds. | Dimitris Fotakis, Jannik Matuschke, Orestis Papadigenopoulos |
| 2022 | Intersecting and Dense Restrictions of Clutters in Polynomial Time. | Martin Drees |
| 2022 | Combinatorial Algorithms for Rooted Prize-Collecting Walks and Applications to Orienteering and Minimum-Latency Problems. | Sina Dezfuli, Zachary Friggstad, Ian Post, Chaitanya Swamy |
| 2022 | On Circuit Diameter Bounds via Circuit Imbalances. | Daniel Dadush, Zhuan Khye Koh, Bento Natura, Lszl A. Vgh |
| 2022 | A Simple Method for Convex Optimization in the Oracle Model. | Daniel Dadush, Christopher Hojny, Sophie Huiberts, Stefan Weltge |
| 2022 | Optimal Item Pricing in Online Combinatorial Auctions. | Jos Correa, Andrs Cristi, Andrs Fielbaum, Tristan Pollner, S. Matthew Weinberg |
| 2022 | A 2-Approximation for the Bounded Treewidth Sparsest Cut Problem in FPT Time. | Vincent Cohen-Addad, Tobias Mmke, Victor Verdugo |
| 2022 | Sparse Multi-term Disjunctive Cuts for the Epigraph of a Function of Binary Variables. | Rui Chen, James R. Luedtke |
| 2022 | Improving the Cook et al. Proximity Bound Given Integral Valued Constraints. | Marcel Celaya, Stefan Kuhlmann, Joseph Paat, Robert Weismantel |
| 2022 | Faster Connectivity in Low-Rank Hypergraphs via Expander Decomposition. | Calvin Beideman, Karthekeyan Chandrasekaran, Sagnik Mukhopadhyay, Danupon Nanongkai |
| 2022 | A Simple LP-Based Approximation Algorithm for the Matching Augmentation Problem. | tienne Bamas, Marina Drygala, Ola Svensson |
| 2022 | The Simultaneous Semi-random Model for TSP. | Eric Balkanski, Yuri Faenza, Mathieu Kubik |
| 2022 | On the Maximal Number of Columns of a $\varDelta $-modular Matrix. | Gennadiy Averkov, Matthias Schymura |
| 2022 | Faster Goal-Oriented Shortest Path Search for Bulk and Incremental Detailed Routing. | Markus Ahrens, Dorothee Henke, Stefan Rabenstein, Jens Vygen |
| 2022 | Total Dual Dyadicness and Dyadic Generating Sets. | Ahmad Abdi, Grard Cornujols, Bertrand Guenin, Levent Tunel |
| 2021 | Face Dimensions of General-Purpose Cutting Planes for Mixed-Integer Linear Programs. | Matthias Walter |
| 2021 | On the Geometry of Symmetry Breaking Inequalities. | Jos Verschae, Matas Villagra, Lonard von Niederhusern |
| 2021 | Sum-of-Squares Hierarchies for Binary Polynomial Optimization. | Lucas Slot, Monique Laurent |
| 2021 | Implications, Conflicts, and Reductions for Steiner Trees. | Daniel Rehfeldt, Thorsten Koch |
| 2021 | Multi-cover Inequalities for Totally-Ordered Multiple Knapsack Sets. | Alberto Del Pia, Jeff T. Linderoth, Haoran Zhu |
| 2021 | Maximum Weight Disjoint Paths in Outerplanar Graphs via Single-Tree Cut Approximators. | Guyslain Naves, F. Bruce Shepherd, Henry Xia |
| 2021 | Fast Quantum Subroutines for the Simplex Method. | Giacomo Nannicini |
| 2021 | Linear Regression with Mismatched Data: A Provably Optimal Local Search Algorithm. | Rahul Mazumder, Haoyue Wang |
| 2021 | Pfaffian Pairs and Parities: Counting on Linear Matroid Intersection and Parity Problems. | Kazuki Matoya, Taihei Oki |
| 2021 | New Exact Techniques Applied to a Class of Network Flow Formulations. | Vincius Loti de Lima, Manuel Iori, Flvio Keidi Miyazawa |