- Joseph Paat, Robert Weismantel, Stefan Weltge, “Distances between optimal solutions of mixed-integer programs”, Math. Program., 179, № 1-2, 2020, 455
- Joseph Paat, Miriam Schlöter, Robert Weismantel, “The integrality number of an integer program”, Math. Program., 192, № 1-2, 2022, 271
- D. V. Gribanov, N. Yu. Zolotykh, “On lattice point counting in $\varDelta $-modular polyhedra”, Optim Lett, 16, № 7, 2022, 1991
- D.V. Gribanov, D.S. Malyshev, “The computational complexity of three graph problems for instances with bounded minors of constraint matrices”, Discrete Applied Mathematics, 227, 2017, 13
- S. I. Veselov, D. V. Gribanov, D. S. Malyshev, “FPT-Algorithm for Computing the Width of a Simplex Given by a Convex Hull”, MoscowUniv.Comput.Math.Cybern., 43, № 1, 2019, 1
- Amitabh Basu, “Complexity of optimizing over the integers”, Math. Program., 200, № 2, 2023, 739
- Dmitry Gribanov, Ivan Shumilov, Dmitry Malyshev, Nikolai Zolotykh, “Faster algorithms for sparse ILP and hypergraph multi-packing/multi-cover problems”, J Glob Optim, 2024
- Martin Henk, Stefan Kuhlmann, Robert Weismantel, “On Lattice Width of Lattice-Free Polyhedra and Height of Hilbert Bases”, SIAM J. Discrete Math., 36, № 3, 2022, 1918
- S. Artmann, F. Eisenbrand, C. Glanzer, T. Oertel, S. Vempala, R. Weismantel, “A note on non-degenerate integer programs with small sub-determinants”, Operations Research Letters, 44, № 5, 2016, 635
- D. V. Gribanov, D. S. Malyshev, P. M. Pardalos, S. I. Veselov, “FPT-algorithms for some problems related to integer programming”, J Comb Optim, 35, № 4, 2018, 1128