Paul Bonsma

1.0k total citations
27 papers, 279 citations indexed

About

Paul Bonsma is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Discrete Mathematics and Combinatorics. According to data from OpenAlex, Paul Bonsma has authored 27 papers receiving a total of 279 indexed citations (citations by other indexed papers that have themselves been cited), including 27 papers in Computational Theory and Mathematics, 15 papers in Computer Networks and Communications and 6 papers in Discrete Mathematics and Combinatorics. Recurrent topics in Paul Bonsma's work include Advanced Graph Theory Research (26 papers), Complexity and Algorithms in Graphs (18 papers) and Interconnection Networks and Systems (8 papers). Paul Bonsma is often cited by papers focused on Advanced Graph Theory Research (26 papers), Complexity and Algorithms in Graphs (18 papers) and Interconnection Networks and Systems (8 papers). Paul Bonsma collaborates with scholars based in Germany, Netherlands and United Kingdom. Paul Bonsma's co-authors include Luis Cereceda, Lutz Volkmann, Nicola Ueffing, Andreas Wiese, Jens Schulz, Winfried Hochstättler, Christoph Berkholz, Martin Grohe, Frederic Dorn and Andrzej Proskurowski and has published in prestigious journals such as SIAM Journal on Computing, Theoretical Computer Science and Discrete Applied Mathematics.

In The Last Decade

Paul Bonsma

25 papers receiving 264 citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
Paul Bonsma Germany	9	218	164	42	31	27	27	279
Mathieu Liedloff France	11	217 1.0×	110 0.7×	31 0.7×	39 1.3×	16 0.6×	36	276
Yota Otachi Japan	9	196 0.9×	104 0.6×	26 0.6×	21 0.7×	36 1.3×	66	244
N. V. R. Mahadev United States	10	215 1.0×	75 0.5×	29 0.7×	51 1.6×	55 2.0×	30	277
Zsolt Tuza Hungary	13	313 1.4×	97 0.6×	68 1.6×	90 2.9×	77 2.9×	27	372
Haruko Okamura Japan	8	217 1.0×	136 0.8×	76 1.8×	35 1.1×	21 0.8×	18	277
S. Pérennes France	11	85 0.4×	228 1.4×	149 3.5×	11 0.4×	13 0.5×	21	309
Jonathan F. Buss Canada	8	215 1.0×	98 0.6×	33 0.8×	48 1.5×	16 0.6×	20	314
Matthias Kriesell Germany	11	365 1.7×	170 1.0×	121 2.9×	107 3.5×	101 3.7×	56	415
Stephen G. Hartke United States	9	153 0.7×	29 0.2×	40 1.0×	73 2.4×	46 1.7×	41	222
Eiji Miyano Japan	8	113 0.5×	97 0.6×	21 0.5×	5 0.2×	3 0.1×	47	184

Countries citing papers authored by Paul Bonsma

Since Specialization

Citations

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

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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-authorship network of co-authors of Paul Bonsma

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

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Berkholz, Christoph, Paul Bonsma, & Martin Grohe. (2016). Tight Lower and Upper Bounds for the Complexity of Canonical Colour Refinement. Theory of Computing Systems. 60(4). 581–614. 10 indexed citations

Bonsma, Paul. (2015). Independent Set Reconfiguration in Cographs and their Generalizations. Journal of Graph Theory. 83(2). 164–195. 6 indexed citations

Bonsma, Paul, Jens Schulz, & Andreas Wiese. (2014). A Constant-Factor Approximation Algorithm for Unsplittable Flow on Paths. SIAM Journal on Computing. 43(2). 767–799. 17 indexed citations

Bonsma, Paul. (2013). The complexity of rerouting shortest paths. Theoretical Computer Science. 510. 1–12. 10 indexed citations

Bonsma, Paul. (2011). Max-leaves spanning tree is APX-hard for cubic graphs. Journal of Discrete Algorithms. 12. 14–23. 8 indexed citations

Bonsma, Paul, Hajo Broersma, Viresh Patel, & A. V. Pyatkin. (2011). The complexity of finding uniform sparsest cuts in various graph classes. Journal of Discrete Algorithms. 14. 136–149. 4 indexed citations

Bonsma, Paul, et al.. (2011). Improved bounds for spanning trees with many leaves. Discrete Mathematics. 312(6). 1178–1194. 5 indexed citations

Bonsma, Paul & Frederic Dorn. (2011). Tight bounds and a fast FPT algorithm for directed Max-Leaf Spanning Tree. ACM Transactions on Algorithms. 7(4). 1–19. 3 indexed citations

Bonsma, Paul, et al.. (2011). A 3/2-Approximation Algorithm for Finding Spanning Trees with Many Leaves in Cubic Graphs. SIAM Journal on Discrete Mathematics. 25(4). 1652–1666. 4 indexed citations

10.

Bonsma, Paul, Jens Schulz, & Andreas Wiese. (2011). A Constant Factor Approximation Algorithm for Unsplittable Flow on Paths. University of Twente Research Information. 47–56. 22 indexed citations

11.

Bonsma, Paul. (2010). Shortest Path Reconfiguration is PSPACE-hard. 5 indexed citations

12.

Bonsma, Paul & Luis Cereceda. (2009). Finding Paths between graph colourings: PSPACE-completeness and superpolynomial distances. Theoretical Computer Science. 410(50). 5215–5226. 61 indexed citations

13.

Bonsma, Paul & Felix Breuer. (2008). Finding Fullerene Patches in Polynomial Time I: Counting Hexagonal Patches. arXiv (Cornell University). 1 indexed citations

14.

Bonsma, Paul. (2007). Linear time algorithms for finding sparsest cuts in various graph classes. Electronic Notes in Discrete Mathematics. 28. 265–272. 3 indexed citations

15.

Bonsma, Paul, Luis Cereceda, Jan van den Heuvel, & Matthew Johnson. (2007). Finding Paths between Graph Colourings: Computational Complexity and Possible Distances. Electronic Notes in Discrete Mathematics. 29. 463–469. 4 indexed citations

16.

Bonsma, Paul, et al.. (2006). Complexity results on restricted instances of a paint shop problem for words. Discrete Applied Mathematics. 154(9). 1335–1343. 18 indexed citations

17.

Bonsma, Paul. (2005). A characterization of extremal graphs with no matching-cut. Discrete Mathematics & Theoretical Computer Science. DMTCS Proceedings vol. AE,...(Proceedings). 2 indexed citations

18.

Bonsma, Paul. (2003). Sparsest cuts and concurrent flows in product graphs. Discrete Applied Mathematics. 136(2-3). 173–182. 6 indexed citations

19.

Bonsma, Paul. (2003). Complexity results for restricted instances of a paint shop problem. Data Archiving and Networked Services (DANS). 2 indexed citations

20.

Bonsma, Paul, Nicola Ueffing, & Lutz Volkmann. (2002). Edge-cuts leaving components of order at least three. Discrete Mathematics. 256(1-2). 431–439. 56 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