Daniël Paulusma

163 papers and 1.2k indexed citations i.

About

Daniël Paulusma has authored 163 papers that have received a total of 1.2k indexed citations. This includes 151 papers in Computational Theory and Mathematics, 64 papers in Discrete Mathematics and Combinatorics and 47 papers in Computer Networks and Communications. The topics of these papers are Advanced Graph Theory Research (141 papers), Combinatorial Optimization and Complexity Theory (77 papers) and Limits and Structures in Graph Theory (64 papers). Daniël Paulusma is often cited by papers focused on Advanced Graph Theory Research (141 papers), Combinatorial Optimization and Complexity Theory (77 papers) and Limits and Structures in Graph Theory (64 papers) and collaborates with scholars based in United Kingdom, Norway and France. Daniël Paulusma's co-authors include Petr A. Golovach, Matthew Johnson, Konrad K. Dabrowski, Hajo Broersma and Jian Song and has published in prestigious journals such as Social Networks, Mathematics of Operations Research and Games and Economic Behavior

In The Last Decade

Rankless by CCL
2025