World's Best Scientists 2026 revealed!
Jan Kratochvíl

Jan Kratochvíl

D-Index & Metrics

Computer Science

D-Index
42
Citations
6105
World Ranking
8504
National Ranking
15

Mathematics

D-Index
42
Citations
6157
World Ranking
1817
National Ranking
10

Overview

Jan Kratochvíl is affiliated with Charles University in the Czech Republic. Their research primarily spans computer science and mathematics, with a particular focus on computational theory, discrete mathematics, and graph-related studies.

Their work frequently addresses topics including:

  • Advanced Graph Theory Research
  • Limits and Structures in Graph Theory
  • Graph Labeling and Dimension Problems
  • Computational Geometry and Mesh Generation
  • Complexity and Algorithms in Graphs
  • Topological and Geometric Data Analysis
  • Graph theory and applications

Jan Kratochvíl has contributed a range of papers to different publication venues, such as arXiv, Algorithmica, and the Leibniz-Zentrum für Informatik (Schloss Dagstuhl). Notable recent papers include:

  • U-Bubble Model for Mixed Unit Interval Graphs and Its Applications: The MaxCut Problem Revisited, 2020, Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • Computational Complexity of Covering Multigraphs with Semi-Edges: Small Cases, 2021, Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • -Bubble Model for Mixed Unit Interval Graphs and Its Applications: The MaxCut Problem Revisited, 2021, Algorithmica
  • List Covering of Regular Multigraphs with Semi-edges, 2023, Algorithmica
  • On a Combinatorial Problem Arising in Machine Teaching, 2024, arXiv (Cornell University)

Frequently collaborating with other researchers, Jan Kratochvíl has coauthored works extensively with:

  • Nikola Jedličková
  • Jan Bok
  • Jiří Fiala
  • Petr Hliněný
  • Michaela Seifrtová

Their publications are often featured in venues with proven scholarly impact, including:

  • arXiv (Cornell University)
  • Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • Algorithmica
  • Discrete Applied Mathematics
  • Journal of Graph Algorithms and Applications

Jan Kratochvíl's work integrates multiple subfields of study involving complex computational and combinatorial problems, reflected by a strong presence in:

  • Computational Theory and Mathematics
  • Discrete Mathematics and Combinatorics
  • Computer Graphics and Computer-Aided Design
  • Geometry and Topology
  • Computer Vision and Pattern Recognition

Best Publications

  • A special planar satisfiability problem and a consequence of its NP-completeness

    Jan Kratochvíl

  • Intersection graphs of segments

    Jan Kratochivíl;Jiří Matoušek

  • Complexity of Coloring Graphs without Forbidden Induced Subgraphs

    Daniel Král;Jan Kratochvíl;Zsolt Tuza;Gerhard J. Woeginger

  • String graphs. II.: Recognizing string graphs is NP-hard

    Jan Kratochvíl

  • On the b-Chromatic Number of Graphs

    Jan Kratochvíl;Zsolt Tuza;Margit Voigt

  • On the injective chromatic number of graphs

    Gena Hahn;Jan Kratochvíl;Jozef Sirán;Dominique Sotteau

  • Fixed parameter complexity of λ-labelings

    Jiri Fiala;Ton Kloks;Jan Kratochvil

  • Covering and coloring polygon-circle graphs

    Alexandr Kostochka;Jan Kratochvíl

  • On the computation of the hull number of a graph

    Mitre C. Dourado;John G. Gimbel;Jan Kratochvíl;Fábio Protti

  • Pursuing a fast robber on a graph

    Fedor V. Fomin;Petr A. Golovach;Jan Kratochvíl;Nicolas Nisse

  • String graphs requiring exponential representations

    Jan Kratochvíl;Jiří Matoušek

  • The capture time of a graph

    A. Bonato;P. Golovach;G. Hahn;J. Kratochvíl

  • Representing graphs by disks and balls (a survey of recognition-complexity results)

    Petr Hliněný;Jan Kratochvíl

  • Perfect codes over graphs

    Jan Kratochvíl

  • The complexity of induced minors and related problems

    Michael R. Fellows;Jan Kratochvíl;Matthias Middendorf;Frank Pfeiffer

  • One more occurrence of variables makes satisfiability jump from trivial to NP-complete

    Jan Kratochvíl;Petr Savický;Zsolt Tuza

  • Algorithmic complexity of list colorings

    Jan Kratochivíl;Zsolt Tuza

  • Precoloring extension with fixed color bound.

    J. Kratochvíl

  • Parameterized complexity of coloring problems: Treewidth versus vertex cover

    Jií Fiala;Petr A. Golovach;Jan Kratochvíl

  • On the complexity of bicoloring clique hypergraphs of graphs

    Jan Kratochvíl;Zsolt Tuza

  • Topics in Discrete Mathematics

    Martin Klazar;Jan Kratochvíl;Martin Loebl;Jiří Matoušek

Frequent Co-Authors

Fedor V. Fomin
Fedor V. Fomin University of Bergen
Zsolt Tuza
Zsolt Tuza University of Pannonia
Magnús M. Halldórsson
Magnús M. Halldórsson Reykjavík University
Daniel Král
Daniel Král Masaryk University
Dieter Kratsch
Dieter Kratsch University of Lorraine
Michael Kaufmann
Michael Kaufmann University of Tübingen
Giuseppe Di Battista
Giuseppe Di Battista Roma Tre University
Gerhard J. Woeginger
Gerhard J. Woeginger RWTH Aachen University
Walter Didimo
Walter Didimo University of Perugia
Jiří Matoušek
Jiří Matoušek Charles University

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

For students studying Mathematics in the USA, exploring related online degrees can open up diverse career pathways. Many professionals enhance their quantitative skills by pursuing a data analytics masters programs, which leverage mathematical foundations for data-driven decision-making roles in various industries.

Additionally, combining business acumen with mathematical expertise is a popular approach. Students often consider MBA degrees, and understanding how to can you transfer mba programs is crucial for those looking to optimize their learning paths across multiple institutions.

For those seeking flexibility, online options abound, with some programs recognized as the easiest mba program choices for admission. These programs provide accessible opportunities for advancing business knowledge without compromising academic standards.

If convenience is a priority, exploring the easiest online mba programs to get into offers a pathway to gain leadership skills quickly and effectively, complementing a math degree’s rigorous analytical training. Together, these educational avenues support versatile and rewarding career trajectories.

Best Scientists Citing Jan Kratochvíl

Trending Scientists