( en | de | ru )

 

Disambiguation of "Goranci, Gramoz"

Author of the publication

copydeleteadd this publication to your clipboard
Improved Guarantees for Vertex Sparsification in Planar Graphs.

, , and . ESA, volume 87 of LIPIcs, page 44:1-44:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)

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 Polylogarithmic Amortized Update Time., , and . ACM Trans. Algorithms, 14 (2): 17:1-17:21 (2018)Universally-Optimal Distributed Shortest Paths and Transshipment via Graph-Based L1-Oblivious Routing., , , , and . CoRR, (2021)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)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)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)Dynamic low-stretch trees via dynamic low-diameter decompositions., and . STOC, page 377-388. ACM, (2019)Fully Dynamic Algorithms for Euclidean Steiner Tree., , , , and . CoRR, (2023)Fully Dynamic Effective Resistances., , , and . CoRR, (2018)Dynamic algorithms for k-center on graphs., , , , and . SODA, page 3441-3462. SIAM, (2024)The Expander Hierarchy and its Applications to Dynamic Graph Algorithms., , , and . SODA, page 2212-2228. SIAM, (2021)