Jan Kratochvil

Cited by

	All	Since 2018
Citations	6399	1968
h-index	45	23
i10-index	122	58

380

190

285

19941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202324 22 32 61 64 68 58 80 109 107 121 136 157 175 237 284 254 318 305 348 339 318 289 351 304 320 298 335 374 336

Public access

View all

17 articles

2 articles

available

not available

Based on funding mandates

Co-authors

Zsolt TuzaMTA Rényi Institute, Budapest & University of Pannonia, VeszprémVerified email at dcs.uni-pannon.hu
Petr GolovachUniversity of BergenVerified email at ii.uib.no
Jan Arne TelleUniversity of Bergen, NorwayVerified email at ii.uib.no
Pavel KlavíkOrgPadVerified email at iuuk.mff.cuni.cz
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
Petr HlinenyMasaryk University, Brno, CZVerified email at fi.muni.cz
Mathieu LiedloffProfesseur des Universités, université d'OrléansVerified email at univ-orleans.fr
Yota OtachiNagoya UniversityVerified email at nagoya-u.jp
Gerhard WoegingerProfessor of Computer Science, RWTH AachenVerified email at cs.rwth-aachen.de
Daniel KralMasaryk UniversityVerified email at fi.muni.cz
Mirka MillerUniversity of Newcastle, Australia & University of West Bohemia, Czech RepublicVerified email at newcastle.edu.au
Dieter Kratschprofesseur d'informatique, Universite de LorraineVerified email at univ-lorraine.fr
Magnús M. HalldórssonProfessor of Computer Science, Reykjavik UniversityVerified email at ru.is
Paweł RzążewskiWarsaw University of Technology, Faculty of Mathematics and Information ScienceVerified email at mini.pw.edu.pl
Patrizio AngeliniJohn Cabot UniversityVerified email at dia.uniroma3.it
Steven ChaplickAssistant Professor, Maastricht UniversityVerified email at maastrichtuniversity.nl
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	254	1994
Intersection graphs of segments J Kratochvíl, J Matousek Journal of Combinatorial Theory, Series B 62 (2), 289-315, 1994	227	1994
String graphs. II. Recognizing string graphs is NP-hard J Kratochvíl Journal of Combinatorial Theory, Series B 52 (1), 67-78, 1991	214	1991
Complexity of coloring graphs without forbidden induced subgraphs D Král’, J Kratochvíl, Z Tuza, GJ Woeginger Graph-Theoretic Concepts in Computer Science: 27th InternationalWorkshop, WG …, 2001	201	2001
On the b-chromatic number of graphs J Kratochvíl, Z Tuza, M Voigt Graph-Theoretic Concepts in Computer Science: 28th International Workshop …, 2002	192	2002
On the injective chromatic number of graphs G Hahn, J Kratochvıl, J Širáň, D Sotteau Discrete mathematics 256 (1-2), 179-192, 2002	158	2002
Fixed-parameter complexity of λ-labelings J Fiala, T Kloks, J Kratochvıl Discrete Applied Mathematics 113 (1), 59-72, 2001	153	2001
Covering and coloring polygon-circle graphs A Kostochka, J Kratochvíl Discrete Mathematics 163 (1-3), 299-305, 1997	136	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	129	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	122	2010
String graphs requiring exponential representations J Kratochvíl, J Matoušek Journal of Combinatorial Theory, Series B 53 (1), 1-4, 1991	120	1991
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	107	2001
The capture time of a graph A Bonato, P Golovach, G Hahn, J Kratochvíl Discrete Mathematics 309 (18), 5588-5595, 2009	103	2009
Independent sets with domination constraints MM Halldórsson, J Kratochvıl, JA Telle Discrete Applied Mathematics 99 (1-3), 39-54, 2000	98	2000
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	98	1993
Algorithmic complexity of list colorings J Kratochvil, Z Tuza Discrete Applied Mathematics 50 (3), 297-302, 1994	97	1994
The complexity of induced minors and related problems MR Fellows, J Kratochvíl, M Middendorf, F Pfeiffer Algorithmica 13 (3), 266-282, 1995	96	1995
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	95	1990
Perfect codes over graphs J Kratochvíl Journal of Combinatorial Theory, Series B 40 (2), 224-228, 1986	95	1986
On the complexity of bicoloring clique hypergraphs of graphs J Kratochvıl, Z Tuza Journal of Algorithms 45 (1), 40-54, 2002	91	2002

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

Follow

Cited by

Co-authors