| 2020 | A Technique for Obtaining True Approximations for k-Center with Covering Constraints. | Georg Anegg, Haris Angelidakis, Adam Kurpisz, Rico Zenklusen |
| 2020 | Optimizing Sparsity over Lattices and Semigroups. | Iskander Aliev, Gennadiy Averkov, Jess A. De Loera, Timm Oertel |
| 2020 | Faster Algorithms for Next Breakpoint and Max Value for Parametric Global Minimum Cuts. | Hassene Aissi, S. Thomas McCormick, Maurice Queyranne |
| 2020 | Flexible Graph Connectivity. | David Adjiashvili, Felix Hommelsheim, Moritz Mhlenthaler |
| 2020 | Idealness of k-wise Intersecting Families. | Ahmad Abdi, Grard Cornujols, Tony Huynh, Dabeen Lee |
| 2020 | A Combinatorial Algorithm for Computing the Rank of a Generic Partitioned Matrix with 2 ˟ 2 Submatrices. | Hiroshi Hirai, Yuni Iwamasa |
| 2019 | Random Projections for Quadratic Programs over a Euclidean Ball. | Ky Khac Vu, Pierre-Louis Poirion, Claudia D'Ambrosio, Leo Liberti |
| 2019 | Breaking Symmetries to Rescue Sum of Squares: The Case of Makespan Scheduling. | Victor Verdugo, Jos Verschae |
| 2019 | Intersection Cuts for Factorable MINLP. | Felipe Serrano |
| 2019 | Earliest Arrival Transshipments in Networks with Multiple Sinks. | Miriam Schlter |
| 2019 | A Generic Exact Solver for Vehicle Routing and Related Problems. | Artur Alves Pessoa, Ruslan Sadykov, Eduardo Uchoa, Franois Vanderbeck |
| 2019 | Sparsity of Integer Solutions in the Average Case. | Timm Oertel, Joseph Paat, Robert Weismantel |
| 2019 | An Exact Algorithm for Robust Influence Maximization. | Giacomo Nannicini, Giorgio Sartor, Emiliano Traversi, Roberto Wolfler Calvo |
| 2019 | A New Contraction Technique with Applications to Congruency-Constrained Cuts. | Martin Ngele, Rico Zenklusen |
| 2019 | Approximate Multi-matroid Intersection via Iterative Refinement. | Andr Linhares, Neil Olver, Chaitanya Swamy, Rico Zenklusen |
| 2019 | Computing the Nucleolus of Weighted Cooperative Matching Games in Polynomial Time. | Jochen Knemann, Kanstantsin Pashkovich, Justin Toth |
| 2019 | An Efficient Characterization of Submodular Spanning Tree Games. | Zhuan Khye Koh, Laura Sanit |
| 2019 | The Asymmetric Traveling Salesman Path LP Has Constant Integrality Ratio. | Anna Khne, Vera Traub, Jens Vygen |
| 2019 | On Compact Representations of Voronoi Cells of Lattices. | Christoph Hunkenschrder, Gina Reuland, Matthias Schymura |
| 2019 | On Perturbation Spaces of Minimal Valid Functions: Inverse Semigroup Theory and Equivariant Decomposition Theorem. | Robert Hildebrand, Matthias Kppe, Yuan Zhou |
| 2019 | The Markovian Price of Information. | Anupam Gupta, Haotian Jiang, Ziv Scully, Sahil Singla |
| 2019 | Dynamic Flows with Adaptive Route Choice. | Lukas Graf, Tobias Harks |
| 2019 | Linear Programming Using Limited-Precision Oracles. | Ambros M. Gleixner, Daniel E. Steffy |
| 2019 | A Bundle Approach for SDPs with Exact Subgraph Constraints. | Elisabeth Gaar, Franz Rendl |
| 2019 | Integer Programming and Incidence Treedepth. | Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak, Michal Pilipczuk, Marcin Wrochna |