| 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 | 34* | 2019 |
| Improved guarantees for vertex sparsification in planar graphs G Goranci, M Henzinger, P Peng SIAM Journal on Discrete Mathematics 34 (1), 130-162, 2020 | 31 | 2020 |
| 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 | 30 | 2021 |
| 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 | 28 | 2016 |
| 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 | 27 | 2018 |
| 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 | 26* | 2019 |
| 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 | 23 | 2020 |
| 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 | 20 | 2018 |
| 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 | 17 | 2017 |
| Vertex sparsification in trees G Goranci, H Räcke International Workshop on Approximation and Online Algorithms, 103-115, 2016 | 13 | 2016 |
| A tree structure for dynamic facility location G Goranci, M Henzinger, D Leniowski Proceedings of the 26th European Symposium on Algorithms (ESA), 2019 | 11 | 2019 |
| Faster graph embeddings via coarsening M Fahrbach, G Goranci, R Peng, S Sachdeva, C Wang International Conference on Machine Learning, 2953-2963, 2020 | 10 | 2020 |
| Dynamic graph algorithms and graph sparsification: New techniques and connections G Goranci arXiv preprint arXiv:1909.06413, 2019 | 10* | 2019 |
| 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 | 8 | 2021 |
| 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 | 7* | 2021 |
| 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 | 6* | 2022 |
| Fast incremental algorithms via local sparsifiers G Goranci, M Henzinger, T Saranurak unpublished manuscript, 2018 | 6 | 2018 |
| 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 | 4 | 2022 |
| 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 | 3 | 2022 |
| 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 | | 2021 |
Monika HenzingerProfessor of Computer Science, University of ViennaVerified email at univie.ac.at
