( en | de | ru )

 

Disambiguation of "Malyshev, Dmitriy S."

Author of the publication

copydeleteadd this publication to your clipboard
New Results on Weighted Independent Domination.

, , , and . WG, volume 10520 of Lecture Notes in Computer Science, page 399-411. Springer, (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)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)Independent domination versus weighted independent domination., , , and . Inf. Process. Lett., (2020)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)FPT-algorithms for some problems related to integer programming., , , and . J. Comb. Optim., 35 (4): 1128-1146 (2018)The reduction of computation times of upper and lower tolerances for selected combinatorial optimization problems., , , and . J. Glob. Optim., 68 (3): 601-622 (2017)Faster Integer Points Counting in Parametric Polyhedra., , , and . CoRR, (2023)