( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Elegant Distance Constrained Labelings of Trees.

, , и . WG, том 3353 из Lecture Notes in Computer Science, стр. 58-67. Springer, (2004)

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.

Jan Kratochvíl

Alexander Kratochvil

Ulla Kratochvil

Pavel Kratochvil

Zora Kratochvil

 

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

Distance Constrained Labelings of Graphs of Bounded Treewidth., , и . ICALP, том 3580 из Lecture Notes in Computer Science, стр. 360-372. Springer, (2005)On the Complexity of Reconstructing H -free Graphs from Their Star Systems., , , , и . LATIN, том 4957 из Lecture Notes in Computer Science, стр. 194-205. 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)Computational Complexity of the Distance Constrained Labeling Problem for Trees (Extended Abstract)., , и . ICALP (1), том 5125 из Lecture Notes in Computer Science, стр. 294-305. Springer, (2008)Cluster Vertex Deletion: A Parameterization between Vertex Cover and Clique-Width., и . MFCS, том 7464 из Lecture Notes in Computer Science, стр. 348-359. Springer, (2012)Generalized Domination in Degenerate Graphs: A Complete Dichotomy of Computational Complexity., и . TAMC, том 4978 из Lecture Notes in Computer Science, стр. 182-191. Springer, (2008)Complexity of choosing subsets from color sets., , и . Discret. Math., 191 (1-3): 139-148 (1998)Preface., , и . Discret. Math., 310 (3): 371-372 (2010)Can they cross? and how?: (the hitchhiker's guide to the universe of geometric intersection graphs).. SCG, стр. 75-76. ACM, (2011)