Incremental Exact Min-Cut in Poly-logarithmic Amortized Update Time. - Gramoz Goranci; Monika Henzinger; Mikkel Thorup (ESA, 2016)

Graph Minors for Preserving Terminal Distances Approximately - Lower and Upper Bounds. - Yun Kuen Cheung; Gramoz Goranci; Monika Henzinger (ICALP, 2016)

Vertex Sparsification in Trees. - Gramoz Goranci; Harald Räcke (WAOA, 2016)

The Power of Vertex Sparsifiers in Dynamic Graph Algorithms. - Gramoz Goranci; Monika Henzinger; Pan Peng 001 (ESA, 2017)

A Tree Structure For Dynamic Facility Location. - Gramoz Goranci; Monika Henzinger; Dariusz Leniowski (ESA, 2018)

Dynamic Effective Resistances and Approximate Schur Complement on Separable Graphs. - Gramoz Goranci; Monika Henzinger; Pan Peng 001 (ESA, 2018)

Fully Dynamic Effective Resistances. - David Durfee; Yu Gao 001; Gramoz Goranci; Richard Peng (CoRR, 2018)

Incremental Exact Min-Cut in Polylogarithmic Amortized Update Time. - Gramoz Goranci; Monika Henzinger; Mikkel Thorup (ACM Trans. Algorithms, 2018)

Fully dynamic spectral vertex sparsifiers and applications. - David Durfee; Yu Gao 001; Gramoz Goranci; Richard Peng (STOC, 2019)

Dynamic low-stretch trees via dynamic low-diameter decompositions. - Sebastian Forster; Gramoz Goranci (STOC, 2019)

Fully Dynamic k-Center Clustering in Doubling Metrics. - Gramoz Goranci; Monika Henzinger; Dariusz Leniowski; Alexander Svozil (CoRR, 2019)

Dynamic Graph Algorithms and Graph Sparsification: New Techniques and Connections. - Gramoz Goranci (CoRR, 2019)

Algorithmen für graphbasierte dynamische Probleme. - Gramoz Goranci (Ausgezeichnete Informatikdissertationen, 2019)

Fast Dynamic Cuts, Distances and Effective Resistances via Vertex Sparsifiers. - Li Chen 028; Gramoz Goranci; Monika Henzinger; Richard Peng; Thatchaphol Saranurak (FOCS, 2020)

Faster Graph Embeddings via Coarsening. - Matthew Fahrbach; Gramoz Goranci; Richard Peng; Sushant Sachdeva; Chi Wang 001 (ICML, 2020)

Improved Guarantees for Vertex Sparsification in Planar Graphs. - Gramoz Goranci; Monika Henzinger; Pan Peng 001 (SIAM J. Discret. Math., 2020)

Fully Dynamic k-Center Clustering in Low Dimensional Metrics. - Gramoz Goranci; Monika Henzinger; Dariusz Leniowski; Christian Schulz 003; Alexander Svozil (ALENEX, 2021)

Minor Sparsifiers and the Distributed Laplacian Paradigm. - Sebastian Forster; Gramoz Goranci; Yang P. Liu; Richard Peng; Xiaorui Sun; Mingquan Ye (FOCS, 2021)

Local Algorithms for Estimating Effective Resistance. - Pan Peng 001; Daniel Lopatta; Yuichi Yoshida; Gramoz Goranci (KDD, 2021)

Dynamic Maintenance of Low-Stretch Probabilistic Tree Embeddings with Applications. - Sebastian Forster; Gramoz Goranci; Monika Henzinger (SODA, 2021)

The Expander Hierarchy and its Applications to Dynamic Graph Algorithms. - Gramoz Goranci; Harald Räcke; Thatchaphol Saranurak; Zihan Tan (SODA, 2021)

Universally-Optimal Distributed Shortest Paths and Transshipment via Graph-Based L1-Oblivious Routing. - Goran Zuzic; Gramoz Goranci; Mingquan Ye; Bernhard Haeupler; Xiaorui Sun (CoRR, 2021)

Universally-Optimal Distributed Shortest Paths and Transshipment via Graph-Based ℓ1-Oblivious Routing. - Goran Zuzic; Gramoz Goranci; Mingquan Ye; Bernhard Haeupler; Xiaorui Sun (SODA, 2022)

Incremental Approximate Maximum Flow in m1/2+o(1) update time. - Gramoz Goranci; Monika Henzinger (CoRR, 2022)

Bootstrapping Dynamic Distance Oracles. - Sebastian Forster; Gramoz Goranci; Yasamin Nazari; Antonis Skarlatos (ESA, 2023)

Efficient Data Structures for Incremental Exact and Approximate Maximum Flow. - Gramoz Goranci; Monika Henzinger (ICALP, 2023)

Fully Dynamic Exact Edge Connectivity in Sublinear Time. - Gramoz Goranci; Monika Henzinger; Danupon Nanongkai; Thatchaphol Saranurak; Mikkel Thorup; Christian Wulff-Nilsen (SODA, 2023)

Dynamic algorithms for k-center on graphs. - Emilio Cruciani; Sebastian Forster; Gramoz Goranci; Yasamin Nazari; Antonis Skarlatos (CoRR, 2023)

Near-Optimal (1+ε)-Approximate Fully-Dynamic All-Pairs Shortest Paths in Planar Graphs. - Arnold Filtser; Gramoz Goranci; Neel Patel; Maximilian Probst Gutenberg (FOCS, 2024)

Dynamic Facility Location in High Dimensional Euclidean Spaces. - Sayan Bhattacharya; Gramoz Goranci; Shaofeng H.-C. Jiang; Yi Qian; Yubo Zhang (ICML, 2024)

Electrical Flows for Polylogarithmic Competitive Oblivious Routing. - Gramoz Goranci; Monika Henzinger; Harald Räcke; Sushant Sachdeva; A. R. Sricharan (ITCS, 2024)

Dynamic algorithms for k-center on graphs. - Emilio Cruciani; Sebastian Forster; Gramoz Goranci; Yasamin Nazari; Antonis Skarlatos (SODA, 2024)

Fast Algorithms for Separable Linear Programs. - Sally Dong; Gramoz Goranci; Lawrence Li; Sushant Sachdeva; Guanghao Ye (SODA, 2024)

Fully Dynamic Algorithms for Euclidean Steiner Tree. - T.-H. Hubert Chan; Gramoz Goranci; Shaofeng H.-C. Jiang; Bo Wang 156; Quan Xue (WALCOM, 2024)

Incremental Approximate Maximum Flow via Residual Graph Sparsification. - Gramoz Goranci; Monika Henzinger; Harald Räcke; A. R. Sricharan (ICALP, 2025)

Fully Dynamic Algorithms for Transitive Reduction. - Gramoz Goranci; Adam Karczmarz; Ali Momeni 003; Nikos Parotsidis (ICALP, 2025)

Fully Dynamic Spectral Sparsification of Hypergraphs. - Gramoz Goranci; Ali Momeni 003 (CoRR, 2025)

Fully Dynamic Euclidean Bi-Chromatic Matching in Sublinear Update Time. - Gramoz Goranci; Peter Kiss; Neel Patel; Martin P. Seybold; Eva Szilagyi; Da Wei Zheng (CoRR, 2025)

Nested Dissection Meets IPMs: Planar Min-Cost Flow in Nearly-Linear Time. - Sally Dong; Yu Gao 001; Gramoz Goranci; Yin Tat Lee; Sushant Sachdeva; Richard Peng; Guanghao Ye (J. ACM, 2025)