Born in Gorky in 1988, I completed my Master's degree at Lobachevsky State University of Nizhny Novgorod (NNSU) in 2011 and earned my Candidate of Sciences (PhD) in Mathematics in 2015 at the St. Petersburg Department of the Steklov Mathematical Institute.

I have extensive teaching experience (over 10 years) across various institutions: Lobachevsky State University of Nizhny Novgorod, the Higher School of Economics, and the School of Data Analysis at Yandex. Courses I have taught include: Algebra, Discrete Mathematics, Linear Programming, Discrete Optimization, Algorithms and Data Structures, Information Theory, and Computational Complexity Theory.

Selected publications

1. Gribanov D.,
   The Flatness Theorem for Some Class of Polytopes and Searching an Integer Point, Springer Proceedings in Mathematics & Statistics. 2014. No. 104. P. 37-43
2. Gribanov D., Veselov S.,
   On integer programming with bounded determinants, Optimization Letters. 2016. Vol. 10. No. 6. P. 1169-1177
3. Gribanov D., Chirkov A.,
   The width and integer optimization on simplices with bounded minors of the constraint matrices, Optimization Letters. 2016. Vol. 10. No. 6. P. 1179-1189
4. Gribanov D., Malyshev D.,
   The computational complexity of three graph problems for instances with bounded minors of constraint matrices, Discrete Applied Mathematics. 2017. Vol. 227. P. 13-20
5. Gribanov D.,
   FPT Algorithms for the Shortest Lattice Vector and Integer Linear Programming Problems, in: Computational Aspects and Applications in Large-Scale Networks, Springer Proceedings in Mathematics & Statistics. Vol. 247. Springer, 2018. P. 19-35
6. D. V. Gribanov, D.S. Malyshev, P. M. Pardalos, Veselov S. I.,
   FPT-algorithms for some problems related to integer programming, Journal of Combinatorial Optimization. 2018. Vol. 35. No. 4. P. 1128-1146
7. Veselov S. I., Gribanov D., Zolotykh N., Chirkov A. Yu.,
   Minimizing a Symmetric Quasiconvex Function on a Two-Dimensional Lattice, Translation from russian. // Journal of Applied and Industrial Mathematics. 2018. Vol. 12. No. 3. P. 587-594
8. Malyshev D., Gribanov D.,
   The computational complexity of dominating set problems for instances with bounded minors of constraint matrices, Discrete Optimization. 2018. Vol. 29. P. 103-110
9. Veselov S. I., Gribanov D., Zolotykh N., Chirkov A. Yu.,
   A polynomial algorithm for minimizing discrete convic functions in fixed dimension, Discrete Applied Mathematics. 2019
10. Veselov S. I., Gribanov D., Malyshev D.,
    FPT-algorithm for computing the width of a simplex given by a convex hull, Moscow University Computational Mathematics and Cybernetics. 2019. Vol. 43. No. 1. P. 1-11
11. Gribanov D., Malyshev D.,
    Integer Conic Function Minimization Based on the Comparison Oracle, in: Mathematical Optimization Theory and Operations Research, 18th International Conference, MOTOR 2019 Ekaterinburg, Russia, July 8–12, 2019 / Ed. by M. Yu. Hachay, Ju. A. Kochetov, P. M. Pardalos. Vol. 11548. Springer, 2019. P. 218-231. Lecture Notes in Computer Science
12. Chirkov A. Y., Gribanov D., Malyshev D., Pardalos P. M., Veselov S. I., Zolotykh N.,
    On the complexity of quasiconvex integer minimization problem, Journal of Global Optimization. 2019. Vol. 73. No. 4. P. 761-788.
13. Gribanov, D.V., Malyshev, D.S. & Mokeev, D.B.,
    Efficient Solvability of the Weighted Vertex Coloring Problem for Some Hereditary Class of Graphs with 5 -Vertex Prohibitions, J. Appl. Ind. Math. 14, 480–489 (2020)
14. Chirkov, A.Y., Gribanov, D.V., Zolotykh, N.Y.,
    On the Proximity of the Optimal Values of the Multi-dimensional Knapsack Problem with and Without the Cardinality Constraint, (2020) Communications in Computer and Information Science, 1275 CCIS, pp. 16-22
15. Gribanov D., Malyshev D.,
    Minimization of Even Conic Functions on the Two-Dimensional Integral Lattice, Journal of Applied and Industrial Mathematics. 2020. 14, 56-72
16. Gribanov, D.V.,
    An FPTAS for the Δ-Modular Multidimensional Knapsack Problem, In: Pardalos, P., Khachay, M., Kazakov, A. (eds) Mathematical Optimization Theory and Operations Research. MOTOR 2021. Lecture Notes in Computer Science (2021), vol 12755. Springer, Cham
17. Gribanov, D.V., Zolotykh, N.Y.,
    On lattice point counting in Δ-modular polyhedra, Optim Lett (2021)
18. Kuznetsov V. V., Moskalenko V. A., Gribanov D. V., Zolotykh Nikolai Yu.,
    Interpretable Feature Generation in ECG Using a Variational Autoencoder, Frontiers in Genetics (2021). Vol. 12
19. Gribanov, D., Malyshev D.,
    A faster algorithm for counting the integer points number in ∆-modular polyhedra, Siberian Electronic Mathematical Reports. 2022. Vol. 19. No. 2. P. 613-626
20. Gribanov, D., Shumilov, I., Malyshev, D., Pardalos, P.,
    On ∆-modular integer linear problems in the canonical form and equivalent problems, Journal of Global Optimization. 2022
21. Gribanov, D., Shumilov, I., Malyshev, D.,
    Structured (min, +)-Convolution And Its Applications For The Shortest Vector, Closest Vector, and Separable Nonlinear Knapsack Problems, Optim Lett (2023)
22. Gribanov, D.,
    Enumeration and Unimodular Equivalence of Empty Delta-Modular Simplices, In: Khachay, M., Kochetov, Y., Eremeev, A., Khamisov, O., Mazalov, V., Pardalos, P. (eds) Mathematical Optimization Theory and Operations Research. MOTOR 2023. Lecture Notes in Computer Science, vol 13930. Springer, Cham
23. Gribanov, D., Shumilov, I., Malyshev, D. et al.,
    Faster algorithms for sparse ILP and hypergraph multi-packing/multi-cover problems, J Glob Optim 89, 1033–1067 (2024)
24. Gribanov, D., Malyshev, D. & Shumilov, I.,
    On a Simple Connection Between Delta-Modular ILP and LP, and a New Bound on the Number of Integer Vertices, Oper. Res. Forum 5, 32 (2024)
25. Gribanov, D.V., Malyshev, D.S., Pardalos, P.M. et al.,
    A new and faster representation for counting integer points in parametric polyhedra, Comput Optim Appl (2024)