| No. |
Title |
Author |
Year |
| 1 |
Computing Bi-Lipschitz Outlier Embeddings into the Line |
Chubarian, Karine et al. |
2020 |
| 2 |
Learning Lines with Ordinal Constraints |
Fan, Bohan et al. |
2020 |
| 3 |
Algorithms for Metric Learning via Contrastive Embeddings |
Ihara, Diego et al. |
2019 |
| 4 |
Routing Symmetric Demands in Directed Minor-Free Graphs with Constant Congestion |
Carpenter, Timothy et al. |
2019 |
| 5 |
Algorithms for Low-Distortion Embeddings into Arbitrary 1-Dimensional Spaces |
Carpenter, Timothy et al. |
2018 |
| 6 |
Fractal Dimension and Lower Bounds for Geometric Problems |
Sidiropoulos, Anastasios et al. |
2018 |
| 7 |
Algorithmic Interpretations of Fractal Dimension |
Sidiropoulos, Anastasios et al. |
2017 |
| 8 |
Temporal Clustering |
Dey, Tamal K. et al. |
2017 |
| 9 |
Temporal Hierarchical Clustering |
Dey, Tamal K. et al. |
2017 |
| 10 |
Constant-Distortion Embeddings of Hausdorff Metrics into Constant-Dimensional l_p Spaces |
Backurs, Arturs et al. |
2016 |
| 11 |
Constant-Factor Approximations for Asymmetric TSP on Nearly-Embeddable Graphs |
Marx, Dániel et al. |
2016 |
| 12 |
Quasimetric Embeddings and Their Applications |
Mémoli, Facundo et al. |
2016 |
