( en | de | ru )

 

Disambiguation of "Goranci, Gramoz"

Author of the publication

copydeleteadd this publication to your clipboard
Dynamic Maintenance of Low-Stretch Probabilistic Tree Embeddings with Applications.

, , and . SODA, page 1226-1245. SIAM, (2021)

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.

No persons found for author name Goranci, Gramoz
add a person with the name Goranci, Gramoz
 

Other publications of authors with the same name

Incremental Exact Min-Cut in Poly-logarithmic Amortized Update Time., , and . ESA, volume 57 of LIPIcs, page 46:1-46:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Dynamic Effective Resistances and Approximate Schur Complement on Separable Graphs., , and . ESA, volume 112 of LIPIcs, page 40:1-40:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Efficient Data Structures for Incremental Exact and Approximate Maximum Flow., and . ICALP, volume 261 of LIPIcs, page 69:1-69:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Graph Minors for Preserving Terminal Distances Approximately - Lower and Upper Bounds., , and . ICALP, volume 55 of LIPIcs, page 131:1-131:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Improved Guarantees for Vertex Sparsification in Planar Graphs., , and . SIAM J. Discret. Math., 34 (1): 130-162 (2020)Fast Algorithms for Separable Linear Programs., , , , and . CoRR, (2023)Universally-Optimal Distributed Shortest Paths and Transshipment via Graph-Based ℓ1-Oblivious Routing., , , , and . SODA, page 2549-2579. SIAM, (2022)Faster Graph Embeddings via Coarsening., , , , and . ICML, volume 119 of Proceedings of Machine Learning Research, page 2953-2963. PMLR, (2020)Dynamic Facility Location in High Dimensional Euclidean Spaces., , , , and . ICML, OpenReview.net, (2024)Dynamic low-stretch trees via dynamic low-diameter decompositions., and . STOC, page 377-388. ACM, (2019)