From post

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.

 

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

One More Occurrence of Variables Makes Satisfiability Jump From Trivial to NP-Complete., , и . SIAM J. Comput., 22 (1): 203-210 (1993)Distance constrained labeling on graphs with bounded neighborhood diversity., , , , и . CoRR, (2015)On the Complexity of Reconstructing H -free Graphs from Their Star Systems., , , , и . LATIN, том 4957 из Lecture Notes in Computer Science, стр. 194-205. Springer, (2008)Cluster Vertex Deletion: A Parameterization between Vertex Cover and Clique-Width., и . MFCS, том 7464 из Lecture Notes in Computer Science, стр. 348-359. Springer, (2012)Computational Complexity of the Distance Constrained Labeling Problem for Trees (Extended Abstract)., , и . ICALP (1), том 5125 из Lecture Notes in Computer Science, стр. 294-305. Springer, (2008)Distance Constrained Labelings of Graphs of Bounded Treewidth., , и . ICALP, том 3580 из Lecture Notes in Computer Science, стр. 360-372. Springer, (2005)Generalized Domination in Degenerate Graphs: A Complete Dichotomy of Computational Complexity., и . TAMC, том 4978 из Lecture Notes in Computer Science, стр. 182-191. Springer, (2008)Completion of the Mixed Unit Interval Graphs Hierarchy., и . TAMC, том 9076 из Lecture Notes in Computer Science, стр. 284-296. Springer, (2015)On tractability of Cops and Robbers game., , и . IFIP TCS, том 273 из IFIP, стр. 171-185. Springer, (2008)Planar Graph Coloring with Forbidden Subgraphs: Why Trees and Paths Are Dangerous., , , и . SWAT, том 2368 из Lecture Notes in Computer Science, стр. 160-169. Springer, (2002)