Manuel Bodirsky
- Computational Theory and Mathematics top 1%
- Computer Networks and Communications top 5%
- Artificial Intelligence top 5%
- Geometry and Topology top 2%
- Discrete Mathematics and Combinatorics top 5%
- Co-authors
- Jan KáraMichael PinskerMihyun KangJaroslav NešetřilHubie ChenPeter JönssonMarco KuhlmannTimo von Oertzen
- Topics
- Constraint Satisfaction and Optimization (44 papers)Advanced Graph Theory Research (37 papers)Logic, Reasoning, and Knowledge (21 papers)
- Cited by
- Discrete Mathematics and CombinatoricsComputational Theory and MathematicsGeometry and Topology
- Journals
- SHILAP Revista de lepidopterologíaArtificial IntelligenceJournal of the ACM
In The Last Decade
Manuel Bodirsky
78 papers receiving 790 citations
Peers
Comparison fields: 5 of 45
- Computational Theory and Mathematics 586
- Computer Networks and Communications 408
- Artificial Intelligence 264
- Geometry and Topology 237
- Discrete Mathematics and Combinatorics 159
Countries citing papers authored by Manuel Bodirsky
This map shows the geographic impact of Manuel Bodirsky'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 Manuel Bodirsky with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Manuel Bodirsky more than expected).
Fields of papers citing papers by Manuel Bodirsky
This network shows the impact of papers produced by Manuel Bodirsky. 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 Manuel Bodirsky. The network helps show where Manuel Bodirsky may publish in the future.
Co-authorship network of co-authors of Manuel Bodirsky
This figure shows the co-authorship network connecting the top 25 collaborators of Manuel Bodirsky. A scholar is included among the top collaborators of Manuel Bodirsky 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 Manuel Bodirsky. Manuel Bodirsky is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 1 | |
| 2 | 8 | |
| 3 | 1 | |
| 4 | 1 | |
| 5 | Topology is relevant (in the infinite-domain dichotomy conjecture for constraint satisfaction problems). | 1 |
| 6 | 5 | |
| 7 | 6 | |
| 8 | 2 | |
| 9 | 23 | |
| 10 | 30 | |
| 11 | 1 | |
| 12 | 14 | |
| 13 | Minimal functions on the random graph and the product ramsey theorem | 1 |
| 14 | 12 | |
| 15 | 4 | |
| 16 | A Fast Algorithm and Lower Bound for Temporal Reasoning | 2 |
| 17 | A direct decomposition of 3-connected planar graphs | 5 |
| 18 | 4 | |
| 19 | 11 | |
| 20 | 14 |
About Manuel Bodirsky
Manuel Bodirsky is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics and Geometry and Topology, having authored 82 papers that have together received 853 indexed citations. Recurring topics across this work include Constraint Satisfaction and Optimization (44 papers), Advanced Graph Theory Research (37 papers) and Logic, Reasoning, and Knowledge (21 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (159 citations), Computational Theory and Mathematics (586 citations) and Geometry and Topology (237 citations). Manuel Bodirsky has collaborated with scholars based in Germany, France and Spain. Frequent co-authors include Jan Kára, Michael Pinsker, Mihyun Kang, Jaroslav Nešetřil, Hubie Chen, Peter Jönsson, Marco Kuhlmann, Timo von Oertzen, Omer Giménez and Marc Noy. Their work appears in journals such as SHILAP Revista de lepidopterología, Artificial Intelligence and Journal of the ACM.
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.