Dmitry A. Shabanov
- Professor:Faculty of Computer Science / Big Data and Information Retrieval School
- Leading Research Fellow:Faculty of Computer Science / International Laboratory of Algebraic Topology and Its Applications
- Dmitry A. Shabanov has been at HSE University since 2015.
Education, Degrees and Academic Titles
- 2018Associate Professor
- 2013
Doctor of Sciences*
- 2008
Candidate of Sciences* (PhD)
- 2005
Degree in Mathematics
Lomonosov Moscow State University
* 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.
* Doctor of Sciences
A post-doctoral degree called Doctor of Sciences is given to reflect second advanced research qualifications or higher doctorates in ISCED 2011.
A post-doctoral degree called Doctor of Sciences is given to reflect second advanced research qualifications or higher doctorates in ISCED 2011.
Courses (2023/2024)
- Additional Chapters of Probability Theory - 3 (Optional course (faculty); Faculty of Computer Science; 2 module)Rus
- Probability Theory (advanced course) (Bachelor’s programme; Faculty of Computer Science; 2 year, 1, 2 module)Rus
- Past Courses
Courses (2022/2023)
- Additional Topics in Probability Theory (Optional course (faculty); Faculty of Computer Science; 4 module)Rus
- Probability Theory (advanced course) (Bachelor’s programme; Faculty of Computer Science; 2 year, 1, 2 module)Rus
- Random Graphs. Part 1 (Optional course (faculty); Faculty of Computer Science; 1, 2 module)Rus
Courses (2021/2022)
- Additional Topics in Probability Theory (Optional course (faculty); Faculty of Computer Science; 3, 4 module)Rus
- Additional Topics in Probability Theory 2 (Optional course (faculty); Faculty of Computer Science; 1, 2 module)Rus
- Probability Theory and Mathematical Statistics (Bachelor’s programme; Faculty of Computer Science; 2 year, 1-4 module)Rus
Courses (2020/2021)
- Additional Topics in Probability Theory (Optional course (faculty); Faculty of Computer Science; 3, 4 module)Rus
- Probability Theory and Mathematical Statistics (Bachelor’s programme; Faculty of Computer Science; 2 year, 1-4 module)Rus
Courses (2019/2020)
- Additional Topics in Probability Theory (Optional course (faculty); Faculty of Computer Science; 3, 4 module)Rus
- Additional Topics in Probability Theory 2 (Optional course (faculty); Faculty of Computer Science; 1, 2 module)Rus
- Probability Theory and Mathematical Statistics (Bachelor’s programme; Faculty of Computer Science; 2 year, 1-4 module)Rus
Courses (2018/2019)
- Additional Topics in Probability Theory (Optional course (faculty); Faculty of Computer Science; 3, 4 module)Rus
- Probability Theory and Mathematical Statistics (Bachelor’s programme; Faculty of Computer Science; 2 year, 1-4 module)Rus
- Topics in Mathematical Statistics (Optional course (faculty); Faculty of Computer Science; 3, 4 module)Rus
Courses (2017/2018)
- Additional Topics in Probability Theory (Optional course (faculty); Faculty of Computer Science; 3, 4 module)Rus
- Probability Theory and Mathematical Statistics (Bachelor’s programme; Faculty of Computer Science; 2 year, 1-4 module)Rus
- Topics in Mathematical Statistics (Optional course (faculty); Faculty of Computer Science; 3, 4 module)Rus
Publications36
- Article Alina Khuzieva, Matveeva T., Dmitry Shabanov. Estimating the strong r-colorability threshold in random hypergraphs // Moscow Journal of Combinatorics and Number Theory. 2023. Vol. 12. No. 1. P. 57-88. doi
- Article Захаров П. А., Шабанов Д. А. Дробные раскраски случайных гиперграфов // Успехи математических наук. 2023. Т. 78. № 6 (474). С. 183-184. doi
- Article Денисов И. О., Шабанов Д. А. О концентрации значений j-хроматических чисел случайных гиперграфов // Доклады Российской академии наук. Математика, информатика, процессы управления (ранее - Доклады Академии Наук. Математика). 2023. Т. 509. № 1. С. 28-35. doi
- Article Тяпкин Д. Н., Шабанов Д. А. О структуре множества полноцветных раскрасок случайного гиперграфа // Доклады Российской академии наук. Математика, информатика, процессы управления (ранее - Доклады Академии Наук. Математика). 2023. Т. 512. № 1. С. 52-57. doi
- Article Akhmejanova M., Balogh J., Dmitrii Shabanov. Chain method for panchromatic colorings of hypergraphs // Discrete Applied Mathematics. 2022. Vol. 321. P. 72-81. doi
- Article Semchankau A., Shabanov D. A., Shkredov I. Number of A+B\ne C solutions in abelian groups and application to counting independent sets in hypergraphs // European Journal of Combinatorics. 2022. Vol. 100. Article 103453. doi
- Article Демидович Ю. А., Шабанов Д. А. О двух предельных значениях хроматического числа случайного гиперграфа // Теория вероятностей и ее применения. 2022. Т. 67. № 2. С. 223-246. doi
- Article Матвеева Т. Г., Хузиева А. Э., Шабанов Д. А. О сильном хроматическом числе случайных гиперграфов // Доклады Российской академии наук. Математика, информатика, процессы управления (ранее - Доклады Академии Наук. Математика). 2022. Т. 502. С. 37-41. doi
- Article Семенов А. С., Шабанов Д. А. Оценки пороговых вероятностей для свойств раскрасок случайных гиперграфов // Проблемы передачи информации. 2022. Т. 58. № 1. С. 80-111. doi
- Chapter Shabanov D. A., Zakharov P. On the Maximum Cut in Sparse Random Hypergraphs, in: Extended Abstracts EuroComb 2021: European Conference on Combinatorics, Graph Theory and Applications Vol. 14. Cham : Birkhäuser, 2021. doi P. 817-822. doi
- Chapter Demidovich Y. A., Shabanov D. A. On the chromatic number of a random 3-uniform hypergraph, in: Recent Developments in Stochastic Methods and Applications: ICSM-5, Moscow, Russia, November 23–27, 2020, Selected Contributions Vol. 371. Springer, 2021. doi P. 190-203. doi
- Article Balobanov A. E., Shabanov D. A. On the strong chromatic number of a random 3-uniform hypergraph // Discrete Mathematics. 2021. Vol. 344. No. 3. Article 112231. doi
- Article Shabanov D. A., Kozik J., Duraj L. Random hypergraphs and property B // European Journal of Combinatorics. 2021. Vol. 91. P. 1-11. doi
- Article Денисов И. О., Шабанов Д. А. О концентрации значений чисел независимости случайных гиперграфов // Дискретная математика. 2021. Т. 33. № 4. С. 32-46. doi
- Article Захаров П. А., Шабанов Д. А. О максимальном разрезе в случайном гиперграфе // Доклады Российской академии наук. Математика, информатика, процессы управления (ранее - Доклады Академии Наук. Математика). 2021. Т. 501. С. 26-30. doi
- Article Shabanov D. A., Akhmejanova M. Coloring hypergraphs with bounded cardinalities of edge intersections // Discrete Mathematics. 2020. Vol. 343. No. 4. P. 1-11. doi
- Article Akhmejanova M., Shabanov D. A. Equitable colorings of hypergraphs with few edges // Discrete Applied Mathematics. 2020. Vol. 276. P. 2-12. doi
- Article Shabanov D. A. Estimating the r-colorability threshold for a random hypergraph // Discrete Applied Mathematics. 2020. Vol. 282. P. 168-183. doi
- Article Shabanov D. A., Semenov A. On the weak chromatic number of random hypergraphs // Discrete Applied Mathematics. 2020. Vol. 276. P. 134-154. doi
- Article Шабанов Д. А., Шайхеева Т. М. О предписанном хроматическом числе полных многодольных гиперграфов и кратных покрытиях независимыми множествами // Математические заметки. 2020. Т. 107. № 3. С. 454-465. doi
- Article Shabanov D. A., Krokhmal N. E., Kravtsov D. A. Panchromatic 3-colorings of random hypergraphs // European Journal of Combinatorics. 2019. Vol. 78. P. 28-43. doi
- Article Шабанов Д. А., Крохмаль Н. Е., Кравцов Д. А. Полноцветные раскраски случайных гиперграфов // Дискретная математика. 2019. Т. 31. № 2. С. 84-113.
- Article Shabanov D. A., Kupavskii A. B. Colourings of uniform hypergraphs with large girth and applications // Combinatorics Probability and Computing. 2018. Vol. 27. No. 2. P. 245-273. doi
- Article Kravtsov D. A., Krokhmal N. E., Shabanov D. A. On panchromatic colourings of a random hypergraph / Пер. с рус. // Russian Mathematical Surveys. 2018. Vol. 73. No. 4. P. 731-733. doi
- Article Шабанов Д. А., Семенов А. С. Независимые множества общего вида в случайных сильно разреженных гиперграфах // Проблемы передачи информации. 2018. Т. 54. № 1. С. 63-77. doi
- Article Шабанов Д. А., Балобанов А. Е. О числе независимых множеств в простых гиперграфах // Математические заметки. 2018. Т. 103. № 1. С. 38-48. doi
- Article Shabanov D. A. On the Concentration of the Chromatic Number of a Random Hypergraph / Пер. с рус. // Doklady Mathematics. 2017. Vol. 96. No. 1. P. 321-325. doi
- Article Шабанов Д. А. О концентрации хроматического числа случайного гиперграфа // Доклады Академии наук. 2017. Т. 475. № 1. С. 24-28. doi
- Article Shabanov D. A., Akolzin I. A. Colorings of hypergraphs with large number of colors // Discrete Mathematics. 2016. Vol. 339. No. 12. P. 3020-3031. doi
- Article Shabanov D. A., Kozik J. Improved algorithms for colorings of simple hypergraphs and applications // Journal of Combinatorial Theory. Series B. 2016. Vol. 116. P. 312-332. doi
- Article Шабанов Д. А., Семенов А. С. О числах независимости случайных разреженных гиперграфов // Дискретная математика. 2016. Т. 28. № 3. С. 126-144. doi
- Article Shabanov D. A. Around Erdos-Lovasz problem on colorings of non-uniform hypergraphs // Discrete Mathematics. 2015. Vol. 338. No. 11. P. 1976-1981. doi
- Article Shabanov D. A. Equitable two-colorings of uniform hypergraphs // European Journal of Combinatorics. 2015. Vol. 43. P. 185-203. doi
- Article Шабанов Д. А., Хузиева А. Э. Количественные оценки характеристик в гиперграфах с большим обхватом и большим хроматическим числом // Математические заметки. 2015. Т. 98. № 6. С. 948-951. doi
- Article Шабанов Д. А., Хузиева А. Э. Об однородных гиперграфах с большим обхватом и большим хроматическим числом // Дискретная математика. 2015. Т. 27. № 2. С. 112-133. doi
- Article Shabanov D. A. Coloring non-uniform hypergraphs without short cycles // Graphs and Combinatorics. 2014. Vol. 30. No. 5. P. 1249-1260. doi
Conferences
- 2019"Stochastic Days" in honor of Albert Shiryaev's 85th birthday (Москва). Presentation: Concentration of the chromatic number of a random graph
- European Conference on Combinatorics, Graph Theory and Applications (EuroComb 2019) (Братислава). Presentation: Two values of the chromatic number of a sparse random graph
- 2018The First Southwestern German Workshop on Graph Theory ( Карлсруэ). Presentation: Panchromatic colorings of sparse random hypergraphs
- The Second Russian-Hungarian Combinatorial Workshop (Будапешт). Presentation: On the strong chromatic number of a random 3-uniform hypergraph
- 2017Vilnius Conference in Combinatorics and Number Theory (Вильнюс). Presentation: The Erdos-Hajnal problem on colorings of hypergraphs, its on-line generalizations and related questions
- European Conference on Combinatorics, Graph Theory and Applications (Eurocomb 2017) (Вена). Presentation: Panchromatic 3-coloring of a random hypergraph
- 2016SIAM conference on Discrete Mathematics (DM16) (Атланта). Presentation: Colorings of hypergraphs with large number of colors
- 2015European Conference on Combinatorics, Graph Theory and Applications (Берген). Presentation: Extremal problems for colorings of simple hypergraphs and applications
Editorial board membership
2021: Member of the Editorial Board, Дискретная математика (Discrete Mathematics and Applications).
Ilya Segalovich Scholarship Winners Interviews. Part 1
The winners of the Ilya Segalovich Scholarship were announced recently. We talked to them about the award, their studies and their projects.