D. Cherkashin, S. Kiselev, “Independence Numbers of Johnson-Type Graphs”, Bulletin of the Brazilian Mathematical Society, New Series, 54:3 (2023), 30
D. Cherkashin, Y. Teplitskaya, “A Self-Similar Infinite Binary Tree Is a Solution to the Steiner Problem”, Fractal and Fractional, 7:5 (2023), 414
А. М. Райгородский, Д. Д. Черкашин, “Экстремальные задачи в раскрасках гиперграфов”, УМН, 75:1(451) (2020), 95–154; A. M. Raigorodskii, D. D. Cherkashin, “Extremal problems in hypergraph colourings”, Russian Math. Surveys, 75:1 (2020), 89–146
D. Cherkashin, F. Petrov,, “Regular behavior of the maximal hypergraph chromatic number”, SIAM Journal on Discrete Mathematics, 34:2 (2020), 1326–1333
D. Cherkashin, Y. Teplitskaya, “On the horseshoe conjecture for maximal distance minimizers”, ESAIM: Control, Optimisation and Calculus of Variations, 24:3 (2018), 1015–1041
D. D. Cherkashin, J. Kozik, “A note on random greedy coloring of uniform hypergraphs”, Random Structures & Algorithms, 47:3 (2015), 407–413
; A. M. Raigorodskii, D. D. Cherkashin, “Extremal problems in hypergraph colourings”, Russian Math. Surveys, 75:1 (2020), 
