| Publication | Date of Publication | Type |
|---|
| Improved linearly ordered colorings of hypergraphs via SDP rounding | 2026-06-12 | Paper |
| Planted models for the densest k-subgraph problem | 2026-03-23 | Paper |
| Sparse cuts in hypergraphs from random walks on simplicial complexes | 2025-12-02 | Paper |
| Accelerated Newton iteration for roots of black box polynomials | 2025-08-06 | Paper |
| The complexity of approximating vertex expansion | 2025-05-20 | Paper |
| New approximation bounds for small-set vertex expansion | 2024-11-28 | Paper |
| Approximating CSPs with outliers | 2024-08-22 | Paper |
| Exact recovery algorithm for planted bipartite graph in semi-random graphs | 2024-06-24 | Paper |
scientific article; zbMATH DE number 7788364 (Why is no real title available?)
(available as arXiv preprint) | 2024-01-15 | Paper |
Planted Models for k-Way Edge and Vertex Expansion
(available as arXiv preprint) | 2023-02-03 | Paper |
scientific article; zbMATH DE number 7650095 (Why is no real title available?)
(available as arXiv preprint) | 2023-02-03 | Paper |
| Sparse Cuts in Hypergraphs from Random Walks on Simplicial Complexes | 2022-12-27 | Paper |
Independent sets in semi-random hypergraphs
(available as arXiv preprint) | 2022-03-25 | Paper |
Semi-random Graphs with Planted Sparse Vertex Cuts: Algorithms for Exact and Approximate Recovery
(available as arXiv preprint) | 2021-07-28 | Paper |
| Finding Pseudorandom Colorings of Pseudorandom Graphs | 2020-11-25 | Paper |
Approximation algorithm for sparsest \(k\)-partitioning
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
Spectral properties of hypergraph Laplacian and approximation algorithms
Journal of the ACM | 2018-12-06 | Paper |
| Approximation algorithms for hypergraph small set expansion and small set vertex expansion | 2017-03-22 | Paper |
Approximation algorithms for hypergraph small-set expansion and small-set vertex expansion
Theory of Computing | 2016-11-01 | Paper |
Hypergraph Markov Operators, Eigenvalues and Approximation Algorithms
Proceedings of the forty-seventh annual ACM symposium on Theory of Computing | 2015-08-21 | Paper |
Linear Programming Hierarchies Suffice for Directed Steiner Tree
Integer Programming and Combinatorial Optimization | 2014-06-02 | Paper |
Many sparse cuts via higher eigenvalues
Proceedings of the forty-fourth annual ACM symposium on Theory of computing | 2014-05-13 | Paper |
A 3-approximation algorithm for the facility location problem with uniform capacities
Mathematical Programming. Series A. Series B | 2013-11-11 | Paper |
Algorithmic extensions of Cheeger's inequality to higher eigenvalues and partitions
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2011-08-17 | Paper |
Improved algorithm for degree bounded survivable network design problem
Lecture Notes in Computer Science | 2010-06-22 | Paper |
