( en | de | ru )

 

Disambiguation of "Kratochvíl, Jan"

Author of the publication

copydeleteadd this publication to your clipboard
Distance Constrained Labelings of Graphs of Bounded Treewidth.

, , and . ICALP, volume 3580 of Lecture Notes in Computer Science, page 360-372. Springer, (2005)

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. You can also use the button next to the name to display some publications already assigned to the person.

Jan Kratochvíl

Alexander Kratochvil

Pavel Kratochvil

Zora Kratochvil

Ulla Kratochvil

 

Other publications of authors with the same name

Distance Constrained Labelings of Graphs of Bounded Treewidth., , and . ICALP, volume 3580 of Lecture Notes in Computer Science, page 360-372. Springer, (2005)Computational Complexity of the Distance Constrained Labeling Problem for Trees (Extended Abstract)., , and . ICALP (1), volume 5125 of Lecture Notes in Computer Science, page 294-305. Springer, (2008)On tractability of Cops and Robbers game., , and . IFIP TCS, volume 273 of IFIP, page 171-185. Springer, (2008)On the Complexity of Reconstructing H -free Graphs from Their Star Systems., , , , and . LATIN, volume 4957 of Lecture Notes in Computer Science, page 194-205. Springer, (2008)Planar Graph Coloring with Forbidden Subgraphs: Why Trees and Paths Are Dangerous., , , and . SWAT, volume 2368 of Lecture Notes in Computer Science, page 160-169. Springer, (2002)Noncrossing Subgraphs in Topological Layouts., , and . SIAM J. Discret. Math., 4 (2): 223-244 (1991)Preface., and . Eur. J. Comb., (2018)Preface., , and . Discret. Math., 310 (3): 371-372 (2010)Complexity of choosing subsets from color sets., , and . Discret. Math., 191 (1-3): 139-148 (1998)Can they cross? and how?: (the hitchhiker's guide to the universe of geometric intersection graphs).. SCG, page 75-76. ACM, (2011)