| Publication | Date of Publication | Type |
|---|
| Batch Optimization for DNA Synthesis | 2024-03-14 | Paper |
| Explainable k -means: don’t be greedy, plant bigger trees! | 2023-12-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875751 | 2023-02-03 | Paper |
| Performance of Johnson--Lindenstrauss Transform for $k$-Means and $k$-Medians Clustering | 2022-04-01 | Paper |
| Perturbation Resilience | 2022-02-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4993604 | 2021-06-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3295547 | 2020-07-10 | Paper |
| Performance of Johnson-Lindenstrauss transform for k -means and k -medians clustering | 2020-01-30 | Paper |
| Robust Algorithms with Polynomial Loss for Near-Unanimity CSPs | 2019-12-09 | Paper |
| Nonlinear dimension reduction via outer Bi-Lipschitz extensions | 2019-08-22 | Paper |
| Bilu–Linial Stable Instances of Max Cut and Minimum Multiway Cut | 2019-06-20 | Paper |
| Approximation Algorithm for Sparsest k-Partitioning | 2019-06-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5743409 | 2019-05-10 | Paper |
| Solving Optimization Problems with Diseconomies of Scale via Decoupling | 2019-02-25 | Paper |
| Maximizing Polynomials Subject to Assignment Constraints | 2018-11-12 | Paper |
| Maximum Quadratic Assignment Problem: Reduction from Maximum Label Cover and LP-Based Approximation Algorithm | 2018-10-30 | Paper |
| Robust algorithms with polynomial loss for near-unanimity CSPs | 2018-07-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4636444 | 2018-04-19 | Paper |
| Minimum nonuniform graph partitioning with unrelated weights | 2018-04-06 | Paper |
| Algorithms for stable and perturbation-resilient problems | 2017-08-17 | Paper |
| Chain Independence and Common Information | 2017-06-08 | Paper |
| Sorting noisy data with partial information | 2017-05-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2957878 | 2017-01-30 | Paper |
| Union of Euclidean Metric Spaces is Euclidean | 2016-10-10 | Paper |
| Metric extension operators, vertex sparsifiers and Lipschitz extendability | 2016-07-25 | Paper |
| Near Optimal LP Rounding Algorithm for CorrelationClustering on Complete and Complete k-partite Graphs | 2015-08-21 | Paper |
| Constant factor approximation for balanced cut in the PIE model | 2015-06-26 | Paper |
| Concentration inequalities for nonlinear matroid intersection | 2015-05-29 | Paper |
| Integrality gaps for Sherali-Adams relaxations | 2015-02-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5497122 | 2015-02-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2934583 | 2014-12-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2934636 | 2014-12-18 | Paper |
| Near-optimal algorithms for unique games | 2014-11-25 | Paper |
| Near-optimal algorithms for maximum constraint satisfaction problems | 2014-11-18 | Paper |
| Min-Max Graph Partitioning and Small Set Expansion | 2014-07-30 | Paper |
| How to Play Unique Games Against a Semi-random Adversary: Study of Semi-random Models of Unique Games | 2014-07-30 | Paper |
| Min-max Graph Partitioning and Small Set Expansion | 2014-07-30 | Paper |
| The Grothendieck Constant is Strictly Smaller than Krivine's Bound | 2014-07-30 | Paper |
| Nonuniform Graph Partitioning with Unrelated Weights | 2014-07-01 | Paper |
| Precedence-Constrained Scheduling of Malleable Jobs with Preemption | 2014-07-01 | Paper |
| Online Make-to-Order Joint Replenishment Model: Primal-Dual Competitive Algorithms | 2014-06-26 | Paper |
| Approximation algorithms for semi-random partitioning problems | 2014-05-13 | Paper |
| Optimization Problems with Diseconomies of Scale via Decoupling | 2014-04-11 | Paper |
| THE GROTHENDIECK CONSTANT IS STRICTLY SMALLER THAN KRIVINE’S BOUND | 2014-03-11 | Paper |
| Approximation algorithms for spanner problems and directed Steiner forest | 2013-06-06 | Paper |
| Approximation Algorithm for Non-boolean MAX k-CSP | 2012-11-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3113698 | 2012-01-23 | Paper |
| Improved Approximation for the Directed Spanner Problem | 2011-07-06 | Paper |
| Maximizing Polynomials Subject to Assignment Constraints | 2011-07-06 | Paper |
| How to Play Unique Games on Expanders | 2011-02-15 | Paper |
| Local Global Tradeoffs in Metric Embeddings | 2011-01-17 | Paper |
| Maximum Quadratic Assignment Problem: Reduction from Maximum Label Cover and LP-Based Approximation Algorithm | 2010-09-07 | Paper |
| O(√log n) approximation algorithms for min UnCut, min 2CNF deletion, and directed cut problems | 2010-08-16 | Paper |
| Directed metrics and directed graph partitioning problems | 2010-08-16 | Paper |
| Quadratic forms on graphs | 2010-08-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579387 | 2010-08-06 | Paper |
| On Hardness of Pricing Items for Single-Minded Bidders | 2009-10-28 | Paper |
| A new class of non-Shannon-type inequalities for entropies | 2006-06-20 | Paper |
| Quadratic forms on graphs | 2006-03-21 | Paper |
