Articles with public access mandates - Gramoz GoranciLearn more
Available somewhere: 15
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
Mandates: US National Science Foundation, European Commission
Improved guarantees for vertex sparsification in planar graphs
G Goranci, M Henzinger, P Peng
SIAM Journal on Discrete Mathematics 34 (1), 130-162, 2020
Mandates: European Commission
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
Mandates: Danish Council for Independent Research, European Commission
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
Mandates: European Commission
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
Mandates: Austrian Science Fund, Natural Sciences and Engineering Research Council of …
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
Mandates: European Commission, Vienna Science and Technology Fund, Austria
Faster graph embeddings via coarsening
M Fahrbach, G Goranci, R Peng, S Sachdeva, C Wang
International conference on machine learning (ICML), 2953-2963, 2020
Mandates: US National Science Foundation, Natural Sciences and Engineering Research …
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
Mandates: US National Science Foundation, Swiss National Science Foundation, European …
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
Mandates: US National Science Foundation, US Department of Defense, Austrian Science …
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
Mandates: US National Science Foundation, Natural Sciences and Engineering Research …
Fully dynamic exact edge connectivity in sublinear time
G Goranci, M Henzinger, D Nanongkai, T Saranurak, M Thorup, ...
Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2023
Mandates: Danish Council for Independent Research, Villum Foundation, Swedish Research …
Dynamic low-stretch trees via dynamic lowdiameter~ decompositions
G Goranci, S Krinninger
arXiv preprint arXiv:1804.04928, 2018
Mandates: European Commission
Dynamic algorithms for k-center on graphs
E Cruciani, S Forster, G Goranci, Y Nazari, A Skarlatos
Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2024
Mandates: Austrian Science Fund, European Commission
Efficient data structures for incremental exact and approximate maximum flow
G Goranci, M Henzinger
50th International Colloquium on Automata, Languages, and Programming (ICALP …, 2023
Mandates: Austrian Science Fund, European Commission
Fully dynamic algorithms for euclidean steiner tree
THH Chan, G Goranci, SHC Jiang, B Wang, Q Xue
International Conference and Workshops on Algorithms and Computation, 62-75, 2024
Mandates: Research Grants Council, Hong Kong
Publication and funding information is determined automatically by a computer program