( en | de | ru )

 

Disambiguation of "Kratochvíl, Jan"

Author of the publication

copydeleteadd this publication to your clipboard
On the Complexity of the Balanced Vertex Ordering Problem.

, , and . COCOON, volume 3595 of Lecture Notes in Computer Science, page 849-858. 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

Ulla Kratochvil

Pavel Kratochvil

Zora Kratochvil

 

Other publications of authors with the same name

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)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)Distance Constrained Labelings of Graphs of Bounded Treewidth., , and . ICALP, volume 3580 of Lecture Notes in Computer Science, page 360-372. Springer, (2005)Distance constrained labeling on graphs with bounded neighborhood diversity., , , , and . CoRR, (2015)Graphs maximal with respect to hom-properties., , and . Discuss. Math. Graph Theory, 17 (1): 77-88 (1997)Guest Editors' Foreword., and . J. Graph Algorithms Appl., 6 (1): 3-5 (2002)Extending Partial Representations of Interval Graphs., , , , and . Algorithmica, 78 (3): 945-967 (2017)Preface., and . Eur. J. Comb., (2018)Hamiltonian path and Hamiltonian cycle are solvable in polynomial time in graphs of bounded independence number., and . CoRR, (2023)