Dmitry Gribanov
- Senior Research Fellow:HSE Campus in Nizhny Novgorod / Laboratory of Algorithms and Technologies for Networks Analysis (Nizhny Novgorod)
- Associate Professor:HSE Campus in Nizhny Novgorod / Faculty of Informatics, Mathematics, and Computer Science (HSE Nizhny Novgorod) / Department of Applied Mathematics and Informatics
- Programme Academic Supervisor:Data Mining
- Dmitry Gribanov has been at HSE University since 2014.
Education and Degrees
- 2016
Candidate of Sciences* (PhD)
- 2011
Master's
Lobachevsky State University of Nizhny Novgorod - 2009
Bachelor's
Lobachevsky State University of Nizhny Novgorod na
* Candidate of Sciences
According to the International Standard Classification of Education (ISCED) 2011, Candidate of Sciences belongs to ISCED level 8 - "doctoral or equivalent", together with PhD, DPhil, D.Lit, D.Sc, LL.D, Doctorate or similar. Candidate of Sciences allows its holders to reach the level of the Associate Professor.
According to the International Standard Classification of Education (ISCED) 2011, Candidate of Sciences belongs to ISCED level 8 - "doctoral or equivalent", together with PhD, DPhil, D.Lit, D.Sc, LL.D, Doctorate or similar. Candidate of Sciences allows its holders to reach the level of the Associate Professor.
Courses (2023/2024)
- Discrete Mathematics (Bachelor’s programme; Faculty of Informatics, Mathematics, and Computer Science (HSE Nizhny Novgorod); 1 year, 1-4 module)Rus
- Optimization: Advanced Level (Master’s programme; Faculty of Informatics, Mathematics, and Computer Science (HSE Nizhny Novgorod); 2 year, 1, 2 module)Rus
- Research Seminar (Bachelor’s programme; Faculty of Informatics, Mathematics, and Computer Science (HSE Nizhny Novgorod); 3 year, 1-3 module)Rus
- Past Courses
Courses (2022/2023)
- Discrete Mathematics (Bachelor’s programme; Faculty of Informatics, Mathematics, and Computer Science (HSE Nizhny Novgorod); 1 year, 1-4 module)Rus
- Optimization: Advanced Level (Master’s programme; Faculty of Informatics, Mathematics, and Computer Science (HSE Nizhny Novgorod); 2 year, 1, 2 module)Rus
- Research Seminar (Bachelor’s programme; Faculty of Informatics, Mathematics, and Computer Science (HSE Nizhny Novgorod); 3 year, 3 module)Rus
Courses (2021/2022)
- Discrete Mathematics (Bachelor’s programme; Faculty of Informatics, Mathematics, and Computer Science (HSE Nizhny Novgorod); 1 year, 1-4 module)Rus
- Optimization: Advanced Level (Master’s programme; Faculty of Informatics, Mathematics, and Computer Science (HSE Nizhny Novgorod); 2 year, 1, 2 module)Rus
- Research Seminar (Bachelor’s programme; Faculty of Informatics, Mathematics, and Computer Science (HSE Nizhny Novgorod); 3 year, 1-3 module)Rus
Courses (2020/2021)
- Discrete Mathematics (Bachelor’s programme; Faculty of Informatics, Mathematics, and Computer Science (HSE Nizhny Novgorod); 1 year, 1-4 module)Rus
- Optimization: Advanced Level (Master’s programme; Faculty of Informatics, Mathematics, and Computer Science (HSE Nizhny Novgorod); 2 year, 1, 2 module)Rus
- Research Seminar (Bachelor’s programme; Faculty of Informatics, Mathematics, and Computer Science (HSE Nizhny Novgorod); 4 year, 2 module)Rus
- Research Seminar (Bachelor’s programme; Faculty of Informatics, Mathematics, and Computer Science (HSE Nizhny Novgorod); 3 year, 1-3 module)Rus
- Research Seminar (Bachelor’s programme; Faculty of Informatics, Mathematics, and Computer Science (HSE Nizhny Novgorod); 1 year, 3, 4 module)Rus
Courses (2019/2020)
- Discrete Mathematics (Bachelor’s programme; Faculty of Informatics, Mathematics, and Computer Science (HSE Nizhny Novgorod); 1 year, 1-4 module)Rus
- Optimization: Advanced Level (Master’s programme; Faculty of Informatics, Mathematics, and Computer Science (HSE Nizhny Novgorod); 2 year, 1, 2 module)Rus
- Research Seminar (Bachelor’s programme; Faculty of Informatics, Mathematics, and Computer Science (HSE Nizhny Novgorod); 3 year, 1-3 module)Rus
Courses (2018/2019)
Research Seminar (Bachelor’s programme; Faculty of Informatics, Mathematics, and Computer Science (HSE Nizhny Novgorod); 3 year, 1-3 module)Rus
Conferences
- 2015XV Всероссийская конференция «Математическое программирование и приложения» (Екатеринбург). Presentation: Ширина некоторых классов политопов и задача поиска целой точки.
- XV Всероссийская конференция «Математическое программирование и приложения» (Екатеринбург). Presentation: Применение методов целочисленной оптимизации для решения задач компьютерной алгебры.
- The 5th International Conference on Network Analysis (Нижний Новгород). Presentation: Integer programming in simplices
- IX Международная конференция "Дискретные модели в теории управляющих систем" (Москва и пос. Красновидово). Presentation: Применение методов целочисленной оптимизации для решения задач компьютерной алгебры.
- IX Международная конференция "Дискретные модели в теории управляющих систем" (Москва и пос. Красновидово). Presentation: Ширина некоторых классов политопов и задача поиска целой точки.
- Международная научная конференция "Дискретная математика, алгебра и их приложения" (DIMA-2015) (Минск). Presentation: О задаче целочисленного программирования с ограниченными минорами.
- 20144th International Conference on Network Analysis (Нижний Новгород). Presentation: The Flatness Theorem Analogs for Polytopes With Bounden Minors of The Constraints Matrix
- 2013The 3rd International Conference on Network Analysis (Нижний Новгород). Presentation: Integer program with bounded minors
- IX Молодежная научная школа по дискретной математике и ее приложениям (Москва). Presentation: О сходимости ветвящихся цепных дробей с целыми элементами
Publications27
- Chapter Грибанов Д. В. О сходимости ветвящихся цепных дробей с целыми элементами. // В кн.: Материалы IX молодежной научной школы по дискретной математике и ее приложениям (Москва, 16-21 сентября 2013 г.) / Под общ. ред.: А. В. Чашкин. М. : Издательство ИПМ РАН, 2013. С. 34-39.
- Article 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. doi
- Article Gribanov D., Veselov S. On integer programming with bounded determinants // Optimization Letters. 2016. Vol. 10. No. 6. P. 1169-1177. doi
- Article 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. doi
- Article Веселов С. И., Чирков А. Ю., Грибанов Д. В. Агрегация уравнений в целочисленном программировании // Известия высших учебных заведений. Поволжский регион. Физико-математические науки. 2016. Т. 38. № 2. С. 5-12. doi
- Article Грибанов Д. В., Малышев Д. С. Сложность некоторых задач на графах с ограниченными минорами их матриц ограничений // Журнал Средневолжского математического общества. 2016. Т. 18. № 3. С. 19-31.
- Article 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. doi
- Chapter 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. doi P. 19-35. doi
- Article 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. doi
- Article Веселов С. И., Gribanov D., Zolotykh N., Чирков А. Ю. Minimizing a Symmetric Quasiconvex Function on a Two-Dimensional Lattice / Пер. с рус. // Journal of Applied and Industrial Mathematics. 2018. Vol. 12. No. 3. P. 587-594. doi
- Article 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. doi
- Article 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. doi
- Article Веселов С. И., Грибанов Д. В., Малышев Д. С. FPT-алгоритм вычисления ширины симплекса, заданного выпуклой оболочкой точек // Вестник Московского университета. Серия 15: Вычислительная математика и кибернетика. 2019. № 1. С. 4-14.
- Chapter 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 М. Ю. Хачай, Ю. А. Кочетов, P. M. Pardalos. Vol. 11548. Springer, 2019. P. 218-231. doi
- Article 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. doi
- Article Veselov S., Gribanov D., Zolotykh N., Chirkov A. A polynomial algorithm for minimizing discrete convic functions in fixed dimension // Discrete Applied Mathematics. 2020. Vol. 283. P. 11-19. doi
- Article Gribanov D., Malyshev D., Mokeev D. B. Efficient solvability of the weighted vertex coloring problem for some hereditary class of graphs with 5-vertex prohibitions / Пер. с рус. // Journal of Applied and Industrial Mathematics. 2020. Vol. 14. P. 480-489. doi
- Article Gribanov D., Malyshev D. Minimization of even conic functions on the two-dimensional integral lattice / Пер. с рус. // Journal of Applied and Industrial Mathematics. 2020. Vol. 14. No. 1. P. 56-72. doi
- Chapter Чирков А. Ю., Gribanov D., Zolotykh N. On the Proximity of the Optimal Values of the Multi-dimensional Knapsack Problem with and Without the Cardinality Constraint, in: Mathematical Optimization Theory and Operations Research, 19th International Conference, MOTOR 2020, Novosibirsk, Russia, July 6–10, 2020, (Т. 12095) / Ed. by A. Kononov, M. Khachay, P. Pardalos, V. A. Kalyagin. Cham : Springer, 2020. doi P. 16-22. doi
- Article Грибанов Д. В., Малышев Д. С. Минимизация четных конических функций на двумерной целочисленной решетке // Дискретный анализ и исследование операций. 2020. Т. 27. № 1. С. 17-42.
- Article Грибанов Д. В., Малышев Д. С., Мокеев Д. Б. Эффективная разрешимость задачи о взвешенной вершинной раскраске для некоторого наследственного класса графов с 5-вершинными запретами // Дискретный анализ и исследование операций. 2020. Т. 27. № 3. С. 71-87. doi
- Chapter Gribanov D. An FPTAS for the Δ-Modular Multidimensional Knapsack Problem, in: Mathematical Optimization Theory and Operations Research: 20th International Conference, MOTOR 2021, Irkutsk, Russia, July 5–10, 2021, Proceedings / Ed. by P. M. Pardalos, M. Y. Khachay, A. Kazakov. Cham : Springer, 2021. doi P. 79-95. doi
- Article Kuznetsov V. V., Moskalenko V. A., Gribanov D., Zolotykh N. Interpretable Feature Generation in ECG Using a Variational Autoencoder // Frontiers in Genetics. 2021. Article 638191. doi
- Article 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. doi
- Article Gribanov D., Zolotykh N. On lattice point counting in Δ-modular polyhedra // Optimization Letters. 2022. Vol. 16. No. 7. P. 1991-2018. doi
- Article Gribanov D., Шумилов И. А., Malyshev D., Pardalos P. M. On Delta-modular integer linear problems in the canonical form and equivalent problems // Journal of Global Optimization. 2023. P. 1-61. doi (in press)
- Article Gribanov D., Shumilov I., Malyshev D. Structured (min,+)‑convolution and its applications for the shortest/closest vector and nonlinear knapsack problems // Optimization Letters. 2023. P. 1-16. doi (in press)
Employment history
software developer (algorithms)
Association of Electronic Trading Platforms
Participated in the development of a search engine, fast access dictionaries and some other sofware solutions.
JSE
Itseez
Integration issues.
Assistant (Lecturer)
The Lobachevsky State University of Nizhny Novgorod
– nowcourses: algebra (seminars), linear programming (lectures, seminars), analysis and design of algorithms (lectures, seminars), mathematical logic, discrete optimization