Paul Bonsma

28 papers and 330 indexed citations i.

About

Paul Bonsma has authored 28 papers that have received a total of 330 indexed citations. This includes 27 papers in Computational Theory and Mathematics, 16 papers in Computer Networks and Communications and 6 papers in Discrete Mathematics and Combinatorics. The topics of these papers are Advanced Graph Theory Research (26 papers), Combinatorial Optimization and Complexity Theory (17 papers) and Optimization and Search Problems (10 papers). Paul Bonsma is often cited by papers focused on Advanced Graph Theory Research (26 papers), Combinatorial Optimization and Complexity Theory (17 papers) and Optimization and Search Problems (10 papers) and collaborates with scholars based in Germany, The Netherlands and United Kingdom. Paul Bonsma's co-authors include Andreas Wiese, Jens Schulz, Luis Cereceda, Hajo Broersma and A. V. Pyatkin and has published in prestigious journals such as SIAM Journal on Computing, Theoretical Computer Science and Discrete Mathematics

In The Last Decade

Rankless by CCL
2025