Jan Kára
- Computational Theory and Mathematics top 5%
- Computer Networks and Communications top 10%
- Artificial Intelligence
- Geometry and Topology top 10%
- Computer Graphics and Computer-Aided Design top 5%
- Co-authors
- Manuel BodirskyDavid R. WoodBarnaby MartinAttila PórTimo von OertzenJan Kratochvı́lHubie ChenZdenĕk Dvořák
- Topics
- Advanced Graph Theory Research (10 papers)Constraint Satisfaction and Optimization (6 papers)Logic, Reasoning, and Knowledge (4 papers)
In The Last Decade
Jan Kára
14 papers receiving 209 citations
Peers
Comparison fields: 5 of 24
- Computational Theory and Mathematics 154
- Computer Networks and Communications 132
- Artificial Intelligence 62
- Geometry and Topology 47
- Computer Graphics and Computer-Aided Design 34
Countries citing papers authored by Jan Kára
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
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
| # | Work | Indexed citations |
|---|---|---|
| 1 | 18 | |
| 2 | 15 | |
| 3 | 75 | |
| 4 | 4 | |
| 5 | 12 | |
| 6 | 4 | |
| 7 | A Fast Algorithm and Lower Bound for Temporal Reasoning | 2 |
| 8 | 14 | |
| 9 | 7 | |
| 10 | 44 | |
| 11 | Computational complexity in Graph theory | 1 |
| 12 | 8 | |
| 13 | [Lung resection for a non-small cell carcinoma (stage IV) with a permanent intracavitary brachytherapy 125I]. | 1 |
| 14 | 16 | |
| 15 | Minimum Degree and the Number of Chords. | 1 |
| 16 | On the number of intersections of two polygons | 0 |
About Jan Kára
Jan Kára is a scholar working on Computer Graphics and Computer-Aided Design, Computational Theory and Mathematics and Discrete Mathematics and Combinatorics, having authored 16 papers that have together received 222 indexed citations. Recurring topics across this work include Advanced Graph Theory Research (10 papers), Constraint Satisfaction and Optimization (6 papers) and Logic, Reasoning, and Knowledge (4 papers). The work is most often cited by research in Computer Graphics and Computer-Aided Design (34 citations), Computational Theory and Mathematics (154 citations) and Discrete Mathematics and Combinatorics (27 citations). Jan Kára has collaborated with scholars based in Czechia, France and Spain. Frequent 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. Their work appears in journals such as Journal of the ACM, Theoretical Computer Science and Discrete Applied Mathematics.
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.