On integer programing with restricted determinants. - Dmitry V. Gribanov; Sergey I. Veselov (CoRR, 2015)

The width and integer optimization on simplices with bounded minors of the constraint matrices. - Dmitry V. Gribanov; Aleksandr Yu. Chirkov (Optim. Lett., 2016)

On integer programming with bounded determinants. - Dmitry V. Gribanov; Sergey I. Veselov (Optim. Lett., 2016)

FPT-algorithms for The Shortest Lattice Vector and Integer Linear Programming Problems. - Dmitry V. Gribanov (CoRR, 2017)

The computational complexity of three graph problems for instances with bounded minors of constraint matrices. - Dmitry V. Gribanov; Dmitriy S. Malyshev (Discret. Appl. Math., 2017)

The computational complexity of dominating set problems for instances with bounded minors of constraint matrices. - Dmitriy S. Malyshev; Dmitry V. Gribanov (Discret. Optim., 2018)

FPT-algorithms for some problems related to integer programming. - Dmitry V. Gribanov; Dmitriy S. Malyshev; Panos M. Pardalos; Sergey I. Veselov (J. Comb. Optim., 2018)

Integer Conic Function Minimization Based on the Comparison Oracle. - Dmitriy V. Gribanov; Dmitriy S. Malyshev (MOTOR, 2019)

On the complexity of quasiconvex integer minimization problem. - Aleksandr Yu. Chirkov; Dmitry V. Gribanov; Dmitriy S. Malyshev; Panos M. Pardalos; Sergey I. Veselov; Nikolai Yu. Zolotykh (J. Glob. Optim., 2019)

Properties of Δ-modular simplicies and "close" polyhedrons. O(Δ · polylog(Δ))-algorithm for knapsack, proximity and sparsity. - Dmitry V. Gribanov (CoRR, 2020)

On lattice point counting in Δ-modular polyhedra. - Dmitry V. Gribanov; Nikolai Yu. Zolotykh (CoRR, 2020)

A polynomial algorithm for minimizing discrete convic functions in fixed dimension. - Sergey I. Veselov; Dmitry V. Gribanov; Nikolai Yu. Zolotykh; Aleksandr Yu. Chirkov (Discret. Appl. Math., 2020)

An FPTAS for the Δ-Modular Multidimensional Knapsack Problem. - Dmitriy V. Gribanov (MOTOR, 2021)

Faster algorithm for counting of the integer points number in Δ-modular polyhedra. - Dmitry V. Gribanov; Dmitriy S. Malyshev (CoRR, 2021)

Faster ILP Algorithms for Problems with Sparse Matrices and Their Applications to Multipacking and Multicover Problems in Graphs and Hypergraphs. - Dmitry V. Gribanov; Dmitry S. Malyshev (CoRR, 2022)

On lattice point counting in $ varDelta $-modular polyhedra. - Dmitry V. Gribanov; Nikolai Yu. Zolotykh (Optim. Lett., 2022)

Enumeration and Unimodular Equivalence of Empty Delta-Modular Simplices. - Dmitriy V. Gribanov (CoRR, 2023)

Faster Integer Points Counting in Parametric Polyhedra. - Dmitry V. Gribanov; Dmitriy S. Malyshev; Panos M. Pardalos; Nikolai Yu. Zolotykh (CoRR, 2023)

Delta-modular ILP Problems of Bounded Co-dimension, Discrepancy, and Convolution. - Dmitry V. Gribanov; Dmitriy S. Malyshev; Panos M. Pardalos (CoRR, 2024)

Structured $( min ,+)$-convolution and its applications for the shortest/closest vector and nonlinear knapsack problems. - Dmitry V. Gribanov; Ivan A. Shumilov; Dmitriy S. Malyshev (Optim. Lett., 2024)

On Δ-modular integer linear problems in the canonical form and equivalent problems. - Dmitry V. Gribanov; Ivan A. Shumilov; Dmitriy S. Malyshev; Panos M. Pardalos (J. Glob. Optim., 2024)

On a Simple Connection Between Δ-Modular ILP and LP, and a New Bound on the Number of Integer Vertices. - Dmitry V. Gribanov; Dmitry S. Malyshev; Ivan A. Shumilov (Oper. Res. Forum, 2024)

Faster algorithms for sparse ILP and hypergraph multi-packing/multi-cover problems. - Dmitry V. Gribanov; Ivan A. Shumilov; Dmitry S. Malyshev; Nikolai Yu. Zolotykh (J. Glob. Optim., 2024)