Paul Bonsma
Impact in
-
- Advanced Graph Theory Research
- Complexity and Algorithms in Graphs
- Graph Labeling and Dimension Problems
-
- Limits and Structures in Graph Theory
Papers in
-
- Advanced Graph Theory Research 26
- Complexity and Algorithms in Graphs 18
- Graph Labeling and Dimension Problems 6
-
- Interconnection Networks and Systems 8
- Optimization and Search Problems 7
- Co-authors
- Luis Cereceda (2 shared papers)Lutz Volkmann (1 shared paper)Nicola Ueffing (1 shared paper)Andreas Wiese (2 shared papers)Jens Schulz (2 shared papers)Winfried Hochstättler (1 shared paper)Christoph Berkholz (1 shared paper)Martin Grohe (1 shared paper)
- Journals
- Discrete Applied Mathematics (3 papers)Theoretical Computer Science (2 papers)Journal of Graph Theory (2 papers)Discrete Mathematics (2 papers)SIAM Journal on Discrete Mathematics (2 papers)
- Partner nations
- GermanyNetherlandsUnited States
In The Last Decade
Paul Bonsma
25 papers receiving 265 citations
Peers
Comparison fields: 5 of 32
- Computational Theory and Mathematics 220
- Discrete Mathematics and Combinatorics 31
- Computer Networks and Communications 164
- Geometry and Topology 28
- Computer Graphics and Computer-Aided Design 10
Countries citing papers authored by Paul Bonsma
This map shows the geographic impact of Paul Bonsma'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 Paul Bonsma with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Paul Bonsma more than expected).
Fields of papers citing papers by Paul Bonsma
This network shows the impact of papers produced by Paul Bonsma. 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 Paul Bonsma. The network helps show where Paul Bonsma may publish in the future.
Co-authors
The 17 scholars most cited alongside Paul Bonsma, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
Showing the 20 most-cited of 27 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 2009 | 63 | |
| 2 | 2002 | 56 | |
| 3 | 2011 | 22 | |
| 4 | 2006 | 18 | |
| 5 | 2014 | 17 | |
| 6 | 2008 | 16 | |
| 7 | 2013 | 10 | |
| 8 | 2016 | 10 | |
| 9 | 2011 | 8 | |
| 10 | 2009 | 8 | |
| 11 | 2015 | 6 | |
| 12 | 2003 | 6 | |
| 13 | 2010 | 5 | |
| 14 | 2011 | 5 | |
| 15 | 2011 | 5 | |
| 16 | 2011 | 4 | |
| 17 | 2007 | 4 | |
| 18 | 2011 | 3 | |
| 19 | 2007 | 3 | |
| 20 | 2011 | 3 |
About Paul Bonsma
Paul Bonsma is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications, Discrete Mathematics and Combinatorics, Geometry and Topology and Artificial Intelligence, having authored 27 papers that have together received 281 indexed citations. Recurring topics across this work include Advanced Graph Theory Research (26 papers), Complexity and Algorithms in Graphs (18 papers), Interconnection Networks and Systems (8 papers), Optimization and Search Problems (7 papers), Graph Labeling and Dimension Problems (6 papers), Limits and Structures in Graph Theory (6 papers), Graph theory and applications (3 papers) and Machine Learning and Algorithms (2 papers). The work is most often cited by research in Computational Theory and Mathematics (220 citations), Discrete Mathematics and Combinatorics (31 citations), Computer Networks and Communications (164 citations), Geometry and Topology (28 citations) and Computer Graphics and Computer-Aided Design (10 citations). Paul Bonsma has collaborated with scholars based in Germany, Netherlands and United States. Frequent co-authors include Luis Cereceda, Lutz Volkmann, Nicola Ueffing, Andreas Wiese, Jens Schulz, Winfried Hochstättler, Christoph Berkholz, Martin Grohe, Frederic Dorn and A. V. Pyatkin. Their work appears in journals such as Discrete Applied Mathematics, Theoretical Computer Science, Journal of Graph Theory, Discrete Mathematics and SIAM Journal on Discrete 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.