Petr Kolman
- Computational Theory and Mathematics top 5%
- Computer Networks and Communications top 10%
- Artificial Intelligence
- Molecular Biology
- Genetics
- Co-authors
- Christian ScheidelerJiřı́ SgallTomasz WaleńAmitabh ChaudharyAmitabha BagchiJie ZhengJiřı́ MatoušekJan Kratochvı́l
- Topics
- Complexity and Algorithms in Graphs (17 papers)Advanced Graph Theory Research (14 papers)Optimization and Search Problems (12 papers)
- Cited by
- Computational Theory and MathematicsComputer Graphics and Computer-Aided DesignComputer Networks and Communications
- Partner nations
- CzechiaUnited StatesGermany
In The Last Decade
Petr Kolman
33 papers receiving 264 citations
Peers
Comparison fields: 5 of 46
- Computational Theory and Mathematics 173
- Computer Networks and Communications 117
- Artificial Intelligence 79
- Molecular Biology 49
- Genetics 49
Countries citing papers authored by Petr Kolman
This map shows the geographic impact of Petr Kolman'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 Petr Kolman with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Petr Kolman more than expected).
Fields of papers citing papers by Petr Kolman
This network shows the impact of papers produced by Petr Kolman. 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 Petr Kolman. The network helps show where Petr Kolman may publish in the future.
Co-authorship network of co-authors of Petr Kolman
This figure shows the co-authorship network connecting the top 25 collaborators of Petr Kolman. A scholar is included among the top collaborators of Petr Kolman 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 Petr Kolman. Petr Kolman is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | Extension Complexity, MSO Logic, and Treewidth | 4 |
| 2 | 2 | |
| 3 | 0 | |
| 4 | Proceedings of the 7th annual conference on Theory and Applications of Models of Computation | 12 |
| 5 | 9 | |
| 6 | 28 | |
| 7 | 14 | |
| 8 | 4 | |
| 9 | 2 | |
| 10 | 2 | |
| 11 | 14 | |
| 12 | 6 | |
| 13 | 11 | |
| 14 | 24 | |
| 15 | 14 | |
| 16 | 1 | |
| 17 | 34 | |
| 18 | 6 | |
| 19 | 1 | |
| 20 | 11 |
About Petr Kolman
Petr Kolman is a scholar working on Computational Theory and Mathematics, Computer Graphics and Computer-Aided Design and Discrete Mathematics and Combinatorics, having authored 35 papers that have together received 298 indexed citations. Recurring topics across this work include Complexity and Algorithms in Graphs (17 papers), Advanced Graph Theory Research (14 papers) and Optimization and Search Problems (12 papers). The work is most often cited by research in Computational Theory and Mathematics (173 citations), Computer Graphics and Computer-Aided Design (24 citations) and Computer Networks and Communications (117 citations). Petr Kolman has collaborated with scholars based in Czechia, United States and Germany. Frequent co-authors include Christian Scheideler, Jiřı́ Sgall, Tomasz Waleń, Amitabh Chaudhary, Amitabha Bagchi, Jie Zheng, Jiřı́ Matoušek, Jan Kratochvı́l, Angsheng Li and Jiřı́ Fiala. Their work appears in journals such as Theoretical Computer Science, Lecture notes in 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.