ACM - Normas
Anupam Gupta
Ittai Abraham
Arnold Filtser
Ofer Neiman
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2018
Cuts, Trees and ?1-Embeddings of Graphs*
On the Non-Uniform Sparsest Cut Problem on Bounded Treewidth Graphs
On the Optimality of Gluing over Scales
a new embedding method for finite metrics
Embedding the diamond graph in ? p and dimension reduction in ? 1
Coarse Differentiation and Multiflows in Planar Graphs