| Publication | Date of Publication | Type |
|---|
| Constrained TSP and low-power computing | 2022-08-19 | Paper |
| On-line load balancing for related machines | 2022-08-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5088943 | 2022-07-18 | Paper |
| Min-Cost Bipartite Perfect Matching with Delays | 2021-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5002703 | 2021-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5002705 | 2021-07-28 | Paper |
| Resilience: A Criterion for Learning in the Presence of Arbitrary Outliers | 2021-06-15 | Paper |
| The one-way communication complexity of dynamic time warping distance | 2021-03-17 | Paper |
| Efficient profile maximum likelihood for universal symmetric property estimation | 2020-01-30 | Paper |
| Hierarchical Clustering better than Average-Linkage | 2019-10-15 | Paper |
| Better Algorithms and Hardness for Broadcast Scheduling via a Discrepancy Approach | 2019-06-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5743407 | 2019-05-10 | Paper |
| Approximate Hierarchical Clustering via Sparsest Cut and Spreading Metrics | 2018-07-16 | Paper |
| On Approximating Target Set Selection | 2018-04-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5368726 | 2017-10-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5365142 | 2017-09-29 | Paper |
| Local guarantees in graph cuts and clustering | 2017-08-31 | Paper |
| Learning from untrusted data | 2017-08-17 | Paper |
| Multireference alignment using semidefinite programming | 2017-05-19 | Paper |
| Relax, No Need to Round | 2017-05-19 | Paper |
| A constant-factor approximation algorithm for the k -median problem (extended abstract) | 2016-09-29 | Paper |
| On targeting Markov segments | 2016-09-29 | Paper |
| Spectral Embedding of k-Cliques, Graph Partitioning and k-Means | 2016-04-15 | Paper |
| Aggregating inconsistent information | 2015-11-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501781 | 2015-08-14 | Paper |
| Smoothed analysis of tensor decompositions | 2015-06-26 | Paper |
| Clustering to minimize the sum of cluster diameters | 2015-02-27 | Paper |
| Approximating min-sum k -clustering in metric spaces | 2015-02-27 | Paper |
| Integrality gaps for Sherali-Adams relaxations | 2015-02-04 | Paper |
| MaxMin allocation via degree lower-bounded arborescences | 2015-02-04 | 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 |
| https://portal.mardi4nfdi.de/entity/Q2921662 | 2014-10-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2921673 | 2014-10-13 | Paper |
| Query strategies for priced information (extended abstract) | 2014-09-26 | Paper |
| Detecting high log-densities | 2014-08-13 | Paper |
| On Quadratic Programming with a Ratio Objective | 2013-08-12 | Paper |
| A Dependent LP-Rounding Approach for the k-Median Problem | 2013-08-12 | Paper |
| Fitting Tree Metrics: Hierarchical Clustering and Phylogeny | 2012-02-11 | Paper |
| Beating the Random Ordering Is Hard: Every Ordering CSP Is Approximation Resistant | 2011-10-18 | Paper |
| Improved approximation algorithms for label cover problems | 2011-08-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3002773 | 2011-05-24 | Paper |
| Local Global Tradeoffs in Metric Embeddings | 2011-01-17 | Paper |
| Better streaming algorithms for clustering problems | 2010-08-16 | Paper |
| On non-uniform multicommodity buy-at-bulk network design | 2010-08-16 | Paper |
| O(√log n) approximation algorithms for min UnCut, min 2CNF deletion, and directed cut problems | 2010-08-16 | Paper |
| A robust maximum completion time measure for scheduling | 2010-08-16 | Paper |
| Directed metrics and directed graph partitioning problems | 2010-08-16 | Paper |
| Aggregating inconsistent information | 2010-08-16 | Paper |
| Approximating the smallest grammar | 2010-08-05 | Paper |
| Similarity estimation techniques from rounding algorithms | 2010-08-05 | Paper |
| Improved Approximation Algorithms for Label Cover Problems | 2009-10-29 | Paper |
| Improved approximation for directed cut problems | 2009-01-05 | Paper |
| On the impossibility of dimension reduction in l 1 | 2008-12-21 | Paper |
| The Smallest Grammar Problem | 2008-12-21 | Paper |
| On the Integrality Ratio for the Asymmetric Traveling Salesman Problem | 2008-05-27 | Paper |
| A derandomization using min-wise independent permutations | 2007-04-26 | Paper |
| Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques | 2006-07-07 | Paper |
| Clustering with qualitative information | 2005-10-10 | Paper |
| Improved Combinatorial Algorithms for Facility Location Problems | 2005-09-16 | Paper |
| Minimizing Wirelength in Zero and Bounded Skew Clock Trees | 2005-02-28 | Paper |
| Incremental Clustering and Dynamic Information Retrieval | 2005-02-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4828990 | 2004-11-29 | Paper |
| Clustering to minimize the sum of cluster diameters | 2004-11-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737179 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4542528 | 2004-01-27 | Paper |
| A constant-factor approximation algorithm for the \(k\)-median problem | 2003-05-04 | Paper |
| Delayed information and action in on-line algorithms | 2003-01-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4542551 | 2002-09-17 | Paper |
| Query strategies for priced information | 2002-09-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4542553 | 2002-08-01 | Paper |
| Algorithms for Capacitated Vehicle Routing | 2002-04-23 | Paper |
| On page migration and other relaxed task systems | 2002-03-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2768359 | 2002-01-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2753729 | 2001-11-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4527030 | 2001-02-28 | Paper |
| On-Line Load Balancing for Related Machines | 2000-10-04 | Paper |
| Min-wise independent permutations | 2000-08-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4250208 | 2000-06-21 | Paper |
| Approximation Algorithms for Directed Steiner Problems | 2000-05-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4250182 | 1999-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252287 | 1999-06-17 | Paper |
