Nick Harvey and Neil Olver, Pipage Rounding, Pessimistic Estimators and Matrix Concentration, accepted to SODA 2014.

Neil Olver and Rico Zenklusen, Chain-Constrained Spanning Trees, IPCO 2013.

Michel Goemans, Neil Olver, Thomas Rothvoss and Rico Zenklusen, Matroids and Integrality Gaps for Hypergraphic Steiner Tree Relaxations, STOC 2012.

Omid Amini, Luc Devroye, Simon Griffiths, Neil Olver, On explosions in heavy-tailed branching random walks, Annals of Probability, 41(3B): pp1864-1899, 2013.

Richard Cole, Jose Correa, Vasilis Gkatzelis, Vahab Mirrokni and Neil Olver, Inner Product Spaces for MinSum Coordination Mechanisms, Games and Economic Behavior (in press). Extended abstract appeared in STOC 2011. (Some slides from a talk given at the 2011 Bellairs workshop on approximation algorithms.).

Neil Olver, Bruce Shepherd, Approximability of Robust Network Design, Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 1097-1105, 2010.

Navin Goyal, Neil Olver and Bruce Shepherd, "Dynamic vs Oblivious Routing in Network Design", accepted to Algorithmica. Conference version in Proceedings of the 17th Annual European Symposium on Algorithms (ESA), 2009.

Navin Goyal, Neil Olver and Bruce Shepherd, "The VPN Conjecture is True", Journal of the ACM, 60(3), 2013. Extended abstract appeared in STOC 2008.

Babak Farzad, Neil Olver and Adrian Vetta, "A Priority-Based Model of Routing", Chicago Journal of Theoretical Computer Science, 2008(1).

Louigi Addario-Berry, Neil Olver and Adrian Vetta, "A Polynomial Time Algorithm for Finding Nash Equilibria in Planar Win-Lose Games", Journal of Graph Algorithms and Applications 11(1): pp309-319, 2007.

N. Olver, I.V. Barashenkov, "Complex Sine-Gordon-2: A new algorithm for multivortex solutions on the plane", Theoretical and Mathematical Physics 144(2): pp1223-1226, 2005.


My PhD thesis, supervised by Bruce Shepherd and Adrian Vetta: Robust Network Design.

My MSc thesis, supervised by Adrian Vetta: The Price of Anarchy and a Priority-Based Model of Routing.