default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGramoz Goranci
Person information
- affiliation: University of Vienna, Austria
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c26]Sayan Bhattacharya, Gramoz Goranci, Shaofeng H.-C. Jiang, Yi Qian, Yubo Zhang:
Dynamic Facility Location in High Dimensional Euclidean Spaces. ICML 2024- [c25]Gramoz Goranci, Monika Henzinger, Harald Räcke, Sushant Sachdeva, A. R. Sricharan:
Electrical Flows for Polylogarithmic Competitive Oblivious Routing. ITCS 2024: 55:1-55:22 - [c24]Emilio Cruciani, Sebastian Forster, Gramoz Goranci, Yasamin Nazari
, Antonis Skarlatos:
Dynamic algorithms for k-center on graphs. SODA 2024: 3441-3462 - [c23]Sally Dong, Gramoz Goranci, Lawrence Li, Sushant Sachdeva, Guanghao Ye:
Fast Algorithms for Separable Linear Programs. SODA 2024: 3558-3604 - [c22]T.-H. Hubert Chan, Gramoz Goranci, Shaofeng H.-C. Jiang, Bo Wang, Quan Xue:
Fully Dynamic Algorithms for Euclidean Steiner Tree. WALCOM 2024: 62-75 - 2023
- [c21]Sebastian Forster, Gramoz Goranci, Yasamin Nazari, Antonis Skarlatos:
Bootstrapping Dynamic Distance Oracles. ESA 2023: 50:1-50:16 - [c20]Gramoz Goranci, Monika Henzinger:
Efficient Data Structures for Incremental Exact and Approximate Maximum Flow. ICALP 2023: 69:1-69:14 - [c19]Gramoz Goranci, Monika Henzinger, Danupon Nanongkai, Thatchaphol Saranurak, Mikkel Thorup, Christian Wulff-Nilsen:
Fully Dynamic Exact Edge Connectivity in Sublinear Time. SODA 2023: 70-86 - [i27]Gramoz Goranci, Monika Henzinger, Danupon Nanongkai, Thatchaphol Saranurak, Mikkel Thorup, Christian Wulff-Nilsen:
Fully Dynamic Exact Edge Connectivity in Sublinear Time. CoRR abs/2302.05951 (2023) - [i26]Gramoz Goranci, Monika Henzinger, Harald Räcke, Sushant Sachdeva, A. R. Sricharan:
Electrical Flows for Polylogarithmic Competitive Oblivious Routing. CoRR abs/2303.02491 (2023) - [i25]Sebastian Forster, Gramoz Goranci, Yasamin Nazari, Antonis Skarlatos:
Bootstrapping Dynamic Distance Oracles. CoRR abs/2303.06102 (2023) - [i24]Emilio Cruciani, Sebastian Forster, Gramoz Goranci, Yasamin Nazari, Antonis Skarlatos:
Dynamic algorithms for k-center on graphs. CoRR abs/2307.15557 (2023) - [i23]Sally Dong, Gramoz Goranci, Lawrence Li, Sushant Sachdeva, Guanghao Ye:
Fast Algorithms for Separable Linear Programs. CoRR abs/2310.16351 (2023) - [i22]T.-H. Hubert Chan, Gramoz Goranci, Shaofeng H.-C. Jiang, Bo Wang, Quan Xue:
Fully Dynamic Algorithms for Euclidean Steiner Tree. CoRR abs/2311.18365 (2023) - 2022
- [c18]Sally Dong, Yu Gao, Gramoz Goranci, Yin Tat Lee, Richard Peng, Sushant Sachdeva, Guanghao Ye:
Nested Dissection Meets IPMs: Planar Min-Cost Flow in Nearly-Linear Time. SODA 2022: 124-153 - [c17]Goran Zuzic, Gramoz Goranci, Mingquan Ye, Bernhard Haeupler, Xiaorui Sun:
Universally-Optimal Distributed Shortest Paths and Transshipment via Graph-Based ℓ1-Oblivious Routing. SODA 2022: 2549-2579 - [i21]Sally Dong, Yu Gao, Gramoz Goranci, Yin Tat Lee, Richard Peng, Sushant Sachdeva, Guanghao Ye:
Nested Dissection Meets IPMs: Planar Min-Cost Flow in Nearly-Linear Time. CoRR abs/2205.01562 (2022) - [i20]Gramoz Goranci, Monika Henzinger:
Incremental Approximate Maximum Flow in m1/2+o(1) update time. CoRR abs/2211.09606 (2022) - 2021
- [c16]Gramoz Goranci, Monika Henzinger, Dariusz Leniowski, Christian Schulz, Alexander Svozil:
Fully Dynamic k-Center Clustering in Low Dimensional Metrics. ALENEX 2021: 143-153 - [c15]Sebastian Forster, Gramoz Goranci, Yang P. Liu, Richard Peng, Xiaorui Sun, Mingquan Ye:
Minor Sparsifiers and the Distributed Laplacian Paradigm. FOCS 2021: 989-999 - [c14]Pan Peng, Daniel Lopatta, Yuichi Yoshida, Gramoz Goranci:
Local Algorithms for Estimating Effective Resistance. KDD 2021: 1329-1338 - [c13]Sebastian Forster, Gramoz Goranci, Monika Henzinger:
Dynamic Maintenance of Low-Stretch Probabilistic Tree Embeddings with Applications. SODA 2021: 1226-1245 - [c12]Gramoz Goranci, Harald Räcke, Thatchaphol Saranurak, Zihan Tan:
The Expander Hierarchy and its Applications to Dynamic Graph Algorithms. SODA 2021: 2212-2228 - [i19]Pan Peng, Daniel Lopatta, Yuichi Yoshida, Gramoz Goranci:
Local Algorithms for Estimating Effective Resistance. CoRR abs/2106.03476 (2021) - [i18]Goran Zuzic, Gramoz Goranci, Mingquan Ye, Bernhard Haeupler, Xiaorui Sun:
Universally-Optimal Distributed Shortest Paths and Transshipment via Graph-Based L1-Oblivious Routing. CoRR abs/2110.15944 (2021) - 2020
- [j2]Gramoz Goranci, Monika Henzinger, Pan Peng:
Improved Guarantees for Vertex Sparsification in Planar Graphs. SIAM J. Discret. Math. 34(1): 130-162 (2020) - [c11]Li Chen, Gramoz Goranci, Monika Henzinger, Richard Peng, Thatchaphol Saranurak:
Fast Dynamic Cuts, Distances and Effective Resistances via Vertex Sparsifiers. FOCS 2020: 1135-1146 - [c10]Matthew Fahrbach, Gramoz Goranci, Richard Peng, Sushant Sachdeva, Chi Wang:
Faster Graph Embeddings via Coarsening. ICML 2020: 2953-2963 - [i17]Sebastian Forster, Gramoz Goranci, Monika Henzinger:
Dynamic Maintenance of Low-Stretch Probabilistic Tree Embeddings with Applications. CoRR abs/2004.10319 (2020) - [i16]Li Chen, Gramoz Goranci, Monika Henzinger, Richard Peng, Thatchaphol Saranurak:
Fast Dynamic Cuts, Distances and Effective Resistances via Vertex Sparsifiers. CoRR abs/2005.02368 (2020) - [i15]Gramoz Goranci, Harald Räcke, Thatchaphol Saranurak, Zihan Tan:
The Expander Hierarchy and its Applications to Dynamic Graph Algorithms. CoRR abs/2005.02369 (2020) - [i14]Matthew Fahrbach, Gramoz Goranci, Richard Peng, Sushant Sachdeva, Chi Wang:
Faster Graph Embeddings via Coarsening. CoRR abs/2007.02817 (2020) - [i13]Sebastian Forster, Gramoz Goranci, Yang P. Liu, Richard Peng, Xiaorui Sun, Mingquan Ye:
Minor Sparsifiers and the Distributed Laplacian Paradigm. CoRR abs/2012.15675 (2020)
2010 – 2019
- 2019
- [c9]Sebastian Forster, Gramoz Goranci:
Dynamic low-stretch trees via dynamic low-diameter decompositions. STOC 2019: 377-388 - [c8]David Durfee, Yu Gao, Gramoz Goranci, Richard Peng:
Fully dynamic spectral vertex sparsifiers and applications. STOC 2019: 914-925 - [p1]Gramoz Goranci:
Algorithmen für graphbasierte dynamische Probleme. Ausgezeichnete Informatikdissertationen 2019: 99-108 - [i12]David Durfee, Yu Gao, Gramoz Goranci, Richard Peng:
Fully Dynamic Spectral Vertex Sparsifiers and Applications. CoRR abs/1906.10530 (2019) - [i11]Gramoz Goranci, Monika Henzinger, Dariusz Leniowski, Alexander Svozil:
Fully Dynamic k-Center Clustering in Doubling Metrics. CoRR abs/1908.03948 (2019) - [i10]Gramoz Goranci:
Dynamic Graph Algorithms and Graph Sparsification: New Techniques and Connections. CoRR abs/1909.06413 (2019) - [i9]Gramoz Goranci, Monika Henzinger, Dariusz Leniowski:
A Tree Structure For Dynamic Facility Location. CoRR abs/1909.06653 (2019) - 2018
- [j1]Gramoz Goranci, Monika Henzinger, Mikkel Thorup:
Incremental Exact Min-Cut in Polylogarithmic Amortized Update Time. ACM Trans. Algorithms 14(2): 17:1-17:21 (2018) - [c7]Gramoz Goranci, Monika Henzinger, Dariusz Leniowski:
A Tree Structure For Dynamic Facility Location. ESA 2018: 39:1-39:13 - [c6]Gramoz Goranci, Monika Henzinger, Pan Peng:
Dynamic Effective Resistances and Approximate Schur Complement on Separable Graphs. ESA 2018: 40:1-40:15 - [i8]Gramoz Goranci, Monika Henzinger, Pan Peng:
Dynamic Effective Resistances and Approximate Schur Complement on Separable Graphs. CoRR abs/1802.09111 (2018) - [i7]David Durfee, Yu Gao, Gramoz Goranci, Richard Peng:
Fully Dynamic Effective Resistances. CoRR abs/1804.04038 (2018) - [i6]Gramoz Goranci, Sebastian Krinninger:
Dynamic Low-Stretch Trees via Dynamic Low-Diameter~Decompositions. CoRR abs/1804.04928 (2018) - 2017
- [c5]Gramoz Goranci, Monika Henzinger, Pan Peng:
Improved Guarantees for Vertex Sparsification in Planar Graphs. ESA 2017: 44:1-44:14 - [c4]Gramoz Goranci, Monika Henzinger, Pan Peng:
The Power of Vertex Sparsifiers in Dynamic Graph Algorithms. ESA 2017: 45:1-45:14 - [i5]Gramoz Goranci, Monika Henzinger, Pan Peng:
Improved Guarantees for Vertex Sparsification in Planar Graphs. CoRR abs/1702.01136 (2017) - [i4]Gramoz Goranci, Monika Henzinger, Pan Peng:
The Power of Vertex Sparsifiers in Dynamic Graph Algorithms. CoRR abs/1712.06473 (2017) - 2016
- [c3]Gramoz Goranci, Monika Henzinger, Mikkel Thorup:
Incremental Exact Min-Cut in Poly-logarithmic Amortized Update Time. ESA 2016: 46:1-46:17 - [c2]Yun Kuen Cheung, Gramoz Goranci, Monika Henzinger:
Graph Minors for Preserving Terminal Distances Approximately - Lower and Upper Bounds. ICALP 2016: 131:1-131:14 - [c1]Gramoz Goranci, Harald Räcke:
Vertex Sparsification in Trees. WAOA 2016: 103-115 - [i3]Yun Kuen Cheung, Gramoz Goranci, Monika Henzinger:
Graph Minors for Preserving Terminal Distances Approximately - Lower and Upper Bounds. CoRR abs/1604.08342 (2016) - [i2]Gramoz Goranci, Monika Henzinger, Mikkel Thorup:
Incremental Exact Min-Cut in Poly-logarithmic Amortized Update Time. CoRR abs/1611.06500 (2016) - [i1]Gramoz Goranci, Harald Räcke:
Vertex Sparsification in Trees. CoRR abs/1612.03017 (2016)
Coauthor Index
aka: Sebastian Krinninger
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
