Малышев Дмитрий Сергеевич
Малышев Дмитрий Сергеевич
НИУ ВШЭ, каф. прикладной математики и информатики; ННГУ им. Н.И.
Подтвержден адрес электронной почты в домене hse.ru
НазваниеПроцитированоГод
Vertex coloring of graphs with few obstructions
VV Lozin, DS Malyshev
Discrete Applied Mathematics 216, 273-280, 2017
402017
The coloring problem for classes with two small obstructions
DS Malyshev
Optimization Letters 8 (8), 2261-2270, 2014
292014
Boundary properties of graphs for algorithmic graph problems
N Korpelainen, VV Lozin, DS Malyshev, A Tiskin
Theoretical Computer Science 412 (29), 3545-3554, 2011
292011
On minimal hard classes of graphs
D Malyshev
Diskretnyi Analiz i Issledovanie Operatsii 16 (6), 43–51, 2009
26*2009
Continued sets of boundary classes of graphs for colorability problems
DS Malyshev
Diskretnyi Analiz i Issledovanie Operatsii 16 (5), 41-51, 2009
242009
Two cases of polynomial-time solvability for the coloring problem
DS Malyshev
Journal of Combinatorial Optimization 31 (2), 833-845, 2016
232016
Classes of graphs critical for the edge list-ranking problem
DS Malyshev
Journal of Applied and Industrial Mathematics 8 (2), 245-255, 2014
192014
A complexity dichotomy and a new boundary class for the dominating set problem
DS Malyshev
Journal of Combinatorial Optimization 32 (1), 226-243, 2016
162016
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
152015
О минимальных сложных классах графов
ДС Малышев
Дискретный анализ и исследование операций 16 (6), 43-51, 2009
15*2009
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
152009
The maximum independent set problem in planar graphs
VE Alekseev, V Lozin, D Malyshev, M Milanič
International Symposium on Mathematical Foundations of Computer Science, 96-107, 2008
152008
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
132013
Critical hereditary graph classes: a survey
DS Malyshev, PM Pardalos
Optimization Letters 10 (8), 1593-1612, 2016
112016
Two complexity results for the vertex coloring problem
DS Malyshev, OO Lobanova
Discrete Applied Mathematics 219, 158-166, 2017
102017
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
102014
The impact of the growth rate of the packing number of graphs on the computational complexity of the independent set problem
DS Malyshev
Discrete Mathematics and Applications 23 (3-4), 245-249, 2013
102013
Критерий граничности и его применения
ВЕ Алексеев, ДС Малышев
Дискретный анализ и исследование операций 15 (6), 3-10, 2008
102008
Efficient algorithms for the recognition of topologically conjugate gradient-like diffeomorhisms
ZS Grines V., Malyshev D., Pochinka O.
Regular and Chaotic Dynamics 21, 189-203, 2016
92016
A study of the boundary graph classes for colorability problems
DS Malyshev
Journal of Applied and Industrial Mathematics 7 (2), 221-228, 2013
72013
В данный момент система не может выполнить эту операцию. Повторите попытку позднее.
Статьи 1–20