Johan Thapper

15 papers receiving 88 citations

Peers

Johan Thapper
Comparison fields: 5 of 24
  • Computational Theory and Mathematics 85
  • Discrete Mathematics and Combinatorics 11
  • Computer Graphics and Computer-Aided Design 9
  • Computer Networks and Communications 56
  • Hardware and Architecture 5
Replace Maximilian Probst Gutenberg with:
Maximilian Probst Gutenberg Switzerland
Markus Sortland Dregi Norway
Daniel Mölle Germany
Alexander Langer Germany
Mamadou Moustapha Kanté France
Pritish Kamath United States
Édouard Bonnet France
Jean-Xavier Rampon France
Fahad Panolan India
Eelko Penninkx Netherlands
Johan Thapper relative to Maximilian Probst Gutenberg Switzerland Maximilian Probst Gutenberg's profile →
Citations per field
00.5×
Maximilian Probst Gutenberg · 1×
Citations per year

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-authors

The 13 scholars most cited alongside Johan Thapper, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.

Border = papers with Johan Thapper Line = papers co-authored together Johan Thapper links everyone, so they are left out of the graph.

All Works

15 of 15 papers shown
#Work
1 201526
2 201324
3
Aspects of a Constraint Optimisation Problem
201013
4
Refined Counting of Fully Packed Loop Configurations
20079
5 20179
6 20165
7 20183
8 20183
9 20133
10
A Microstructure Based Approach to Constraint Satisfaction Optimisation Problems
20052
11 20152
12
Determining the Number of Solutions to Binary CSP instances
20071
13
Combinatorial Considerations on Two Models from Statistical Mechanics
20071
14 20091
15 20151

About Johan Thapper

Johan Thapper is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications, Discrete Mathematics and Combinatorics, Artificial Intelligence and Computer Graphics and Computer-Aided Design, having authored 15 papers that have together received 103 indexed citations. Recurring topics across this work include Advanced Graph Theory Research (11 papers), Complexity and Algorithms in Graphs (8 papers), Constraint Satisfaction and Optimization (8 papers), Computational Geometry and Mesh Generation (2 papers), Advanced Combinatorial Mathematics (2 papers), Data Management and Algorithms (1 paper), Hermeneutics and Narrative Identity (1 paper) and Logic, Reasoning, and Knowledge (1 paper). The work is most often cited by research in Computational Theory and Mathematics (85 citations), Discrete Mathematics and Combinatorics (11 citations), Computer Graphics and Computer-Aided Design (9 citations), Computer Networks and Communications (56 citations) and Hardware and Architecture (5 citations). Johan Thapper has collaborated with scholars based in France, Sweden and United Kingdom. Frequent co-authors include Stanislav Živný, Vladimir Kolmogorov, Peter Jönsson, Manuel Bodirsky, Dugald Macpherson, N. Narayanan, Luís A. Montero, Csilla Bujtás, Michał Karpiński and Zs. Tuza. Their work appears in journals such as SIAM Journal on Computing, SIAM Journal on Discrete Mathematics, Journal of Computer and System Sciences, Discrete Mathematics & Theoretical Computer Science and ACM Transactions on Computational Logic.

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