( en | de | ru )

 

Disambiguation of "Kratochvíl, Jan"

Author of the publication

copydeleteadd this publication to your clipboard
Untangling a Planar Graph

, , , , , and . Discrete & Computational Geometry, 42 (4): 542--569 (2009)
DOI: 10.1007/s00454-008-9130-6

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

Ulla Kratochvil

Pavel Kratochvil

Zora Kratochvil

 

Other publications of authors with the same name

Cluster Vertex Deletion: A Parameterization between Vertex Cover and Clique-Width., and . MFCS, volume 7464 of Lecture Notes in Computer Science, page 348-359. Springer, (2012)Completion of the Mixed Unit Interval Graphs Hierarchy., and . TAMC, volume 9076 of Lecture Notes in Computer Science, page 284-296. Springer, (2015)On tractability of Cops and Robbers game., , and . IFIP TCS, volume 273 of IFIP, page 171-185. 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)Hamiltonian path and Hamiltonian cycle are solvable in polynomial time in graphs of bounded independence number., and . CoRR, (2023)Parameterized complexity of distance labeling and uniform channel assignment problems., , , , and . Discret. Appl. Math., (2018)Guest editors' foreword., , and . Discret. Appl. Math., 157 (12): 2575-2576 (2009)Algorithmic complexity of list colorings., and . Discret. Appl. Math., 50 (3): 297-302 (1994)Transversal Partitioning in Balanced Hypergraphs., , , and . Discret. Appl. Math., 79 (1-3): 75-89 (1997)Guest editors' foreword., , and . Discret. Appl. Math., (2014)