Daniël Paulusma
- Computational Theory and Mathematics top 0.5%
- Discrete Mathematics and Combinatorics top 1%
- Computer Networks and Communications top 5%
- Economics and Econometrics top 10%
- Electrical and Electronic Engineering
- Co-authors
- Petr A. GolovachWalter KernJian SongHajo BroersmaMatthew JohnsonPim van ’t HofKonrad K. DabrowskiJiřı́ Fiala
- Topics
- Advanced Graph Theory Research (121 papers)Complexity and Algorithms in Graphs (70 papers)Limits and Structures in Graph Theory (54 papers)
- Cited by
- Discrete Mathematics and CombinatoricsComputational Theory and MathematicsComputer Networks and Communications
- Partner nations
- United KingdomNetherlandsNorway
In The Last Decade
Daniël Paulusma
134 papers receiving 1.0k citations
Peers
Comparison fields: 5 of 59
- Computational Theory and Mathematics 843
- Discrete Mathematics and Combinatorics 317
- Computer Networks and Communications 294
- Economics and Econometrics 123
- Electrical and Electronic Engineering 123
Countries citing papers authored by Daniël Paulusma
This map shows the geographic impact of Daniël Paulusma'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 Daniël Paulusma with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Daniël Paulusma more than expected).
Fields of papers citing papers by Daniël Paulusma
This network shows the impact of papers produced by Daniël Paulusma. 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 Daniël Paulusma. The network helps show where Daniël Paulusma may publish in the future.
Co-authorship network of co-authors of Daniël Paulusma
This figure shows the co-authorship network connecting the top 25 collaborators of Daniël Paulusma. A scholar is included among the top collaborators of Daniël Paulusma 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 Daniël Paulusma. Daniël Paulusma is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 1 | |
| 2 | 0 | |
| 3 | 1 | |
| 4 | 0 | |
| 5 | 3 | |
| 6 | 0 | |
| 7 | 1 | |
| 8 | 3 | |
| 9 | 3 | |
| 10 | 3 | |
| 11 | 3 | |
| 12 | 9 | |
| 13 | Colouring on Hereditary Graph Classes Closed under Complementation. | 1 |
| 14 | 15 | |
| 15 | 18 | |
| 16 | 2 | |
| 17 | 3 | |
| 18 | Graph-Theoretic Concepts in Computer Science: 34th International Workshop, WG 2008, Durham, UK, June 30 --- July 2, 2008. Revised Papers | 1 |
| 19 | 4 | |
| 20 | 13 |
About Daniël Paulusma
Daniël Paulusma is a scholar working on Discrete Mathematics and Combinatorics, Computational Theory and Mathematics and Computer Networks and Communications, having authored 145 papers that have together received 1.0k indexed citations. Recurring topics across this work include Advanced Graph Theory Research (121 papers), Complexity and Algorithms in Graphs (70 papers) and Limits and Structures in Graph Theory (54 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (317 citations), Computational Theory and Mathematics (843 citations) and Computer Networks and Communications (294 citations). Daniël Paulusma has collaborated with scholars based in United Kingdom, Netherlands and Norway. Frequent co-authors include Petr A. Golovach, Walter Kern, Jian Song, Hajo Broersma, Matthew Johnson, Pim van ’t Hof, Konrad K. Dabrowski, Jiřı́ Fiala, Stefan Szeider and Péter Bíró. Their work appears in journals such as Mathematical Programming, Theoretical Computer Science and Social Networks.
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.