( en | de | ru )

 

Disambiguation of "Malyshev, Dmitriy S."

Author of the publication

copydeleteadd this publication to your clipboard
The Maximum Independent Set Problem in Planar Graphs.

, , , and . MFCS, volume 5162 of Lecture Notes in Computer Science, page 96-107. Springer, (2008)

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

Integer Conic Function Minimization Based on the Comparison Oracle., and . MOTOR, volume 11548 of Lecture Notes in Computer Science, page 218-231. Springer, (2019)Two complexity results for the vertex coloring problem., and . Discret. Appl. Math., (2017)Independent domination versus weighted independent domination., , , and . Inf. Process. Lett., (2020)Structured (min, +)-Convolution And Its Applications For The Shortest Vector, Closest Vector, and Separable Nonlinear Knapsack Problems., , and . CoRR, (2022)New Results on Weighted Independent Domination., , , and . WG, volume 10520 of Lecture Notes in Computer Science, page 399-411. Springer, (2017)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)FPT-algorithms for some problems related to integer programming., , , and . J. Comb. Optim., 35 (4): 1128-1146 (2018)The Maximum Independent Set Problem in Planar Graphs., , , and . MFCS, volume 5162 of Lecture Notes in Computer Science, page 96-107. Springer, (2008)Combinatorics and Algorithms for Quasi-chain Graphs., , , and . IWOCA, volume 12757 of Lecture Notes in Computer Science, page 49-62. Springer, (2021)