C.W. Duin

833 total citations
22 papers, 509 citations indexed

About

C.W. Duin is a scholar working on Industrial and Manufacturing Engineering, Computational Theory and Mathematics and Electrical and Electronic Engineering. According to data from OpenAlex, C.W. Duin has authored 22 papers receiving a total of 509 indexed citations (citations by other indexed papers that have themselves been cited), including 12 papers in Industrial and Manufacturing Engineering, 10 papers in Computational Theory and Mathematics and 8 papers in Electrical and Electronic Engineering. Recurrent topics in C.W. Duin's work include VLSI and FPGA Design Techniques (8 papers), Complexity and Algorithms in Graphs (8 papers) and Scheduling and Optimization Algorithms (6 papers). C.W. Duin is often cited by papers focused on VLSI and FPGA Design Techniques (8 papers), Complexity and Algorithms in Graphs (8 papers) and Scheduling and Optimization Algorithms (6 papers). C.W. Duin collaborates with scholars based in Netherlands, Germany and China. C.W. Duin's co-authors include A. Volgenant, Lixin Tang, Hua Gong, Andréas Fink, Stefan Voß, Ton Volgenant, Mao-cheng Cai, Xiaoguang Yang, Jianzhong Zhang and Erik van der Sluis and has published in prestigious journals such as European Journal of Operational Research, Computers & Operations Research and Annals of Operations Research.

In The Last Decade

C.W. Duin

21 papers receiving 472 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
C.W. Duin Netherlands	13	293	175	120	100	66	22	509
Eranda Çela Austria	11	252 0.9×	121 0.7×	66 0.6×	109 1.1×	79 1.2×	29	455
Abílio Lucena Brazil	14	370 1.3×	167 1.0×	77 0.6×	187 1.9×	66 1.0×	37	570
Giulia Galbiati Italy	12	171 0.6×	269 1.5×	63 0.5×	168 1.7×	82 1.2×	32	469
Kenji Onaga Japan	11	107 0.4×	199 1.1×	66 0.6×	121 1.2×	62 0.9×	67	395
Olivier Goldschmidt United States	12	112 0.4×	252 1.4×	131 1.1×	204 2.0×	58 0.9×	24	535
Vladimir G. Deı̌neko United Kingdom	11	256 0.9×	104 0.6×	50 0.4×	103 1.0×	55 0.8×	45	463
Donald K. Wagner United States	9	64 0.2×	170 1.0×	93 0.8×	140 1.4×	69 1.0×	32	403
Gintaras Palubeckis Lithuania	14	384 1.3×	127 0.7×	39 0.3×	91 0.9×	179 2.7×	38	589
Matthew J. Saltzman United States	12	222 0.8×	170 1.0×	47 0.4×	104 1.0×	63 1.0×	17	519
Jérôme Monnot France	15	195 0.7×	353 2.0×	82 0.7×	177 1.8×	85 1.3×	70	608

Countries citing papers authored by C.W. Duin

Since Specialization

Citations

This map shows the geographic impact of C.W. Duin'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.W. Duin with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites C.W. Duin more than expected).

Fields of papers citing papers by C.W. Duin

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by C.W. Duin. 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.W. Duin. The network helps show where C.W. Duin may publish in the future.

Co-authorship network of co-authors of C.W. Duin

This figure shows the co-authorship network connecting the top 25 collaborators of C.W. Duin. A scholar is included among the top collaborators of C.W. Duin 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.W. Duin. C.W. Duin is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Duin, C.W. & A. Volgenant. (2012). On weighting two criteria with a parameter in combinatorial optimization problems. European Journal of Operational Research. 221(1). 1–6. 3 indexed citations

Duin, C.W., et al.. (2010). A reduction approach to the repeated assignment problem. European Journal of Operational Research. 210(2). 185–193. 3 indexed citations

Gong, Hua, Lixin Tang, & C.W. Duin. (2009). A two-stage flow shop scheduling problem on a batching machine and a discrete machine with blocking and shared setup times. Computers & Operations Research. 37(5). 960–969. 94 indexed citations

Volgenant, A. & C.W. Duin. (2009). Improved polynomial algorithms for robust bottleneck problems with interval data. Computers & Operations Research. 37(5). 909–915. 8 indexed citations

Volgenant, A. & C.W. Duin. (2009). On a pair of job-machine assignment problems with two stages. Computers & Operations Research. 37(2). 334–340. 1 indexed citations

Cai, Mao-cheng, C.W. Duin, Xiaoguang Yang, & Jianzhong Zhang. (2007). The partial inverse minimum spanning tree problem when weight increase is forbidden. European Journal of Operational Research. 188(2). 348–353. 18 indexed citations

Duin, C.W.. (2005). Two fast algorithms for all-pairs shortest paths. Computers & Operations Research. 34(9). 2824–2839. 10 indexed citations

Duin, C.W.. (2004). A Branch-Checking Algorithm for All-Pairs Shortest Paths. Algorithmica. 41(2). 131–145. 3 indexed citations

Duin, C.W. & A. Volgenant. (2004). Some inverse optimization problems under the Hamming distance. European Journal of Operational Research. 170(3). 887–899. 33 indexed citations

10.

Duin, C.W., A. Volgenant, & Stefan Voß. (2003). Solving group Steiner problems as Steiner problems. European Journal of Operational Research. 154(1). 323–329. 34 indexed citations

11.

Duin, C.W., et al.. (1999). The pilot method: A strategy for heuristic repetition with application to the Steiner problem in graphs. Networks. 34(3). 181–191. 57 indexed citations

12.

Duin, C.W. & A. Volgenant. (1997). The partial sum criterion for Steiner trees in graphs and shortest paths. European Journal of Operational Research. 97(1). 172–182. 18 indexed citations

13.

Voß, Stefan & C.W. Duin. (1993). HEURISTIC METHODS FOR THE RECTILINEAR STEINER ARBORESCENCE PROBLEM. Engineering Optimization. 21(2). 121–145. 1 indexed citations

14.

Duin, C.W. & A. Volgenant. (1991). Minimum deviation and balanced optimization: A unified approach. Operations Research Letters. 10(1). 43–48. 22 indexed citations

15.

Duin, C.W. & Ton Volgenant. (1991). The multi-weighted Steiner tree problem. Annals of Operations Research. 33(6). 451–469. 23 indexed citations

16.

Duin, C.W.. (1990). Basic graph and network algorithms. European Journal of Operational Research. 45(2-3). 372–372. 1 indexed citations

17.

Duin, C.W. & A. Volgenant. (1989). An edge elimination test for the steiner problem in graphs. Operations Research Letters. 8(2). 79–83. 12 indexed citations

18.

Duin, C.W. & A. Volgenant. (1989). Reduction tests for the steiner problem in grapsh. Networks. 19(5). 549–567. 57 indexed citations

19.

Duin, C.W. & A. Volgenant. (1989). Reducing the hierarchical network design problem. European Journal of Operational Research. 39(3). 332–344. 22 indexed citations

20.

Duin, C.W. & A. Volgenant. (1987). Some generalizations of the steiner problem in graphs. Networks. 17(3). 353–364. 31 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.

Explore authors with similar magnitude of impact