| Publication | Date of Publication | Type |
|---|
| On optimization and counting of non-broken bases of matroids | 2025-01-14 | Paper |
| An improved trickle down theorem for partite complexes | 2024-11-19 | Paper |
| Matroid partition property and the secretary problem | 2024-09-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6126295 | 2024-04-09 | Paper |
| Log-concave polynomials. II: High-dimensional walks and an FPRAS for counting bases of a matroid | 2024-01-02 | Paper |
| An improved approximation algorithm for the minimum k -edge connected multi-subgraph problem | 2023-12-08 | Paper |
| A (slightly) improved approximation algorithm for metric TSP | 2023-11-14 | Paper |
| Log-concave polynomials IV: approximate exchange, tight mixing times, and near-optimal sampling of forests | 2023-11-14 | Paper |
| A deterministic better-than-3/2 approximation algorithm for metric TSP | 2023-11-09 | Paper |
| On Optimization and Counting of Non-Broken Bases of Matroids | 2023-05-05 | Paper |
| Complete Log Concavity of Coverage-Like Functions | 2023-03-07 | Paper |
| An Improved Trickle-Down Theorem for Partite Complexes | 2022-08-08 | Paper |
| Log-concave polynomials. I: Entropy and a deterministic approximation algorithm for counting bases of matroids | 2021-12-13 | Paper |
| Matroid Partition Property and the Secretary Problem | 2021-11-24 | Paper |
| Spectral Independence in High-Dimensional Expanders and Applications to the Hardcore Model | 2021-08-06 | Paper |
| A Matrix Trickle-Down Theorem on Simplicial Complexes and Applications to Sampling Colorings | 2021-06-07 | Paper |
| A (Slightly) Improved Bound on the Integrality Gap of the Subtour LP for TSP | 2021-05-20 | Paper |
| A generalization of permanent inequalities and applications in counting and optimization | 2021-04-23 | Paper |
| Composable Core-sets for Determinant Maximization Problems via Spectral Spanners | 2021-02-02 | Paper |
| An improved approximation algorithm for TSP in the half integral case | 2021-01-19 | Paper |
| On the Bias of Reed--Muller Codes over Odd Prime Fields | 2020-06-09 | Paper |
| Log-concave polynomials II: high-dimensional walks and an FPRAS for counting bases of a matroid | 2020-01-30 | Paper |
| A simply exponential upper bound on the maximum number of stable matchings | 2019-08-22 | Paper |
| An Improved Approximation Algorithm for TSP in the Half Integral Case | 2019-08-01 | Paper |
| Partitioning into Expanders | 2019-06-20 | Paper |
| Log-Concave Polynomials III: Mason's Ultra-Log-Concavity Conjecture for Independent Sets of Matroids | 2018-11-05 | Paper |
| Almost Optimal Local Graph Clustering Using Evolving Sets | 2018-08-02 | Paper |
| Approximation Algorithms for Finding Maximum Induced Expanders | 2018-07-16 | Paper |
| Log-Concave Polynomials I: Entropy and a Deterministic Approximation Algorithm for Counting Bases of Matroids | 2018-07-02 | Paper |
| Nash Social Welfare for Indivisible Items under Separable, Piecewise-Linear Concave Utilities | 2018-03-15 | Paper |
| Approximating the Largest Root and Applications to Interlacing Families | 2018-03-15 | Paper |
| Online stochastic matching: online actions based on offline statistics | 2017-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5365102 | 2017-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5365094 | 2017-09-29 | Paper |
| An O(log n/log log n)-Approximation Algorithm for the Asymmetric Traveling Salesman Problem | 2017-09-26 | Paper |
| A generalization of permanent inequalities and applications in counting and optimization | 2017-08-17 | Paper |
| Simply Exponential Approximation of the Permanent of Positive Semidefinite Matrices | 2017-04-11 | Paper |
| Spectral graph theory via higher order eigenvalues and applications to the analysis of random walks | 2016-02-19 | Paper |
| Monte Carlo Markov Chain Algorithms for Sampling Strongly Rayleigh Distributions and Determinantal Point Processes | 2016-02-16 | Paper |
| A new regularity lemma and faster approximation algorithms for low threshold rank graphs | 2015-08-21 | Paper |
| Multi-way spectral partitioning and higher-order Cheeger inequalities | 2015-08-14 | Paper |
| On variants of the matroid secretary problem | 2015-03-23 | Paper |
| The Kadison-Singer Problem for Strongly Rayleigh Measures and Applications to Asymmetric TSP | 2014-12-02 | Paper |
| Online stochastic matching: online actions based on offline statistics | 2014-10-21 | Paper |
| Improved Cheeger's inequality | 2014-08-07 | Paper |
| A Randomized Rounding Approach to the Traveling Salesman Problem | 2014-07-30 | Paper |
| An \(O(\log n/ \log \log n)\)-approximation algorithm for the asymmetric traveling salesman problem | 2014-05-22 | Paper |
| Multi-way spectral partitioning and higher-order Cheeger inequalities | 2014-05-13 | Paper |
| A new regularity lemma and faster approximation algorithms for low threshold rank graphs | 2013-10-04 | Paper |
| A rounding by sampling approach to the minimum size \(k\)-arc connected subgraph problem | 2013-08-12 | Paper |
| A Universal upper bound on Graph Diameter based on Laplacian Eigenvalues | 2012-12-11 | Paper |
| On variants of the matroid secretary problem | 2011-09-16 | Paper |
| Spanning trees with minimum weighted degrees | 2010-03-24 | Paper |
