Jan Kára

586 total citations
16 papers, 222 citations indexed

About

Jan Kára is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Artificial Intelligence. According to data from OpenAlex, Jan Kára has authored 16 papers receiving a total of 222 indexed citations (citations by other indexed papers that have themselves been cited), including 10 papers in Computational Theory and Mathematics, 6 papers in Computer Networks and Communications and 4 papers in Artificial Intelligence. Recurrent topics in Jan Kára's work include Advanced Graph Theory Research (10 papers), Constraint Satisfaction and Optimization (6 papers) and Logic, Reasoning, and Knowledge (4 papers). Jan Kára is often cited by papers focused on Advanced Graph Theory Research (10 papers), Constraint Satisfaction and Optimization (6 papers) and Logic, Reasoning, and Knowledge (4 papers). Jan Kára collaborates with scholars based in Czechia, France and Spain. Jan Kára's co-authors include Manuel Bodirsky, David R. Wood, Barnaby Martin, Attila Pór, Timo von Oertzen, Jan Kratochvı́l, Hubie Chen, Zdenĕk Dvořák, Jakub Černý and Vít Jelínek and has published in prestigious journals such as Journal of the ACM, Theoretical Computer Science and Discrete Applied Mathematics.

In The Last Decade

Jan Kára

14 papers receiving 209 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Jan Kára Czechia 8 154 132 62 47 34 16 222
Isolde Adler Germany 8 190 1.2× 87 0.7× 53 0.9× 24 0.5× 16 0.5× 21 231
Vincent Bouchitté France 7 196 1.3× 88 0.7× 25 0.4× 15 0.3× 14 0.4× 15 224
Phyllis Zweig Chinn United States 4 227 1.5× 91 0.7× 24 0.4× 58 1.2× 18 0.5× 11 286
Yota Otachi Japan 9 196 1.3× 104 0.8× 27 0.4× 36 0.8× 29 0.9× 66 244
Jonathan F. Buss Canada 8 215 1.4× 98 0.7× 96 1.5× 16 0.3× 33 1.0× 20 314
Virginia Vassilevska United States 8 120 0.8× 78 0.6× 46 0.7× 15 0.3× 12 0.4× 13 186
Marcin Kozik Poland 10 376 2.4× 233 1.8× 55 0.9× 42 0.9× 13 0.4× 26 414
Jesper Nederlof Netherlands 9 337 2.2× 132 1.0× 71 1.1× 14 0.3× 38 1.1× 35 373
Hervé Fournier France 8 107 0.7× 19 0.1× 48 0.8× 30 0.6× 13 0.4× 19 153
Lúcia Draque Penso Germany 9 203 1.3× 73 0.6× 22 0.4× 77 1.6× 11 0.3× 32 274

Countries citing papers authored by Jan Kára

Since Specialization
Citations

This map shows the geographic impact of Jan Kára's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Jan Kára with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Jan Kára more than expected).

Fields of papers citing papers by Jan Kára

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Jan Kára. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Jan Kára. The network helps show where Jan Kára may publish in the future.

Co-authorship network of co-authors of Jan Kára

This figure shows the co-authorship network connecting the top 25 collaborators of Jan Kára. A scholar is included among the top collaborators of Jan Kára based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Jan Kára. Jan Kára is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

16 of 16 papers shown
1.
Bodirsky, Manuel, Jan Kára, & Barnaby Martin. (2012). The complexity of surjective homomorphism problems—a survey. Discrete Applied Mathematics. 160(12). 1680–1690. 18 indexed citations
2.
Bodirsky, Manuel & Jan Kára. (2010). A fast algorithm and datalog inexpressibility for temporal reasoning. ACM Transactions on Computational Logic. 11(3). 1–21. 15 indexed citations
3.
Bodirsky, Manuel & Jan Kára. (2010). The complexity of temporal constraint satisfaction problems. Journal of the ACM. 57(2). 1–41. 75 indexed citations
4.
Dvořák, Zdenĕk, et al.. (2010). Pattern Hypergraphs. The Electronic Journal of Combinatorics. 17(1). 4 indexed citations
5.
Bodirsky, Manuel, Hubie Chen, Jan Kára, & Timo von Oertzen. (2009). Maximal infinite-valued constraint languages. Theoretical Computer Science. 410(18). 1684–1693. 12 indexed citations
6.
Jelínková, Eva, et al.. (2009). Clustered Planarity: Small Clusters in Cycles and Eulerian Graphs. Journal of Graph Algorithms and Applications. 13(3). 379–422. 4 indexed citations
7.
Bodirsky, Manuel & Jan Kára. (2008). A Fast Algorithm and Lower Bound for Temporal Reasoning. arXiv (Cornell University). 2 indexed citations
8.
Bodirsky, Manuel & Jan Kára. (2008). The complexity of temporal constraint satisfaction problems. 29–38. 14 indexed citations
9.
Černý, Jakub, Zdenĕk Dvořák, Vít Jelínek, & Jan Kára. (2007). Noncrossing Hamiltonian paths in geometric graphs. Discrete Applied Mathematics. 155(9). 1096–1105. 7 indexed citations
10.
Bodirsky, Manuel & Jan Kára. (2007). The Complexity of Equality Constraint Languages. Theory of Computing Systems. 43(2). 136–158. 44 indexed citations
11.
Kára, Jan. (2007). Computational complexity in Graph theory. Digital Repository (National Repository of Grey Literature). 1 indexed citations
12.
Kára, Jan, Jan Kratochvı́l, & David R. Wood. (2007). On the complexity of the balanced vertex ordering problem. Discrete Mathematics & Theoretical Computer Science. Vol. 9 no. 1(Graph and Algorithms). 8 indexed citations
13.
Lang, O., et al.. (2006). [Lung resection for a non-small cell carcinoma (stage IV) with a permanent intracavitary brachytherapy 125I].. PubMed. 85(2). 67–70. 1 indexed citations
14.
Kára, Jan, Attila Pór, & David R. Wood. (2005). On the Chromatic Number of the Visibility Graph of a Set of Points in the Plane. Discrete & Computational Geometry. 34(3). 497–506. 16 indexed citations
15.
Kára, Jan & Daniel Král͏̌. (2003). Minimum Degree and the Number of Chords.. Ars Combinatoria. 68. 1 indexed citations
16.
Černý, Jakub, et al.. (2003). On the number of intersections of two polygons. Commentationes Mathematicae Universitatis Carolinae. 44(2). 217–228.

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Breakdown of academic impact, for papers by Isolde Adler Breakdown of academic impact, for papers by Vincent Bouchitté Breakdown of academic impact, for papers by Phyllis Zweig Chinn Breakdown of academic impact, for papers by Yota Otachi Breakdown of academic impact, for papers by Jonathan F. Buss Breakdown of academic impact, for papers by Virginia Vassilevska Breakdown of academic impact, for papers by Marcin Kozik Breakdown of academic impact, for papers by Jesper Nederlof Breakdown of academic impact, for papers by Hervé Fournier Breakdown of academic impact, for papers by Lúcia Draque Penso
Rankless by CCL
2026