| Publication | Date of Publication | Type |
|---|
| Optimality of the Johnson-Lindenstrauss dimensionality reduction for practical measures | 2024-05-14 | Paper |
| Near-linear time approximation schemes for Steiner tree and forest in low-dimensional spaces | 2023-11-14 | Paper |
| Covering metric spaces by few trees | 2022-08-26 | Paper |
| Covering Metric Spaces by Few Trees | 2022-07-21 | Paper |
| Advances in Metric Ramsey Theory and its Applications | 2021-04-07 | Paper |
| Approximate nearest neighbor search for \(\ell_p\)-spaces \((2<p<\infty)\) via embeddings | 2020-02-12 | Paper |
| On notions of distortion and an almost minimum spanning tree with constant average distortion | 2019-08-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633900 | 2019-05-06 | Paper |
| Approximate nearest neighbor search for \(\ell_{p}\)-spaces \((2 < p < \infty)\) via embeddings | 2019-01-18 | Paper |
| On Notions of Distortion and an Almost Minimum Spanning Tree with Constant Average Distortion | 2018-07-16 | Paper |
| On-line routing in all-optical networks | 2018-07-04 | Paper |
| On the Impossibility of Dimension Reduction for Doubling Subsets of ℓp | 2018-04-23 | Paper |
| Dimension Reduction Techniques for l_p (1<p<2), with Applications | 2018-01-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5365087 | 2017-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5365085 | 2017-09-29 | Paper |
| The traveling salesman problem: low-dimensionality implies a polynomial time approximation scheme | 2016-09-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501781 | 2015-08-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501324 | 2015-08-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501325 | 2015-08-03 | Paper |
| On the Impossibility of Dimension Reduction for Doubling Subsets of $\ell_{p}$ | 2015-07-31 | Paper |
| Local embeddings of metric spaces | 2015-07-10 | Paper |
| Embedding Metrics into Ultrametrics and Graphs into Spanning Trees with Constant Average Distortion | 2015-06-02 | Paper |
| Competitive distributed file allocation | 2015-05-07 | Paper |
| Approximating min-sum k -clustering in metric spaces | 2015-02-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2934632 | 2014-12-18 | Paper |
| Advances in metric embedding theory | 2014-11-25 | Paper |
| Volume in general metric spaces | 2014-10-29 | Paper |
| The traveling salesman problem | 2014-05-13 | Paper |
| Bandwidth and low dimensional embedding | 2013-12-19 | Paper |
| Advances in metric embedding theory | 2011-12-02 | Paper |
| Bandwidth and Low Dimensional Embedding | 2011-08-17 | Paper |
| Volume in General Metric Spaces | 2010-09-06 | Paper |
| On metric Ramsey-type phenomena | 2010-08-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579400 | 2010-08-06 | Paper |
| Universal Immersion Spaces for Edge-Colored Graphs and Nearest-Neighbor Metrics | 2010-06-01 | Paper |
| Local embeddings of metric spaces | 2009-01-05 | Paper |
| New algorithms for an ancient scheduling problem. | 2008-12-21 | Paper |
| Competitive algorithms for distributed data management. | 2008-12-21 | Paper |
| Limitations to Fréchet's metric embedding method | 2007-10-09 | Paper |
| STACS 2004 | 2007-10-01 | Paper |
| On the Value of Preemption in Scheduling | 2007-08-28 | Paper |
| Lower Bounds for On-line Graph Problems with Application to On-line Circuit and Optical Routing | 2007-05-03 | Paper |
| The harmonic k -server algorithm is competitive | 2006-09-12 | Paper |
| On metric Ramsey-type phenomena | 2006-07-26 | Paper |
| Ramsey-type theorems for metric spaces with applications to online problems | 2006-07-12 | Paper |
| Algorithms – ESA 2004 | 2005-08-18 | Paper |
| Randomized k-server algorithms for growth-rate bounded graphs | 2005-06-30 | Paper |
| ON METRIC RAMSEY-TYPE DICHOTOMIES | 2005-05-23 | Paper |
| Some low distortion metric Ramsey problems | 2005-02-23 | Paper |
| Fast, Distributed Approximation Algorithms for Positive Linear Programming with Applications to Flow Control | 2005-02-21 | Paper |
| Multiembedding of Metric Spaces | 2005-02-21 | Paper |
| On the competitive ratio of the work function algorithm for the \(k\)-server problem | 2004-11-23 | Paper |
| On-line generalized Steiner problem | 2004-11-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4818855 | 2004-09-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4471325 | 2004-07-28 | Paper |
| Competitive distributed file allocation. | 2004-03-14 | Paper |
| Low dimensional embeddings of ultrametrics. | 2004-02-14 | Paper |
| More on random walks, electrical networks, and the harmonic \(k\)-server algorithm. | 2003-01-21 | Paper |
| A randomized algorithm for two servers on the line. | 2003-01-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4542533 | 2002-08-01 | Paper |
| Fast, fair and frugal bandwidth allocation in ATM networks | 2002-06-17 | Paper |
| On page migration and other relaxed task systems | 2002-03-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4501566 | 2001-06-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4527040 | 2001-03-01 | Paper |
| Multiprocessor Scheduling with Rejection | 2000-03-19 | Paper |
| On-line routing in all-optical networks | 2000-01-12 | Paper |
| On capital investment. | 2000-01-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252277 | 1999-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4230358 | 1999-04-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4228508 | 1999-03-01 | Paper |
| Distributed Paging for General Networks | 1998-01-01 | Paper |
| The Distributedk-Server Problem—A Competitive Distributed Translator fork-Server Algorithms | 1997-11-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3128890 | 1997-04-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4876409 | 1996-10-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4875173 | 1996-09-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4875170 | 1996-04-28 | Paper |
| A better lower bound for on-line scheduling | 1994-06-15 | Paper |
