Gramoz Goranci
Gramoz Goranci
Verified email at glasgow.ac.uk - Homepage
Title
Cited by
Cited by
Year
Fully dynamic spectral vertex sparsifiers and applications
D Durfee, Y Gao, G Goranci, R Peng
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing …, 2019
25*2019
Incremental exact min-cut in polylogarithmic amortized update time
G Goranci, M Henzinger, M Thorup
ACM Transactions on Algorithms (TALG) 14 (2), 1-21, 2018
252018
Improved guarantees for vertex sparsification in planar graphs
G Goranci, M Henzinger, P Peng
SIAM Journal on Discrete Mathematics 34 (1), 130-162, 2020
242020
Graph minors for preserving terminal distances approximately-lower and upper bounds
YK Cheung, G Goranci, M Henzinger
Proceedings of the 43rd International Colloquium on Automata, Languages, and …, 2016
232016
Dynamic low-stretch trees via dynamic low-diameter decompositions
S Forster, G Goranci
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing …, 2019
22*2019
The expander hierarchy and its applications to dynamic graph algorithms
G Goranci, H Räcke, T Saranurak, Z Tan
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021
18*2021
Dynamic effective resistances and approximate schur complement on separable graphs
G Goranci, M Henzinger, P Peng
Proceedings of the 26th European Symposium on Algorithms (ESA), 2018
172018
The power of vertex sparsifiers in dynamic graph algorithms
G Goranci, M Henzinger, P Peng
Proceedings of the 25th European Symposium on Algorithms (ESA), 2017
152017
Fast dynamic cuts, distances and effective resistances via vertex sparsifiers
L Chen, G Goranci, M Henzinger, R Peng, T Saranurak
Proceedings of the 61st IEEE Symposium on Foundations of Computer Science (FOCS), 2020
132020
A tree structure for dynamic facility location
G Goranci, M Henzinger, D Leniowski
Proceedings of the 26th European Symposium on Algorithms (ESA), 2019
122019
Vertex sparsification in trees
G Goranci, H Räcke
International Workshop on Approximation and Online Algorithms, 103-115, 2016
92016
Dynamic maintenance of low-stretch probabilistic tree embeddings with applications
S Forster, G Goranci, M Henzinger
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021
72021
Fast incremental algorithms via local sparsifiers
G Goranci, M Henzinger, T Saranurak
unpublished manuscript, 2018
62018
Faster graph embeddings via coarsening
M Fahrbach, G Goranci, R Peng, S Sachdeva, C Wang
International Conference on Machine Learning, 2953-2963, 2020
42020
Dynamic graph algorithms and graph sparsification: New techniques and connections
G Goranci
arXiv preprint arXiv:1909.06413, 2019
4*2019
Fully Dynamic k-Center Clustering in Low Dimensional Metrics
G Goranci, M Henzinger, D Leniowski, C Schulz, A Svozil
2021 Proceedings of the Workshop on Algorithm Engineering and Experiments …, 2021
3*2021
Minor Sparsifiers and the Distributed Laplacian Paradigm
S Forster, G Goranci, YP Liu, R Peng, X Sun, M Ye
arXiv preprint arXiv:2012.15675, 2020
32020
Local Algorithms for Estimating Effective Resistance
P Peng, D Lopatta, Y Yoshida, G Goranci
arXiv preprint arXiv:2106.03476, 2021
2021
The system can't perform the operation now. Try again later.
Articles 1–18