Dmitry V. Gribanov

Publication Activity (10 Years)

Years Active: 2015-2024
Publications (10 Years): 23

Top Topics

Top Venues

J. Glob. Optim.

Discret. Appl. Math.

Publications

Dmitry V. Gribanov, Ivan A. Shumilov, Dmitriy S. Malyshev, Panos M. Pardalos
On Δ-modular integer linear problems in the canonical form and equivalent problems. J. Glob. Optim. 88 (3) (2024)
Dmitry V. Gribanov, Dmitriy S. Malyshev, Panos M. Pardalos
Delta-modular ILP Problems of Bounded Co-dimension, Discrepancy, and Convolution. CoRR (2024)
Dmitry V. Gribanov, I. A. Shumilov, Dmitriy S. Malyshev
Structured $(\min ,+)$-convolution and its applications for the shortest/closest vector and nonlinear knapsack problems. Optim. Lett. 18 (1) (2024)
Dmitry V. Gribanov, Ivan A. Shumilov, Dmitry S. Malyshev, Nikolai Yu. Zolotykh
Faster algorithms for sparse ILP and hypergraph multi-packing/multi-cover problems. J. Glob. Optim. 89 (4) (2024)
Dmitry V. Gribanov, Dmitry S. Malyshev, Ivan A. Shumilov
On a Simple Connection Between Δ-Modular ILP and LP, and a New Bound on the Number of Integer Vertices. Oper. Res. Forum 5 (2) (2024)
Dmitry V. Gribanov, Dmitriy S. Malyshev, Panos M. Pardalos, Nikolai Yu. Zolotykh
Faster Integer Points Counting in Parametric Polyhedra. CoRR (2023)
Dmitry V. Gribanov, Dmitriy S. Malyshev, I. A. Shumilov
On a Simple Connection Between Δ-modular ILP and LP, and a New Bound on the Number of Integer Vertices. CoRR (2022)
Dmitry V. Gribanov, Nikolai Yu. Zolotykh
On lattice point counting in $\varDelta $-modular polyhedra. Optim. Lett. 16 (7) (2022)
Dmitry V. Gribanov
An FPTAS for the Δ-modular multidimensional knapsack problem. CoRR (2021)
Dmitry V. Gribanov, Dmitriy S. Malyshev
Faster algorithm for counting of the integer points number in Δ-modular polyhedra. CoRR (2021)
Sergey I. Veselov, Dmitry V. Gribanov, Nikolai Yu. Zolotykh, Aleksandr Yu. Chirkov
A polynomial algorithm for minimizing discrete convic functions in fixed dimension. Discret. Appl. Math. 283 (2020)
Dmitry V. Gribanov
Properties of Δ-modular simplicies and "close" polyhedrons. O(Δ · polylog(Δ))-algorithm for knapsack, proximity and sparsity. CoRR (2020)
Dmitry V. Gribanov, Nikolai Yu. Zolotykh
On lattice point counting in Δ-modular polyhedra. CoRR (2020)
Aleksandr Yu. Chirkov, Dmitry V. Gribanov, Dmitriy S. Malyshev, Panos M. Pardalos, Sergey I. Veselov, Nikolai Yu. Zolotykh
On the complexity of quasiconvex integer minimization problem. J. Glob. Optim. 73 (4) (2019)
Dmitry V. Gribanov, Dmitriy S. Malyshev, Panos M. Pardalos, Sergey I. Veselov
FPT-algorithms for some problems related to integer programming. J. Comb. Optim. 35 (4) (2018)
Aleksandr Yu. Chirkov, Dmitry V. Gribanov, Dmitriy S. Malyshev, Panos M. Pardalos, Sergey I. Veselov, Nikolai Yu. Zolotykh
On the complexity of quasiconvex integer minimization problem. CoRR (2018)
Dmitriy S. Malyshev, Dmitry V. Gribanov
The computational complexity of dominating set problems for instances with bounded minors of constraint matrices. Discret. Optim. 29 (2018)
Dmitry V. Gribanov, Dmitriy S. Malyshev, Panos M. Pardalos, Sergey I. Veselov
FPT-algorithms for some problems related to integer programming. CoRR (2017)
Dmitry V. Gribanov, Dmitriy S. Malyshev
The computational complexity of three graph problems for instances with bounded minors of constraint matrices. Discret. Appl. Math. 227 (2017)
Dmitry V. Gribanov
FPT-algorithms for The Shortest Lattice Vector and Integer Linear Programming Problems. CoRR (2017)
Dmitry V. Gribanov, Aleksandr Yu. Chirkov
The Width and Integer Optimization on Simplices With Bounded Minors of the Constraint Matrices. CoRR (2017)
Dmitry V. Gribanov, Sergey I. Veselov
On integer programming with bounded determinants. Optim. Lett. 10 (6) (2016)
Dmitry V. Gribanov, Aleksandr Yu. Chirkov
The width and integer optimization on simplices with bounded minors of the constraint matrices. Optim. Lett. 10 (6) (2016)
Dmitry V. Gribanov, Sergey I. Veselov
On integer programing with restricted determinants. CoRR (2015)