A Polynomial Time Algorithm for Finding Nash Equilibria in Planar Win-Lose Games. - Louigi Addario-Berry; Neil Olver; Adrian Vetta (J. Graph Algorithms Appl., 2007)

A Priority-Based Model of Routing. - Babak Farzad; Neil Olver; Adrian Vetta (Chic. J. Theor. Comput. Sci., 2008)

Inner product spaces for MinSum coordination mechanisms. - Richard Cole 001; José R. Correa; Vasilis Gkatzelis; Vahab S. Mirrokni; Neil Olver (STOC, 2011)

Dynamic vs. Oblivious Routing in Network Design. - Navin Goyal; Neil Olver; F. Bruce Shepherd (Algorithmica, 2011)

Matroids and integrality gaps for hypergraphic steiner tree relaxations. - Michel X. Goemans; Neil Olver; Thomas Rothvoß; Rico Zenklusen (STOC, 2012)

The VPN Conjecture Is True. - Navin Goyal; Neil Olver; F. Bruce Shepherd (J. ACM, 2013)

Pipage Rounding, Pessimistic Estimators and Matrix Concentration. - Nicholas J. A. Harvey; Neil Olver (SODA, 2014)

Approximability of Robust Network Design. - Neil Olver; F. Bruce Shepherd (Math. Oper. Res., 2014)

Adaptive Rumor Spreading. - José Correa 001; Marcos A. Kiwi; Neil Olver; Alberto Vera (WINE, 2015)

Decentralized utilitarian mechanisms for scheduling games. - Richard Cole 001; José R. Correa; Vasilis Gkatzelis; Vahab S. Mirrokni; Neil Olver (Games Econ. Behav., 2015)

On the equivalence of the bidirected and hypergraphic relaxations for Steiner tree. - Andreas Emil Feldmann; Jochen Könemann; Neil Olver; Laura Sanità (Math. Program., 2016)

A note on hierarchical hubbing for a generalization of the VPN problem. - Neil Olver (Oper. Res. Lett., 2016)

On the Integrality Gap of the Prize-Collecting Steiner Forest LP. - Jochen Könemann; Neil Olver; Kanstantsin Pashkovich; R. Ravi 001; Chaitanya Swamy; Jens Vygen (APPROX-RANDOM, 2017)

Exploring the Tractability of the Capped Hose Model. - Thomas Bosman; Neil Olver (ESA, 2017)

Fast, Deterministic and Sparse Dimensionality Reduction. - Daniel Dadush; Cristóbal Guzmán; Neil Olver (SODA, 2018)

The Itinerant List Update Problem. - Neil Olver; Kirk Pruhs; Kevin Schewior; René Sitters; Leen Stougie (WAOA, 2018)

Chain-constrained spanning trees. - Neil Olver; Rico Zenklusen (Math. Program., 2018)

Fixed-Order Scheduling on Parallel Machines. - Thomas Bosman; Dario Frascaria; Neil Olver; René Sitters; Leen Stougie (IPCO, 2019)

Improved Approximation Algorithms for Inventory Problems. - Thomas Bosman; Neil Olver (IPCO, 2020)

A Simpler and Faster Strongly Polynomial Algorithm for Generalized Flow Maximization. - Neil Olver; László A. Végh (J. ACM, 2020)

Approximate multi-matroid intersection via iterative refinement. - André Linhares; Neil Olver; Chaitanya Swamy; Rico Zenklusen (Math. Program., 2020)

Continuity, Uniqueness and Long-Term Behavior of Nash Flows Over Time. - Neil Olver; Leon Sering; Laura Vargas Koch (FOCS, 2021)

Majorizing Measures for the Optimizer. - Sander Borst; Daniel Dadush; Neil Olver; Makrand Sinha (ITCS, 2021)

Performance of the Smallest-Variance-First Rule in Appointment Sequencing. - Madelon A. de Kemp; Michel Mandjes; Neil Olver (Oper. Res., 2021)

A short proof of convexity of step-out-step-in sequencing games. - Coulter Beeson; Neil Olver (Oper. Res. Lett., 2021)

Long-Term Behavior of Dynamic Equilibria in Fluid Queuing Networks. - Roberto Cominetti; José Correa 001; Neil Olver (Oper. Res., 2022)

Algorithms for flows over time with scheduling costs. - Dario Frascaria; Neil Olver (Math. Program., 2022)

Thin Trees for Laminar Families. - Nathan Klein; Neil Olver (FOCS, 2023)

Convergence of Approximate and Packet Routing Equilibria to Nash Flows Over Time. - Neil Olver; Leon Sering; Laura Vargas Koch (FOCS, 2023)

Demand-Aware Network Design with Steiner Nodes and a Connection to Virtual Network Embedding. - Aleksander Figiel; Janne H. Korhonen; Neil Olver; Stefan Schmid 001 (CoRR, 2023)

A duality based 2-approximation algorithm for maximum agreement forest. - Neil Olver; Frans Schalekamp; Suzanne van der Ster; Leen Stougie; Anke van Zuylen (Math. Program., 2023)

Efficient Algorithms for Demand-Aware Networks and a Connection to Virtual Network Embedding. - Aleksander Figiel; Janne H. Korhonen; Neil Olver; Stefan Schmid 001 (OPODIS, 2024)

A Strongly Polynomial Algorithm for Linear Programs with At Most Two Nonzero Entries per Row or Column. - Daniel Dadush; Zhuan Khye Koh; Bento Natura; Neil Olver; László A. Végh (STOC, 2024)

A Strongly Polynomial Algorithm for Linear Programs with at Most Two Non-Zero Entries per Row or Column (Invited Talk). - Daniel Dadush; Zhuan Khye Koh; Bento Natura; Neil Olver; László A. Végh (STACS, 2025)