( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
The Maximum Independent Set Problem in Planar Graphs.

, , , и . MFCS, том 5162 из Lecture Notes in Computer Science, стр. 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.

Dmitriy Nikolayev

Dmitriy Izychev

Andrey Malyshev

Dmitriy Stukalin

Dmitriy Logashenko

 

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

Two complexity results for the vertex coloring problem., и . Discret. Appl. Math., (2017)Integer Conic Function Minimization Based on the Comparison Oracle., и . MOTOR, том 11548 из Lecture Notes in Computer Science, стр. 218-231. Springer, (2019)Independent domination versus weighted independent domination., , , и . Inf. Process. Lett., (2020)New Results on Weighted Independent Domination., , , и . WG, том 10520 из Lecture Notes in Computer Science, стр. 399-411. Springer, (2017)Structured (min, +)-Convolution And Its Applications For The Shortest Vector, Closest Vector, and Separable Nonlinear Knapsack Problems., , и . CoRR, (2022)The computational complexity of weighted vertex coloring for P5, K2, 3, K+2, 3-free graphs., , и . Optim. Lett., 15 (1): 137-152 (2021)Critical properties of bipartite permutation graphs., , и . J. Graph Theory, 105 (1): 34-60 (января 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., и . Discret. Appl. Math., (2017)Faster Exploration of Some Temporal Graphs., , , и . SAND, том 221 из LIPIcs, стр. 5:1-5:10. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)