RUS  ENG
Full version
PEOPLE
Malyshev Dmitriy Sergeevich
Professor
Doctor of physico-mathematical sciences (2014)

Speciality: 01.01.09 (Discrete mathematics and mathematical cybernetics)
Birth date: 29.10.1985
Phone: +7 960 170 39 37
E-mail:
Website: https://www.hse.ru/org/persons/22927140/
Keywords: graph problem, computational complexity, efficient algorithm
UDC: 519.1
MSC: 05Cxx, 05Dxx

Subject:

graph theory, theory of computational complexity, combinatorics


Main publications:
  1. 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  mathnet
  2. 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  crossref  zmath
  3. Alekseev V. E., Malyshev D. S., “Kriterii granichnosti i ego primeneniya”, Diskretnyi analiz i issledovanie operatsii, 15:6 (2008), 3–10  mathnet
  4. Malyshev D. S., “Kontinualnye mnozhestva granichnykh klassov grafov dlya zadach o raskraske”, Diskretnyi analiz i issledovanie operatsii, 16:5 (2009), 41–51  mathnet
  5. Malyshev D. S., “O minimalnykh slozhnykh klassakh grafov”, Diskretnyi analiz i issledovanie operatsii, 16:6 (2009), 43–51  mathnet

Publications in Math-Net.Ru

Presentations in Math-Net.Ru

Personal pages:

Organisations:


© Steklov Math. Inst. of RAS, 2025