( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
The computational complexity of three graph problems for instances with bounded minors of constraint matrices.

, и . 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.

Dmitriy Nikolayev

Andrey Malyshev

Dmitriy Izychev

Dmitriy Stukalin

Dmitriy Logashenko

 

Другие публикации лиц с тем же именем

Structured $(,+)$-convolution and its applications for the shortest/closest vector and nonlinear knapsack problems., , и . Optim. Lett., 18 (1): 73-103 (января 2024)Structured (min, +)-Convolution And Its Applications For The Shortest Vector, Closest Vector, and Separable Nonlinear Knapsack Problems., , и . CoRR, (2022)FPT-algorithms for some problems related to integer programming., , , и . CoRR, (2017)The coloring problem for classes with two small obstructions.. CoRR, (2013)The coloring problem for P5, P̅5-free graphs and P5, Kp-e-free graphs is polynomial., и . CoRR, (2015)New Results on Weighted Independent Domination., , , и . WG, том 10520 из Lecture Notes in Computer Science, стр. 399-411. Springer, (2017)Two complexity results for the vertex coloring problem., и . Discret. Appl. Math., (2017)Independent domination versus weighted independent domination., , , и . Inf. Process. Lett., (2020)Integer Conic Function Minimization Based on the Comparison Oracle., и . MOTOR, том 11548 из Lecture Notes in Computer Science, стр. 218-231. Springer, (2019)The clique problem for graphs with a few eigenvalues of the same sign., и . Optim. Lett., 9 (5): 839-843 (2015)