Daniël Paulusma
Impact in
-
- Limits and Structures in Graph Theory
- Computational Theory and Mathematics top 0.5%
- Advanced Graph Theory Research
- Complexity and Algorithms in Graphs
- Graph Labeling and Dimension Problems
Papers in
-
- Advanced Graph Theory Research 121
- Complexity and Algorithms in Graphs 70
- Graph Labeling and Dimension Problems 47
-
- Limits and Structures in Graph Theory 54
- Co-authors
- Petr A. Golovach (38 shared papers)Walter Kern (15 shared papers)Jian Song (7 shared papers)Hajo Broersma (16 shared papers)Matthew Johnson (23 shared papers)Pim van ’t Hof (16 shared papers)Jiřı́ Fiala (9 shared papers)Konrad K. Dabrowski (17 shared papers)
- Journals
- Theoretical Computer Science (26 papers)Discrete Applied Mathematics (20 papers)Algorithmica (13 papers)Journal of Computer and System Sciences (7 papers)European Journal of Combinatorics (6 papers)
- Partner nations
- United KingdomNetherlandsNorway
In The Last Decade
Daniël Paulusma
134 papers receiving 1.0k citations
Peers
Comparison fields: 5 of 59
- Discrete Mathematics and Combinatorics 317
- Computational Theory and Mathematics 843
- Computer Networks and Communications 294
- Geometry and Topology 93
- Management Science and Operations Research 104
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-authors
The 25 scholars most cited alongside Daniël Paulusma, 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 145 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 2016 | 59 | |
| 2 | 2003 | 52 | |
| 3 | 2005 | 38 | |
| 4 | 2011 | 37 | |
| 5 | 2012 | 33 | |
| 6 | 2005 | 26 | |
| 7 | 2011 | 26 | |
| 8 | 2008 | 25 | |
| 9 | 2012 | 20 | |
| 10 | 2013 | 19 | |
| 11 | 2014 | 19 | |
| 12 | 2013 | 18 | |
| 13 | Run-time assignment of tasks to multiple heterogeneous processors | 2004 | 18 |
| 14 | 2012 | 17 | |
| 15 | 2013 | 16 | |
| 16 | 2014 | 16 | |
| 17 | 2009 | 16 | |
| 18 | 2014 | 15 | |
| 19 | 2012 | 15 | |
| 20 | 2010 | 15 |
About Daniël Paulusma
Daniël Paulusma is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics, Computer Networks and Communications, Geometry and Topology and Economics and Econometrics, 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), Limits and Structures in Graph Theory (54 papers), Graph Labeling and Dimension Problems (47 papers), Interconnection Networks and Systems (21 papers), Optimization and Search Problems (18 papers), Game Theory and Voting Systems (15 papers) and Graph theory and applications (14 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (317 citations), Computational Theory and Mathematics (843 citations), Computer Networks and Communications (294 citations), Geometry and Topology (93 citations) and Management Science and Operations Research (104 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, Jiřı́ Fiala, Konrad K. Dabrowski, Stefan Szeider and Péter Bíró. Their work appears in journals such as Theoretical Computer Science, Discrete Applied Mathematics, Algorithmica, Journal of Computer and System Sciences and European Journal of Combinatorics.
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.