( 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.

Vadim Alekseev

Sergej Alekseev

Sergej Alekseev

Denis Alekseev

Vladimir Milutinovi

 

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

The Maximum Independent Set Problem in Planar Graphs., , , и . MFCS, том 5162 из Lecture Notes in Computer Science, стр. 96-107. Springer, (2008)Polynomial algorithm for finding the largest independent sets in graphs without forks.. Discret. Appl. Math., 135 (1-3): 3-16 (2004)Graph Parameters, Implicit Representations and Factorial Properties., , , , и . IWOCA, том 13270 из Lecture Notes in Computer Science, стр. 60-72. Springer, (2022)On easy and hard hereditary classes of graphs with respect to the independent set problem.. Discret. Appl. Math., 132 (1-3): 17-26 (2003)Local transformations of graphs preserving independence number., и . Discret. Appl. Math., 135 (1-3): 17-30 (2004)König graphs for 3-paths and 3-cycles., и . Discret. Appl. Math., (2016)