( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Three Approaches to Data Analysis - Test Theory, Rough Sets and Logical Analysis of Data

, , , , , , и . Intelligent Systems Reference Library Springer, (2013)

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 Vogelsang

Vadim Alekseev

Vadim Azhmyakov

Vadim Kopzon

Vadim Korotkov

 

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

The 3-Colorability Problem on Graphs with Maximum Degree Four., , и . SIAM J. Comput., 32 (5): 1128-1139 (2003)The Clique-Width of Bipartite Graphs in Monogenic Classes., и . Int. J. Found. Comput. Sci., 19 (2): 477-494 (2008)WQO is decidable for factorial languages., , и . Inf. Comput., (2017)Graph Parameters and Ramsey Theory.. CoRR, (2016)Well-quasi-ordering versus clique-width., , и . J. Comb. Theory, Ser. B, (2018)Maximum Independent Sets in Subcubic Graphs: New Results., , , и . CoRR, (2018)Well-Quasi-Ordering versus Clique-Width: New Results on Bigenic Classes., , и . IWOCA, том 9843 из Lecture Notes in Computer Science, стр. 253-265. Springer, (2016)On the Clique-Width of Graphs in Hereditary Classes., и . ISAAC, том 2518 из Lecture Notes in Computer Science, стр. 44-54. Springer, (2002)A Note on k-Colorability of P5-Free Graphs., , , , и . MFCS, том 5162 из Lecture Notes in Computer Science, стр. 387-394. Springer, (2008)Deciding WQO for Factorial Languages., , и . LATA, том 7810 из Lecture Notes in Computer Science, стр. 68-79. Springer, (2013)