Gerard Sierksma
- Industrial and Manufacturing Engineering top 1%
- Computational Theory and Mathematics top 2%
- Computer Networks and Communications top 10%
- Management Science and Operations Research top 10%
- Electrical and Electronic Engineering
- Co-authors
- Diptesh GhoshBoris GoldengorinYori ZwólšJack A.A. van der VeenManoj ChangatHenry Martyn MulderGerard GaalmanPeter van Dam
- Topics
- Vehicle Routing Optimization Methods (14 papers)Advanced Graph Theory Research (8 papers)Scheduling and Optimization Algorithms (7 papers)
- Cited by
- Industrial and Manufacturing EngineeringComputational Theory and MathematicsDiscrete Mathematics and Combinatorics
- Partner nations
- NetherlandsIndiaUnited States
In The Last Decade
Gerard Sierksma
59 papers receiving 638 citations
Peers
Comparison fields: 5 of 91
- Industrial and Manufacturing Engineering 306
- Computational Theory and Mathematics 208
- Computer Networks and Communications 98
- Management Science and Operations Research 83
- Electrical and Electronic Engineering 73
Countries citing papers authored by Gerard Sierksma
This map shows the geographic impact of Gerard Sierksma'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 Gerard Sierksma with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Gerard Sierksma more than expected).
Fields of papers citing papers by Gerard Sierksma
This network shows the impact of papers produced by Gerard Sierksma. 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 Gerard Sierksma. The network helps show where Gerard Sierksma may publish in the future.
Co-authorship network of co-authors of Gerard Sierksma
This figure shows the co-authorship network connecting the top 25 collaborators of Gerard Sierksma. A scholar is included among the top collaborators of Gerard Sierksma 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 Gerard Sierksma. Gerard Sierksma is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 6 | |
| 2 | 2 | |
| 3 | 3 | |
| 4 | 52 | |
| 5 | Tolerance-based branch and bound, algorithms | 2 |
| 6 | 13 | |
| 7 | 32 | |
| 8 | 33 | |
| 9 | Convexities related to path properties on graphs; a unified approach | 2 |
| 10 | 30 | |
| 11 | 1 | |
| 12 | 1 | |
| 13 | 14 | |
| 14 | 58 | |
| 15 | 2 | |
| 16 | NEARLY PRINCIPAL MINORS OF M-MATRICES | 2 |
| 17 | 1 | |
| 18 | 8 | |
| 19 | 3 | |
| 20 | 17 |
About Gerard Sierksma
Gerard Sierksma is a scholar working on Industrial and Manufacturing Engineering, Computational Theory and Mathematics and Discrete Mathematics and Combinatorics, having authored 63 papers that have together received 735 indexed citations. Recurring topics across this work include Vehicle Routing Optimization Methods (14 papers), Advanced Graph Theory Research (8 papers) and Scheduling and Optimization Algorithms (7 papers). The work is most often cited by research in Industrial and Manufacturing Engineering (306 citations), Computational Theory and Mathematics (208 citations) and Discrete Mathematics and Combinatorics (28 citations). Gerard Sierksma has collaborated with scholars based in Netherlands, India and United States. Frequent co-authors include Diptesh Ghosh, Boris Goldengorin, Yori Zwólš, Jack A.A. van der Veen, Manoj Changat, Henry Martyn Mulder, Gerard Gaalman, Peter van Dam, Michael Tso and David Alcaide López de Pablo. Their work appears in journals such as Management Science, European Journal of Operational Research and Operations Research.
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.