| Faster k -SAT algorithms using biased-PPSZ | 1 | 0.37 | 2019 |
| ARRIVAL: Next Stop in CLS. | 0 | 0.34 | 2018 |
| Decremental Data Structures for Connectivity and Dominators in Directed Graphs. | 1 | 0.35 | 2017 |
| Faster Algorithms for Computing Maximal 2-Connected Subgraphs in Sparse Directed Graphs. | 4 | 0.46 | 2017 |
| Improved Algorithms for Computing the Cycle of Minimum Cost-to-Time Ratio in Directed Graphs. | 0 | 0.34 | 2017 |
| Random-Edge Is Slower Than Random-Facet on Abstract Cubes. | 3 | 0.41 | 2016 |
| Decremental Single-Source Reachability and Strongly Connected Components in Õ(m√n) Total Update Time | 1 | 0.35 | 2016 |
| An Improved Version of the Random-Facet Pivoting Rule for the Simplex Algorithm | 5 | 0.45 | 2015 |
| Simulating Branching Programs with Edit Distance and Friends or: A Polylog Shaved is a Lower Bound Made | 18 | 0.68 | 2015 |
| Subtree Isomorphism Revisited | 8 | 0.49 | 2015 |
| Hollow Heaps. | 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 |
| Errata for: A subexponential lower bound for the Random Facet algorithm for Parity Games. | 2 | 0.36 | 2014 |
| A faster algorithm for solving one-clock priced timed games | 6 | 0.49 | 2013 |
| The complexity of interior point methods for solving discounted turn-based stochastic games | 0 | 0.34 | 2013 |
| Subexponential lower bounds for randomized pivoting rules for the simplex algorithm | 26 | 1.15 | 2011 |
| A subexponential lower bound for the random facet algorithm for parity games | 10 | 0.57 | 2011 |
| Lower Bounds for Howard's Algorithm for Finding Minimum Mean-Cost Cycles | 6 | 0.63 | 2010 |
| On Acyclicity of Games with Cycles | 9 | 0.96 | 2010 |
| Strategy Iteration Is Strongly Polynomial for 2-Player Turn-Based Stochastic Games with a Constant Discount Factor | 31 | 1.44 | 2010 |
| Improved Bounds for Facility Location Games with Fair Cost Allocation | 2 | 0.40 | 2009 |
| Approximability and Parameterized Complexity of Minmax Values | 10 | 0.77 | 2008 |
| On Range of Skill | 2 | 0.36 | 2008 |
| On Pure and (Approximate) Strong Equilibria of Facility Location Games | 5 | 0.49 | 2008 |
