| 2021 | The Double Exponential Runtime is Tight for 2-Stage Stochastic ILPs. | Klaus Jansen, Kim-Manuel Klein, Alexandra Lassota |
| 2021 | A Combinatorial Algorithm for Computing the Degree of the Determinant of a Generic Partitioned Polynomial Matrix with $2\, \times \, 2$ Submatrices. | Yuni Iwamasa |
| 2021 | On the Power of Static Assignment Policies for Robust Facility Location Problems. | Omar El Housni, Vineet Goyal, David B. Shmoys |
| 2021 | Lifting Convex Inequalities for Bipartite Bilinear Programs. | Xiaoyi Gu, Santanu S. Dey, Jean-Philippe P. Richard |
| 2021 | A Finite Time Combinatorial Algorithm for Instantaneous Dynamic Equilibrium Flows. | Lukas Graf, Tobias Harks |
| 2021 | On the Recognition of a, b, c-Modular Matrices. | Christoph Glanzer, Ingo Stallknecht, Robert Weismantel |
| 2021 | Semi-streaming Algorithms for Submodular Matroid Intersection. | Paritosh Garg, Linus Jordan, Ola Svensson |
| 2021 | Affinely Representable Lattices, Stable Matchings, and Choice Functions. | Yuri Faenza, Xuan Zhang |
| 2021 | A Computational Status Update for Exact Rational Mixed Integer Programming. | Leon Eifler, Ambros M. Gleixner |
| 2021 | Speed-Robust Scheduling - Sand, Bricks, and Rocks. | Franziska Eberle, Ruben Hoeksma, Nicole Megow, Lukas Nlke, Kevin Schewior, Bertrand Simon |
| 2021 | Approximating the Discrete Time-Cost Tradeoff Problem with Bounded Depth. | Siad Daboul, Stephan Held, Jens Vygen |
| 2021 | On the Implementation and Strengthening of Intersection Cuts for QCQPs. | Antonia Chmiela, Gonzalo Muoz, Felipe Serrano |
| 2021 | Fixed Parameter Approximation Scheme for Min-Max k-Cut. | Karthekeyan Chandrasekaran, Weihang Wang |
| 2021 | Robust k-Center with Two Types of Radii. | Deeparnab Chakrabarty, Maryam Negahbani |
| 2021 | Proximity Bounds for Random Integer Programs. | Marcel Celaya, Martin Henk |
| 2021 | A New Integer Programming Formulation of the Graphical Traveling Salesman Problem. | Robert D. Carr, Neil Simonetti |
| 2021 | Online k-Taxi via Double Coverage and Time-Reverse Primal-Dual. | Niv Buchbinder, Christian Coester, Joseph (Seffi) Naor |
| 2021 | On the Integrality Gap of Binary Integer Programs with Gaussian Data. | Sander Borst, Daniel Dadush, Sophie Huiberts, Samarth Tiwari |
| 2021 | Improving the Approximation Ratio for Capacitated Vehicle Routing. | Jannis Blauth, Vera Traub, Jens Vygen |
| 2021 | Complexity, Exactness, and Rationality in Polynomial Optimization. | Daniel Bienstock, Alberto Del Pia, Robert Hildebrand |
| 2021 | Complexity of Branch-and-Bound and Cutting Planes in Mixed-Integer Optimization - II. | Amitabh Basu, Michele Conforti, Marco Di Summa, Hongyi Jiang |
| 2021 | Computational Aspects of Relaxation Complexity. | Gennadiy Averkov, Christopher Hojny, Matthias Schymura |
| 2021 | A Tight Approximation Algorithm for the Cluster Vertex Deletion Problem. | Manuel Aprile, Matthew Drescher, Samuel Fiorini, Tony Huynh |
| 2020 | On the Convexification of Constrained Quadratic Optimization Problems with Indicator Variables. | Linchuan Wei, Andrs Gmez, Simge Kkyavuz |
| 2020 | On Convex Hulls of Epigraphs of QCQPs. | Alex L. Wang, Fatma Kilin-Karzan |