O. J. Boxma

416 total citations
11 papers, 318 citations indexed

About

O. J. Boxma is a scholar working on Management Information Systems, Management Science and Operations Research and Computer Networks and Communications. According to data from OpenAlex, O. J. Boxma has authored 11 papers receiving a total of 318 indexed citations (citations by other indexed papers that have themselves been cited), including 11 papers in Management Information Systems, 9 papers in Management Science and Operations Research and 5 papers in Computer Networks and Communications. Recurrent topics in O. J. Boxma's work include Advanced Queuing Theory Analysis (11 papers), Probability and Risk Models (7 papers) and Network Traffic and Congestion Control (4 papers). O. J. Boxma is often cited by papers focused on Advanced Queuing Theory Analysis (11 papers), Probability and Risk Models (7 papers) and Network Traffic and Congestion Control (4 papers). O. J. Boxma collaborates with scholars based in Netherlands, Slovakia and Germany. O. J. Boxma's co-authors include W.P. Groenendijk, Sem Borst, René Bekker, Jacques Resing, Mark Kelbert and Johan S. H. van Leeuwaarden and has published in prestigious journals such as Operations Research, Annals of Operations Research and Journal of Applied Probability.

In The Last Decade

O. J. Boxma

11 papers receiving 288 citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
O. J. Boxma Netherlands	6	280	140	110	108	54	11	318
W.P. Groenendijk Netherlands	7	286 1.0×	177 1.3×	83 0.8×	141 1.3×	51 0.9×	9	324
Martin Eisenberg United States	8	335 1.2×	201 1.4×	116 1.1×	162 1.5×	49 0.9×	17	459
M. H. van Hoorn Netherlands	9	254 0.9×	113 0.8×	131 1.2×	73 0.7×	20 0.4×	13	317
A. Kuczura United States	8	266 0.9×	217 1.6×	85 0.8×	127 1.2×	31 0.6×	8	383
Manfred Brandt Germany	9	285 1.0×	151 1.1×	69 0.6×	137 1.3×	24 0.4×	26	340
C. N. Laws United Kingdom	7	272 1.0×	181 1.3×	65 0.6×	151 1.4×	24 0.4×	9	315
Yang Woo Shin South Korea	10	293 1.0×	103 0.7×	128 1.2×	95 0.9×	36 0.7×	46	334
Che Soong Kim South Korea	11	226 0.8×	126 0.9×	103 0.9×	99 0.9×	20 0.4×	24	268
Yaakov Kogan United States	10	177 0.6×	182 1.3×	54 0.5×	128 1.2×	14 0.3×	29	291
S. F. Yashkov Russia	5	219 0.8×	161 1.1×	67 0.6×	98 0.9×	7 0.1×	10	259

Countries citing papers authored by O. J. Boxma

Since Specialization

Citations

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

Fields of papers citing papers by O. J. Boxma

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of O. J. Boxma

This figure shows the co-authorship network connecting the top 25 collaborators of O. J. Boxma. A scholar is included among the top collaborators of O. J. Boxma 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 O. J. Boxma. O. J. Boxma 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:

11 of 11 papers shown

1.

Borst, Sem, et al.. (2013). Queues with random back-offs. Queueing Systems. 77(1). 33–74. 2 indexed citations

2.

Bekker, René & O. J. Boxma. (2007). An M/G/1 Queue with Adaptable Service Speed. Stochastic Models. 23(3). 373–396. 17 indexed citations

3.

Borst, Sem & O. J. Boxma. (1997). Polling Models With and Without Switchover Times. Operations Research. 45(4). 536–543. 46 indexed citations

4.

Boxma, O. J., et al.. (1996). Wiener-Hopf analysis of an M/G/1 queue with negative customers and of a related class of random walks. Queueing Systems. 23(1-4). 301–316. 37 indexed citations

5.

Boxma, O. J. & Mark Kelbert. (1994). Stochastic bounds for a polling system. Annals of Operations Research. 48(3). 295–310. 4 indexed citations

6.

Boxma, O. J. & Jacques Resing. (1994). Tandem queues with deterministic service times. Annals of Operations Research. 49(1). 221–239. 3 indexed citations

7.

Boxma, O. J. & W.P. Groenendijk. (1987). Pseudo-conservation laws in cyclic-service systems. Journal of Applied Probability. 24(4). 949–964. 175 indexed citations

8.

Boxma, O. J.. (1983). The cyclic queue with one general and one exponential server. Advances in Applied Probability. 15(4). 857–873. 22 indexed citations

9.

Boxma, O. J.. (1980). The longest service time in a busy period. Mathematical Methods of Operations Research. 24(7). 235–242. 5 indexed citations

10.

Boxma, O. J.. (1975). The single-server queue with random service output. Journal of Applied Probability. 12(4). 763–778. 4 indexed citations

11.

Boxma, O. J.. (1975). The single-server queue with random service output. Journal of Applied Probability. 12(4). 763–778. 3 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