Dmitriy Malyshev
- Professor: HSE Campus in Nizhny Novgorod / Faculty of Informatics, Mathematics, and Computer Science (HSE Nizhny Novgorod) / Department of Applied Mathematics and Informatics
- Leading Research Fellow: HSE Campus in Nizhny Novgorod / Laboratory of Algorithms and Technologies for Networks Analysis
- Dmitriy Malyshev has been at HSE University since 2010.
Education, Degrees and Academic Titles
Lobachevsky State University of Nizhny Novgorod
Thesis Title: Investigation of effective solvability borders for the family of hereditary classes of graphs
Lobachevsky State University of Nizhny Novgorod, Computer Mathematics and Cybernatics
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.
A post-doctoral degree called Doctor of Sciences is given to reflect second advanced research qualifications or higher doctorates in ISCED 2011.
Awards and Accomplishments
- Best Teacher — 2023–2024, 2018, 2016
- Winner of the HSE University Best Russian Research Paper Competition – 2024, 2023, 2022
- Young Faculty Support Programme (Group of Young Academic Professionals)
Category "Future Professoriate" (2013–2014)
Category "New Lecturers" (2011–2012)
Courses (2025/2026)
- Discrete Mathematics (Bachelor’s programme; Faculty of Informatics, Mathematics, and Computer Science (HSE Nizhny Novgorod) field of study Applied Mathematics and Information Science, Software Engineering, Business Informatics; 1 year, 1-4 module)Rus
- Discrete Models and Algorithms Complexity (Postgraduate course; Faculty of Informatics, Mathematics, and Computer Science (HSE Nizhny Novgorod); 1 year, 2 semester)Rus
- Discrete Models and Algorithms Complexity (Master’s programme; Faculty of Informatics, Mathematics, and Computer Science (HSE Nizhny Novgorod) field of study Applied Mathematics and Informatics; 1 year, 1, 2 module)Rus
- Discrete Models and Algorithms Complexity (Mago-Lego; Faculty of Informatics, Mathematics, and Computer Science (HSE Nizhny Novgorod); 1, 2 module)Rus
- Past Courses
Courses (2024/2025)
- Discrete Mathematics (Bachelor’s programme; Faculty of Informatics, Mathematics, and Computer Science (HSE Nizhny Novgorod) field of study Software Engineering; 1 year, 1-4 module)Rus
- Discrete Models and Algorithms Complexity (Master’s programme; Faculty of Informatics, Mathematics, and Computer Science (HSE Nizhny Novgorod) field of study Applied Mathematics and Informatics; 1 year, 1, 2 module)Rus
- Discrete Models and Algorithms Complexity (Mago-Lego; 1, 2 module)Rus
Courses (2023/2024)
- Discrete Mathematics (Bachelor’s programme; Faculty of Informatics, Mathematics, and Computer Science (HSE Nizhny Novgorod) field of study Applied Mathematics and Information Science; 1 year, 1-4 module)Rus
- Discrete Models and Algorithms Complexity (Master’s programme; Faculty of Informatics, Mathematics, and Computer Science (HSE Nizhny Novgorod) field of study Applied Mathematics and Informatics; 1 year, 1, 2 module)Rus
- Discrete Models and Algorithms Complexity (Mago-Lego; 1, 2 module)Rus
Courses (2022/2023)
- Discrete Mathematics (Bachelor’s programme; Faculty of Informatics, Mathematics, and Computer Science (HSE Nizhny Novgorod) field of study Applied Mathematics and Information Science; 1 year, 1-4 module)Rus
- Discrete Models and Algorithms Complexity (Master’s programme; Faculty of Informatics, Mathematics, and Computer Science (HSE Nizhny Novgorod) field of study Applied Mathematics and Informatics; 1 year, 1, 2 module)Rus
- Discrete Models and Algorithms Complexity (Mago-Lego; 1, 2 module)Rus
Courses (2021/2022)
- Discrete Mathematics (Bachelor’s programme; Faculty of Informatics, Mathematics, and Computer Science (HSE Nizhny Novgorod) field of study Applied Mathematics and Information Science; 1 year, 1-4 module)Rus
- Discrete Models and Algorithms Complexity (Master’s programme; Faculty of Informatics, Mathematics, and Computer Science (HSE Nizhny Novgorod) field of study Applied Mathematics and Informatics; 1 year, 1, 2 module)Rus
Editorial board membership
Conferences
- 2026
XV международный семинар «Дискретная математика и ее приложения» имени академика О.Б. Лупанова (Москва). Presentation: A complete complexity classification for the edge 3-colorability problem, forbidding a subgraph with at most 9 edges
XV международный семинар «Дискретная математика и ее приложения» имени академика О.Б. Лупанова (Москва). Presentation: Vector search algorithms: A survey and recent advances
Siberian International Conference on Graph Theory and Combinatorics (Новосибирск). Presentation: Vector search algorithms: A survey and recent advances
XVIII Summer School on Operations Research, Data, and Decision Making (Нижний Новгород). Presentation: Vector search algorithms: A survey of methods and some our recent advances
- 2025
Вероятностные методы в анализе и теория аппроксимации 2025 (Санкт-Петербург). Presentation: On recent advances in graph-based approximate vector search
- 2024
The XIV International Conference on Network Analysis (Нижний Новгород). Presentation: Efficient algorithm for finding k-th L_1- or L_infty distance in a system of plane points
Winter School-Conference “Approximations, graphs, networks and data mining” (Сочи). Presentation: Efficient sensitivity analysis for the sparse bottleneck path problem
Winter School-Conference “Approximations, graphs, networks and data mining” (Сочи). Presentation: Efficient algorithm for the minimum spanning tree problem on spaced points with the Manhattan norm
XX Международная конференция "Проблемы теоретической кибернетики" (Москва). Presentation: Efficient online sensitivity analysis in the bottleneck path problem
XX Международная конференция "Проблемы теоретической кибернетики" (Москва). Presentation: On the computational complexity of the vertex 3-colorability problem for some pairs of 6-vertex induced prohibitions
- 2023
Huawei Future Network Frontier Workshop (Москва). Presentation: Critical hereditary graph classes: What helps to understand better the computational complexity
- 2022
14 Международный научный семинар "Дискретная математика и ее приложения" им. акад. О.Б.Лупанова (Москва). Presentation: О связных субкубических графах с N вершинами и N +3 ребрами, имеющих наибольшее число паросочетаний
Международная научная конференция «Графы, игры и модели» (Майкоп). Presentation: Critical hereditary graph classes
- 2021
XIX Международная конференция "Проблемы теоретической кибернетики". Presentation: Полная классификация сложности задачи о реберной раскраске для классов субкубических графов, определяемых 8-реберными запретами
Конференция международных математических центров мирового уровня (г. Сочи). Presentation: Critical hereditary classes of graphs
The 5th Workshop on "Algebraic Graph Theory and its Applications" (Новосибирск). Presentation: Critical hereditary classes of graphs: A survey of recent (ant not only) developments
Higher School of Economics and Huawei company seminar (Нижний Новгород). Presentation: Structural, Quantitative, and Algorithmic Issues of Graph Theory: Some Advances of the LATNA Laboratory
- 2020
Meetup c технологическими лабораториями НИУ ВШЭ НН (Нижний Новгород). Presentation: Вычислительная сложность решения задач оптимизации на графах и не только:)
- 2019
XIII Международный семинар «Дискретная математика и ее приложения» (Москва). Presentation: Об алгоритмической сложности задач о раскраске в семействе наследственных классов графов, определяемых запретами небольшого размера
Huawei Wireless Workshop conference (Сочи). Presentation: Some recent results in algorithmic graph theory
XIII Международный семинар «Дискретная математика и ее приложения» (Москва). Presentation: Граничные классы: Что делает задачу на графах более простой?
- 2017
XVIII Международная конференция "ПРОБЛЕМЫ ТЕОРЕТИЧЕСКОЙ КИБЕРНЕТИКИ" (Пенза). Presentation: Эффективные алгоритмы различения некоторых типов оснащённых графов
- 2016
XII Международный научный семинар «Дискретная математика и ее приложения» имени академика О. Б. Лупанова (Москва). Presentation: Граничные классы графов в замкнутых семействах классов графов
The 6th International Conference on Network Analysis (Nizhny Novgorod). Presentation: Polynomial-time approximation algorithms for the coloring problem in some hereditary classes
Коллоквиум факультета компьютерных наук НИУ ВШЭ (Москва). Presentation: Критические наследственные классы графов
Семинар в ПОМИ РАН (Санкт-Петерсбург). Presentation: Исследование критических наследственных классов графов
- 2015
The 5th International Conference on Network Analysis (Нижний Новгород). Presentation: A new boundary class and a complete dichotomy for the dominating set problem
Семинар общества Попова (Нижний Новгород). Presentation: Критические классы графов
- 2014
XVII Международная конференция "Проблемы теоретической кибернетики" (Казань). Presentation: О сложности задач о раскраске для наследственных классов с запретами небольшого размера
- 2013
The 3rd International Conference on Network Analysis (Нижний Новгород). Presentation: «Critical» graph classes for the edge list ranking problem
XXXV Одесский семинар по дискретной математике (Одесса). Presentation: Исследование "критических" наследственных классов в анализе вычислительной сложности задач на графах
- 2012
The 2nd International Conference on Network Analysis (Нижний Новгород). Presentation: On expanding operators for the independent set problem
XI Международный семинар "Дискретная математика и ее приложения" (Москва). Presentation: Расширяющие операторы применительно к задаче о независимом множестве
- 2011
XVI Международная конференция "Проблемы теоретической кибернетики" (Нижний Новгород). Presentation: Конечно определенные минимальные сложные классы графов для задачи о реберном списковом ранжировании
- 2010
10 Международный семинар "Дискретная математика и ее приложения" (Москва). Presentation: О тупиковых по вычислительной сложности наследственных классах графов
Российская конференция "Дискретная оптимизация и исследование операций" (Новосибирск). Presentation: Совместное влияние количеств ребер и компонент связности в графах на сложность вычисления числа независимости
- 2009
7 международная научная конференция "Дискретные модели в теории управляющих систем" (Московская обл. ). Presentation: О недавних результатах в теории граничных классов графов
- 2008
XV Международная конференция "Проблемы теоретической кибернетики" (Казань). Presentation: О бесконечности множества граничных классов для задачи о 3-раскраске
From Neural Networks to Stock Markets: Advancing Computer Science Research at HSE University in Nizhny Novgorod
The International Laboratory of Algorithms and Technologies for Network Analysis (LATNA), established in 2011 at HSE University in Nizhny Novgorod, conducts a wide range of fundamental and applied research, including joint projects with large companies: Sberbank, Yandex, and other leaders of the IT industry. The methods developed by the university's researchers not only enrich science, but also make it possible to improve the work of transport companies and conduct medical and genetic research more successfully. HSE News Service discussed work of the laboratory with its head, Professor Valery Kalyagin.
HSE Researchers Receive Grants in Russian Science Foundation Competitions
The Russian Science Foundation announced the results of its 2019 competitions for support from the Presidential Research Project Programme. One competition was for grants in support of research initiatives by early career researchers, and another was in support of research conducted by research groups headed by early career scholars.