| 2026 | IPCO | A Threshold Phenomenon for the Shortest Lattice Vector Problem in the Infinity Norm. | Stefan Kuhlmann, Robert Weismantel |
| 2025 | IPCO | Sparse Approximation in Lattices and Semigroups. | Stefan Kuhlmann, Timm Oertel, Robert Weismantel |
| 2025 | SODA | Forall-exist statements in pseudopolynomial time. | Eleonore Bach, Friedrich Eisenbrand, Thomas Rothvoss, Robert Weismantel |
| 2024 | IPCO | On Matrices over a Polynomial Ring with Restricted Subdeterminants. | Marcel Celaya, Stefan Kuhlmann, Robert Weismantel |
| 2023 | IPCO | Sparse Approximation over the Cube. | Sabrina Bruckmeier, Christoph Hunkenschrder, Robert Weismantel |
| 2022 | IPCO | Improving the Cook et al. Proximity Bound Given Integral Valued Constraints. | Marcel Celaya, Stefan Kuhlmann, Joseph Paat, Robert Weismantel |
| 2021 | ESA | Efficient Sequential and Parallel Algorithms for Multistage Stochastic Integer Programming Using Proximity. | Jana Cslovjecsek, Friedrich Eisenbrand, Michal Pilipczuk, Moritz Venzin, Robert Weismantel |
| 2021 | IPCO | On the Recognition of a, b, c-Modular Matrices. | Christoph Glanzer, Ingo Stallknecht, Robert Weismantel |
| 2021 | SODA | Block-Structured Integer and Linear Programming in Strongly Polynomial and Near Linear Time. | Jana Cslovjecsek, Friedrich Eisenbrand, Christoph Hunkenschrder, Lars Rohwedder, Robert Weismantel |
| 2020 | IPCO | The Integrality Number of an Integer Program. | Joseph Paat, Miriam Schlter, Robert Weismantel |
| 2019 | IPCO | Sparsity of Integer Solutions in the Average Case. | Timm Oertel, Joseph Paat, Robert Weismantel |
| 2018 | SODA | Proximity results and faster algorithms for Integer Programming using the Steinitz Lemma. | Friedrich Eisenbrand, Robert Weismantel |
| 2017 | SODA | Extension Complexity Lower Bounds for Mixed-Integer Extended Formulations. | Robert Hildebrand, Robert Weismantel, Rico Zenklusen |
| 2017 | STOC | A strongly polynomial algorithm for bimodular integer linear programming. | Stephan Artmann, Robert Weismantel, Rico Zenklusen |
| 2016 | SODA | An FPTAS for Minimizing Indefinite Quadratic Forms over Integers in Polyhedra. | Robert Hildebrand, Robert Weismantel, Kevin Zemmer |
| 2014 | ICALP | Time-Expanded Packings. | David Adjiashvili, Sandro Bosio, Robert Weismantel, Rico Zenklusen |
| 2014 | SODA | Integer quadratic programming in the plane. | Alberto Del Pia, Robert Weismantel |
| 2010 | IPCO | Zero-Coefficient Cuts. | Kent Andersen, Robert Weismantel |
| 2010 | IPCO | A Polynomial-Time Algorithm for Optimizing over | Raymond Hemmecke, Matthias Kppe, Robert Weismantel |
| 2009 | AAIM | Nonlinear Optimization over a Weighted Independence System. | Jon Lee, Shmuel Onn, Robert Weismantel |
| 2007 | IPCO | Inequalities from Two Rows of a Simplex Tableau. | Kent Andersen, Quentin Louveaux, Robert Weismantel, Laurence A. Wolsey |
| 2006 | SODA | FPTAS for mixed-integer polynomial optimization with a fixed number of variables. | Jess A. De Loera, Raymond Hemmecke, Matthias Kppe, Robert Weismantel |
| 2002 | ESA | A Primal Approach to the Stable Set Problem. | Claudio Gentile, Utz-Uwe Haus, Matthias Kppe, Giovanni Rinaldi, Robert Weismantel |
| 2002 | IPCO | A Generalization of Edmonds' Matching and Matroid Intersection Algorithms. | Bianca Spille, Robert Weismantel |
| 1999 | SODA | An Oracle-Polynomial Time Augmentation Algorithm for Integer Programming. | Andreas S. Schulz, Robert Weismantel |
| 1998 | IPCO | The Intersection of Knapsack Polyhedra and Extensions. | Alexander Martin, Robert Weismantel |
| 1997 | ESA | Decomposition of Integer Programs and of Generating Sets. | Grard Cornujols, Regina Urbaniak, Robert Weismantel, Laurence A. Wolsey |
| 1997 | ESA | Test Sets of the Knapsack Problem and Simultaneous Diophantine Approximations. | Martin Henk, Robert Weismantel |
| 1996 | IPCO | Quadratic Knapsack Relaxations Using Cutting Planes. | Christoph Helmberg, Franz Rendl, Robert Weismantel |
| 1996 | IPCO | Test Sets and Inequalities for Integer Programs. | Rekha R. Thomas, Robert Weismantel |
| 1995 | ESA | 0/1-Integer Programming: Optimization and Augmentation are Equivalent. | Andreas S. Schulz, Robert Weismantel, Gnter M. Ziegler |
| 1993 | IPCO | Routing in grid graphs by cutting planes. | Martin Grtschel, Alexander Martin, Robert Weismantel |