Color-coding N Alon, R Yuster, U Zwick Journal of the ACM (JACM) 42 (4), 844-856, 1995 | 1324 | 1995 |
Approximate distance oracles M Thorup, U Zwick Journal of the ACM (JACM) 52 (1), 1-24, 2005 | 925 | 2005 |
Reachability and distance queries via 2-hop labels E Cohen, E Halperin, H Kaplan, U Zwick SIAM Journal on Computing 32 (5), 1338-1355, 2003 | 837 | 2003 |
Finding and counting given length cycles N Alon, R Yuster, U Zwick Algorithmica 17 (3), 209-223, 1997 | 706 | 1997 |
Compact routing schemes M Thorup, U Zwick Proceedings of the thirteenth annual ACM symposium on Parallel algorithms …, 2001 | 702 | 2001 |
The complexity of mean payoff games on graphs U Zwick, M Paterson Theoretical Computer Science 158, 1-2, 1995 | 673 | 1995 |
All pairs shortest paths using bridging sets and rectangular matrix multiplication U Zwick Journal of the ACM (JACM) 49 (3), 289-317, 2002 | 401 | 2002 |
Fast sparse matrix multiplication R Yuster, U Zwick ACM Transactions On Algorithms (TALG) 1 (1), 2-13, 2005 | 353 | 2005 |
All-pairs almost shortest paths D Dor, S Halperin, U Zwick SIAM Journal on Computing 29 (5), 1740-1759, 2000 | 334 | 2000 |
A deterministic subexponential algorithm for solving parity games M Jurdziński, M Paterson, U Zwick SIAM Journal on Computing 38 (4), 1519-1532, 2008 | 295 | 2008 |
A 7/8-approximation algorithm for MAX 3SAT? H Karloff, U Zwick Proceedings 38th Annual Symposium on Foundations of Computer Science, 406-415, 1997 | 290 | 1997 |
Exact and approximate distances in graphs—a survey U Zwick European Symposium on Algorithms, 33-48, 2001 | 250 | 2001 |
Improved rounding techniques for the MAX 2-SAT and MAX DI-CUT problems M Lewin, D Livnat, U Zwick International Conference on Integer Programming and Combinatorial …, 2002 | 182 | 2002 |
All pairs shortest paths in undirected graphs with integer weights A Shoshan, U Zwick 40th Annual Symposium on Foundations of Computer Science (Cat. No. 99CB37039 …, 1999 | 182 | 1999 |
Outward rotations: a tool for rounding solutions of semidefinite programming relaxations, with applications to MAX CUT and other problems U Zwick Proceedings of the thirty-first annual ACM symposium on Theory of computing …, 1999 | 181 | 1999 |
Deterministic constructions of approximate distance oracles and spanners L Roditty, M Thorup, U Zwick International Colloquium on Automata, Languages, and Programming, 261-272, 2005 | 180 | 2005 |
Approximation Algorithms for Constraint Satisfaction Problems Involving at Most Three Variables per Constraint. U Zwick SODA 98, 201-210, 1998 | 179 | 1998 |
A fully dynamic reachability algorithm for directed graphs with an almost linear update time L Roditty, U Zwick Proceedings of the thirty-sixth annual ACM symposium on Theory of computing …, 2004 | 177 | 2004 |
Strategy iteration is strongly polynomial for 2-player turn-based stochastic games with a constant discount factor TD Hansen, PB Miltersen, U Zwick Journal of the ACM (JACM) 60 (1), 1-16, 2013 | 170 | 2013 |
On dynamic shortest paths problems L Roditty, U Zwick Algorithms–ESA 2004: 12th Annual European Symposium, Bergen, Norway …, 2004 | 155 | 2004 |