( en | de | ru )

 

Disambiguation of "Malyshev, Dmitriy S."

Author of the publication

copydeleteadd this publication to your clipboard
On the complexity of quasiconvex integer minimization problem.

, , , , , and . CoRR, (2018)

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 Shevela

 

Other publications of authors with the same name

New Results on Weighted Independent Domination., , , and . WG, volume 10520 of Lecture Notes in Computer Science, page 399-411. Springer, (2017)Independent domination versus weighted independent domination., , , and . Inf. Process. Lett., (2020)Two complexity results for the vertex coloring problem., and . Discret. Appl. Math., (2017)Structured $(,+)$-convolution and its applications for the shortest/closest vector and nonlinear knapsack problems., , and . Optim. Lett., 18 (1): 73-103 (January 2024)Structured (min, +)-Convolution And Its Applications For The Shortest Vector, Closest Vector, and Separable Nonlinear Knapsack Problems., , and . CoRR, (2022)The coloring problem for P5, P̅5-free graphs and P5, Kp-e-free graphs is polynomial., and . CoRR, (2015)FPT-algorithms for some problems related to integer programming., , , and . CoRR, (2017)The coloring problem for classes with two small obstructions.. CoRR, (2013)Integer Conic Function Minimization Based on the Comparison Oracle., and . MOTOR, volume 11548 of Lecture Notes in Computer Science, page 218-231. Springer, (2019)The computational complexity of three graph problems for instances with bounded minors of constraint matrices., and . Discret. Appl. Math., (2017)