( en | de | ru )

 

Disambiguation of "Kratochvíl, Jan"

Author of the publication

copydeleteadd this publication to your clipboard
On the Hardness of Switching to a Small Number of Edges.

, , and . COCOON, volume 9797 of Lecture Notes in Computer Science, page 159-170. Springer, (2016)

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

One More Occurrence of Variables Makes Satisfiability Jump From Trivial to NP-Complete., , and . SIAM J. Comput., 22 (1): 203-210 (1993)Parameterized Complexity of Generalized Domination Problems., , and . WG, volume 5911 of Lecture Notes in Computer Science, page 133-142. (2009)On tractability of Cops and Robbers game., , and . IFIP TCS, volume 273 of IFIP, page 171-185. Springer, (2008)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 labeling on graphs with bounded neighborhood diversity., , , , and . CoRR, (2015)Compatible 2-factors., and . Discret. Appl. Math., 36 (3): 253-266 (1992)Preface., , , and . Electron. Notes Discret. Math., (2007)Noncrossing Subgraphs in Topological Layouts., , and . SIAM J. Discret. Math., 4 (2): 223-244 (1991)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)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)