| Counting and Sampling Perfect Matchings in Regular Expanding Non-Bipartite Graphs. | 0 | 0.34 | 2022 |
| A (Slightly) Improved Bound on the Integrality Gap of the Subtour LP for TSP | 0 | 0.34 | 2022 |
| An Improved Approximation Algorithm for the Minimum k-Edge Connected Multi-subgraph Problem | 0 | 0.34 | 2022 |
| Log-concave polynomials IV: approximate exchange, tight mixing times, and near-optimal sampling of forests | 1 | 0.36 | 2021 |
| A (slightly) improved approximation algorithm for metric TSP | 2 | 0.38 | 2021 |
| A Matrix Trickle-Down Theorem on Simplicial Complexes and Applications to Sampling Colorings | 0 | 0.34 | 2021 |
| On the Bias of Reed-Muller Codes over Odd Prime Fields. | 0 | 0.34 | 2020 |
| An Improved Approximation Algorithm for TSP in the Half Integral Case | 1 | 0.36 | 2020 |
| Composable Core-sets for Determinant Maximization: A Simple Near-Optimal Algorithm | 0 | 0.34 | 2019 |
| A Polynomial Time MCMC Method for Sampling from Continuous Determinantal Point Processes | 0 | 0.34 | 2019 |
| Log-Concave Polynomials III: Mason's Ultra-Log-Concavity Conjecture for Independent Sets of Matroids. | 0 | 0.34 | 2018 |
| A Simply Exponential Upper Bound on the Maximum Number of Stable Matchings. | 1 | 0.35 | 2018 |
| Log-Concave Polynomials, Entropy, and a Deterministic Approximation Algorithm for Counting Bases of Matroids | 3 | 0.42 | 2018 |
| A Polynomial Time MCMC Method for Sampling from Continuous DPPs. | 0 | 0.34 | 2018 |
| Approximating the Largest Root and Applications to Interlacing Families. | 0 | 0.34 | 2018 |
| Nash Social Welfare for Indivisible Items under Separable, Piecewise-Linear Concave Utilities. | 0 | 0.34 | 2018 |
| Graph Clustering using Effective Resistance. | 0 | 0.34 | 2018 |
| Time-Space Tradeoffs for Learning Finite Functions from Random Evaluations, with Applications to Polynomials. | 0 | 0.34 | 2018 |
| Log-Concave Polynomials II: High-Dimensional Walks and an FPRAS for Counting Bases of a Matroid. | 5 | 0.53 | 2018 |
| Time-Space Tradeoffs for Learning from Small Test Spaces: Learning Low Degree Polynomial Functions. | 2 | 0.42 | 2017 |
| Nash Social Welfare, Matrix Permanent, and Stable Polynomials. | 2 | 0.40 | 2017 |
| Simply Exponential Approximation of the Permanent of Positive Semidefinite Matrices | 4 | 0.50 | 2017 |
| A Generalization of Permanent Inequalities and Applications in Counting and Optimization. | 8 | 0.58 | 2017 |
| Monte Carlo Markov Chains Algorithms for Sampling Strongly Rayleigh Distributions and Determinantal Point Processes. | 0 | 0.34 | 2016 |
| Almost Optimal Local Graph Clustering Using Evolving Sets. | 4 | 0.38 | 2016 |
| Approximation algorithms for finding maximum induced expanders | 0 | 0.34 | 2015 |
| Effective-Resistance-Reducing Flows, Spectrally Thin Trees, and Asymmetric TSP | 8 | 0.53 | 2015 |
| The Kadison-Singer Problem for Strongly Rayleigh Measures and Applications to Asymmetric TSP. | 7 | 0.52 | 2014 |
| Dynamic matching market design | 7 | 0.60 | 2014 |
| Effective-Resistance-Reducing Flows and Asymmetric TSP. | 1 | 0.35 | 2014 |
| Partitioning into expanders | 1 | 0.35 | 2014 |
| Improved ARV Rounding in Small-set Expanders and Graphs of Bounded Threshold Rank | 2 | 0.38 | 2013 |
| Improved Cheeger's inequality: analysis of spectral partitioning algorithms through higher order spectral gap | 26 | 1.23 | 2013 |
| A New Regularity Lemma and Faster Approximation Algorithms for Low Threshold Rank Graphs | 0 | 0.34 | 2012 |
| A Universal upper bound on Graph Diameter based on Laplacian Eigenvalues | 0 | 0.34 | 2012 |
| Approximating the Expansion Profile and Almost Optimal Local Graph Clustering | 21 | 0.73 | 2012 |
| A rounding by sampling approach to the minimum size k-arc connected subgraph problem | 3 | 0.40 | 2012 |
| Sharp Bounds On Random Walk Eigenvalues Via Spectral Embedding | 3 | 0.60 | 2012 |
| Simultaneous approximations for adversarial and stochastic online budgeted allocation | 19 | 0.89 | 2012 |
| The asymmetric traveling salesman problem on graphs with bounded genus | 15 | 0.74 | 2011 |
| Submodular maximization by simulated annealing | 36 | 1.72 | 2011 |
| A Higher-Order Cheeger's Inequality | 1 | 0.40 | 2011 |
| Online stochastic matching: online actions based on offline statistics | 26 | 1.43 | 2011 |
| A Randomized Rounding Approach to the Traveling Salesman Problem | 56 | 2.27 | 2011 |
| On variants of the matroid secretary problem | 18 | 0.90 | 2011 |
| An O(log n/ log log n)-approximation algorithm for the asymmetric traveling salesman problem | 37 | 1.34 | 2010 |
| A Time Warping Speech Recognition System Based on Particle Swarm Optimization | 2 | 0.43 | 2008 |
| Spanning trees with minimum weighted degrees | 1 | 0.36 | 2007 |
