| Publication | Date of Publication | Type |
|---|
Approximating red-blue set cover and minimum monotone satisfying assignment
| 2025-01-14 | Paper |
Approximation algorithm for norm multiway cut
| 2025-01-06 | Paper |
Higher-order Cheeger inequality for partitioning with buffers
| 2024-11-28 | Paper |
Efficient Kirszbraun extension with applications to regression
Mathematical Programming. Series A. Series B | 2024-09-19 | Paper |
Correction to: ``Efficient Kirszbraun extension with applications to regression
Mathematical Programming. Series A. Series B | 2024-09-19 | Paper |
Approximating fair clustering with cascaded norm objectives
| 2024-07-19 | Paper |
Certified Algorithms: Worst-Case Analysis and Beyond
| 2023-02-03 | Paper |
Performance of Johnson--Lindenstrauss Transform for $k$-Means and $k$-Medians Clustering
SIAM Journal on Computing | 2022-04-01 | Paper |
Perturbation Resilience
| 2022-02-04 | Paper |
Approximation Algorithms for CSPs
| 2021-06-15 | Paper |
Bilu-Linial stability
| 2020-07-10 | Paper |
Performance of Johnson-Lindenstrauss transform for \(k\)-means and \(k\)-medians clustering
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing | 2020-01-30 | Paper |
Robust algorithms with polynomial loss for near-unanimity CSPs
SIAM Journal on Computing | 2019-12-09 | Paper |
Nonlinear dimension reduction via outer bi-Lipschitz extensions
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
Bilu-Linial stable instances of max cut and minimum multiway cut
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
Approximation algorithms and hardness of the \(k\)-route cut problem
| 2019-05-10 | Paper |
Approximation algorithms and hardness of the \(k\)-route cut problem
ACM Transactions on Algorithms | 2018-10-30 | Paper |
Robust algorithms with polynomial loss for near-unanimity CSPs
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Minimizing the union: tight approximations for small set bipartite vertex expansion
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Algorithmic and hardness results for the hub labeling problem
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
A bi-criteria approximation algorithm for \(k\)-means
| 2018-04-19 | Paper |
Minimum nonuniform graph partitioning with unrelated weights
Sbornik: Mathematics | 2018-04-06 | Paper |
A pseudo-approximation for the genus of Hamiltonian graphs
Theory of Computing | 2017-10-11 | Paper |
On graph crossing number and edge planarization
| 2017-09-29 | Paper |
An improved integrality gap for the Călinescu-Karloff-Rabani relaxation for multiway cut
| 2017-08-31 | Paper |
Algorithms for stable and perturbation-resilient problems
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing | 2017-08-17 | Paper |
Chain Independence and Common Information
IEEE Transactions on Information Theory | 2017-06-08 | Paper |
Sorting noisy data with partial information
Proceedings of the 4th conference on Innovations in Theoretical Computer Science | 2017-05-16 | 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 |
Union of Euclidean metric spaces is Euclidean
Discrete Analysis | 2016-10-10 | Paper |
Metric extension operators, vertex sparsifiers and Lipschitz extendability
Israel Journal of Mathematics | 2016-07-25 | Paper |
Constant factor approximation for balanced cut in the PIE model
Proceedings of the forty-sixth annual ACM symposium on Theory of computing | 2015-06-26 | Paper |
Integrality gaps for Sherali-Adams relaxations
Proceedings of the forty-first annual ACM symposium on Theory of computing | 2015-02-04 | Paper |
Approximation algorithm for non-Boolean \textsc{Max}-\(k\)-CSP
Theory of Computing | 2015-02-03 | Paper |
Clustering, Hamming Embedding, Generalized LSH and the Max Norm
Lecture Notes in Computer Science | 2015-01-14 | Paper |
scientific article; zbMATH DE number 6381632 (Why is no real title available?)
| 2014-12-18 | Paper |
A divide and conquer algorithm for \(d\)-dimensional arrangement
| 2014-12-18 | Paper |
Near-optimal algorithms for unique games
Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing | 2014-11-25 | Paper |
Near-optimal algorithms for maximum constraint satisfaction problems
ACM Transactions on Algorithms | 2014-11-18 | Paper |
Subgraph sparsification and nearly optimal ultrasparsifiers
Proceedings of the forty-second ACM symposium on Theory of computing | 2014-08-13 | Paper |
The Grothendieck Constant is Strictly Smaller than Krivine's Bound
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science | 2014-07-30 | Paper |
How to Play Unique Games Against a Semi-random Adversary: Study of Semi-random Models of Unique Games
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science | 2014-07-30 | Paper |
Nonuniform graph partitioning with unrelated weights
Automata, Languages, and Programming | 2014-07-01 | Paper |
Approximation algorithms for semi-random partitioning problems
Proceedings of the forty-fourth annual ACM symposium on Theory of computing | 2014-05-13 | Paper |
The Grothendieck constant is strictly smaller than Krivine's bound
Forum of Mathematics, Pi | 2014-03-11 | Paper |
A pseudo-approximation for the genus of Hamiltonian graphs
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2013-10-04 | Paper |
Simple linear time approximation algorithm for betweenness
Operations Research Letters | 2013-03-05 | Paper |
Approximation algorithm for non-Boolean MAX \(k\)-CSP
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2012-11-02 | Paper |
Planarizing an unknown surface
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2012-11-02 | Paper |
Balanced allocation: memory performance tradeoffs
The Annals of Applied Probability | 2012-09-19 | Paper |
How to Play Unique Games on Expanders
Approximation and Online Algorithms | 2011-02-15 | Paper |
Local global tradeoffs in metric embeddings
SIAM Journal on Computing | 2011-01-17 | Paper |
\(O(\sqrt{\log n})\) approximation algorithms for Min UnCut, Min 2CNF deletion, and directed cut problems
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing | 2010-08-16 | Paper |
Quadratic forms on graphs (extended abstract)
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing | 2010-08-16 | Paper |
Dimension reduction for hyperbolic space
Proceedings of the American Mathematical Society | 2009-02-25 | Paper |
Eigenvalue multiplicity and volume growth
| 2008-06-10 | Paper |
A new class of non-Shannon-type inequalities for entropies
Communications in Information and Systems | 2006-06-20 | Paper |
Quadratic forms on graphs
Inventiones Mathematicae | 2006-03-21 | Paper |
scientific article; zbMATH DE number 1033818 (Why is no real title available?)
| 1997-08-24 | Paper |
