Dmitry V. Gribanov

According to our database, Dmitry V. Gribanov authored at least 21 papers between 2015 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2024

On Δ-modular integer linear problems in the canonical form and equivalent problems.

Dmitry V. Gribanov, Ivan Shumilov, Dmitriy S. Malyshev, Panos M. Pardalos

J. Glob. Optim., March, 2024

Structured $(\min ,+)$-convolution and its applications for the shortest/closest vector and nonlinear knapsack problems.

Dmitry V. Gribanov, I. A. Shumilov, Dmitriy S. Malyshev

Optim. Lett., January, 2024

2023

Faster Integer Points Counting in Parametric Polyhedra.

Dmitry V. Gribanov, Dmitriy S. Malyshev, Panos M. Pardalos, Nikolai Yu. Zolotykh

CoRR, 2023

Enumeration and Unimodular Equivalence of Empty Delta-Modular Simplices.

Dmitriy V. Gribanov

CoRR, 2023

2022

On lattice point counting in $\varDelta $-modular polyhedra.

Dmitry V. Gribanov, Nikolai Yu. Zolotykh

Optim. Lett., 2022

On a Simple Connection Between Δ-modular ILP and LP, and a New Bound on the Number of Integer Vertices.

Dmitry V. Gribanov, Dmitriy S. Malyshev, I. A. Shumilov

CoRR, 2022

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

2021

Faster algorithm for counting of the integer points number in Δ-modular polyhedra.

Dmitry V. Gribanov, Dmitriy S. Malyshev

CoRR, 2021

An FPTAS for the Δ-Modular Multidimensional Knapsack Problem.

Dmitriy V. Gribanov

Proceedings of the Mathematical Optimization Theory and Operations Research, 2021

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

On lattice point counting in Δ-modular polyhedra.

Dmitry V. Gribanov, Nikolai Yu. Zolotykh

CoRR, 2020

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

Dmitry V. Gribanov

CoRR, 2020

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

Integer Conic Function Minimization Based on the Comparison Oracle.

Dmitriy V. Gribanov, Dmitriy S. Malyshev

Proceedings of the Mathematical Optimization Theory and Operations Research, 2019

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

The computational complexity of dominating set problems for instances with bounded minors of constraint matrices.

Dmitriy S. Malyshev, Dmitry V. Gribanov

Discret. Optim., 2018

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

FPT-algorithms for The Shortest Lattice Vector and Integer Linear Programming Problems.

Dmitry V. Gribanov

CoRR, 2017

2016

On integer programming with bounded determinants.

Dmitry V. Gribanov, Sergey I. Veselov

Optim. Lett., 2016

The width and integer optimization on simplices with bounded minors of the constraint matrices.

Dmitry V. Gribanov, Aleksandr Yu. Chirkov

Optim. Lett., 2016

2015

On integer programing with restricted determinants.

Dmitry V. Gribanov, Sergey I. Veselov

CoRR, 2015