Publication | Date of Publication | Type |
---|
Low Rank Matrix-Valued Chernoff Bounds and Approximate Matrix Multiplication | 2017-09-29 | Paper |
How well can primal-dual and local-ratio algorithms perform? | 2014-09-09 | Paper |
https://portal.mardi4nfdi.de/entity/Q5403036 | 2014-03-25 | Paper |
On the Tightening of the Standard SDP for Vertex Cover with $ell_1$ Inequalities | 2012-10-24 | Paper |
https://portal.mardi4nfdi.de/entity/Q2913812 | 2012-09-27 | Paper |
Tight Gaps for Vertex Cover in the Sherali-Adams SDP Hierarchy | 2012-08-31 | Paper |
Toward a model for backtracking and dynamic programming | 2012-06-26 | Paper |
https://portal.mardi4nfdi.de/entity/Q3002766 | 2011-05-24 | Paper |
Integrality Gaps of $2-o(1)$ for Vertex Cover SDPs in the Lovász–Schrijver Hierarchy | 2011-04-04 | Paper |
Online Embeddings | 2010-09-10 | Paper |
A sublinear algorithm for weakly approximating edit distance | 2010-08-16 | Paper |
Sublinear geometric algorithms | 2010-08-16 | Paper |
Girth and euclidean distortion | 2010-08-05 | Paper |
Extending SDP Integrality Gaps to Sherali-Adams with Applications to Quadratic Programming and MaxCutGain | 2010-06-22 | Paper |
On Quadratic Threshold CSPs | 2010-04-27 | Paper |
Integrality Gaps of Semidefinite Programs for Vertex Cover and Relations to $\ell_1$ Embeddability of Negative Type Metrics | 2010-03-17 | Paper |
Optimal Sherali-Adams Gaps from Pairwise Independence | 2009-10-28 | Paper |
Robust Algorithms for on Minor-Free Graphs Based on the Sherali-Adams Hierarchy | 2009-10-28 | Paper |
Integrality Gaps of Semidefinite Programs for Vertex Cover and Relations to ℓ1 Embeddability of Negative Type Metrics | 2009-02-17 | Paper |
Near Optimal Dimensionality Reductions That Preserve Volumes | 2008-11-27 | Paper |
Analysis of set-up time models: a metric perspective | 2008-07-31 | Paper |
Vertex Cover Resists SDPs Tightened by Local Hypermetric Inequalities | 2008-06-10 | Paper |
Approximate range searching in higher dimension | 2007-10-19 | Paper |
Dimensionality reductions in \(\ell_{2}\) that preserve volumes and distance to affine spaces | 2007-10-11 | Paper |
A Rigorous Analysis for Set-Up Time Models – A Metric Perspective | 2007-09-10 | Paper |
Monotone Circuits for the Majority Function | 2007-08-28 | Paper |
Sublinear Geometric Algorithms | 2006-06-01 | Paper |
Computing and Combinatorics | 2006-01-11 | Paper |
Automata, Languages and Programming | 2006-01-10 | Paper |
Simple permutations mix well | 2006-01-09 | Paper |
Approximating the Weight of the Euclidean Minimum Spanning Tree in Sublinear Time | 2005-10-28 | Paper |
Automata, Languages and Programming | 2005-08-24 | Paper |
Metric embeddings -- beyond one-dimensional distortion | 2004-12-16 | Paper |
https://portal.mardi4nfdi.de/entity/Q4471376 | 2004-07-28 | Paper |
https://portal.mardi4nfdi.de/entity/Q4542534 | 2004-02-08 | Paper |
https://portal.mardi4nfdi.de/entity/Q4440441 | 2003-12-17 | Paper |
Least-distortion Euclidean embeddings of graphs: Products of cycles and expanders | 2002-12-10 | Paper |
Girth and Euclidean distortion | 2002-07-29 | Paper |
Low distortion Euclidean embeddings of trees | 2000-06-05 | Paper |