Jan Kratochvil

Cited by

	All	Since 2017
Citations	5960	1915
h-index	43	24
i10-index	121	56

380

190

285

1994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202225 28 24 60 59 68 47 80 98 103 114 128 157 176 233 295 276 303 303 363 328 327 294 350 301 333 313 352 265

Public access

View all

14 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
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
Daniel KralMasaryk UniversityVerified email at fi.muni.cz
Mathieu Liedloffmaître de conférences HdR, université d'OrléansVerified email at univ-orleans.fr
Petr HlinenyMasaryk University, Brno, CZVerified email at fi.muni.cz
Yota OtachiNagoya UniversityVerified email at nagoya-u.jp
Magnús M. HalldórssonProfessor of Computer Science, Reykjavik UniversityVerified email at ru.is
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
Patrizio AngeliniJohn Cabot UniversityVerified email at dia.uniroma3.it
Paweł RzążewskiWarsaw University of Technology, Faculty of Mathematics and Information ScienceVerified email at mini.pw.edu.pl
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	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	203	1991
Intersection graphs of segments J Kratochvíl, J Matousek Journal of Combinatorial Theory, Series B 62 (2), 289-315, 1994	195	1994
Complexity of coloring graphs without forbidden induced subgraphs D Král, J Kratochvíl, Z Tuza, GJ Woeginger International Workshop on Graph-Theoretic Concepts in Computer Science, 254-262, 2001	194	2001
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	177	2002
Fixed-parameter complexity of λ-labelings J Fiala, T Kloks, J Kratochvıl Discrete Applied Mathematics 113 (1), 59-72, 2001	154	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	138	2002
Covering and coloring polygon-circle graphs A Kostochka, J Kratochvíl Discrete Mathematics 163 (1-3), 299-305, 1997	124	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	118	2009
String graphs requiring exponential representations J Kratochvíl, J Matoušek Journal of Combinatorial Theory, Series B 53 (1), 1-4, 1991	115	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	107	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	101	2001
The capture time of a graph A Bonato, P Golovach, G Hahn, J Kratochvíl Discrete Mathematics 309 (18), 5588-5595, 2009	98	2009
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	93	1994
The complexity of induced minors and related problems MR Fellows, J Kratochvíl, M Middendorf, F Pfeiffer Algorithmica 13 (3), 266-282, 1995	90	1995
Precoloring extension with fixed color bound J Kratochvil Acta Math. Univ. Comen 62, 139-153, 1993	89	1993
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	87	1990
On the complexity of bicoloring clique hypergraphs of graphs J Kratochvıl, Z Tuza Journal of Algorithms 45 (1), 40-54, 2002	84	2002
Independent sets with domination constraints MM Halldórsson, J Kratochvıl, JA Telle Discrete Applied Mathematics 99 (1-3), 39-54, 2000	83	2000

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