Bernardo D’Auria

462 total citations
30 papers, 257 citations indexed

About

Bernardo D’Auria is a scholar working on Management Information Systems, Computer Networks and Communications and Management Science and Operations Research. According to data from OpenAlex, Bernardo D’Auria has authored 30 papers receiving a total of 257 indexed citations (citations by other indexed papers that have themselves been cited), including 18 papers in Management Information Systems, 10 papers in Computer Networks and Communications and 7 papers in Management Science and Operations Research. Recurrent topics in Bernardo D’Auria's work include Advanced Queuing Theory Analysis (18 papers), Random Matrices and Applications (6 papers) and Stochastic processes and financial applications (6 papers). Bernardo D’Auria is often cited by papers focused on Advanced Queuing Theory Analysis (18 papers), Random Matrices and Applications (6 papers) and Stochastic processes and financial applications (6 papers). Bernardo D’Auria collaborates with scholars based in Spain, Netherlands and Italy. Bernardo D’Auria's co-authors include Offer Kella, Sidney I. Resnick, Pasquale Avella, Jevgeņijs Ivanovs, Michel Mandjes, Saverio Salerno, Maurizio Boccia, Igor Vasil’ev, Ivo Adan and Neil Walton and has published in prestigious journals such as European Journal of Operational Research, Operations Research and SIAM Journal on Applied Mathematics.

In The Last Decade

Bernardo D’Auria

26 papers receiving 248 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Bernardo D’Auria Spain 10 117 116 68 52 48 30 257
Ana da Silva Soares Belgium 10 213 1.8× 184 1.6× 45 0.7× 49 0.9× 24 0.5× 12 339
Jinhua Cao Taiwan 11 264 2.3× 143 1.2× 34 0.5× 16 0.3× 56 1.2× 22 470
Victor F. Nicola Netherlands 13 148 1.3× 190 1.6× 157 2.3× 17 0.3× 9 0.2× 29 398
Stella Kapodistria Netherlands 11 156 1.3× 82 0.7× 29 0.4× 6 0.1× 11 0.2× 20 287
P. J. Hunt United Kingdom 10 359 3.1× 76 0.7× 342 5.0× 77 1.5× 14 0.3× 18 554
A. A. Yushkevich United States 11 60 0.5× 86 0.7× 29 0.4× 73 1.4× 13 0.3× 22 302
Yaakov Kogan United States 10 177 1.5× 54 0.5× 182 2.7× 10 0.2× 6 0.1× 29 291
Sergey Shorgin Russia 7 74 0.6× 56 0.5× 55 0.8× 16 0.3× 3 0.1× 44 165
Sebastian Hahn Germany 7 147 1.3× 55 0.5× 148 2.2× 4 0.1× 21 0.4× 11 311

Countries citing papers authored by Bernardo D’Auria

Since Specialization
Citations

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

Fields of papers citing papers by Bernardo D’Auria

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Bernardo D’Auria. 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 Bernardo D’Auria. The network helps show where Bernardo D’Auria may publish in the future.

Co-authorship network of co-authors of Bernardo D’Auria

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

All Works

20 of 20 papers shown
1.
D’Auria, Bernardo, et al.. (2024). Optimal stopping of Gauss–Markov bridges. Advances in Applied Probability. 57(1). 1–34.
2.
D’Auria, Bernardo, et al.. (2022). Anticipative information in a Brownian−Poisson market. Annals of Operations Research. 336(1-2). 1289–1314.
3.
D’Auria, Bernardo, et al.. (2020). A Class of Itô Diffusions with Known Terminal Value and Specified Optimal Barrier. Mathematics. 8(1). 123–123. 1 indexed citations
4.
Adan, Ivo, Bernardo D’Auria, & Offer Kella. (2019). Special volume on ‘Recent Developments in Queueing Theory’ of the third ECQT conference. Queueing Systems. 93(1-2). 1–2. 3 indexed citations
5.
Adan, Ivo & Bernardo D’Auria. (2016). Sojourn Time in a Single-Server Queue with Threshold Service Rate Control. SIAM Journal on Applied Mathematics. 76(1). 197–216. 2 indexed citations
6.
Bramson, Maury, Bernardo D’Auria, & Neil Walton. (2016). Proportional Switching in First-in, First-out Networks. Operations Research. 65(2). 496–513. 4 indexed citations
7.
D’Auria, Bernardo, et al.. (2015). Pure threshold strategies for a two-node tandem network under partial information. Operations Research Letters. 43(5). 467–470. 9 indexed citations
8.
Anselmi, Jonatha, Bernardo D’Auria, & Neil Walton. (2013). Closed Queueing Networks Under Congestion: Nonbottleneck Independence and Bottleneck Convergence. Mathematics of Operations Research. 38(3). 469–491. 11 indexed citations
9.
D’Auria, Bernardo. (2013). M/M/∞ Queue with ON-OFF Service Speeds. Journal of Mathematical Sciences. 196(1). 37–42. 1 indexed citations
10.
D’Auria, Bernardo & Offer Kella. (2012). Markov modulation of a two-sided reflected Brownian motion with application to fluid queues. Stochastic Processes and their Applications. 122(4). 1566–1581. 8 indexed citations
11.
D’Auria, Bernardo, et al.. (2010). First passage process of a Markov additive process, with applications to reflection problems. arXiv (Cornell University). 10(2). 1–16. 4 indexed citations
12.
D’Auria, Bernardo & Sidney I. Resnick. (2008). The influence of dependence on data network models. Advances in Applied Probability. 40(1). 60–94. 15 indexed citations
13.
D’Auria, Bernardo. (2008). M/M/∞ queues in semi-Markovian random environment. Queueing Systems. 58(3). 221–237. 32 indexed citations
14.
Avella, Pasquale, Bernardo D’Auria, Saverio Salerno, & Igor Vasil’ev. (2007). A computational study of local search algorithms for Italian high-school timetabling. Journal of Heuristics. 13(6). 543–556. 25 indexed citations
15.
D’Auria, Bernardo. (2007). $M/M/\infty$ queues in quasi-Markovian random environment. TU/e Research Portal (Eindhoven University of Technology). 1 indexed citations
16.
D’Auria, Bernardo, et al.. (2006). The influence of dependence on data network models of burstiness. eCommons (Cornell University). 2006022. 6 indexed citations
17.
D’Auria, Bernardo & Sidney I. Resnick. (2006). Data network models of burstiness. Advances in Applied Probability. 38(2). 373–404. 16 indexed citations
18.
D’Auria, Bernardo & Gennady Samorodnitsky. (2005). Limit Behavior of Fluid Queues and Networks. Operations Research. 53(6). 933–945. 7 indexed citations
19.
Avella, Pasquale, Bernardo D’Auria, & Saverio Salerno. (2005). A LP-based heuristic for a time-constrained routing problem. European Journal of Operational Research. 173(1). 120–124. 12 indexed citations
20.
Avella, Pasquale, Maurizio Boccia, & Bernardo D’Auria. (2005). Near-Optimal Solutions of Large-Scale Single-Machine Scheduling Problems. INFORMS journal on computing. 17(2). 183–191. 18 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

Rankless by CCL
2026