Author of the publication

On Constant Multi-Commodity Flow-Cut Gaps for Families of Directed Minor-Free Graphs.

, , and . SODA, page 535-553. SIAM, (2019)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Grouping Words with Semantic Diversity., , , and . NAACL-HLT, page 3217-3228. Association for Computational Linguistics, (2021)A Polynomial Time Algorithm for Maximum Likelihood Estimation of Multivariate Log-concave Densities, , and . (2018)cite arxiv:1812.05524.Polylogarithmic approximation for Euler genus on bounded degree graphs., and . STOC, page 164-175. ACM, (2019)Approximation Algorithms for Low-Distortion Embeddings into Low-Dimensional Spaces., , , , , , , and . SIAM J. Discret. Math., 33 (1): 454-473 (2019)Fractal Dimension and Lower Bounds for Geometric Problems., , and . Discret. Comput. Geom., 66 (1): 32-67 (2021)On Constant Multi-Commodity Flow-Cut Gaps for Families of Directed Minor-Free Graphs., , and . SODA, page 535-553. SIAM, (2019)Routing Symmetric Demands in Directed Minor-Free Graphs with Constant Congestion., , and . APPROX-RANDOM, volume 145 of LIPIcs, page 14:1-14:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Learning Lines with Ordinal Constraints., , , , , and . APPROX-RANDOM, volume 176 of LIPIcs, page 45:1-45:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Approximate greedy clustering and distance selection for graph metrics., , and . J. Comput. Geom., 11 (1): 629-652 (2020)Geometric Algorithms for k-NN Poisoning., , , , , , and . CoRR, (2023)