graph theory, theory of computational complexity, combinatorics
Main publications:
Alekseev V. E., Malyshev D. S., “Klassy planarnykh grafov s polinomialno razreshimoi zadachei o nezavisimom mnozhestve”, Diskretn. analiz i issled. oper., 15:1 (2008), 3–10
Alekseev V.E., Lozin V.V., Malyshev D.S.,
Millanic M., “The Maximum Independent Set Problem in Planar Graphs”, Lecture Notes in Computer Science, 5162 (2008), 96–107
Alekseev V. E., Malyshev D. S., “Kriterii granichnosti i ego primeneniya”, Diskretnyi analiz i issledovanie operatsii, 15:6 (2008), 3–10
Malyshev D. S., “Kontinualnye mnozhestva granichnykh klassov grafov dlya zadach o raskraske”, Diskretnyi analiz i issledovanie operatsii, 16:5 (2009), 41–51
Malyshev D. S., “O minimalnykh slozhnykh klassakh grafov”, Diskretnyi analiz i issledovanie operatsii, 16:6 (2009), 43–51
