Publications
Neil Olver, Bruce Shepherd, Approximability of Robust Network Design, accepted to the ACM-SIAM Symposium on Discrete Algorithms (SODA), 2010.
Navin Goyal, Neil Olver and Bruce Shepherd, "Dynamic vs Oblivious Routing in Network Design", accepted to the 17th Annual European Symposium on Algorithms (ESA), 2009.
Navin Goyal, Neil Olver and Bruce Shepherd, "The VPN Conjecture is True". Proceedings of the 40th ACM Symposium on Theory of Computing (STOC), pages 443--450, 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.
My MSc thesis, supervised by Adrian Vetta: The Price of Anarchy and a Priority-Based Model of Routing.
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. (Based on work done in an undergraduate project under the supervision of Prof. Barashenkov).
