| Algorithmic trade-offs for girth approximation in undirected graphs | 1 | 0.35 | 2022 |
| Simulating a stack using queues | 0 | 0.34 | 2022 |
| Public vs. private randomness in simultaneous multi-party communication complexity. | 1 | 0.34 | 2020 |
| Selection from heaps, row-sorted matrices and X+Y using soft heaps. | 0 | 0.34 | 2019 |
| Dynamic Ordered Sets with Approximate Queries, Approximate Heaps and Soft Heaps. | 0 | 0.34 | 2019 |
| A Faster Deterministic Exponential Time Algorithm for Energy Games and Mean Payoff Games. | 0 | 0.34 | 2019 |
| Random k-out Subgraph Leaves only O(n/k) Inter-Component Edges | 0 | 0.34 | 2019 |
| Improved bounds for multipass pairing heaps and path-balanced binary search trees. | 1 | 0.34 | 2018 |
| Pairing heaps: the forward variant. | 1 | 0.34 | 2018 |
| Random-Edge Is Slower Than Random-Facet on Abstract Cubes. | 3 | 0.41 | 2016 |
| Bottleneck Paths and Trees and Deterministic Graphical Games. | 1 | 0.35 | 2016 |
| An Improved Version of the Random-Facet Pivoting Rule for the Simplex Algorithm | 5 | 0.45 | 2015 |
| The amortized cost of finding the minimum | 0 | 0.34 | 2015 |
| Dantzig's pivoting rule for shortest paths, deterministic MDPs, and minimum cost to time ratio cycles | 1 | 0.36 | 2014 |
| Improved upper bounds for random-edge and random-jump on abstract cubes | 7 | 0.47 | 2014 |
| Random-Facet and Random-Bland require subexponential time even for shortest paths. | 3 | 0.41 | 2014 |
| Fibonacci Heaps Revisited. | 1 | 0.37 | 2014 |
| Adjacency labeling schemes and induced-universal graphs. | 9 | 0.48 | 2014 |
| Soft Heaps Simplified. | 0 | 0.34 | 2013 |
| Dynamic Approximate All-Pairs Shortest Paths in Undirected Graphs | 49 | 1.75 | 2012 |
| All-pairs bottleneck paths in vertex weighted graphs | 16 | 0.73 | 2011 |
| All-Pairs Shortest Paths in $O(n^2)$ time with high probability | 5 | 0.48 | 2011 |
| Subexponential lower bounds for randomized pivoting rules for the simplex algorithm | 26 | 1.15 | 2011 |
| All-pairs shortest paths in O(n2) time with high probability | 13 | 0.69 | 2010 |
| Efficient algorithms for the 2-gathering problem | 1 | 0.36 | 2010 |
| Lower Bounds for Howard's Algorithm for Finding Minimum Mean-Cost Cycles | 6 | 0.63 | 2010 |
| Discounted deterministic Markov decision processes and discounted all-pairs shortest paths | 4 | 0.47 | 2010 |
| Overhang | 0 | 0.34 | 2009 |
| An Efficient Algorithm for the Nearly Equitable Edge Coloring Problem. | 0 | 0.34 | 2008 |
| A Deterministic Subexponential Algorithm for Solving Parity Games | 115 | 4.33 | 2008 |
| Roundtrip spanners and roundtrip routing in directed graphs | 38 | 1.30 | 2008 |
| Improved Dynamic Reachability Algorithms for Directed Graphs | 37 | 1.59 | 2008 |
| Maximum matching in graphs with an excluded minor | 15 | 0.68 | 2007 |
| A Slightly Improved Sub-Cubic Algorithm for the All PairsShortest Paths Problem with Real Edge Lengths | 17 | 1.04 | 2006 |
| Spanners and emulators with sublinear distance errors | 65 | 1.98 | 2006 |
| Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 9th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2006 and 10th International Workshop on Randomization and Computation, RANDOM 2006, Barcelona, Spain, August 28-30 2006, Proceedings | 37 | 3.17 | 2006 |
| Rounding two and three dimensional solutions of the SDP relaxation of MAX CUT | 5 | 0.48 | 2005 |
| Approximate distance oracles | 170 | 5.36 | 2005 |
| Deterministic constructions of approximate distance oracles and spanners | 77 | 2.48 | 2005 |
| Union-Find with Constant Time Deletions | 4 | 0.42 | 2005 |
| Answering distance queries in directed graphs using fast matrix multiplication | 17 | 0.83 | 2005 |
| Meldable RAM priority queues and minimum directed spanning trees | 1 | 0.35 | 2004 |
| A fully dynamic reachability algorithm for directed graphs with an almost linear update time | 47 | 1.81 | 2004 |
| On Dynamic Shortest Paths Problems | 55 | 1.85 | 2004 |
| Approximating Energy Efficient Paths in Wireless Multi-hop Networks | 6 | 0.52 | 2003 |
| Boolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms, and Implementation | 33 | 1.58 | 2003 |
| Algorithms - ESA 2003, 11th Annual European Symposium, Budapest, Hungary, September 16-19, 2003, Proceedings | 68 | 9.83 | 2003 |
| I/O-Efficient Undirected Shortest Paths | 25 | 1.15 | 2003 |
| Packing a Trunk | 6 | 0.75 | 2003 |
| Algorithms and Experiments for the Webgraph | 17 | 1.29 | 2003 |
