Dmitry Sirotkin
- Dmitry Sirotkin has been at HSE University since 2020.
Education and Degrees
- 2020
Candidate of Sciences* (PhD)
- 2019
Master's
HSE University
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.
Young Faculty Support Program (Group of Young Academic Professionals)
Category "New Researchers" (2020-2021)
Courses (2021/2022)
- Discrete Mathematics (Bachelor’s programme; HSE Tikhonov Moscow Institute of Electronics and Mathematics (MIEM HSE); 2 year, 1, 2 module)Rus
- Discrete Mathematics (Bachelor’s programme; HSE Tikhonov Moscow Institute of Electronics and Mathematics (MIEM HSE); 1 year, 3, 4 module)Rus
- Geometry (Specialist’s programme; HSE Tikhonov Moscow Institute of Electronics and Mathematics (MIEM HSE); 1 year, 1, 2 module)Rus
- Linear Algebra and Analytical Geometry (Bachelor’s programme; HSE Tikhonov Moscow Institute of Electronics and Mathematics (MIEM HSE); 1 year, 1-4 module)Rus
- Past Courses
Courses (2020/2021)
- Algebra (Specialist’s programme; HSE Tikhonov Moscow Institute of Electronics and Mathematics (MIEM HSE); 1 year, 1-4 module)Rus
Algebra and Geometry (Bachelor’s programme; HSE Tikhonov Moscow Institute of Electronics and Mathematics (MIEM HSE); field of study "11.03.02. Инфокоммуникационные технологии и системы связи", field of study "10.03.01. Информационная безопасность"; 1 year, 3, 4 module)Rus
- Geometry (Specialist’s programme; HSE Tikhonov Moscow Institute of Electronics and Mathematics (MIEM HSE); 1 year, 1, 2 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
- Research Seminar (Bachelor’s programme; Faculty of Informatics, Mathematics, and Computer Science (HSE Nizhny Novgorod); 2 year, 1-3 module)Rus
Courses (2018/2019)
- Discrete Mathematics (Bachelor’s programme; Faculty of Informatics, Mathematics, and Computer Science (HSE Nizhny Novgorod); 1 year, 1-4 module)Rus
- Research Seminar (Bachelor’s programme; Faculty of Informatics, Mathematics, and Computer Science (HSE Nizhny Novgorod); 2 year, 1-3 module)Rus
Courses (2017/2018)
- Research Seminar (Bachelor’s programme; Faculty of Informatics, Mathematics, and Computer Science (HSE Nizhny Novgorod); 1 year, 4 module)Rus
- Research Seminar (Bachelor’s programme; Faculty of Informatics, Mathematics, and Computer Science (HSE Nizhny Novgorod); 2 year, 1-4 module)Rus
Publications7
- Article Shchur V., Spirin V., Sirotkin D., Burovski E., De Maio N., Corbett-Detig R. VGsim: Scalable viral genealogy simulator for global pandemic // PLoS Computational Biology. 2022. Vol. 18. No. 8. Article e1010409. doi
- Article Sirotkin D., Malyshev D. On 3-colouring of graphs with short faces and bounded maximum vertex degree // Lobachevskii Journal of Mathematics. 2021. Vol. 42. No. 4. P. 760-766. doi
- Article Сироткин Д. В., Малышев Д. С. Конструктивная теорема существования, ассоциированная с локальными преобразованиями графов для задачи о независимом множестве // Журнал Средневолжского математического общества. 2019. Т. 21. № 2. С. 215-221. doi
- Article Sirotkin D., Malyshev D. A method of graph reduction and its applications / Пер. с рус. // Discrete Mathematics and Applications. 2018. Vol. 28. No. 4. P. 249-258. doi
- Article Sirotkin D., Malyshev D. On the Complexity of the Vertex 3-Coloring Problem for the Hereditary Graph Classes With Forbidden Subgraphs of Small Size / Пер. с рус. // Journal of Applied and Industrial Mathematics. 2018. Vol. 12. No. 4. P. 759-769. doi
- Article Сироткин Д. В. О сложности построения 3-раскраски с короткими гранями // Журнал Средневолжского математического общества. 2018. Т. 20. № 2. С. 199-205. doi
- Article Malyshev D., Sirotkin D. Polynomial-Time Solvability of the Independent Set Problem in a Certain Class of Subcubic Planar Graphs / Пер. с рус. // Journal of Applied and Industrial Mathematics. 2017. Vol. 11. No. 3. P. 400-414. doi
Conferences
- 2020
The 10th International Conference on Network Analysis (Нижний Новгород). Presentation: NP-hardness of Problems, Connected with an Auto-battler Video-game Genre
- 2019
Конференция молодых учёных "Ломоносов - 2019" (Москва). Presentation: О сложности задачи о вершинной 3-раскраске для планарных графов с короткими гранями
- Conference on graphs, networks, and their applications 2019 (Москва). Presentation: Complexity of the Vertex 3-Coloring problem for the hereditary graph classes with quadruples of small forbidden subgraphs
- Семинар "Дискретная математика и ее приложения" (Москва). Presentation: Некоторые локальные преобразования графов для задачи о независимом множестве и связанная с ними конструктивная теорема существования
- 2018
10-я конференция "Дискретные модели в теории управляющих систем" (Москва). Presentation: Некоторые результаты о труднорешаемости задач о независимом множестве и 3-раскраске
- Конференция молодых учёных "Ломоносов - 2018" (Москва). Presentation: Теоремы существования и достаточности, связанные с локальными преобразованиями графов для задачи о k-раскраске
Workshop on graphs, networks and its applications (Долгопрудный). Presentation: A Way for Graph Reduction for the Independent Set Problem and Its Application
- The 8th International Conference on Network Analysis (Москва). Presentation: On local graph transformations for the vertex k-coloring problem
Employment history
2015 - 2017 - Higher School of Economics, laboratory TAPRADESS, laboratory assistant
2017 - 2019 - Higher School of Economics, laboratory LATNA, ressearch trainee
2019 - 2020 - Higher School of Economics, laboratory LATNA, junior researcher
2020 -н. в. - Higher School of Economics, laboratory MLSVG, researcher