Jan Kratochvil

Cited by

	All	Since 2019
Citations	6712	1935
h-index	46	24
i10-index	131	59

360

180

270

199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202424 22 35 58 64 73 64 83 114 108 118 137 157 178 239 288 256 320 306 349 335 324 285 352 306 349 289 319 339 332 301

Public access

View all

21 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
Ignaz RutterUniversity of PassauVerified email at uni-passau.de
Fedor V. FominProfessor of Computer Science, University of BergenVerified email at uib.no
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
Gerhard WoegingerProfessor of Computer Science, RWTH AachenVerified email at cs.rwth-aachen.de
Yota OtachiNagoya UniversityVerified email at nagoya-u.jp
Mirka MillerUniversity of Newcastle, Australia & University of West Bohemia, Czech RepublicVerified email at newcastle.edu.au
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
Daniel KralMasaryk UniversityVerified email at fi.muni.cz
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	258	1994
Intersection graphs of segments J Kratochvíl, J Matousek Journal of Combinatorial Theory, Series B 62 (2), 289-315, 1994	234	1994
String graphs. II. Recognizing string graphs is NP-hard J Kratochvíl Journal of Combinatorial Theory, Series B 52 (1), 67-78, 1991	222	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	219	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	197	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	166	2002
Fixed-parameter complexity of λ-labelings J Fiala, T Kloks, J Kratochvıl Discrete Applied Mathematics 113 (1), 59-72, 2001	157	2001
Covering and coloring polygon-circle graphs A Kostochka, J Kratochvíl Discrete Mathematics 163 (1-3), 299-305, 1997	139	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	138	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	128	2010
String graphs requiring exponential representations J Kratochvíl, J Matoušek Journal of Combinatorial Theory, Series B 53 (1), 1-4, 1991	125	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	116	2001
The capture time of a graph A Bonato, P Golovach, G Hahn, J Kratochvíl Discrete Mathematics 309 (18), 5588-5595, 2009	112	2009
Independent sets with domination constraints MM Halldórsson, J Kratochvıl, JA Telle Discrete Applied Mathematics 99 (1-3), 39-54, 2000	106	2000
The complexity of induced minors and related problems MR Fellows, J Kratochvíl, M Middendorf, F Pfeiffer Algorithmica 13 (3), 266-282, 1995	103	1995
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	102	1993
Perfect codes over graphs J Kratochvíl Journal of Combinatorial Theory, Series B 40 (2), 224-228, 1986	100	1986
Algorithmic complexity of list colorings J Kratochvil, Z Tuza Discrete Applied Mathematics 50 (3), 297-302, 1994	99	1994
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	98	1990
Parameterized complexity of coloring problems: Treewidth versus vertex cover J Fiala, PA Golovach, J Kratochvíl Theoretical Computer Science 412 (23), 2513-2523, 2011	93	2011

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