( en | de | ru )

 

Disambiguation of "Kratochvíl, Jan"

Author of the publication

copydeleteadd this publication to your clipboard
Simultaneous Orthogonal Planarity

, , , , , , , , , and . Proceedings of the 24th International Symposium on Graph Drawing and Network Visualization (GD'16), volume 9801 of Lecture Notes in Computer Science, page 532--545. Springer-Verlag, (September 2016)
DOI: 10.1007/978-3-319-50106-2_41

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

Noncrossing Subgraphs in Topological Layouts., , and . SIAM J. Discret. Math., 4 (2): 223-244 (1991)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)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)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)Generalized Domination in Degenerate Graphs: A Complete Dichotomy of Computational Complexity., and . TAMC, volume 4978 of Lecture Notes in Computer Science, page 182-191. Springer, (2008)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)Complexity of choosing subsets from color sets., , and . Discret. Math., 191 (1-3): 139-148 (1998)