Manuel Bodirsky

2.3k total citations
82 papers, 853 citations indexed

About

Manuel Bodirsky is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Artificial Intelligence. According to data from OpenAlex, Manuel Bodirsky has authored 82 papers receiving a total of 853 indexed citations (citations by other indexed papers that have themselves been cited), including 57 papers in Computational Theory and Mathematics, 44 papers in Computer Networks and Communications and 30 papers in Artificial Intelligence. Recurrent topics in Manuel Bodirsky's work include Constraint Satisfaction and Optimization (44 papers), Advanced Graph Theory Research (37 papers) and Logic, Reasoning, and Knowledge (21 papers). Manuel Bodirsky is often cited by papers focused on Constraint Satisfaction and Optimization (44 papers), Advanced Graph Theory Research (37 papers) and Logic, Reasoning, and Knowledge (21 papers). Manuel Bodirsky collaborates with scholars based in Germany, France and Spain. Manuel Bodirsky's 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 and has published in prestigious journals such as SHILAP Revista de lepidopterología, Artificial Intelligence and Journal of the ACM.

In The Last Decade

Manuel Bodirsky

78 papers receiving 790 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Manuel Bodirsky Germany 16 586 408 264 237 159 82 853
Johann A. Makowsky Israel 17 966 1.6× 280 0.7× 372 1.4× 286 1.2× 250 1.6× 80 1.2k
Rod Downey New Zealand 19 1.2k 2.0× 189 0.5× 344 1.3× 259 1.1× 48 0.3× 110 1.3k
Bruce A. Reed Canada 15 719 1.2× 199 0.5× 102 0.4× 141 0.6× 200 1.3× 30 854
Terry A. McKee United States 10 379 0.6× 131 0.3× 140 0.5× 137 0.6× 82 0.5× 65 587
Andreĭ A. Bulatov Canada 8 560 1.0× 353 0.9× 132 0.5× 56 0.2× 77 0.5× 28 668
Patrice Ossona de Mendez France 16 721 1.2× 98 0.2× 73 0.3× 223 0.9× 403 2.5× 68 874
Stephen Suen United States 12 209 0.4× 495 1.2× 89 0.3× 50 0.2× 96 0.6× 23 752
Gary MacGillivray Canada 15 566 1.0× 162 0.4× 61 0.2× 102 0.4× 184 1.2× 78 688
R.P. Anstee Canada 15 367 0.6× 116 0.3× 113 0.4× 112 0.5× 198 1.2× 58 592
George Havas Australia 14 181 0.3× 94 0.2× 283 1.1× 153 0.6× 250 1.6× 62 610

Countries citing papers authored by Manuel Bodirsky

Since Specialization
Citations

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

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

20 of 20 papers shown
1.
Bodirsky, Manuel, et al.. (2024). Spectrahedral shadows and completely positive maps on real closed fields. Journal of the European Mathematical Society. 28(5). 2233–2259. 1 indexed citations
2.
Pinsker, Michael & Manuel Bodirsky. (2021). Canonical functions: a proof via topological dynamics. Contributions to Discrete Mathematics. 16(2). 36–45. 8 indexed citations
3.
Bodirsky, Manuel, et al.. (2021). Piecewise Linear Valued CSPs Solvable by Linear Programming Relaxation. CINECA IRIS Institutial research information system (University of Pisa). 1 indexed citations
4.
Bodirsky, Manuel, et al.. (2020). The Complexity of Combinations of Qualitative Constraint Satisfaction Problems. SHILAP Revista de lepidopterología. 1 indexed citations
5.
Bodirsky, Manuel, et al.. (2019). Topology is relevant (in the infinite-domain dichotomy conjecture for constraint satisfaction problems).. arXiv (Cornell University). 1 indexed citations
6.
Bodirsky, Manuel, et al.. (2018). A Dichotomy for First-Order Reducts of Unary Structures. SHILAP Revista de lepidopterología. 5 indexed citations
7.
Bodirsky, Manuel, et al.. (2018). The Universal Homogenous Binary Tree. CLOK (University of Central Lancashire). 6 indexed citations
8.
Bodirsky, Manuel, et al.. (2015). Distance constraint satisfaction problems. Information and Computation. 247. 87–105. 2 indexed citations
9.
Bodirsky, Manuel & Michael Pinsker. (2014). Topological Birkhoff. Transactions of the American Mathematical Society. 367(4). 2527–2549. 23 indexed citations
10.
Bodirsky, Manuel, Peter Jönsson, & Timo von Oertzen. (2012). Essential Convexity and Complexity of Semi-Algebraic Constraints. Logical Methods in Computer Science. Volume 8, Issue 4. 30 indexed citations
11.
Bodirsky, Manuel, et al.. (2011). Tractable set constraints. International Joint Conference on Artificial Intelligence. 510–515. 1 indexed citations
12.
Bodirsky, Manuel, et al.. (2011). RCC8 is polynomial on networks of bounded treewidth. International Joint Conference on Artificial Intelligence. 756–761. 14 indexed citations
13.
Bodirsky, Manuel & Michael Pinsker. (2010). Minimal functions on the random graph and the product ramsey theorem. arXiv (Cornell University). 1 indexed citations
14.
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
15.
Bodirsky, Manuel & Hubie Chen. (2009). Peek arc consistency. Theoretical Computer Science. 411(2). 445–453. 4 indexed citations
16.
Bodirsky, Manuel & Jan Kára. (2008). A Fast Algorithm and Lower Bound for Temporal Reasoning. arXiv (Cornell University). 2 indexed citations
17.
Bodirsky, Manuel, Clemens Gröpl, Daniel Johannsen, & Mihyun Kang. (2007). A direct decomposition of 3-connected planar graphs. Max Planck Institute for Plasma Physics. 5 indexed citations
18.
Bodirsky, Manuel, Éric Fusy, Mihyun Kang, & Stefan Vigerske. (2007). An unbiased pointing operator for unlabeled structures, with applications to counting and sampling. Symposium on Discrete Algorithms. 356–365. 4 indexed citations
19.
Bodirsky, Manuel, Clemens Gröpl, & Mihyun Kang. (2007). Generating labeled planar graphs uniformly at random. Theoretical Computer Science. 379(3). 377–386. 11 indexed citations
20.
Bodirsky, Manuel, et al.. (2004). A new algorithm for normal dominance constraints. Symposium on Discrete Algorithms. 59–67. 14 indexed citations

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

Rankless by CCL
2026