Gramoz Goranci

Publication Activity (10 Years)

Years Active: 2016-2024
Publications (10 Years): 55

Top Topics

Top Venues

Publications

T.-H. Hubert Chan, Gramoz Goranci, Shaofeng H.-C. Jiang, Bo Wang, Quan Xue
Fully Dynamic Algorithms for Euclidean Steiner Tree. WALCOM (2024)
Sally Dong, Gramoz Goranci, Lawrence Li, Sushant Sachdeva, Guanghao Ye
Fast Algorithms for Separable Linear Programs. SODA (2024)
Gramoz Goranci, Monika Henzinger, Harald Räcke, Sushant Sachdeva, A. R. Sricharan
Electrical Flows for Polylogarithmic Competitive Oblivious Routing. ITCS (2024)
Emilio Cruciani, Sebastian Forster, Gramoz Goranci, Yasamin Nazari, Antonis Skarlatos
-center on graphs. SODA (2024)
Gramoz Goranci, Monika Henzinger, Harald Räcke, Sushant Sachdeva, A. R. Sricharan
Electrical Flows for Polylogarithmic Competitive Oblivious Routing. CoRR (2023)
T.-H. Hubert Chan, Gramoz Goranci, Shaofeng H.-C. Jiang, Bo Wang, Quan Xue
Fully Dynamic Algorithms for Euclidean Steiner Tree. CoRR (2023)
Gramoz Goranci, Monika Henzinger, Danupon Nanongkai, Thatchaphol Saranurak, Mikkel Thorup, Christian Wulff-Nilsen
Fully Dynamic Exact Edge Connectivity in Sublinear Time. SODA (2023)
Sebastian Forster, Gramoz Goranci, Yasamin Nazari, Antonis Skarlatos
Bootstrapping Dynamic Distance Oracles. CoRR (2023)
Sally Dong, Gramoz Goranci, Lawrence Li, Sushant Sachdeva, Guanghao Ye
Fast Algorithms for Separable Linear Programs. CoRR (2023)
Gramoz Goranci, Monika Henzinger
Efficient Data Structures for Incremental Exact and Approximate Maximum Flow. ICALP (2023)
Emilio Cruciani, Sebastian Forster, Gramoz Goranci, Yasamin Nazari, Antonis Skarlatos
Dynamic algorithms for k-center on graphs. CoRR (2023)
Gramoz Goranci, Monika Henzinger, Danupon Nanongkai, Thatchaphol Saranurak, Mikkel Thorup, Christian Wulff-Nilsen
Fully Dynamic Exact Edge Connectivity in Sublinear Time. CoRR (2023)
Sebastian Forster, Gramoz Goranci, Yasamin Nazari, Antonis Skarlatos
Bootstrapping Dynamic Distance Oracles. ESA (2023)
Goran Zuzic, Gramoz Goranci, Mingquan Ye, Bernhard Haeupler, Xiaorui Sun
-Oblivious Routing. SODA (2022)
Sally Dong, Yu Gao, Gramoz Goranci, Yin Tat Lee, Richard Peng, Sushant Sachdeva, Guanghao Ye
Nested Dissection Meets IPMs: Planar Min-Cost Flow in Nearly-Linear Time. CoRR (2022)
Sally Dong, Yu Gao, Gramoz Goranci, Yin Tat Lee, Richard Peng, Sushant Sachdeva, Guanghao Ye
Nested Dissection Meets IPMs: Planar Min-Cost Flow in Nearly-Linear Time. SODA (2022)
Sebastian Forster, Gramoz Goranci, Yang P. Liu, Richard Peng, Xiaorui Sun, Mingquan Ye
Minor Sparsifiers and the Distributed Laplacian Paradigm. FOCS (2022)
Gramoz Goranci, Monika Henzinger
update time. CoRR (2022)
Sebastian Forster, Gramoz Goranci, Yang P. Liu, Richard Peng, Xiaorui Sun, Mingquan Ye
Minor Sparsifiers and the Distributed Laplacian Paradigm. FOCS (2021)
Goran Zuzic, Gramoz Goranci, Mingquan Ye, Bernhard Haeupler, Xiaorui Sun
Universally-Optimal Distributed Shortest Paths and Transshipment via Graph-Based L1-Oblivious Routing. CoRR (2021)
Pan Peng, Daniel Lopatta, Yuichi Yoshida, Gramoz Goranci
Local Algorithms for Estimating Effective Resistance. CoRR (2021)
Sebastian Forster, Gramoz Goranci, Monika Henzinger
Dynamic Maintenance of Low-Stretch Probabilistic Tree Embeddings with Applications. SODA (2021)
Gramoz Goranci, Monika Henzinger, Dariusz Leniowski, Christian Schulz, Alexander Svozil
-Center Clustering in Low Dimensional Metrics. ALENEX (2021)
Gramoz Goranci, Harald Räcke, Thatchaphol Saranurak, Zihan Tan
The Expander Hierarchy and its Applications to Dynamic Graph Algorithms. SODA (2021)
Pan Peng, Daniel Lopatta, Yuichi Yoshida, Gramoz Goranci
Local Algorithms for Estimating Effective Resistance. KDD (2021)
Matthew Fahrbach, Gramoz Goranci, Richard Peng, Sushant Sachdeva, Chi Wang
Faster Graph Embeddings via Coarsening. ICML (2020)
Gramoz Goranci, Harald Räcke, Thatchaphol Saranurak, Zihan Tan
The Expander Hierarchy and its Applications to Dynamic Graph Algorithms. CoRR (2020)
Li Chen, Gramoz Goranci, Monika Henzinger, Richard Peng, Thatchaphol Saranurak
Fast Dynamic Cuts, Distances and Effective Resistances via Vertex Sparsifiers. FOCS (2020)
Gramoz Goranci, Monika Henzinger, Pan Peng
Improved Guarantees for Vertex Sparsification in Planar Graphs. SIAM J. Discret. Math. 34 (1) (2020)
Sebastian Forster, Gramoz Goranci, Yang P. Liu, Richard Peng, Xiaorui Sun, Mingquan Ye
Minor Sparsifiers and the Distributed Laplacian Paradigm. CoRR (2020)
Li Chen, Gramoz Goranci, Monika Henzinger, Richard Peng, Thatchaphol Saranurak
Fast Dynamic Cuts, Distances and Effective Resistances via Vertex Sparsifiers. CoRR (2020)
Sebastian Forster, Gramoz Goranci, Monika Henzinger
Dynamic Maintenance of Low-Stretch Probabilistic Tree Embeddings with Applications. CoRR (2020)
Matthew Fahrbach, Gramoz Goranci, Richard Peng, Sushant Sachdeva, Chi Wang
Faster Graph Embeddings via Coarsening. CoRR (2020)
Sebastian Forster, Gramoz Goranci
Dynamic low-stretch trees via dynamic low-diameter decompositions. STOC (2019)
Gramoz Goranci
Dynamic Graph Algorithms and Graph Sparsification: New Techniques and Connections. CoRR (2019)
David Durfee, Yu Gao, Gramoz Goranci, Richard Peng
Fully Dynamic Spectral Vertex Sparsifiers and Applications. CoRR (2019)
David Durfee, Yu Gao, Gramoz Goranci, Richard Peng
Fully dynamic spectral vertex sparsifiers and applications. STOC (2019)
Gramoz Goranci, Monika Henzinger, Dariusz Leniowski, Alexander Svozil
Fully Dynamic k-Center Clustering in Doubling Metrics. CoRR (2019)
Gramoz Goranci, Monika Henzinger, Dariusz Leniowski
A Tree Structure For Dynamic Facility Location. CoRR (2019)
Gramoz Goranci, Monika Henzinger, Dariusz Leniowski
A Tree Structure For Dynamic Facility Location. ESA (2018)
Gramoz Goranci, Sebastian Krinninger
Dynamic Low-Stretch Trees via Dynamic Low-Diameter~Decompositions. CoRR (2018)
Gramoz Goranci, Monika Henzinger, Mikkel Thorup
Incremental Exact Min-Cut in Polylogarithmic Amortized Update Time. ACM Trans. Algorithms 14 (2) (2018)
David Durfee, Yu Gao, Gramoz Goranci, Richard Peng
Fully Dynamic Effective Resistances. CoRR (2018)
Gramoz Goranci, Monika Henzinger, Pan Peng
Dynamic Effective Resistances and Approximate Schur Complement on Separable Graphs. CoRR (2018)
Gramoz Goranci, Monika Henzinger, Pan Peng
Dynamic Effective Resistances and Approximate Schur Complement on Separable Graphs. ESA (2018)
Gramoz Goranci, Monika Henzinger, Pan Peng
The Power of Vertex Sparsifiers in Dynamic Graph Algorithms. ESA (2017)
Gramoz Goranci, Monika Henzinger, Pan Peng
Improved Guarantees for Vertex Sparsification in Planar Graphs. ESA (2017)
Gramoz Goranci, Monika Henzinger, Pan Peng
The Power of Vertex Sparsifiers in Dynamic Graph Algorithms. CoRR (2017)
Gramoz Goranci, Monika Henzinger, Pan Peng
Improved Guarantees for Vertex Sparsification in Planar Graphs. CoRR (2017)
Yun Kuen Cheung, Gramoz Goranci, Monika Henzinger
Graph Minors for Preserving Terminal Distances Approximately - Lower and Upper Bounds. ICALP (2016)
Gramoz Goranci, Harald Räcke
Vertex Sparsification in Trees. CoRR (2016)
Yun Kuen Cheung, Gramoz Goranci, Monika Henzinger
Graph Minors for Preserving Terminal Distances Approximately - Lower and Upper Bounds. CoRR (2016)
Gramoz Goranci, Monika Henzinger, Mikkel Thorup
Incremental Exact Min-Cut in Poly-logarithmic Amortized Update Time. CoRR (2016)
Gramoz Goranci, Harald Räcke
Vertex Sparsification in Trees. WAOA (2016)
Gramoz Goranci, Monika Henzinger, Mikkel Thorup
Incremental Exact Min-Cut in Poly-logarithmic Amortized Update Time. ESA (2016)