Jan Kára
Impact in
-
- Advanced Graph Theory Research
- Complexity and Algorithms in Graphs
- semigroups and automata theory
-
- Computational Geometry and Mesh Generation
Papers in
-
- Advanced Graph Theory Research 10
- Graph Labeling and Dimension Problems 2
- Complexity and Algorithms in Graphs 2
- semigroups and automata theory 2
-
- Constraint Satisfaction and Optimization 6
- Co-authors
- Manuel Bodirsky (7 shared papers)David R. Wood (2 shared papers)Barnaby Martin (1 shared paper)Attila Pór (1 shared paper)Timo von Oertzen (1 shared paper)Hubie Chen (1 shared paper)Zdenĕk Dvořák (2 shared papers)Jan Kratochvı́l (2 shared papers)
In The Last Decade
Jan Kára
15 papers receiving 213 citations
Peers
Comparison fields: 5 of 24
- Computational Theory and Mathematics 156
- Computer Graphics and Computer-Aided Design 34
- Discrete Mathematics and Combinatorics 29
- Computer Networks and Communications 132
- Geometry and Topology 48
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-authors
The 15 scholars most cited alongside Jan Kára, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
| # | Work | ||
|---|---|---|---|
| 1 | 2010 | 76 | |
| 2 | 2007 | 44 | |
| 3 | 2012 | 19 | |
| 4 | 2005 | 16 | |
| 5 | 2010 | 15 | |
| 6 | 2008 | 14 | |
| 7 | 2009 | 12 | |
| 8 | 2007 | 8 | |
| 9 | 2007 | 7 | |
| 10 | 2010 | 4 | |
| 11 | 2009 | 4 | |
| 12 | A Fast Algorithm and Lower Bound for Temporal Reasoning | 2008 | 2 |
| 13 | Minimum Degree and the Number of Chords. | 2003 | 1 |
| 14 | Computational complexity in Graph theory | 2007 | 1 |
| 15 | [Lung resection for a non-small cell carcinoma (stage IV) with a permanent intracavitary brachytherapy 125I]. | 2006 | 1 |
| 16 | On the number of intersections of two polygons | 2003 | 0 |
About Jan Kára
Jan Kára is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications, Artificial Intelligence, Computer Graphics and Computer-Aided Design and Discrete Mathematics and Combinatorics, having authored 16 papers that have together received 224 indexed citations. Recurring topics across this work include Advanced Graph Theory Research (10 papers), Constraint Satisfaction and Optimization (6 papers), Logic, Reasoning, and Knowledge (4 papers), Computational Geometry and Mesh Generation (3 papers), Graph Labeling and Dimension Problems (2 papers), Complexity and Algorithms in Graphs (2 papers), semigroups and automata theory (2 papers) and Lung Cancer Diagnosis and Treatment (1 paper). The work is most often cited by research in Computational Theory and Mathematics (156 citations), Computer Graphics and Computer-Aided Design (34 citations), Discrete Mathematics and Combinatorics (29 citations), Computer Networks and Communications (132 citations) and Geometry and Topology (48 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, Hubie Chen, Zdenĕk Dvořák, Jan Kratochvı́l, Vít Jelínek and Daniel Král͏̌. Their work appears in journals such as Discrete Applied Mathematics, Theory of Computing Systems, Journal of the ACM, ACM Transactions on Computational Logic and Theoretical Computer Science.
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.