Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDmitry V. Gribanov
Person information
- affiliation: Lobachevsky State University of Nizhny Novgorod, Russia
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j11]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): 591-651 (2024)- [j10]Dmitry V. Gribanov, Ivan A. Shumilov, Dmitriy S. Malyshev:
Structured $(\min ,+)$-convolution and its applications for the shortest/closest vector and nonlinear knapsack problems. Optim. Lett. 18(1): 73-103 (2024) - [j9]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): 32 (2024) - 2022
- [j8]Dmitry V. Gribanov, Nikolai Yu. Zolotykh:
On lattice point counting in $\varDelta $-modular polyhedra. Optim. Lett. 16(7): 1991-2018 (2022) - 2020
- [j7]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: 11-19 (2020) - 2019
- [j6]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): 761-788 (2019) - 2018
- [j5]Dmitriy S. Malyshev, Dmitry V. Gribanov:
The computational complexity of dominating set problems for instances with bounded minors of constraint matrices. Discret. Optim. 29: 103-110 (2018) - [j4]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): 1128-1146 (2018) - 2017
- [j3]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: 13-20 (2017) - 2016
- [j2]Dmitry V. Gribanov, Sergey I. Veselov:
On integer programming with bounded determinants. Optim. Lett. 10(6): 1169-1177 (2016) - [j1]Dmitry V. Gribanov, Aleksandr Yu. Chirkov:
The width and integer optimization on simplices with bounded minors of the constraint matrices. Optim. Lett. 10(6): 1179-1189 (2016)
Conference and Workshop Papers
- 2021
- [c2]Dmitriy V. Gribanov:
An FPTAS for the Δ-Modular Multidimensional Knapsack Problem. MOTOR 2021: 79-95 - 2019
- [c1]Dmitriy V. Gribanov, Dmitriy S. Malyshev:
Integer Conic Function Minimization Based on the Comparison Oracle. MOTOR 2019: 218-231
Informal and Other Publications
- 2023
- [i14]Dmitriy V. Gribanov:
Enumeration and Unimodular Equivalence of Empty Delta-Modular Simplices. CoRR abs/2303.01224 (2023) - [i13]Dmitry V. Gribanov, Dmitriy S. Malyshev, Panos M. Pardalos, Nikolai Yu. Zolotykh:
Faster Integer Points Counting in Parametric Polyhedra. CoRR abs/2310.13788 (2023) - 2022
- [i12]Dmitry V. Gribanov, Dmitry S. Malyshev:
Faster ILP Algorithms for Problems with Sparse Matrices and Their Applications to Multipacking and Multicover Problems in Graphs and Hypergraphs. CoRR abs/2201.08988 (2022) - [i11]Dmitry V. Gribanov, Dmitriy S. Malyshev, Ivan A. Shumilov:
On a Simple Connection Between Δ-modular ILP and LP, and a New Bound on the Number of Integer Vertices. CoRR abs/2203.03907 (2022) - 2021
- [i10]Dmitry V. Gribanov:
An FPTAS for the Δ-modular multidimensional knapsack problem. CoRR abs/2103.07257 (2021) - [i9]Dmitry V. Gribanov, Dmitriy S. Malyshev:
Faster algorithm for counting of the integer points number in Δ-modular polyhedra. CoRR abs/2110.01732 (2021) - 2020
- [i8]Dmitry V. Gribanov:
Properties of Δ-modular simplicies and "close" polyhedrons. O(Δ · polylog(Δ))-algorithm for knapsack, proximity and sparsity. CoRR abs/2002.01307 (2020) - [i7]Dmitry V. Gribanov, Nikolai Yu. Zolotykh:
On lattice point counting in Δ-modular polyhedra. CoRR abs/2010.05768 (2020) - [i6]Sergey I. Veselov, Dmitriy V. Gribanov, Nikolai Yu. Zolotykh, Aleksandr Yu. Chirkov:
A polynomial algorithm for minimizing discrete convic functions in fixed dimension. CoRR abs/2011.00598 (2020) - 2018
- [i5]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 abs/1807.02790 (2018) - 2017
- [i4]Dmitry V. Gribanov:
FPT-algorithms for The Shortest Lattice Vector and Integer Linear Programming Problems. CoRR abs/1710.00321 (2017) - [i3]Dmitry V. Gribanov, Aleksandr Yu. Chirkov:
The Width and Integer Optimization on Simplices With Bounded Minors of the Constraint Matrices. CoRR abs/1710.00328 (2017) - [i2]Dmitry V. Gribanov, Dmitriy S. Malyshev, Panos M. Pardalos, Sergey I. Veselov:
FPT-algorithms for some problems related to integer programming. CoRR abs/1712.06309 (2017) - 2015
- [i1]Dmitry V. Gribanov, Sergey I. Veselov:
On integer programing with restricted determinants. CoRR abs/1505.03132 (2015)
Coauthor Index
aka: Dmitry S. Malyshev
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-19 02:28 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
