Neil Olver - RankMe

60 papers A* 11A 4B 8Journal 34Unranked 3

Year	Rank	Type	Title / Venue / Authors
2025	A	`conf`	A Strongly Polynomial Algorithm for Linear Programs with at Most Two Non-Zero Entries per Row or Column (Invited Talk). STACS Daniel Dadush, Zhuan Khye Koh, Bento Natura, Neil Olver, László A. Végh
2024	A*	`conf`	A Strongly Polynomial Algorithm for Linear Programs with At Most Two Nonzero Entries per Row or Column. STOC Daniel Dadush, Zhuan Khye Koh, Bento Natura, Neil Olver, László A. Végh
2024	J	`jnl`	Convergence of Approximate and Packet Routing Equilibria to Nash Flows Over Time. CoRR Neil Olver, Leon Sering, Laura Vargas Koch
2024	B	`conf`	Efficient Algorithms for Demand-Aware Networks and a Connection to Virtual Network Embedding. OPODIS Aleksander Figiel, Janne H. Korhonen, Neil Olver, Stefan Schmid
2023	J	`jnl`	A duality based 2-approximation algorithm for maximum agreement forest. Math. Program. Neil Olver, Frans Schalekamp, Suzanne van der Ster, Leen Stougie, Anke van Zuylen
2023	A*	`conf`	Convergence of Approximate and Packet Routing Equilibria to Nash Flows Over Time. FOCS Neil Olver, Leon Sering, Laura Vargas Koch
2023	J	`jnl`	Demand-Aware Network Design with Steiner Nodes and a Connection to Virtual Network Embedding. CoRR Aleksander Figiel, Janne H. Korhonen, Neil Olver, Stefan Schmid
2023	A*	`conf`	Thin Trees for Laminar Families. FOCS Nathan Klein, Neil Olver
2023	J	`jnl`	Thin trees for laminar families. CoRR Nathan Klein, Neil Olver
2022	J	`jnl`	Algorithms for flows over time with scheduling costs. Math. Program. Dario Frascaria, Neil Olver
2022	J	`jnl`	Long-Term Behavior of Dynamic Equilibria in Fluid Queuing Networks. Oper. Res. Roberto Cominetti, José Correa, Neil Olver
2021	J	`jnl`	A Short Proof of Convexity of Step-out Step-in Sequencing Games. CoRR Coulter Beeson, Neil Olver
2021	J	`jnl`	A short proof of convexity of step-out-step-in sequencing games. Oper. Res. Lett. Coulter Beeson, Neil Olver
2021	A*	`conf`	Continuity, Uniqueness and Long-Term Behavior of Nash Flows Over Time. FOCS Neil Olver, Leon Sering, Laura Vargas Koch
2021	J	`jnl`	Continuity, Uniqueness and Long-Term Behavior of Nash Flows Over Time. CoRR Neil Olver, Leon Sering, Laura Vargas Koch
2021	J	`jnl`	Long term behavior of dynamic equilibria in fluid queuing networks. CoRR Roberto Cominetti, José Correa, Neil Olver
2021	A	`conf`	Majorizing Measures for the Optimizer. ITCS Sander Borst, Daniel Dadush, Neil Olver, Makrand Sinha
2021	J	`jnl`	Performance of the Smallest-Variance-First Rule in Appointment Sequencing. Oper. Res. Madelon A. de Kemp, Michel Mandjes, Neil Olver
2020	J	`jnl`	A Simpler and Faster Strongly Polynomial Algorithm for Generalized Flow Maximization. J. ACM Neil Olver, László A. Végh
2020	B	`conf`	Algorithms for Flows over Time with Scheduling Costs. IPCO Dario Frascaria, Neil Olver
2020	J	`jnl`	Approximate multi-matroid intersection via iterative refinement. Math. Program. André Linhares, Neil Olver, Chaitanya Swamy, Rico Zenklusen
2020	B	`conf`	Improved Approximation Algorithms for Inventory Problems. IPCO Thomas Bosman, Neil Olver
2020	J	`jnl`	Majorizing Measures for the Optimizer. CoRR Sander Borst, Daniel Dadush, Neil Olver, Makrand Sinha
2019	J	`jnl`	Algorithms for flows over time with scheduling costs. CoRR Dario Frascaria, Neil Olver
2019	B	`conf`	Approximate Multi-matroid Intersection via Iterative Refinement. IPCO André Linhares, Neil Olver, Chaitanya Swamy, Rico Zenklusen
2019	B	`conf`	Fixed-Order Scheduling on Parallel Machines. IPCO Thomas Bosman, Dario Frascaria, Neil Olver, René Sitters, Leen Stougie
2019	J	`jnl`	Improved Approximation Algorithms for Inventory Problems. CoRR Thomas Bosman, Neil Olver
2018	J	`jnl`	A Duality Based 2-Approximation Algorithm for Maximum Agreement Forest. CoRR Neil Olver, Frans Schalekamp, Suzanne van der Ster, Leen Stougie, Anke van Zuylen
2018	J	`jnl`	Approximate Multi-Matroid Intersection via Iterative Refinement. CoRR André Linhares, Neil Olver, Chaitanya Swamy, Rico Zenklusen
2018	J	`jnl`	Chain-constrained spanning trees. Math. Program. Neil Olver, Rico Zenklusen
2018	A*	`conf`	Fast, Deterministic and Sparse Dimensionality Reduction. SODA Daniel Dadush, Cristóbal Guzmán, Neil Olver
2018	J	`jnl`	Performance of the smallest-variance-first rule in appointment sequencing. CoRR Madelon A. de Kemp, Michel Mandjes, Neil Olver
2018	B	`conf`	The Itinerant List Update Problem. WAOA Neil Olver, Kirk Pruhs, Kevin Schewior, René Sitters, Leen Stougie
2017	A*	`conf`	A simpler and faster strongly polynomial algorithm for generalized flow maximization. STOC Neil Olver, László A. Végh
2017	A	`conf`	Exploring the Tractability of the Capped Hose Model. ESA Thomas Bosman, Neil Olver
2017	B	`conf`	Long Term Behavior of Dynamic Equilibria in Fluid Queuing Networks. IPCO Roberto Cominetti, José Correa, Neil Olver
2017	—	`conf`	On the Integrality Gap of the Prize-Collecting Steiner Forest LP. APPROX-RANDOM Jochen Könemann, Neil Olver, Kanstantsin Pashkovich, R. Ravi, Chaitanya Swamy, Jens Vygen
2017	J	`jnl`	On the Integrality Gap of the Prize-Collecting Steiner Forest LP. CoRR Jochen Könemann, Neil Olver, Kanstantsin Pashkovich, R. Ravi, Chaitanya Swamy, Jens Vygen
2016	J	`jnl`	A Simpler and Faster Strongly Polynomial Algorithm for Generalized Flow Maximization. CoRR Neil Olver, László A. Végh
2016	J	`jnl`	A note on hierarchical hubbing for a generalization of the VPN problem. Oper. Res. Lett. Neil Olver
2016	J	`jnl`	On the equivalence of the bidirected and hypergraphic relaxations for Steiner tree. Math. Program. Andreas Emil Feldmann, Jochen Könemann, Neil Olver, Laura Sanità
2015	—	`conf`	Adaptive Rumor Spreading. WINE José Correa, Marcos A. Kiwi, Neil Olver, Alberto Vera
2015	J	`jnl`	Decentralized utilitarian mechanisms for scheduling games. Games Econ. Behav. Richard Cole, José R. Correa, Vasilis Gkatzelis, Vahab S. Mirrokni, Neil Olver
2014	J	`jnl`	A note on hierarchical hubbing for a generalization of the VPN problem. CoRR Neil Olver
2014	J	`jnl`	Approximability of Robust Network Design. Math. Oper. Res. Neil Olver, F. Bruce Shepherd
2014	—	`conf`	On the Equivalence of the Bidirected and Hypergraphic Relaxations for Steiner Tree. APPROX-RANDOM Andreas Emil Feldmann, Jochen Könemann, Neil Olver, Laura Sanità
2014	A*	`conf`	Pipage Rounding, Pessimistic Estimators and Matrix Concentration. SODA Nicholas J. A. Harvey, Neil Olver
2013	B	`conf`	Chain-Constrained Spanning Trees. IPCO Neil Olver, Rico Zenklusen
2013	J	`jnl`	Dynamic vs Oblivious Routing in Network Design. CoRR Navin Goyal, Neil Olver, F. Bruce Shepherd
2013	J	`jnl`	Pipage Rounding, Pessimistic Estimators and Matrix Concentration. CoRR Nicholas J. A. Harvey, Neil Olver
2013	J	`jnl`	The VPN Conjecture Is True. J. ACM Navin Goyal, Neil Olver, F. Bruce Shepherd
2012	A*	`conf`	Matroids and integrality gaps for hypergraphic steiner tree relaxations. STOC Michel X. Goemans, Neil Olver, Thomas Rothvoß, Rico Zenklusen
2011	J	`jnl`	Dynamic vs. Oblivious Routing in Network Design. Algorithmica Navin Goyal, Neil Olver, F. Bruce Shepherd
2011	A*	`conf`	Inner product spaces for MinSum coordination mechanisms. STOC Richard Cole, José R. Correa, Vasilis Gkatzelis, Vahab S. Mirrokni, Neil Olver
2011	J	`jnl`	Matroids and Integrality Gaps for Hypergraphic Steiner Tree Relaxations CoRR Michel X. Goemans, Neil Olver, Thomas Rothvoß, Rico Zenklusen
2010	A*	`conf`	Approximability of Robust Network Design. SODA Neil Olver, F. Bruce Shepherd
2009	A	`conf`	Dynamic vs. Oblivious Routing in Network Design. ESA Navin Goyal, Neil Olver, F. Bruce Shepherd
2008	J	`jnl`	A Priority-Based Model of Routing. Chic. J. Theor. Comput. Sci. Babak Farzad, Neil Olver, Adrian Vetta
2008	A*	`conf`	The vpn conjecture is true. STOC Navin Goyal, Neil Olver, F. Bruce Shepherd
2007	J	`jnl`	A Polynomial Time Algorithm for Finding Nash Equilibria in Planar Win-Lose Games. J. Graph Algorithms Appl. Louigi Addario-Berry, Neil Olver, Adrian Vetta