Jan Kratochvil
Jan Kratochvil
professor, Charles university in Prague, Univerzita Karlova
Verified email at kam.mff.cuni.cz
Cited by
Cited by
A special planar satisfiability problem and a consequence of its NP-completeness
J Kratochvíl
Discrete Applied Mathematics 52 (3), 233-252, 1994
String graphs. II. Recognizing string graphs is NP-hard
J Kratochvíl
Journal of Combinatorial Theory, Series B 52 (1), 67-78, 1991
Complexity of coloring graphs without forbidden subgraphs
D Král, J Kratochvíl, Z Tuza, G Woeginger
27th International Workshop on Graph-Theoretic Concepts in Computer Science …, 2001
Intersection graphs of segments
J Kratochvíl, J Matousek
Journal of Combinatorial Theory, Series B 62 (2), 289-315, 1994
On the b-chromatic number of graphs
J Kratochvíl, Z Tuza, M Voigt
International Workshop on Graph-Theoretic Concepts in Computer Science, 310-320, 2002
Evropská úmluva o lidských právech. Komentář
J Kmec, D Kosař, J Kratochvíl, M Bobek
CH Beck, 2012
Fixed-parameter complexity of λ-labelings
J Fiala, T Kloks, J Kratochvıl
Discrete Applied Mathematics 113 (1), 59-72, 2001
On the injective chromatic number of graphs
G Hahn, J Kratochvıl, J Širáň, D Sotteau
Discrete mathematics 256 (1-2), 179-192, 2002
Covering and coloring polygon-circle graphs
A Kostochka, J Kratochvíl
Discrete Mathematics 163 (1-3), 299-305, 1997
On the computation of the hull number of a graph
MC Dourado, JG Gimbel, J Kratochvíl, F Protti, JL Szwarcfiter
Discrete Mathematics 309 (18), 5668-5674, 2009
String graphs requiring exponential representations
J Kratochvíl, J Matoušek
Journal of Combinatorial Theory, Series B 53 (1), 1-4, 1991
Pursuing a fast robber on a graph
FV Fomin, PA Golovach, J Kratochvíl, N Nisse, K Suchan
Theoretical Computer Science 411 (7-9), 1167-1181, 2010
Representing graphs by disks and balls (a survey of recognition-complexity results)
P Hliněný, J Kratochvıl
Discrete Mathematics 229 (1-3), 101-124, 2001
High rate fingerprinting codes and the fingerprinting capacity
E Amiri, G Tardos
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete …, 2009
The capture time of a graph
A Bonato, P Golovach, G Hahn, J Kratochvíl
Discrete Mathematics 309 (18), 5588-5595, 2009
Algorithmic complexity of list colorings
J Kratochvil, Z Tuza
Discrete Applied Mathematics 50 (3), 297-302, 1994
One more occurrence of variables makes satisfiability jump from trivial to NP-complete
J Kratochvíl, P Savický, Z Tuza
SIAM Journal on Computing 22 (1), 203-210, 1993
Precoloring extension with fixed color bound
J Kratochvil
Acta Math. Univ. Comen 62, 139-153, 1993
The complexity of induced minors and related problems
MR Fellows, J Kratochvíl, M Middendorf, F Pfeiffer
Algorithmica 13 (3), 266-282, 1995
On the complexity of bicoloring clique hypergraphs of graphs
J Kratochvıl, Z Tuza
Journal of Algorithms 45 (1), 40-54, 2002
The system can't perform the operation now. Try again later.
Articles 1–20