| Publication | Date of Publication | Type |
|---|
Approximating red-blue set cover and minimum monotone satisfying assignment
| 2025-01-14 | Paper |
Approximating fair clustering with cascaded norm objectives
| 2024-07-19 | Paper |
scientific article; zbMATH DE number 7758343 (Why is no real title available?)
| 2023-10-31 | Paper |
scientific article; zbMATH DE number 7650078 (Why is no real title available?)
| 2023-02-03 | Paper |
scientific article; zbMATH DE number 7561533 (Why is no real title available?)
| 2022-07-21 | Paper |
Sherali-Adams integrality gaps matching the log-density threshold
| 2021-08-04 | Paper |
Approximating spanners and directed Steiner forest. Upper and lower bounds
ACM Transactions on Algorithms | 2021-05-03 | Paper |
Linear index coding via semidefinite programming
| 2019-05-10 | Paper |
Lift-and-project methods for set cover and knapsack
Algorithmica | 2018-10-18 | Paper |
The densest \(k\)-subhypergraph problem
SIAM Journal on Discrete Mathematics | 2018-07-18 | Paper |
Approximating spanners and directed Steiner forest: upper and lower bounds
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 |
Approximation algorithms for label cover and the log-density threshold
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
The densest \(k\)-subhypergraph problem
| 2018-04-19 | Paper |
scientific article; zbMATH DE number 6696497 (Why is no real title available?)
| 2017-03-22 | Paper |
Lowest-degree \(k\)-spanner: approximation and hardness
Theory of Computing | 2016-11-01 | Paper |
Convex relaxations and integrality gaps
International Series in Operations Research & Management Science | 2016-04-26 | Paper |
New approximation guarantee for chromatic number
Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing | 2014-11-25 | Paper |
Inapproximability of NP-complete variants of Nash equilibrium
Theory of Computing | 2014-10-06 | Paper |
Detecting high log-densities, an \(O(n^{1/4})\) approximation for densest \(k\)-subgraph
Proceedings of the forty-second ACM symposium on Theory of computing | 2014-08-13 | Paper |
Linear index coding via semidefinite programming
Combinatorics, Probability and Computing | 2014-04-16 | Paper |
Lift-and-project methods for set cover and knapsack
Lecture Notes in Computer Science | 2013-08-12 | Paper |
Understanding Set Cover: Sub-exponential Time Approximations and Lift-and-Project Methods
| 2012-04-24 | Paper |
Inapproximability of NP-Complete Variants of Nash Equilibrium
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2011-08-17 | Paper |
Approximating sparsest cut in graphs of bounded treewidth
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2010-09-10 | Paper |
Improved Approximation Guarantees through Higher Levels of SDP Hierarchies
Lecture Notes in Computer Science | 2008-11-27 | Paper |
Improved approximation of the minimum cover time
Theoretical Computer Science | 2005-09-22 | Paper |
