RUS  ENG
Full version
PEOPLE

Malyshev Dmitriy Sergeevich

Publications in Math-Net.Ru

  1. Approximate search for the $k$th order distance in a system of unit square points

    Mat. Zametki, 116:4 (2024),  504–509
  2. On 5- and 6-Leaved Trees with the Largest Number of Matchings

    Mat. Zametki, 115:3 (2024),  371–384
  3. Effective calculation of all tolerances in the sparse maximin routing problem

    Uspekhi Mat. Nauk, 79:5(479) (2024),  185–186
  4. A complete complexity dichotomy of the edge-coloring problem for all sets of 8-edge forbidden subgraphs

    Diskretn. Anal. Issled. Oper., 30:4 (2023),  91–109
  5. On a countable family of boundary graph classes for the dominating set problem

    Diskretn. Anal. Issled. Oper., 30:1 (2023),  28–39
  6. On diameter $5$ trees with the maximum number of matchings

    Mat. Sb., 214:2 (2023),  143–154
  7. Some cases of polynomial solvability for the edge colorability problem generated by forbidden $8$-edge subcubic forests

    Diskretn. Anal. Issled. Oper., 29:2 (2022),  38–61
  8. Enumeration of Matchings in Complete $q$-ary Trees

    Mat. Zametki, 111:3 (2022),  393–402
  9. A New Proof of a Result Concerning a Complete Description of $ (n, n + 2) $-Graphs with Maximum Value of the Hosoya Index

    Mat. Zametki, 111:2 (2022),  258–276
  10. A faster algorithm for counting the integer points number in $\Delta$-modular polyhedra

    Sib. Èlektron. Mat. Izv., 19:2 (2022),  613–626
  11. Structural and algorithmic properties of maximal dissociating sets in graphs

    Trudy Inst. Mat. i Mekh. UrO RAN, 28:2 (2022),  114–142
  12. Efficient solvability of the weighted vertex coloring problem for some two hereditary graph classes

    Diskretn. Anal. Issled. Oper., 28:1 (2021),  15–47
  13. Complete complexity dichotomy for 7-edge forbidden subgraphs in the edge coloring problem

    Diskretn. Anal. Issled. Oper., 27:4 (2020),  104–130
  14. Efficient solvability of the weighted vertex coloring problem for some hereditary class of graphs with $5$-vertex prohibitions

    Diskretn. Anal. Issled. Oper., 27:3 (2020),  71–87
  15. On the König graphs for a 5-path and its spanning supergraphs

    Diskretn. Anal. Issled. Oper., 27:2 (2020),  90–116
  16. Minimization of even conic functions on the two-dimensional integral lattice

    Diskretn. Anal. Issled. Oper., 27:1 (2020),  17–42
  17. Trees with a given number of leaves and the maximal number of maximum independent sets

    Diskr. Mat., 32:2 (2020),  71–84
  18. On Topological Classification of Gradient-like Flows on an $n$-sphere in the Sense of Topological Conjugacy

    Regul. Chaotic Dyn., 25:6 (2020),  716–728
  19. A complete classification of the complexity of the vertex 3-colourability problem for quadruples of induced 5-vertex prohibitions

    Zhurnal SVMO, 22:1 (2020),  38–47
  20. König graphs with respect to the 4-path and its spanning supergraphs

    Diskretn. Anal. Issled. Oper., 26:1 (2019),  74–88
  21. A constructive existence theorem related to local transformations of graphs for the independent set problem

    Zhurnal SVMO, 21:2 (2019),  215–221
  22. On the complexity of the vertex $3$-coloring problem for the hereditary graph classes with forbidden subgraphs of small size

    Diskretn. Anal. Issled. Oper., 25:4 (2018),  112–130
  23. On trees of bounded degree with maximal number of greatest independent sets

    Diskretn. Anal. Issled. Oper., 25:2 (2018),  101–123
  24. Trees without twin-leaves with smallest number of maximal independent sets

    Diskr. Mat., 30:4 (2018),  115–133
  25. A multicolour graph as a complete topological invariant for $\Omega$-stable flows without periodic trajectories on surfaces

    Mat. Sb., 209:1 (2018),  100–126
  26. Polynomial-time solvability of the independent set problem in a certain class of subcubic planar graphs

    Diskretn. Anal. Issled. Oper., 24:3 (2017),  35–60
  27. Critical elements in combinatorially closed families of graph classes

    Diskretn. Anal. Issled. Oper., 24:1 (2017),  81–96
  28. A method of graph reduction and its applications

    Diskr. Mat., 29:3 (2017),  114–125
  29. On the number of maximal independent sets in complete $q$-ary trees

    Diskr. Mat., 28:4 (2016),  139–149
  30. Complexity classification of the edge coloring problem for a family of graph classes

    Diskr. Mat., 28:2 (2016),  44–50
  31. Efficient Algorithms for the Recognition of Topologically Conjugate Gradient-like Diffeomorhisms

    Regul. Chaotic Dyn., 21:2 (2016),  189–203
  32. On the topological classification of Morse-Smale diffeomorphisms on the sphere $S^n$ via colored graphs

    Zhurnal SVMO, 18:4 (2016),  30–33
  33. The complexity of some graph problems with bounded minors of their constraint matrices

    Zhurnal SVMO, 18:3 (2016),  19–31
  34. The graph criterion for the topological equivalence of $\Omega $ – stable flows without periodic trajectories on surfaces and efficient algorithm for its application

    Zhurnal SVMO, 18:2 (2016),  47–58
  35. The complexity of the edge 3-colorability problem for graphs without two induced fragments each on at most six vertices

    Sib. Èlektron. Mat. Izv., 11 (2014),  811–822
  36. Critical graph classes for the edge list-ranking problem

    Diskretn. Anal. Issled. Oper., 20:6 (2013),  59–76
  37. Сlasses of subcubic planar graphs for which the independent set problem is polynomial-time solvable

    Diskretn. Anal. Issled. Oper., 20:3 (2013),  26–44
  38. Extending operators for the independent set problem

    Diskretn. Anal. Issled. Oper., 20:2 (2013),  75–87
  39. The impact of the growth rate of the packing number of graphs on the computational complexity of the independent set problem

    Diskr. Mat., 25:2 (2013),  63–67
  40. Study of boundary graph classes for colorability problems

    Diskretn. Anal. Issled. Oper., 19:6 (2012),  37–48
  41. Polynomial solvability of the independent set problem for one class of graphs with small diameter

    Diskretn. Anal. Issled. Oper., 19:4 (2012),  66–72
  42. Effective solvability of the independent set problem in a class of graphs without induced path and cycle with five vertices and a big clique

    Diskretn. Anal. Issled. Oper., 19:3 (2012),  58–64
  43. The complexity analysis of the edge-ranking problem for hereditary graph classes with at most three prohibitions

    Diskretn. Anal. Issled. Oper., 19:1 (2012),  74–96
  44. Extremal sets of graphs in the problem of demarcation in the family of hereditary closed classes of graphs

    Diskr. Mat., 24:4 (2012),  91–103
  45. On intersection and symmetric difference of families of boundary classes in the problems on colouring and on the chromatic number

    Diskr. Mat., 24:2 (2012),  75–78
  46. Boundary classes for the list-ranking problems in subclasses of forests

    Diskretn. Anal. Issled. Oper., 18:6 (2011),  61–70
  47. Analysis of the number of the edges effect on the complexity of the independent set problem solvability

    Diskretn. Anal. Issled. Oper., 18:3 (2011),  84–88
  48. Minimal hard classes of graphs for the edge list-ranking problem

    Diskretn. Anal. Issled. Oper., 18:1 (2011),  70–76
  49. On minimal hard classes of graphs

    Diskretn. Anal. Issled. Oper., 16:6 (2009),  43–51
  50. Continued sets of boundary classes of graphs for colorability problems

    Diskretn. Anal. Issled. Oper., 16:5 (2009),  41–51
  51. Boundary classes of graphs for some recognition problems

    Diskretn. Anal. Issled. Oper., 16:2 (2009),  85–94
  52. On infinity of the set of boundary classes for the 3-edge-colorability problem

    Diskretn. Anal. Issled. Oper., 16:1 (2009),  37–43
  53. On the number of boundary classes in the 3-colouring problem

    Diskr. Mat., 21:4 (2009),  129–134
  54. A criterion for a class of graphs to be a boundary class and applications

    Diskretn. Anal. Issled. Oper., 15:6 (2008),  3–10
  55. Классы планарных графов с полиномиально разрешимой задачей о независимом множестве

    Diskretn. Anal. Issled. Oper., 15:1 (2008),  3–10

  56. To the 75th anniversary of Vyacheslav Zigmundovich Grines

    Zhurnal SVMO, 23:4 (2021),  472–476

© Steklov Math. Inst. of RAS, 2024