LSE creators

Number of items: 46.
Article
  • Olver, Neil, Sering, Leon, Vargas Koch, Laura (2025). Continuity, uniqueness and long-term behavior of Nash flows over time. Operations Research,
  • Olver, Neil, Schalekamp, Frans, van der Ster, Suzanne, Stougie, Leen, van Zuylen, Anke (2023). A duality based 2-approximation algorithm for maximum agreement forest. Mathematical Programming, 198(1), 811 - 853. https://doi.org/10.1007/s10107-022-01790-y picture_as_pdf
  • Frascaria, Dario, Olver, Neil (2022). Algorithms for flows over time with scheduling costs. Mathematical Programming: A Publication of the Mathematical Optimization Society, 192(1-2), 177 - 206. https://doi.org/10.1007/s10107-021-01725-z picture_as_pdf
  • Cominetti, Roberto, Correa, José, Olver, Neil (2022). Long-term behavior of dynamic equilibria in fluid queuing networks. Operations Research, 70(1), 516 - 526. https://doi.org/10.1287/opre.2020.2081 picture_as_pdf
  • de Kemp, Madelon A, Mandjes, Michel, Olver, Neil (2021). Performance of the smallest-variance-first rule in appointment sequencing. Operations Research, 69(6), 1909 - 1935. https://doi.org/10.1287/opre.2020.2025 picture_as_pdf
  • Beeson, Coulter, Olver, Neil (2021). A short proof of convexity of step-out–step-in sequencing games. Operations Research Letters, 49(2), 257 - 259. https://doi.org/10.1016/j.orl.2021.01.015 picture_as_pdf
  • Linhares, André, Olver, Neil, Swamy, Chaitanya, Zenklusen, Rico (2020). Approximate multi-matroid intersection via iterative refinement. Mathematical Programming: A Publication of the Mathematical Optimization Society, 183(1-2), 397 - 418. https://doi.org/10.1007/s10107-020-01524-y picture_as_pdf
  • Frascaria, Dario, Olver, Neil, Verhoef, Erik (2020). Emergent hypercongestion in Vickrey bottleneck networks. Transportation Research Part B: Methodological, 139, 523 - 538. https://doi.org/10.1016/j.trb.2020.07.010 picture_as_pdf
  • Olver, Neil, Végh, László A. (2020). A simpler and faster strongly polynomial algorithm for generalized flow maximization. Journal of the ACM, 67(2). https://doi.org/10.1145/3383454 picture_as_pdf
  • Olver, Neil, Zenklusen, Rico (2017). Chain-constrained spanning trees. Mathematical Programming, 167(2), 293 - 314. https://doi.org/10.1007/s10107-017-1126-7 picture_as_pdf
  • Feldmann, Andreas Emil, Könemann, Jochen, Olver, Neil, Sanitàa, Laura (2016). On the equivalence of the bidirected and hypergraphic relaxations for Steiner tree. Mathematical Programming, 160(1-2), 379 - 406. https://doi.org/10.1007/s10107-016-0987-5 picture_as_pdf
  • Olver, Neil (2016). A note on hierarchical hubbing for a generalization of the VPN problem. Operations Research Letters, 44(2), 191 - 195. https://doi.org/10.1016/j.orl.2015.12.020 picture_as_pdf
  • Amini, Omid, Devroye, Luc, Griffiths, Simon, Olver, Neil (2015). Explosion and linear transit times in infinite trees. Probability Theory and Related Fields, 167, 325 - 347. https://doi.org/10.1007/s00440-015-0683-z picture_as_pdf
  • Cole, Richard, Correa, Jose, Gkatzelis, Vasillis, Mirrokni, Vahab, Olver, Neil (2015). Decentralized utilitarian mechanisms for scheduling games. Games and Economic Behavior, 92, 306 - 326. https://doi.org/10.1016/j.geb.2013.03.011 picture_as_pdf
  • Olver, Neil, Bruce Shepherd, F. (2013). Approximability of Robust Network Design. Mathematics of Operations Research, 561 - 572. https://doi.org/10.1287/moor.2013.0620
  • Amini, Omid, Devroye, Luc, Griffiths, Simon, Olver, Neil (2013). On explosions in heavy-tailed branching random walks. Annals of Probability, 41(3B), 1864 - 1899. https://doi.org/10.1214/12-AOP806
  • Goyal, Navin, Olver, Neil, Bruce Shepherd, F. (2013). The VPN conjecture is true. Journal of the ACM, 60(3). https://doi.org/10.1145/2487241.2487243
  • Goyal, Navin, Olver, Neil, Bruce Shepherd, F. (2010). Dynamic vs Oblivious Routing in Network Design. Algorithmica, 61(1), 161 - 173. https://doi.org/10.1007/s00453-010-9455-4
    • Chapter
  • Dadush, Daniel, Koh, Zhuan Khye, Natura, Bento, Olver, Neil, Vegh, Laszlo A. (2025). A strongly polynomial algorithm for linear programs with at most two non-zero entries per row or column. In Beyersdorff, O, Pilipczuk, M, Pimentel, E, Thang, NK (Eds.), 42nd International Symposium On Theoretical Aspects Of Computer Science, Stacs 2025 . https://doi.org/10.4230/LIPIcs.STACS.2025.2 picture_as_pdf
  • Figiel, Aleksander, Korhonen, Janne H., Olver, Neil, Schmid, Stefan (2025). Efficient algorithms for demand-aware networks and a connection to virtual network embedding. In Bonomi, Silvia, Galletta, Letterio, Riviere, Etienne, Schiavoni, Valerio (Eds.), 28th International Conference on Principles of Distributed Systems, OPODIS 2024 . Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.OPODIS.2024.38 picture_as_pdf
  • Dadush, Daniel, Koh, Zhuan Khye, Natura, Bento, Olver, Neil, Végh, László A. (2024). A strongly polynomial algorithm for linear programs with at most two nonzero entries per row or column. In Mohar, Bojan, Shinkar, Igor, O�Donnell, Ryan (Eds.), STOC 2024: Proceedings of the 56th Annual ACM Symposium on Theory of Computing (STOC ’24), June 24–28 (pp. 1561 – 1572). ACM Press. https://doi.org/10.1145/3618260.3649764 picture_as_pdf
  • Olver, Neil, Sering, Leon, Vargas Koch, Laura (2023). Convergence of approximate and packet routing equilibria to Nash flows over time. In Proceedings of the 64th IEEE Symposium on Foundations of Computer Science (FOCS (pp. 123 - 133). IEEE Computer Society Press. https://doi.org/10.1109/FOCS57990.2023.00016 picture_as_pdf
  • Klein, Nathan, Olver, Neil (2023). Thin trees for laminar families. In 2023 IEEE 64th Annual Symposium on Foundations of Computer Science: FOCS 2023, Proceedings . IEEE Computer Society Press. https://doi.org/10.1109/FOCS57990.2023.00011 picture_as_pdf
  • Olver, Neil, Sering, Leon, Vargas Koch, Laura (2022). Continuity, uniqueness and long-term behavior of Nash flows over time. In IEEE Symposium on Foundations of Computer Science (FOCS) 2022 . IEEE Press. picture_as_pdf
  • Borst, Sander, Dadush, Daniel, Olver, Neil, Sinha, Makrand (2021). Majorizing measures for the optimizer. In Lee, James R. (Ed.), 12th Innovations in Theoretical Computer Science Conference, ITCS 2021 . Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ITCS.2021.73 picture_as_pdf
  • Frascaria, Dario, Olver, Neil (2020). Algorithms for flows over time with scheduling costs. In Bienstock, Daniel, Zambelli, Giacomo (Eds.), Integer Programming and Combinatorial Optimization - 21st International Conference, IPCO 2020, Proceedings (pp. 130 - 143). Springer Berlin / Heidelberg. https://doi.org/10.1007/978-3-030-45771-6_11 picture_as_pdf
  • Bosman, Thomas, Olver, Neil (2020). Improved approximation algorithms for inventory problems. In Bienstock, Daniel, Zambelli, Giacomo (Eds.), Integer Programming and Combinatorial Optimization - 21st International Conference, IPCO 2020, Proceedings (pp. 91 - 103). Springer Berlin / Heidelberg. https://doi.org/10.1007/978-3-030-45771-6_8 picture_as_pdf
  • Linhares, Andre, Olver, Neil, Swamy, Chaitanya, Zenklusen, Rico (2019). Approximate multi-matroid intersection via iterative refinement. In Lodi, Andrea, Nagarajan, Viswanath (Eds.), Integer Programming and Combinatorial Optimization: 20th International Conference, IPCO 2019, Proceedings (pp. 299 - 312). Springer Berlin / Heidelberg. https://doi.org/10.1007/978-3-030-17953-3_23
  • Bosman, Thomas, Frascaria, Dario, Olver, Neil, Sitters, Rene, Stougie, Leen (2019). Fixed-order scheduling on parallel machines. In Lodi, Andrea, Nagarajan, Viswanath (Eds.), Integer Programming and Combinatorial Optimization: 20th International Conference, IPCO 2019, Proceedings (pp. 88 - 100). Springer Berlin / Heidelberg. https://doi.org/10.1007/978-3-030-17953-3_7
  • Olver, Neil, Pruhs, Kirk, Schewior, Kevin, Sitters, Rene, Stougie, Leen (2018). The itinerant list update problem. In Epstein, L, Erlebach, T (Eds.), Approximation and Online Algorithms: WAOA 2018 (pp. 310-326). Springer Berlin / Heidelberg. https://doi.org/10.1007/978-3-030-04693-4_19
  • Olver, Neil, Végh, László A. (2017). A simpler and faster strongly polynomial algorithm for generalized flow maximization. In STOC: ACM Symposium on Theory of Computing (pp. 100 - 111). ACM Press. https://doi.org/10.1145/3055399.3055439
  • Cominetti, Roberto, Correa, Jose, Olver, Neil (2017). Long term behavior of dynamic equilibria in fluid queuing networks. In IPCO: International Conference on Integer Programming and Combinatorial Optimization (pp. 161-172). Springer Berlin / Heidelberg. https://doi.org/10.1007/978-3-319-59250-3_14
  • Harvey, Nicholas J.A., Olver, Neil (2014). Pipage rounding, pessimistic estimators and matrix concentration. In SODA '14: Symposium on Discrete Algorithms (pp. 926-945). Society for Industrial and Applied Mathematics.
    • Conference or Workshop Item
  • Dadush, Daniel, Guzmán, Cristóbal, Olver, Neil (2018-01-07 - 2018-01-10) Fast, deterministic and sparse dimensionality reduction [Paper]. ACM SIAM Symposium on Discrete Algorithms, Astor Crowne Plaza, New Orleans, United States, USA. https://doi.org/10.1137/1.9781611975031.87
  • Bosman, Thomas, Olver, Neil (2018-09-04 - 2018-09-08) Exploring the tractability of the capped hose model [Paper]. Proceedings of the 25th Annual European Symposium on Algorithms (ESA): ALGO 2017, Vienna, Vienns, Austria, AUT. https://doi.org/10.4230/LIPIcs.ESA.2017.19
  • Könemann, Jochen, Olver, Neil, Pashkovich, Kanstantsin, Ravi, R, Swamy, Chaitanya, Vygen, Jens (2017-08-16 - 2017-08-18) On the integrality gap of the prize-collecting steiner forest LP [Paper]. Approx 2017 - Random 2017, UC Berkley, Berkley, United States, USA. https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.17
  • Olver, Neil, Végh, László A. (2017-06-19 - 2017-06-23) A simpler and faster strongly polynomial algorithm for generalized flow maximization [Paper]. STOC 2017 Theory Fest: 49th Annual ACM Symposium on the Theory of Computing, Hyatt Regency, Montreal, Montreal, Canada, CAN.
  • Correa, Jose, Kiwi, Marcos, Olver, Neil, Vera, Alberto (2015-12-09 - 2015-12-12) Adaptive Rumor Spreading [Paper]. WINE 2015: the 11th conference on web and internet economics, Amsterdam, Amsterdam, Netherlands, NLD. https://doi.org/10.1007/978-3-662-48995-6_20
  • Feldmann, Andreas Emil, Könemann, Jochen, Olver, Neil, Sanitàa, Laura (2014-09-04 - 2014-09-06) On the equivalence of the bidirected and hypergraphic relaxations for Steiner tree [Paper]. 17th. International Workshop on Approximation Algorithms for Combinatorial Optimization Problems: Random-Approx 2014, Universitat Politècnica de Catalunya (UPC), Barcelona, Spain, ESP. https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.176
  • Olver, Neil, Zenklusen, Rico (2013-03-18 - 2013-03-20) Chain-constrained spanning trees [Paper]. The 16th Conference on Integer Programming and Combinatorial Optimization, Universidad Técnica Federico Santa María, Valparaiso, Chile, CHL. https://doi.org/10.1007%2F978-3-642-36694-9_28
  • Goemans, Michel, Olver, Neil, Rothvoß, Thomas, Zenklusen, Rico (2012-05-19 - 2012-05-22) Matroids and integrality gaps for hypergraphic steiner tree relaxations [Paper]. STOC 2012 - 44th ACM Symposium on Theory of Computing, New York, United States, USA. https://doi.org/10.1145/2213977.2214081
  • Cole, Richard, Correa, Jose, Gkatzelis, Vasillis, Mirrokni, Vahab, Olver, Neil (2011-06-06 - 2011-06-08) Decentralized utilitarian mechanisms for scheduling games [Paper]. 43rd ACM Symposium on Theory of Computing, San Jose, California, San Jose, United States, USA.
  • Olver, Neil, Shepherd, Bruce (2010-01-17 - 2010-01-19) Approximability of robust network design [Paper]. ACM-SIAM Symposium on Discrete Algorithms, Hyatt Regency Austin, Austin, United States, USA.
  • Goyal, Navin, Olver, Neil, Shepherd, Bruce (2009-09-07 - 2009-09-09) Dynamic vs oblivious routing in network design [Paper]. 17th Annual European Symposium on Algorithms, University of Copenhagen, Copenhagen, Denmark, DNK.
    • Blog post
  • Olver, Neil, Wolfram, Conrad (17 June 2025) Fixing education for the AI age: Conrad Wolfram. Maths@LSE Blog. picture_as_pdf
  • Olver, Neil (21 June 2024) Favourite open problems: Prof. Benny Sudakov. Maths@LSE Blog. picture_as_pdf