| 2026 | ESA | Improved Bounds for Strategy Improvement Algorithms for Energy Games. | Dani Dorfman, Haim Kaplan, Uri Zwick |
| 2026 | SODA | MAX BISECTION might be harder to approximate than MAX CUT. | Joshua Brakensiek, Neng Huang, Aaron Potechin, Uri Zwick |
| 2026 | STOC | Improved Approximation Algorithms for Multiway Cut by Large Mixtures of New and Old Rounding Schemes. | Joshua Brakensiek, Neng Huang, Aaron Potechin, Uri Zwick |
| 2025 | ICALP | Faster All-Pairs Optimal Electric Car Routing. | Dani Dorfman, Haim Kaplan, Robert E. Tarjan, Mikkel Thorup, Uri Zwick |
| 2025 | SODA | All-Hops Shortest Paths. | Virginia Vassilevska Williams, Zoe Xi, Yinzhan Xu, Uri Zwick |
| 2024 | SODA | Tight approximability of MAX 2-SAT and relatives, under UGC. | Joshua Brakensiek, Neng Huang, Uri Zwick |
| 2023 | ESA | Optimal Energetic Paths for Electric Cars. | Dani Dorfman, Haim Kaplan, Robert E. Tarjan, Uri Zwick |
| 2023 | FOCS | Separating MAX 2-AND, MAX DI-CUT and MAX CUT. | Joshua Brakensiek, Neng Huang, Aaron Potechin, Uri Zwick |
| 2023 | SODA | Improved girth approximation in weighted undirected graphs. | Avi Kadria, Liam Roditty, Aaron Sidford, Virginia Vassilevska Williams, Uri Zwick |
| 2022 | SODA | Algorithmic trade-offs for girth approximation in undirected graphs. | Avi Kadria, Liam Roditty, Aaron Sidford, Virginia Vassilevska Williams, Uri Zwick |
| 2022 | SODA | Simulating a stack using queues. | Haim Kaplan, Robert E. Tarjan, Or Zamir, Uri Zwick |
| 2021 | SODA | On the Mysteries of MAX NAE-SAT. | Joshua Brakensiek, Neng Huang, Aaron Potechin, Uri Zwick |
| 2019 | FOCS | Random k-out Subgraph Leaves only O(n/k) Inter-Component Edges. | Jacob Holm, Valerie King, Mikkel Thorup, Or Zamir, Uri Zwick |
| 2019 | ICALP | A Faster Deterministic Exponential Time Algorithm for Energy Games and Mean Payoff Games. | Dani Dorfman, Haim Kaplan, Uri Zwick |
| 2019 | ICALP | Dynamic Ordered Sets with Approximate Queries, Approximate Heaps and Soft Heaps. | Mikkel Thorup, Or Zamir, Uri Zwick |
| 2019 | SODA | Selection from Heaps, Row-Sorted Matrices, and X+Y Using Soft Heaps. | Haim Kaplan, Lszl Kozma, Or Zamir, Uri Zwick |
| 2019 | SODA | A sort of an adversary. | Haim Kaplan, Or Zamir, Uri Zwick |
| 2019 | STOC | Faster | Thomas Dueholm Hansen, Haim Kaplan, Or Zamir, Uri Zwick |
| 2018 | ESA | Improved Bounds for Multipass Pairing Heaps and Path-Balanced Binary Search Trees. | Dani Dorfman, Haim Kaplan, Lszl Kozma, Seth Pettie, Uri Zwick |
| 2018 | MFCS | Pairing heaps: the forward variant. | Dani Dorfman, Haim Kaplan, Lszl Kozma, Uri Zwick |
| 2016 | ICALP | Random-Edge Is Slower Than Random-Facet on Abstract Cubes. | Thomas Dueholm Hansen, Uri Zwick |
| 2016 | STACS | Bottleneck Paths and Trees and Deterministic Graphical Games. | Shiri Chechik, Haim Kaplan, Mikkel Thorup, Or Zamir, Uri Zwick |
| 2016 | SIROCCO | Public vs. Private Randomness in Simultaneous Multi-party Communication Complexity. | Orr Fischer, Rotem Oshman, Uri Zwick |
| 2015 | ICALP | Hollow Heaps. | Thomas Dueholm Hansen, Haim Kaplan, Robert Endre Tarjan, Uri Zwick |
| 2015 | SODA | The amortized cost of finding the minimum. | Haim Kaplan, Or Zamir, Uri Zwick |
| 2015 | STOC | Adjacency Labeling Schemes and Induced-Universal Graphs. | Stephen Alstrup, Haim Kaplan, Mikkel Thorup, Uri Zwick |
| 2015 | STOC | An Improved Version of the Random-Facet Pivoting Rule for the Simplex Algorithm. | Thomas Dueholm Hansen, Uri Zwick |
| 2014 | ICALP | Listing Triangles. | Andreas Bjrklund, Rasmus Pagh, Virginia Vassilevska Williams, Uri Zwick |
| 2014 | SODA | Dantzig's pivoting rule for shortest paths, deterministic MDPs, and minimum cost to time ratio cycles. | Thomas Dueholm Hansen, Haim Kaplan, Uri Zwick |
| 2014 | SODA | Improved upper bounds for Random-Edge and Random-Jump on abstract cubes. | Thomas Dueholm Hansen, Mike Paterson, Uri Zwick |
| 2013 | FOCS | A Forward-Backward Single-Source Shortest Paths Algorithm. | David B. Wilson, Uri Zwick |
| 2011 | SODA | A subexponential lower bound for the Random Facet algorithm for Parity Games. | Oliver Friedmann, Thomas Dueholm Hansen, Uri Zwick |
| 2011 | SODA | Collapse. | Gnter Rote, Uri Zwick |
| 2011 | STOC | Subexponential lower bounds for randomized pivoting rules for the simplex algorithm. | Oliver Friedmann, Thomas Dueholm Hansen, Uri Zwick |
| 2010 | FOCS | All-Pairs Shortest Paths in O(n | Yuval Peres, Dmitry Sotnikov, Benny Sudakov, Uri Zwick |
| 2010 | ISAAC | Lower Bounds for Howard's Algorithm for Finding Minimum Mean-Cost Cycles. | Thomas Dueholm Hansen, Uri Zwick |
| 2009 | SODA | A simpler implementation and analysis of Chazelle's soft heaps. | Haim Kaplan, Uri Zwick |
| 2009 | SODA | Discounted deterministic Markov decision processes and discounted all-pairs shortest paths. | Omid Madani, Mikkel Thorup, Uri Zwick |
| 2009 | SODA | Efficient algorithms for the 2-gathering problem. | Alon Shalita, Uri Zwick |
| 2008 | CSR | Simple Stochastic Games, Mean Payoff Games, Parity Games. | Uri Zwick |
| 2008 | SODA | Maximum overhang. | Mike Paterson, Yuval Peres, Mikkel Thorup, Peter Winkler, Uri Zwick |
| 2008 | WABI | An Algorithm for Orienting Graphs Based on Cause-Effect Pairs and Its Applications to Orienting Protein Networks. | Alexander Medvedovsky, Vineet Bafna, Uri Zwick, Roded Sharan |
| 2007 | ISAAC | New Bounds for the Nearly Equitable Edge Coloring Problem. | Xuzhen Xie, Mutsunori Yagiura, Takao Ono, Tomio Hirata, Uri Zwick |
| 2007 | SODA | All-pairs bottleneck paths in vertex weighted graphs. | Asaf Shapira, Raphael Yuster, Uri Zwick |
| 2007 | SODA | Deterministic rendezvous, treasure hunts and strongly universal exploration sequences. | Amnon Ta-Shma, Uri Zwick |
| 2007 | SODA | Maximum matching in graphs with an excluded minor. | Raphael Yuster, Uri Zwick |
| 2006 | SODA | A deterministic subexponential algorithm for solving parity games. | Marcin Jurdzinski, Mike Paterson, Uri Zwick |
| 2006 | SODA | Overhang. | Mike Paterson, Uri Zwick |
| 2006 | SODA | Spanners and emulators with sublinear distance errors. | Mikkel Thorup, Uri Zwick |
| 2005 | FOCS | Answering distance queries in directed graphs using fast matrix multiplication. | Raphael Yuster, Uri Zwick |
| 2005 | ICALP | Union-Find with Constant Time Deletions. | Stephen Alstrup, Inge Li Grtz, Theis Rauhe, Mikkel Thorup, Uri Zwick |
| 2005 | ICALP | Deterministic Constructions of Approximate Distance Oracles and Spanners. | Liam Roditty, Mikkel Thorup, Uri Zwick |
| 2005 | ICALP | Replacement Paths and | Liam Roditty, Uri Zwick |
| 2005 | WAOA | Improved Approximation Algorithms for MAX NAE-SAT and MAX SAT. | Adi Avidor, Ido Berkovitch, Uri Zwick |
| 2004 | ESA | On Dynamic Shortest Paths Problems. | Liam Roditty, Uri Zwick |
| 2004 | ESA | Fast Sparse Matrix Multiplication. | Raphael Yuster, Uri Zwick |
| 2004 | FOCS | Dynamic Approximate All-Pairs Shortest Paths in Undirected Graphs. | Liam Roditty, Uri Zwick |
| 2004 | ISAAC | Multicriteria Global Minimum Cuts. | Amitai Armon, Uri Zwick |
| 2004 | ISAAC | A Slightly Improved Sub-Cubic Algorithm for the All Pairs Shortest Paths Problem with Real Edge Lengths. | Uri Zwick |
| 2004 | SODA | Meldable RAM priority queues and minimum directed spanning trees. | Ran Mendelson, Mikkel Thorup, Uri Zwick |
| 2004 | SODA | Detecting short directed cycles using rectangular matrix multiplication and dynamic programming. | Raphael Yuster, Uri Zwick |
| 2004 | STOC | A fully dynamic reachability algorithm for directed graphs with an almost linear update time. | Liam Roditty, Uri Zwick |
| 2002 | FOCS | Improved Dynamic Reachability Algorithms for Directed Graphs. | Liam Roditty, Uri Zwick |
| 2002 | IPCO | Improved Rounding Techniques for the MAX 2-SAT and MAX DI-CUT Problems. | Michael Lewin, Dror Livnat, Uri Zwick |
| 2002 | ISAAC | Approximating MIN k-SAT. | Adi Avidor, Uri Zwick |
| 2002 | SODA | Reachability and distance queries via 2-hop labels. | Edith Cohen, Eran Halperin, Haim Kaplan, Uri Zwick |
| 2002 | SODA | MAX CUT in cubic graphs. | Eran Halperin, Dror Livnat, Uri Zwick |
| 2002 | SODA | Roundtrip spanners and roundtrip routing in directed graphs. | Liam Roditty, Mikkel Thorup, Uri Zwick |
| 2002 | SODA | Jenga. | Uri Zwick |
| 2002 | SODA | Computer assisted proof of optimal approximability results. | Uri Zwick |
| 2001 | ESA | Exact and Approximate Distances in Graphs - A Survey. | Uri Zwick |
| 2001 | IPCO | A Unified Framework for Obtaining Improved Approximation Algorithms for Maximum Graph Bisection Problems. | Eran Halperin, Uri Zwick |
| 2001 | SODA | Constructing worst case instances for semidefinite programming based approximation algorithms. | Noga Alon, Benny Sudakov, Uri Zwick |
| 2001 | SODA | Which formulae shrink under random restrictions? | Hana Chockler, Uri Zwick |
| 2001 | SODA | Coloring k-colorable graphs using smaller palettes. | Eran Halperin, Ram Nathaniel, Uri Zwick |
| 2001 | SODA | Combinatorial approximation algorithms for the maximum directed cut problem. | Eran Halperin, Uri Zwick |
| 2001 | STOC | Approximate distance oracles. | Mikkel Thorup, Uri Zwick |
| 2001 | SPAA | Compact routing schemes. | Mikkel Thorup, Uri Zwick |
| 2001 | WADS | Competitive Analysis of the LRFU Paging Algorithm. | Edith Cohen, Haim Kaplan, Uri Zwick |
| 2000 | SPAA | Connection caching under vaious models of communication. | Edith Cohen, Haim Kaplan, Uri Zwick |
| 1999 | FOCS | All Pairs Shortest Paths in Undirected Graphs with Integer Weights. | Avi Shoshan, Uri Zwick |
| 1999 | IPCO | Approximation Algorithms for MAX 4-SAT and Rounding Procedures for Semidefinite Programs. | Eran Halperin, Uri Zwick |
| 1999 | STOC | Connection Caching. | Edith Cohen, Haim Kaplan, Uri Zwick |
| 1999 | STOC | All Pairs Lightest Shortest Paths. | Uri Zwick |
| 1999 | STOC | Outward Rotations: A Tool for Rounding Solutions of Semidefinite Programming Relaxations, with Applications to MAX CUT and Other Problems. | Uri Zwick |
| 1998 | FOCS | All Pairs Shortest Paths in Weighted Directed Graphs ¾ Exact and Almost Exact Algorithms. | Uri Zwick |
| 1998 | SODA | Spatial Codes and the Hardness of String Folding Problems (Extended Abstract). | Ashwin Nayak, Alistair Sinclair, Uri Zwick |
| 1998 | SODA | Approximation Algorithms for Constraint Satisfaction Problems Involving at Most Three Variables per Constraint. | Uri Zwick |
| 1998 | STOC | Finding Almost-Satisfying Assignments. | Uri Zwick |
| 1997 | FOCS | A 7/8-Approximation Algorithm for MAX 3SAT? | Howard J. Karloff, Uri Zwick |
| 1997 | SODA | All-Pairs Small-Stretch Paths. | Edith Cohen, Uri Zwick |
| 1996 | FOCS | All Pairs Almost Shortest Paths. | Dorit Dor, Shay Halperin, Uri Zwick |
| 1996 | FOCS | Median Selection Requires (2+epsilon)n Comparisons. | Dorit Dor, Uri Zwick |
| 1996 | SODA | Optimal randomized EREW PRAM Algorithms for Finding Spanning Forests and for other Basic Graph Connectivity Problems. | Shay Halperin, Uri Zwick |
| 1995 | COCOON | The Complexity of Mean Payoff Games. | Uri Zwick, Mike Paterson |
| 1995 | SODA | Selecting the Median. | Dorit Dor, Uri Zwick |
| 1994 | ESA | Finding and Counting Given Length Cycles (Extended Abstract). | Noga Alon, Raphael Yuster, Uri Zwick |
| 1994 | ICALP | Finding Even Cycles Even Faster. | Raphael Yuster, Uri Zwick |
| 1994 | STOC | Color-coding: a new method for finding simple paths, cycles and other small subgraphs within large graphs. | Noga Alon, Raphael Yuster, Uri Zwick |
| 1994 | SPAA | An Optimal Randomized Logarithmic Time Connectivity algorithm for the EREW PRAM (Extended Abstract). | Shay Halperin, Uri Zwick |
| 1992 | FOCS | Amplification and Percolation | Moshe Dubiner, Uri Zwick |
| 1992 | STOC | Shallow Multiplication Circuits and Wise Financial Investments | Mike Paterson, Uri Zwick |
| 1991 | ARITH | Shallow multiplication circuits. | Michael S. Paterson, Uri Zwick |
| 1991 | FOCS | Shrinkage of de~Morgan formulae under restriction | Mike Paterson, Uri Zwick |
| 1990 | FOCS | Faster Circuits and Shorter Formulae for Multiple Addition, Multiplication and Symmetric Boolean Functions | Mike Paterson, Nicholas Pippenger, Uri Zwick |