Countries citing papers authored by C.A.J. Hurkens
Since
Specialization
Citations
This map shows the geographic impact of C.A.J. Hurkens'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 C.A.J. Hurkens with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites C.A.J. Hurkens more than expected).
This network shows the impact of papers produced by C.A.J. Hurkens. 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 C.A.J. Hurkens. The network helps show where C.A.J. Hurkens may publish in the future.
Co-authorship network of co-authors of C.A.J. Hurkens
This figure shows the co-authorship network connecting the top 25 collaborators of C.A.J. Hurkens.
A scholar is included among the top collaborators of C.A.J. Hurkens 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 C.A.J. Hurkens. C.A.J. Hurkens is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Werf, Jan Martijn E. M. van der, Boudewijn F. van Dongen, C.A.J. Hurkens, & Alexander Serebrenik. (2009). Process Discovery using Integer Linear Programming. Fundamenta Informaticae. 94(3-4). 387–412.113 indexed citations
6.
Hurkens, C.A.J., et al.. (2004). Virtual private network design : a proof of the tree routing conjecture on ring networks. TU/e Research Portal (Eindhoven University of Technology). 200415.2 indexed citations
Hurkens, C.A.J.. (2000). Spreading gossip efficiently. TU/e Research Portal (Eindhoven University of Technology). 208–210.11 indexed citations
9.
Hurkens, C.A.J., et al.. (1999). Algorithms for the radio link frequency assignment problem. Data Archiving and Networked Services (DANS). 17.4 indexed citations
10.
Hurkens, C.A.J., et al.. (1998). Models and algorithms for the microdata protection problem. Journal of Official Statistics. 14(4). 437–447.5 indexed citations
11.
Hurkens, C.A.J., et al.. (1997). An algorithm for solving a diophantine equation with lower and upper bounds on the variables. Data Archiving and Networked Services (DANS). 9740(5). 503–4.2 indexed citations
12.
Williamson, David P., L. A. Hall, J.A. Hoogeveen, et al.. (1997). Short Shop Schedules. Operations Research. 45(2). 288–294.134 indexed citations
13.
Hurkens, C.A.J., et al.. (1996). Algorithms for frequency assignment problems. Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands. 9(6). 1–8.8 indexed citations
14.
Hurkens, C.A.J., et al.. (1995). A time-indexed formulation for single-machine scheduling problems : branch-and-cut. Data Archiving and Networked Services (DANS). 9524.2 indexed citations
15.
Hurkens, C.A.J.. (1992). Nasty TSP Instances for Farthest Insertion.. Data Archiving and Networked Services (DANS). 346–352.2 indexed citations
Hurkens, C.A.J., László Lovász, & Éva Tardos. (1988). How to tidy up your set-system?. Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands. 309–314.7 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.