( en | de | ru )

 

Disambiguation of "Malyshev, Dmitriy S."

Author of the publication

copydeleteadd this publication to your clipboard
Two complexity results for the vertex coloring problem.

, and . Discret. Appl. Math., (2017)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Dmitriy Nikolayev

Dmitriy Izychev

Andrey Malyshev

Dmitriy Stukalin

Dmitriy Logashenko

 

Other publications of authors with the same name

Two complexity results for the vertex coloring problem., and . Discret. Appl. Math., (2017)Integer Conic Function Minimization Based on the Comparison Oracle., and . MOTOR, volume 11548 of Lecture Notes in Computer Science, page 218-231. Springer, (2019)Independent domination versus weighted independent domination., , , and . Inf. Process. Lett., (2020)New Results on Weighted Independent Domination., , , and . WG, volume 10520 of Lecture Notes in Computer Science, page 399-411. Springer, (2017)Structured (min, +)-Convolution And Its Applications For The Shortest Vector, Closest Vector, and Separable Nonlinear Knapsack Problems., , and . CoRR, (2022)The computational complexity of weighted vertex coloring for P5, K2, 3, K+2, 3-free graphs., , and . Optim. Lett., 15 (1): 137-152 (2021)Critical properties of bipartite permutation graphs., , and . J. Graph Theory, 105 (1): 34-60 (January 2024)Two cases of polynomial-time solvability for the coloring problem.. J. Comb. Optim., 31 (2): 833-845 (2016)The computational complexity of three graph problems for instances with bounded minors of constraint matrices., and . Discret. Appl. Math., (2017)Faster Exploration of Some Temporal Graphs., , , and . SAND, volume 221 of LIPIcs, page 5:1-5:10. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)