Neil Olver

542 total citations
24 papers, 195 citations indexed

About

Neil Olver is a scholar working on Computational Theory and Mathematics, Management Science and Operations Research and Computer Networks and Communications. According to data from OpenAlex, Neil Olver has authored 24 papers receiving a total of 195 indexed citations (citations by other indexed papers that have themselves been cited), including 14 papers in Computational Theory and Mathematics, 6 papers in Management Science and Operations Research and 5 papers in Computer Networks and Communications. Recurrent topics in Neil Olver's work include Complexity and Algorithms in Graphs (11 papers), Advanced Graph Theory Research (8 papers) and Game Theory and Applications (4 papers). Neil Olver is often cited by papers focused on Complexity and Algorithms in Graphs (11 papers), Advanced Graph Theory Research (8 papers) and Game Theory and Applications (4 papers). Neil Olver collaborates with scholars based in Netherlands, Canada and United States. Neil Olver's co-authors include F. Bruce Shepherd, Navin Goyal, Adrian Vetta, José Correa, Vasilis Gkatzelis, Vahab Mirrokni, Richard Cole, Michel Mandjes, László A. Végh and Rico Zenklusen and has published in prestigious journals such as Operations Research, Journal of the ACM and Transportation Research Part B Methodological.

In The Last Decade

Neil Olver

22 papers receiving 184 citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
Neil Olver Netherlands	9	83	60	55	38	34	24	195
Andreas Darmann Austria	8	81 1.0×	55 0.9×	97 1.8×	103 2.7×	42 1.2×	33	234
Akash Nanavati United States	3	108 1.3×	79 1.3×	14 0.3×	41 1.1×	24 0.7×	4	153
Nir Andelman Israel	6	127 1.5×	135 2.3×	18 0.3×	72 1.9×	16 0.5×	6	218
Łukasz Kruk Poland	8	33 0.4×	51 0.8×	14 0.3×	25 0.7×	9 0.3×	32	156
Ana da Silva Soares Belgium	10	184 2.2×	45 0.8×	47 0.9×	14 0.4×	24 0.7×	12	339
Anureet Saxena United States	7	83 1.0×	15 0.3×	113 2.1×	11 0.3×	64 1.9×	13	256
Bernardo D’Auria Spain	10	116 1.4×	68 1.1×	7 0.1×	15 0.4×	48 1.4×	30	257
Josh Reed United States	10	103 1.2×	37 0.6×	6 0.1×	37 1.0×	22 0.6×	26	263
Fatma Kılınç-Karzan United States	9	92 1.1×	8 0.1×	59 1.1×	10 0.3×	30 0.9×	26	207
David Gamarnik United States	6	68 0.8×	89 1.5×	12 0.2×	15 0.4×	9 0.3×	7	227

Countries citing papers authored by Neil Olver

Since Specialization

Citations

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

Fields of papers citing papers by Neil Olver

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Neil Olver

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

Dadush, Daniel, et al.. (2024). A Strongly Polynomial Algorithm for Linear Programs with At Most Two Nonzero Entries per Row or Column. London School of Economics and Political Science Research Online (London School of Economics and Political Science). 1561–1572.

Olver, Neil, et al.. (2022). A duality based 2-approximation algorithm for maximum agreement forest. Mathematical Programming. 198(1). 811–853. 2 indexed citations

Cominetti, Roberto, José Correa, & Neil Olver. (2021). Long-Term Behavior of Dynamic Equilibria in Fluid Queuing Networks. Operations Research. 70(1). 516–526. 1 indexed citations

Olver, Neil, et al.. (2020). Emergent hypercongestion in Vickrey bottleneck networks. Transportation Research Part B Methodological. 139. 523–538. 2 indexed citations

Mandjes, Michel, et al.. (2018). . arXiv (Cornell University). 15 indexed citations

Olver, Neil & László A. Végh. (2017). A simpler and faster strongly polynomial algorithm for generalized flow maximization. London School of Economics and Political Science Research Online (London School of Economics and Political Science). 100–111. 7 indexed citations

Olver, Neil & Rico Zenklusen. (2017). Chain-constrained spanning trees. Mathematical Programming. 167(2). 293–314.

Könemann, Jochen, Neil Olver, Kanstantsin Pashkovich, et al.. (2017). On the Integrality Gap of the Prize-Collecting Steiner Forest LP. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 13. 3 indexed citations

Feldmann, Andreas Emil, Jochen Könemann, Neil Olver, & Laura Sanità. (2016). On the equivalence of the bidirected and hypergraphic relaxations for Steiner tree. Mathematical Programming. 160(1-2). 379–406. 8 indexed citations

10.

Amini, Omid, Luc Devroye, Simon Griffiths, & Neil Olver. (2015). Explosion and linear transit times in infinite trees. Probability Theory and Related Fields. 167(1-2). 325–347. 4 indexed citations

11.

Olver, Neil & F. Bruce Shepherd. (2013). Approximability of Robust Network Design. Mathematics of Operations Research. 39(2). 561–572. 1 indexed citations

12.

Cole, Richard, José Correa, Vasilis Gkatzelis, Vahab Mirrokni, & Neil Olver. (2013). Decentralized utilitarian mechanisms for scheduling games. Games and Economic Behavior. 92. 306–326. 26 indexed citations

13.

Goemans, Michel X., Neil Olver, Thomas Rothvoß, & Rico Zenklusen. (2012). Matroids and integrality gaps for hypergraphic steiner tree relaxations. VU Research Portal. 1161–1176. 16 indexed citations

14.

Cole, Richard, José Correa, Vasilis Gkatzelis, Vahab Mirrokni, & Neil Olver. (2011). Inner product spaces for MinSum coordination mechanisms. 539–548. 15 indexed citations

15.

Olver, Neil & F. Bruce Shepherd. (2010). Approximability of Robust Network Design. 1097–1105. 2 indexed citations

16.

Goyal, Navin, Neil Olver, & F. Bruce Shepherd. (2010). Dynamic vs. Oblivious Routing in Network Design. Algorithmica. 61(1). 161–173. 11 indexed citations

17.

Olver, Neil. (2010). Robust network design. eScholarship@McGill (McGill). 13 indexed citations

18.

Olver, Neil, et al.. (2008). A Priority-based Model of Routing. Data Archiving and Networked Services (DANS). 2008(1). 1. 20 indexed citations

19.

Olver, Neil, et al.. (2008). . 14(1). 1–29. 10 indexed citations

20.

Goyal, Navin, Neil Olver, & F. Bruce Shepherd. (2008). The VPN conjecture is true. 443–450. 21 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