Johan Thapper

431 total citations
15 papers, 103 citations indexed

About

Johan Thapper is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Discrete Mathematics and Combinatorics. According to data from OpenAlex, Johan Thapper has authored 15 papers receiving a total of 103 indexed citations (citations by other indexed papers that have themselves been cited), including 12 papers in Computational Theory and Mathematics, 8 papers in Computer Networks and Communications and 3 papers in Discrete Mathematics and Combinatorics. Recurrent topics in Johan Thapper's work include Advanced Graph Theory Research (11 papers), Constraint Satisfaction and Optimization (8 papers) and Complexity and Algorithms in Graphs (8 papers). Johan Thapper is often cited by papers focused on Advanced Graph Theory Research (11 papers), Constraint Satisfaction and Optimization (8 papers) and Complexity and Algorithms in Graphs (8 papers). Johan Thapper collaborates with scholars based in France, Sweden and United Kingdom. Johan Thapper's co-authors include Stanislav Živný, Vladimir Kolmogorov, Peter Jönsson, Manuel Bodirsky, Dugald Macpherson, N. Narayanan, Svante Linusson, Luís A. Montero, Csilla Bujtás and Peter Jönsson and has published in prestigious journals such as SIAM Journal on Computing, Journal of Computer and System Sciences and SIAM Journal on Discrete Mathematics.

In The Last Decade

Johan Thapper

15 papers receiving 88 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Johan Thapper France 6 85 56 18 11 9 15 103
Maximilian Probst Gutenberg Switzerland 5 72 0.8× 49 0.9× 34 1.9× 4 0.4× 10 1.1× 16 107
Markus Sortland Dregi Norway 3 104 1.2× 42 0.8× 15 0.8× 8 0.7× 6 0.7× 4 124
Alexander Langer Germany 9 122 1.4× 50 0.9× 20 1.1× 16 1.5× 5 0.6× 16 152
Daniel Mölle Germany 5 106 1.2× 61 1.1× 12 0.7× 12 1.1× 4 0.4× 6 130
Mamadou Moustapha Kanté France 7 115 1.4× 29 0.5× 10 0.6× 20 1.8× 6 0.7× 19 121
Jean-Xavier Rampon France 7 56 0.7× 29 0.5× 15 0.8× 4 0.4× 5 0.6× 21 94
Fahad Panolan India 7 183 2.2× 75 1.3× 14 0.8× 31 2.8× 20 2.2× 57 205
Édouard Bonnet France 6 62 0.7× 15 0.3× 15 0.8× 19 1.7× 10 1.1× 27 82
Eelko Penninkx Netherlands 4 145 1.7× 52 0.9× 16 0.9× 22 2.0× 26 2.9× 6 159
Dimitrios M. Thilikos France 7 127 1.5× 36 0.6× 18 1.0× 43 3.9× 5 0.6× 25 149

Countries citing papers authored by Johan Thapper

Since Specialization
Citations

This map shows the geographic impact of Johan Thapper'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 Johan Thapper with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Johan Thapper more than expected).

Fields of papers citing papers by Johan Thapper

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Johan Thapper. 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 Johan Thapper. The network helps show where Johan Thapper may publish in the future.

Co-authorship network of co-authors of Johan Thapper

This figure shows the co-authorship network connecting the top 25 collaborators of Johan Thapper. A scholar is included among the top collaborators of Johan Thapper 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 Johan Thapper. Johan Thapper is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

15 of 15 papers shown
1.
Thapper, Johan & Stanislav Živný. (2018). The Limits of SDP Relaxations for General-Valued CSPs. arXiv (Cornell University). 10(3). 1–22. 3 indexed citations
2.
Bujtás, Csilla, Michał Karpiński, Yannis Manoussakis, et al.. (2018). Tropical dominating sets in vertex-coloured graphs. Journal of Discrete Algorithms. 48. 27–41. 3 indexed citations
3.
Thapper, Johan & Stanislav Živný. (2017). The Power of Sherali--Adams Relaxations for General-Valued CSPs. SIAM Journal on Computing. 46(4). 1241–1279. 9 indexed citations
4.
Jönsson, Peter & Johan Thapper. (2016). Constraint satisfaction and semilinear expansions of addition over the rationals and the reals. Journal of Computer and System Sciences. 82(5). 912–928. 5 indexed citations
5.
Kolmogorov, Vladimir, Johan Thapper, & Stanislav Živný. (2015). The Power of Linear Programming for General-Valued CSPs. SIAM Journal on Computing. 44(1). 1–36. 26 indexed citations
6.
Thapper, Johan & Stanislav Živný. (2015). Necessary Conditions for Tractability of Valued CSPs. SIAM Journal on Discrete Mathematics. 29(4). 2361–2384. 2 indexed citations
7.
Jönsson, Peter, et al.. (2015). An approximability-related parameter on graphs―-properties and applications. Discrete Mathematics & Theoretical Computer Science. Vol. 17 no. 1(Graph Theory). 1 indexed citations
8.
Bodirsky, Manuel, Dugald Macpherson, & Johan Thapper. (2013). Constraint satisfaction tractability from semi-lattice operations on infinite sets. ACM Transactions on Computational Logic. 14(4). 1–19. 3 indexed citations
9.
Thapper, Johan & Stanislav Živný. (2013). The complexity of finite-valued CSPs. 695–704. 24 indexed citations
10.
Thapper, Johan. (2010). Aspects of a Constraint Optimisation Problem. KTH Publication Database DiVA (KTH Royal Institute of Technology). 13 indexed citations
11.
Jönsson, Peter, et al.. (2009). Properties of an Approximability-related Parameter on Circular Complete Graphs. Electronic Notes in Discrete Mathematics. 35. 115–120. 1 indexed citations
12.
Thapper, Johan. (2007). Refined Counting of Fully Packed Loop Configurations. 56. 1–27. 9 indexed citations
13.
Jönsson, Peter, et al.. (2007). Determining the Number of Solutions to Binary CSP instances. 1 indexed citations
14.
Thapper, Johan. (2007). Combinatorial Considerations on Two Models from Statistical Mechanics. KTH Publication Database DiVA (KTH Royal Institute of Technology). 1 indexed citations
15.
Thapper, Johan, et al.. (2005). A Microstructure Based Approach to Constraint Satisfaction Optimisation Problems. The Florida AI Research Society. 155–160. 2 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