Vertex coloring of graphs with few obstructions VV Lozin, DS Malyshev
Discrete Applied Mathematics 216, 273-280, 2017
61 2017 The coloring problem for classes with two small obstructions DS Malyshev
Optimization Letters 8, 2261-2270, 2014
39 2014 Boundary properties of graphs for algorithmic graph problems N Korpelainen, VV Lozin, DS Malyshev, A Tiskin
Theoretical Computer Science 412 (29), 3545-3554, 2011
38 2011 Two cases of polynomial-time solvability for the coloring problem DS Malyshev
Journal of Combinatorial Optimization 31 (2), 833-845, 2016
37 2016 Continued sets of boundary classes of graphs for colorability problems DS Malyshev
Diskretnyi Analiz i Issledovanie Operatsii 16 (5), 41-51, 2009
27 2009 Two complexity results for the vertex coloring problem DS Malyshev, OO Lobanova
Discrete Applied Mathematics 219, 158-166, 2017
26 2017 A complexity dichotomy and a new boundary class for the dominating set problem DS Malyshev
Journal of Combinatorial Optimization 32 (1), 226-243, 2016
26 2016 Classes of graphs critical for the edge list-ranking problem DS Malyshev
Journal of Applied and Industrial Mathematics 8 (2), 245-255, 2014
26 2014 The maximum independent set problem in planar graphs VE Alekseev, V Lozin, D Malyshev, M Milanič
Mathematical Foundations of Computer Science 2008: 33rd International …, 2008
26 2008 The complexity of the 3-colorability problem in the absence of a pair of small forbidden induced subgraphs DS Malyshev
Discrete Mathematics 338 (11), 1860-1865, 2015
22 2015 Classes of subcubic planar graphs for which the independent set problem is polynomially solvable DS Malyshev
Journal of Applied and Industrial Mathematics 7 (4), 537, 2013
21 * 2013 Hopf algebra of ribbon graphs and renormalization D Malyshev
Journal of High Energy Physics 2002 (05), 013, 2002
21 2002 Planar graph classes with the independent set problem solvable in polynomial time VE Alekseev, DS Malyshev
Journal of Applied and Industrial Mathematics 3 (1), 1, 2009
17 2009 Critical hereditary graph classes: a survey DS Malyshev, PM Pardalos
Optimization Letters 10, 1593-1612, 2016
16 2016 On minimal hard classes of graphs DS Malyshev
Diskretnyi Analiz i Issledovanie Operatsii 16 (6), 43-51, 2009
16 2009 The complexity of the vertex 3-colorability problem for some hereditary classes defined by 5-vertex forbidden induced subgraphs DS Malyshev
Graphs and Combinatorics 33 (4), 1009-1022, 2017
15 2017 The complexity of the edge 3-colorability problem for graphs without two induced fragments each on at most six vertices DS Malyshev
Сибирские электронные математические известия 11 (0), 811-822, 2014
15 2014 The weighted coloring problem for two graph classes characterized by small forbidden induced structures DS Malyshev
Discrete Applied Mathematics 247, 423-432, 2018
14 2018 Topoligical classification of V Kruglov, D Malyshev, O Pochinka
arXiv preprint arXiv:1706.01695, 2017
14 2017 Polynomial-time approximation algorithms for the coloring problem in some cases DS Malyshev
Journal of Combinatorial Optimization 33, 809-813, 2017
14 2017 
Vadim LozinUniversity of WarwickПодтвержден адрес электронной почты в домене warwick.ac.uk
