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
K. Kaymakov, D. S. Malyshev, “Approximate search for the $k$th order distance in a system of unit square points”, Mat. Zametki, 116:4 (2024), 504–509; Math. Notes, 116:4 (2024), 646–650
2.
N. A. Kuz'min, D. S. Malyshev, “On 5- and 6-Leaved Trees
with the Largest Number of Matchings”, Mat. Zametki, 115:3 (2024), 371–384; Math. Notes, 115:3 (2024), 341–351
3.
K. Kaymakov, D. S. Malyshev, “Effective calculation of all tolerances in the sparse maximin routing problem”, Uspekhi Mat. Nauk, 79:5(479) (2024), 185–186
2023
4.
D. S. Malyshev, O. I. Duginov, “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; J. Appl. Industr. Math., 17:4 (2023), 791–801
5.
G. S. Dakhno, D. S. Malyshev, “On a countable family of boundary graph classes for the dominating set problem”, Diskretn. Anal. Issled. Oper., 30:1 (2023), 28–39; J. Appl. Industr. Math., 17:1 (2023), 25–31
6.
N. A. Kuz'min, D. S. Malyshev, “On diameter $5$ trees with the maximum number of matchings”, Mat. Sb., 214:2 (2023), 143–154; Sb. Math., 214:2 (2023), 273–284
D. S. Malyshev, O. I. Duginov, “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
N. A. Kuz'min, D. S. Malyshev, “Enumeration of Matchings in Complete $q$-ary Trees”, Mat. Zametki, 111:3 (2022), 393–402; Math. Notes, 111:3 (2022), 398–406
9.
N. A. Kuz'min, D. S. Malyshev, “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; Math. Notes, 111:2 (2022), 258–272
D. Gribanov, D. Malyshev, “A faster algorithm for counting the integer points number in $\Delta$-modular polyhedra”, Sib. Èlektron. Mat. Izv., 19:2 (2022), 613–626
11.
O. I. Duginov, B. M. Kuskova, D. S. Malyshev, N. A. Shur, “Structural and algorithmic properties of maximal dissociating sets in graphs”, Trudy Inst. Mat. i Mekh. UrO RAN, 28:2 (2022), 114–142
2021
12.
O. O. Razvenskaya, D. S. Malyshev, “Efficient solvability of the weighted vertex coloring problem for some two hereditary graph classes”, Diskretn. Anal. Issled. Oper., 28:1 (2021), 15–47; J. Appl. Industr. Math., 15:1 (2021), 97–117
D. S. Malyshev, “Complete complexity dichotomy for 7-edge forbidden subgraphs in the edge coloring problem”, Diskretn. Anal. Issled. Oper., 27:4 (2020), 104–130; J. Appl. Industr. Math., 14:4 (2020), 706–721
D. V. Gribanov, D. S. Malyshev, D. B. Mokeev, “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; J. Appl. Industr. Math., 14:3 (2020), 480–489
D. B. Mokeev, D. S. Malyshev, “On the König graphs for a 5-path and its spanning supergraphs”, Diskretn. Anal. Issled. Oper., 27:2 (2020), 90–116; J. Appl. Industr. Math., 14:2 (2020), 367–382
D. V. Gribanov, D. S. Malyshev, “Minimization of even conic functions on the two-dimensional integral lattice”, Diskretn. Anal. Issled. Oper., 27:1 (2020), 17–42; J. Appl. Industr. Math., 14:1 (2020), 56–72
D. S. Taletskii, D. S. Malyshev, “Trees with a given number of leaves and the maximal number of maximum independent sets”, Diskr. Mat., 32:2 (2020), 71–84; Discrete Math. Appl., 31:2 (2021), 135–144
18.
Vladislav E. Kruglov, Dmitry S. Malyshev, Olga V. Pochinka, Danila D. Shubin, “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
D. S. Malyshev, “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
D. S. Malyshev, D. B. Mokeev, “König graphs with respect to the 4-path and its spanning supergraphs”, Diskretn. Anal. Issled. Oper., 26:1 (2019), 74–88; J. Appl. Industr. Math., 13:1 (2019), 85–92
D. V. Sirotkin, D. S. Malyshev, “A constructive existence theorem related to local transformations of graphs for the independent set problem”, Zhurnal SVMO, 21:2 (2019), 215–221
2018
22.
D. V. Sirotkin, D. S. Malyshev, “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; J. Appl. Industr. Math., 12:4 (2018), 759–769
D. S. Taletskii, D. S. Malyshev, “On trees of bounded degree with maximal number of greatest independent sets”, Diskretn. Anal. Issled. Oper., 25:2 (2018), 101–123; J. Appl. Industr. Math., 12:2 (2018), 369–381
D. S. Taletskii, D. S. Malyshev, “Trees without twin-leaves with smallest number of maximal independent sets”, Diskr. Mat., 30:4 (2018), 115–133; Discrete Math. Appl., 30:1 (2020), 53–67
V. E. Kruglov, D. S. Malyshev, O. V. Pochinka, “A multicolour graph as a complete topological invariant for $\Omega$-stable flows without periodic trajectories on surfaces”, Mat. Sb., 209:1 (2018), 100–126; Sb. Math., 209:1 (2018), 96–121
D. S. Malyshev, D. V. Sirotkin, “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; J. Appl. Industr. Math., 11:3 (2017), 400–414
D. S. Malyshev, “Critical elements in combinatorially closed families of graph classes”, Diskretn. Anal. Issled. Oper., 24:1 (2017), 81–96; J. Appl. Industr. Math., 11:1 (2017), 99–106
D. V. sirotkin, D. S. Malyshev, “A method of graph reduction and its applications”, Diskr. Mat., 29:3 (2017), 114–125; Discrete Math. Appl., 28:4 (2018), 249–258
D. S. Taletskii, D. S. Malyshev, “On the number of maximal independent sets in complete $q$-ary trees”, Diskr. Mat., 28:4 (2016), 139–149; Discrete Math. Appl., 27:5 (2017), 311–318
D. S. Malyshev, “Complexity classification of the edge coloring problem for a family of graph classes”, Diskr. Mat., 28:2 (2016), 44–50; Discrete Math. Appl., 27:2 (2017), 97–101
Vyacheslav Z. Grines, Dmitry S. Malyshev, Olga V. Pochinka, Svetlana Kh. Zinina, “Efficient Algorithms for the Recognition of Topologically Conjugate Gradient-like Diffeomorhisms”, Regul. Chaotic Dyn., 21:2 (2016), 189–203
E. Ya. Gurevich, D. S. Malyshev, “On the topological classification of Morse-Smale diffeomorphisms on the sphere $S^n$ via colored graphs”, Zhurnal SVMO, 18:4 (2016), 30–33
33.
D. V. Gribanov, D. S. Malyshev, “The complexity of some graph problems with bounded minors of their constraint matrices”, Zhurnal SVMO, 18:3 (2016), 19–31
34.
V. E. Kruglov, D. S. Malyshev, O. V. Pochinka, “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
D. S. Malyshev, “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
D. S. Malyshev, “Critical graph classes for the edge list-ranking problem”, Diskretn. Anal. Issled. Oper., 20:6 (2013), 59–76; J. Appl. Industr. Math., 8:2 (2014), 245–255
D. S. Malyshev, “Сlasses of subcubic planar graphs for which the independent set problem is polynomial-time solvable”, Diskretn. Anal. Issled. Oper., 20:3 (2013), 26–44; J. Appl. Industr. Math., 7:4 (2013), 537–548
D. S. Malyshev, “Extending operators for the independent set problem”, Diskretn. Anal. Issled. Oper., 20:2 (2013), 75–87; J. Appl. Industr. Math., 7:3 (2013), 412–419
39.
D. S. Malyshev, “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; Discrete Math. Appl., 23:3-4 (2013), 245–249
D. S. Malyshev, “Study of boundary graph classes for colorability problems”, Diskretn. Anal. Issled. Oper., 19:6 (2012), 37–48; J. Appl. Industr. Math., 7:2 (2013), 221–228
D. S. Malyshev, “Polynomial solvability of the independent set problem for one class of graphs with small diameter”, Diskretn. Anal. Issled. Oper., 19:4 (2012), 66–72
D. S. Malyshev, “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
D. S. Malyshev, “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
D. S. Malyshev, “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; Discrete Math. Appl., 22:5-6 (2012), 595–608
45.
D. S. Malyshev, “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; Discrete Math. Appl., 21:5-6 (2011), 645–649
D. S. Malyshev, V. E. Alekseev, “Boundary classes for the list-ranking problems in subclasses of forests”, Diskretn. Anal. Issled. Oper., 18:6 (2011), 61–70
D. S. Malyshev, “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; J. Appl. Industr. Math., 6:1 (2012), 97–99
D. S. Malyshev, “On infinity of the set of boundary classes for the 3-edge-colorability problem”, Diskretn. Anal. Issled. Oper., 16:1 (2009), 37–43; J. Appl. Industr. Math., 4:2 (2010), 213–217
D. S. Malyshev, “On the number of boundary classes in the 3-colouring problem”, Diskr. Mat., 21:4 (2009), 129–134; Discrete Math. Appl., 19:6 (2009), 625–630
V. E. Alekseev, D. S. Malyshev, “A criterion for a class of graphs to be a boundary class and applications”, Diskretn. Anal. Issled. Oper., 15:6 (2008), 3–10
V. E. Alekseev, D. S. Malyshev, “Классы планарных графов с полиномиально разрешимой задачей о независимом множестве”, Diskretn. Anal. Issled. Oper., 15:1 (2008), 3–10; J. Appl. Industr. Math., 3:1 (2009), 1–4
O. V. Anashkin, P. M. Akhmet'ev, D. V. Balandin, M. K. Barinova, I. V. Boykov, A. N. Bezdenezhnyh, V. N. Belykh, P. A. Vel'misov, I. Yu. Vlasenko, O. E. Galkin, S. Yu. Galkina, V. K. Gorbunov, S. D. Glyzin, S. V. Gonchenko, A. S. Gorodetski, E. V. Gubina, E. Ya. Gurevich, A. A. Davydov, L. S. Efremova, R. V. Zhalnin, A. Yu. Zhirov, E. V. Zhuzhoma, N. I. Zhukova, S. Kh. Zinina, Yu. S. Ilyashenko, N. V. Isaenkova, A. O. Kazakov, A. V. Klimenko, S. A. Komech, Yu. A. Kordyukov, V. E. Kruglov, E. V. Kruglov, E. B. Kuznetsov, S. K. Lando, Yu. A. Levchenko, L. M. Lerman, S. I. Maksimenko, M. I. Malkin, D. S. Malyshev, V. K. Mamaev, T. Ph. Mamedova, V. S. Medvedev, T. V. Medvedev, D. I. Mints, T. M. Mitryakova, A. D. Morozov, A. I. Morozov, E. V. Nozdrinova, E. N. Pelinovsky, Ya. B. Pesin, A. S. Pikovsky, S. Yu. Pilyugin, G. M. Polotovsky, O. V. Pochinka, I. D. Remizov, P. E. Ryabov, A. S. Skripchenko, A. V. Slunyaev, S. V. Sokolov, L. A. Sukharev, E. A. Talanova, V. A. Timorin, S. B. Tikhomirov, V. F. Tishkin, D. V. Treschev, D. V. Turaev, N. G. Chebochko, E. E. Chilina, P. A. Shamanaev, D. D. Shubin, E. I. Yakovlev, “To the 75th anniversary of Vyacheslav Zigmundovich Grines”, Zhurnal SVMO, 23:4 (2021), 472–476
Contact us: