Prati
Gramoz Goranci
Gramoz Goranci
University of Vienna
Potvrđena adresa e-pošte na univie.ac.at - Početna stranica
Naslov
Citirano
Citirano
Godina
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
792021
Fast dynamic cuts, distances and effective resistances via vertex sparsifiers
L Chen, G Goranci, M Henzinger, R Peng, T Saranurak
2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS …, 2020
542020
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
532019
Improved guarantees for vertex sparsification in planar graphs
G Goranci, M Henzinger, P Peng
SIAM Journal on Discrete Mathematics 34 (1), 130-162, 2020
462020
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
422018
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
412019
Graph minors for preserving terminal distances approximately-lower and upper bounds
YK Cheung, G Goranci, M Henzinger
Proceedings of the International Colloquium on Automata, Languages, and …, 2016
372016
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
332021
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
32*2021
Faster graph embeddings via coarsening
M Fahrbach, G Goranci, R Peng, S Sachdeva, C Wang
International conference on machine learning (ICML), 2953-2963, 2020
302020
Dynamic effective resistances and approximate schur complement on separable graphs
G Goranci, M Henzinger, P Peng
Proceedings of the European Symposium on Algorithms (ESA), 2018
292018
Universally-Optimal Distributed Shortest Paths and Transshipment via Graph-Based ℓ1-Oblivious Routing
G Zuzic, G Goranci, M Ye, B Haeupler, X Sun
Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2022
262022
Minor sparsifiers and the distributed laplacian paradigm
S Forster, G Goranci, YP Liu, R Peng, X Sun, M Ye
2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS …, 2022
252022
Local algorithms for estimating effective resistance
P Peng, D Lopatta, Y Yoshida, G Goranci
Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery & Data …, 2021
252021
The power of vertex sparsifiers in dynamic graph algorithms
G Goranci, M Henzinger, P Peng
Proceedings of the European Symposium on Algorithms (ESA), 2017
222017
Nested dissection meets ipms: Planar min-cost flow in nearly-linear time
S Dong, Y Gao, G Goranci, YT Lee, R Peng, S Sachdeva, G Ye
Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2022
202022
Vertex sparsification in trees
G Goranci, H Räcke
International Workshop on Approximation and Online Algorithms, 103-115, 2016
202016
A tree structure for dynamic facility location
G Goranci, M Henzinger, D Leniowski
Proceedings of the European Symposium on Algorithms (ESA), 2019
192019
Bootstrapping dynamic distance oracles
S Forster, G Goranci, Y Nazari, A Skarlatos
Proceedings of the European Symposium on Algorithms (ESA), 2023
152023
Dynamic graph algorithms and graph sparsification: New techniques and connections
G Goranci
arXiv preprint arXiv:1909.06413, 2019
122019
Sustav trenutno ne može provesti ovu radnju. Pokušajte ponovo kasnije.
Članci 1–20