Gramoz Goranci

According to our database, Gramoz Goranci authored at least 33 papers between 2016 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2024

Fully Dynamic Algorithms for Euclidean Steiner Tree.

T.-H. Hubert Chan, Gramoz Goranci, Shaofeng H.-C. Jiang, Bo Wang, Quan Xue

Proceedings of the WALCOM: Algorithms and Computation, 2024

Fast Algorithms for Separable Linear Programs.

Sally Dong, Gramoz Goranci, Lawrence Li, Sushant Sachdeva, Guanghao Ye

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

Dynamic algorithms for <i>k</i>-center on graphs.

Emilio Cruciani, Sebastian Forster, Gramoz Goranci, Yasamin Nazari, Antonis Skarlatos

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

Electrical Flows for Polylogarithmic Competitive Oblivious Routing.

Gramoz Goranci, Monika Henzinger, Harald Räcke, Sushant Sachdeva, A. R. Sricharan

Proceedings of the 15th Innovations in Theoretical Computer Science Conference, 2024

2023

Dynamic algorithms for k-center on graphs.

Emilio Cruciani, Sebastian Forster, Gramoz Goranci, Yasamin Nazari, Antonis Skarlatos

CoRR, 2023

Fully Dynamic Exact Edge Connectivity in Sublinear Time.

Gramoz Goranci, Monika Henzinger, Danupon Nanongkai, Thatchaphol Saranurak, Mikkel Thorup, Christian Wulff-Nilsen

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Efficient Data Structures for Incremental Exact and Approximate Maximum Flow.

Gramoz Goranci, Monika Henzinger

Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

Bootstrapping Dynamic Distance Oracles.

Sebastian Forster, Gramoz Goranci, Yasamin Nazari, Antonis Skarlatos

Proceedings of the 31st Annual European Symposium on Algorithms, 2023

2022

Incremental Approximate Maximum Flow in m^1/2+o(1) update time.

Gramoz Goranci, Monika Henzinger

CoRR, 2022

Universally-Optimal Distributed Shortest Paths and Transshipment via Graph-Based ℓ₁-Oblivious Routing.

Goran Zuzic, Gramoz Goranci, Mingquan Ye, Bernhard Haeupler, Xiaorui Sun

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

Nested Dissection Meets IPMs: Planar Min-Cost Flow in Nearly-Linear Time.

Sally Dong, Yu Gao, Gramoz Goranci, Yin Tat Lee, Richard Peng, Sushant Sachdeva, Guanghao Ye

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

2021

Universally-Optimal Distributed Shortest Paths and Transshipment via Graph-Based L1-Oblivious Routing.

Goran Zuzic, Gramoz Goranci, Mingquan Ye, Bernhard Haeupler, Xiaorui Sun

CoRR, 2021

The Expander Hierarchy and its Applications to Dynamic Graph Algorithms.

Gramoz Goranci, Harald Räcke, Thatchaphol Saranurak, Zihan Tan

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

Dynamic Maintenance of Low-Stretch Probabilistic Tree Embeddings with Applications.

Sebastian Forster, Gramoz Goranci, Monika Henzinger

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

Local Algorithms for Estimating Effective Resistance.

Pan Peng, Daniel Lopatta, Yuichi Yoshida, Gramoz Goranci

Proceedings of the KDD '21: The 27th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2021

Minor Sparsifiers and the Distributed Laplacian Paradigm.

Sebastian Forster, Gramoz Goranci, Yang P. Liu, Richard Peng, Xiaorui Sun, Mingquan Ye

Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021

Fully Dynamic <i>k</i>-Center Clustering in Low Dimensional Metrics.

Gramoz Goranci, Monika Henzinger, Dariusz Leniowski, Christian Schulz, Alexander Svozil

Proceedings of the Symposium on Algorithm Engineering and Experiments, 2021

2020

Improved Guarantees for Vertex Sparsification in Planar Graphs.

Gramoz Goranci, Monika Henzinger, Pan Peng

SIAM J. Discret. Math., 2020

Faster Graph Embeddings via Coarsening.

Matthew Fahrbach, Gramoz Goranci, Richard Peng, Sushant Sachdeva, Chi Wang

Proceedings of the 37th International Conference on Machine Learning, 2020

Fast Dynamic Cuts, Distances and Effective Resistances via Vertex Sparsifiers.

Li Chen, Gramoz Goranci, Monika Henzinger, Richard Peng, Thatchaphol Saranurak

Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020

2019

Algorithmen für graphbasierte dynamische Probleme.

Gramoz Goranci

Proceedings of the Ausgezeichnete Informatikdissertationen 2019., 2019

Dynamic Graph Algorithms and Graph Sparsification: New Techniques and Connections.

Gramoz Goranci

CoRR, 2019

Fully Dynamic k-Center Clustering in Doubling Metrics.

Gramoz Goranci, Monika Henzinger, Dariusz Leniowski, Alexander Svozil

CoRR, 2019

Dynamic low-stretch trees via dynamic low-diameter decompositions.

Sebastian Forster, Gramoz Goranci

Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019

Fully dynamic spectral vertex sparsifiers and applications.

David Durfee, Yu Gao, Gramoz Goranci, Richard Peng

Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019

2018

Incremental Exact Min-Cut in Polylogarithmic Amortized Update Time.

Gramoz Goranci, Monika Henzinger, Mikkel Thorup

ACM Trans. Algorithms, 2018

Fully Dynamic Effective Resistances.

David Durfee, Yu Gao, Gramoz Goranci, Richard Peng

CoRR, 2018

Dynamic Effective Resistances and Approximate Schur Complement on Separable Graphs.

Gramoz Goranci, Monika Henzinger, Pan Peng

Proceedings of the 26th Annual European Symposium on Algorithms, 2018

A Tree Structure For Dynamic Facility Location.

Gramoz Goranci, Monika Henzinger, Dariusz Leniowski

Proceedings of the 26th Annual European Symposium on Algorithms, 2018

2017

The Power of Vertex Sparsifiers in Dynamic Graph Algorithms.

Gramoz Goranci, Monika Henzinger, Pan Peng

Proceedings of the 25th Annual European Symposium on Algorithms, 2017

2016

Vertex Sparsification in Trees.

Gramoz Goranci, Harald Räcke

Proceedings of the Approximation and Online Algorithms - 14th International Workshop, 2016

Graph Minors for Preserving Terminal Distances Approximately - Lower and Upper Bounds.

Yun Kuen Cheung, Gramoz Goranci, Monika Henzinger

Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

Incremental Exact Min-Cut in Poly-logarithmic Amortized Update Time.

Gramoz Goranci, Monika Henzinger, Mikkel Thorup

Proceedings of the 24th Annual European Symposium on Algorithms, 2016