Jan Kratochvil

Cited by

	All	Since 2016
Citations	5809	1879
h-index	42	23
i10-index	123	56

400

200

100

300

199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202118 15 17 23 24 25 49 58 62 52 80 94 110 118 130 158 176 234 309 292 314 320 386 365 373 336 394 335 359 383 68

Co-authors

Petr GolovachUniversity of BergenVerified email at ii.uib.no
Zsolt TuzaMTA Rényi Institute, Budapest & University of Pannonia, VeszprémVerified email at dcs.uni-pannon.hu
Pavel KlavíkOrgpadVerified email at iuuk.mff.cuni.cz
Jan Arne TelleUniversity of Bergen, NorwayVerified email at ii.uib.no
Tomas VyskocilCharles University, Rutgers UniversityVerified email at cs.rutgers.edu
Fedor V. FominProfessor of Computer Science, University of BergenVerified email at uib.no
Ignaz RutterUniversity of PassauVerified email at uni-passau.de
Jaroslav NešetřilCharles UniversityVerified email at kam.mff.cuni.cz
Gerhard WoegingerProfessor of Computer Science, RWTH AachenVerified email at cs.rwth-aachen.de
Mathieu Liedloffmaître de conférences HdR, université d'OrléansVerified email at univ-orleans.fr
Magnús M. HalldórssonProfessor of Computer Science, Reykjavik UniversityVerified email at ru.is
Dieter Kratschprofesseur d'informatique, Universite de LorraineVerified email at univ-lorraine.fr
Yota OtachiNagoya UniversityVerified email at nagoya-u.jp
Mirka MillerUniversity of Newcastle, Australia & University of West Bohemia, Czech RepublicVerified email at newcastle.edu.au
Petr HlinenyMasaryk University, Brno, CZVerified email at fi.muni.cz
Patrizio AngeliniJohn Cabot UniversityVerified email at dia.uniroma3.it
Daniel KralMasaryk UniversityVerified email at fi.muni.cz
Steven ChaplickAssistant Professor, DKE, Maastricht UniversityVerified email at maastrichtuniversity.nl
Paweł RzążewskiWarsaw University of Technology, Faculty of Mathematics and Information ScienceVerified email at mini.pw.edu.pl
Maurizio PatrignaniProfessor of Computer Science, Roma Tre UniversityVerified email at dia.uniroma3.it

Jan Kratochvil

professor, Charles university in Prague, Univerzita Karlova

Verified email at kam.mff.cuni.cz

computer science discrete mathematics graph theory computational complexity


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
A special planar satisfiability problem and a consequence of its NP-completeness J Kratochvíl Discrete Applied Mathematics 52 (3), 233-252, 1994	221	1994
String graphs. II. Recognizing string graphs is NP-hard J Kratochvíl Journal of Combinatorial Theory, Series B 52 (1), 67-78, 1991	186	1991
Intersection graphs of segments J Kratochvíl, J Matousek Journal of Combinatorial Theory, Series B 62 (2), 289-315, 1994	176	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	169	2002
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	166	2001
Fixed-parameter complexity of λ-labelings J Fiala, T Kloks, J Kratochvıl Discrete Applied Mathematics 113 (1), 59-72, 2001	146	2001
Evropská úmluva o lidských právech. Komentář J Kmec, D Kosař, J Kratochvíl, M Bobek CH Beck, 2012	140	2012
Covering and coloring polygon-circle graphs A Kostochka, J Kratochvíl Discrete Mathematics 163 (1-3), 299-305, 1997	116	1997
On the injective chromatic number of graphs G Hahn, J Kratochvıl, J Širáň, D Sotteau Discrete mathematics 256 (1-2), 179-192, 2002	111	2002
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	107	2009
String graphs requiring exponential representations J Kratochvíl, J Matoušek Journal of Combinatorial Theory, Series B 53 (1), 1-4, 1991	107	1991
High rate fingerprinting codes and the fingerprinting capacity E Amiri, G Tardos Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete …, 2009	94	2009
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	93	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	93	2001
The complexity of induced minors and related problems MR Fellows, J Kratochvíl, M Middendorf, F Pfeiffer Algorithmica 13 (3), 266-282, 1995	88	1995
Algorithmic complexity of list colorings J Kratochvil, Z Tuza Discrete Applied Mathematics 50 (3), 297-302, 1994	88	1994
Precoloring extension with fixed color bound J Kratochvil Acta Math. Univ. Comen 62, 139-153, 1993	88	1993
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	86	1993
The capture time of a graph A Bonato, P Golovach, G Hahn, J Kratochvíl Discrete Mathematics 309 (18), 5588-5595, 2009	84	2009
Independent set and clique problems in intersection-defined classes of graphs J Kratochvíl, J Nešetřil Commentationes Mathematicae Universitatis Carolinae 31 (1), 85-93, 1990	80	1990

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Upload PDF

Follow this author

Cited by

Co-authors