This map shows the geographic impact of S.C. Borst'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 S.C. Borst with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites S.C. Borst more than expected).
This network shows the impact of papers produced by S.C. Borst. 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 S.C. Borst. The network helps show where S.C. Borst may publish in the future.
Co-authorship network of co-authors of S.C. Borst
This figure shows the co-authorship network connecting the top 25 collaborators of S.C. Borst.
A scholar is included among the top collaborators of S.C. Borst 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 S.C. Borst. S.C. Borst is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Aalto, Samuli, Urtzi Ayesta, S.C. Borst, Vishal Misra, & R. Núñez Queija. (2007). Beyond processor sharing. Data Archiving and Networked Services (DANS).1 indexed citations
6.
Borst, S.C., R. Núñez Queija, & Bert Zwart. (2006). Sojourn time asymptotics in Processor-Sharing queues. Data Archiving and Networked Services (DANS).
7.
Borst, S.C., et al.. (2006). Delay optimization in bandwidth-sharing networks. Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands. 1–15.1 indexed citations
8.
Borst, S.C., et al.. (2006). Heavy-traffic delay minimization in bandwidth-sharing networks. Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands. 1–25.1 indexed citations
9.
Queija, R. Núñez, et al.. (2005). Differentiated bandwidth sharing with disparate flow sizes. 200501.
10.
Bekker, René, S.C. Borst, & R. Núñez Queija. (2005). Performance of TCP-friendly streaming sessions in the presence of heavy-tailed elastic flows. Data Archiving and Networked Services (DANS). 504(4). 1–162.3 indexed citations
Borst, S.C. & Philip Whiting. (2001). The use of diversity antennas in high-speed wireless systems: capacity gains, fairness issues, multi-user scheduling. TU/e Research Portal.28 indexed citations
16.
Borst, S.C., Onno Boxma, & Predrag R. Jelenković. (2000). Induced burstiness in generalized processor sharing queues with long-tailed traffic flows. TU/e Research Portal. 4(4). 1–16.15 indexed citations
17.
Boucherie, Richard J., S.C. Borst, & Onno Boxma. (1998). ERMR: A generalised Equivalent Random Method for overflow systems with Repacking. UvA-DARE (University of Amsterdam).5 indexed citations
18.
Borst, S.C., Onno Boxma, & Predrag R. Jelenković. (1998). Generalized processor sharing with long-tailed traffic sources. TU/e Research Portal. 9823. 345–354.20 indexed citations
Borst, S.C. & R.D. van der Mei. (1994). Waiting-time approximations for multiple-server polling systems. Research portal (Tilburg University). 9428(28). 1–27.1 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.