Operations that Preserve the Covering Property of the Lifting Region. - Amitabh Basu; Joseph Paat (SIAM J. Optim., 2015)

Conflict-free railway track assignment at depots. - Brady Gilg; Torsten Klug; Rosemarie Martienssen; Joseph Paat; Thomas Schlechte; Christof Schulz; Senan Seymen; Alexander Tesch (J. Rail Transp. Plan. Manag., 2018)

Extreme functions with an arbitrary number of slopes. - Amitabh Basu; Michele Conforti; Marco Di Summa; Joseph Paat (Math. Program., 2018)

Approximation of Corner Polyhedra with Families of Intersection Cuts. - Gennadiy Averkov; Amitabh Basu; Joseph Paat (SIAM J. Optim., 2018)

Sparsity of Integer Solutions in the Average Case. - Timm Oertel; Joseph Paat; Robert Weismantel (IPCO, 2019)

Most IPs with bounded determinants can be solved in polynomial time. - Joseph Paat; Miriam Schlöter; Robert Weismantel (CoRR, 2019)

The Structure of the Infinite Models in Integer Programming. - Amitabh Basu; Michele Conforti; Marco Di Summa; Joseph Paat (Math. Oper. Res., 2019)

Nonunique Lifting of Integer Variables in Minimal Inequalities. - Amitabh Basu; Santanu S. Dey; Joseph Paat (SIAM J. Discret. Math., 2019)

Improving Proximity Bounds Using Sparsity. - Jon Lee 001; Joseph Paat; Ingo Stallknecht; Luze Xu (ISCO, 2020)

Distances between optimal solutions of mixed-integer programs. - Joseph Paat; Robert Weismantel; Stefan Weltge (Math. Program., 2020)

The Distributions of Functions Related to Parametric Integer Optimization. - Timm Oertel; Joseph Paat; Robert Weismantel (SIAM J. Appl. Algebra Geom., 2020)

Improving the Cook et al. Proximity Bound Given Integral Valued Constraints. - Marcel Celaya; Stefan Kuhlmann; Joseph Paat; Robert Weismantel (IPCO, 2022)

Constructing lattice-free gradient polyhedra in dimension two. - Joseph Paat; Miriam Schlöter; Emily Speakman (Math. Program., 2022)

The integrality number of an integer program. - Joseph Paat; Miriam Schlöter; Robert Weismantel (Math. Program., 2022)

Towards a Characterization of Maximal Quadratic-Free Sets. - Gonzalo Muñoz 001; Joseph Paat; Felipe Serrano 001 (IPCO, 2023)

Polynomial Upper Bounds on the Number of Differing Columns of ?-Modular Integer Programs. - Jon Lee 001; Joseph Paat; Ingo Stallknecht; Luze Xu (Math. Oper. Res., 2023)

Proximity and Flatness Bounds for Linear Integer Optimization. - Marcel Celaya; Stefan Kuhlmann; Joseph Paat; Robert Weismantel (Math. Oper. Res., 2024)

A colorful Steinitz Lemma with application to block-structured integer programs. - Timm Oertel; Joseph Paat; Robert Weismantel (Math. Program., 2024)

On the Column Number and Forbidden Submatrices for ( Delta )-Modular Matrices. - Joseph Paat; Ingo Stallknecht; Zach Walsh; Luze Xu (SIAM J. Discret. Math., 2024)

The MIP Workshop 2023 Computational Competition on reoptimization. - Suresh Bolusani; Mathieu Besançon; Ambros M. Gleixner; Timo Berthold; Claudia D'Ambrosio; Gonzalo Muñoz 001; Joseph Paat; Dimitri Thomopulos (Math. Program. Comput., 2024)

Extended formulations for the integer hull of strictly Δ-modular cographic polyhedral cones. - Joseph Paat; Zach Walsh; Luze Xu (Oper. Res. Lett., 2025)

A characterization of maximal homogeneous-quadratic-free sets. - Gonzalo Muñoz 001; Joseph Paat; Felipe Serrano 001 (Math. Program., 2025)

Compressing branch-and-bound trees. - Gonzalo Muñoz 001; Joseph Paat; Álinson S. Xavier (Math. Program., 2025)