Skip to content

Gramoz Goranci

Publication record assembled from the DBLP archive of ranked conferences.

Papers indexed

32

Venues

11

Active years

2016–2026

Best venue rank

A*

Where they publish

Papers

32 indexed papers, newest first.

YearVenueTitleAuthors
2026SODADynamic Hierarchical j-Tree Decomposition and Its Applications.Gramoz Goranci, Monika Henzinger, Peter Kiss, Ali Momeni, Gernot Zcklein
2026SODATree Embedding in High Dimensions: Dynamic and Massively Parallel.Gramoz Goranci, Shaofeng H.-C. Jiang, Peter Kiss, Qihao Kong, Yi Qian, Eva Szilagyi
2026STACSFully Dynamic Spectral Sparsification for Directed Hypergraphs.Sebastian Forster, Gramoz Goranci, Ali Momeni
2025ICALPIncremental Approximate Maximum Flow via Residual Graph Sparsification.Gramoz Goranci, Monika Henzinger, Harald Rcke, A. R. Sricharan
2025ICALPFully Dynamic Algorithms for Transitive Reduction.Gramoz Goranci, Adam Karczmarz, Ali Momeni, Nikos Parotsidis
2025ICMLFully Dynamic Euclidean Bi-Chromatic Matching in Sublinear Update Time.Gramoz Goranci, Peter Kiss, Neel Patel, Martin P. Seybold, Eva Szilagyi, Da Wei Zheng
2024FOCSNear-Optimal (1+ε)-Approximate Fully-Dynamic All-Pairs Shortest Paths in Planar Graphs.Arnold Filtser, Gramoz Goranci, Neel Patel, Maximilian Probst Gutenberg
2024ICMLDynamic Facility Location in High Dimensional Euclidean Spaces.Sayan Bhattacharya, Gramoz Goranci, Shaofeng H.-C. Jiang, Yi Qian, Yubo Zhang
2024SODADynamic algorithms forEmilio Cruciani, Sebastian Forster, Gramoz Goranci, Yasamin Nazari, Antonis Skarlatos
2024SODAFast Algorithms for Separable Linear Programs.Sally Dong, Gramoz Goranci, Lawrence Li, Sushant Sachdeva, Guanghao Ye
2024WALCOMFully Dynamic Algorithms for Euclidean Steiner Tree.T.-H. Hubert Chan, Gramoz Goranci, Shaofeng H.-C. Jiang, Bo Wang, Quan Xue
2023ESABootstrapping Dynamic Distance Oracles.Sebastian Forster, Gramoz Goranci, Yasamin Nazari, Antonis Skarlatos
2023ICALPEfficient Data Structures for Incremental Exact and Approximate Maximum Flow.Gramoz Goranci, Monika Henzinger
2023SODAFully Dynamic Exact Edge Connectivity in Sublinear Time.Gramoz Goranci, Monika Henzinger, Danupon Nanongkai, Thatchaphol Saranurak, Mikkel Thorup, Christian Wulff-Nilsen
2022SODANested Dissection Meets IPMs: Planar Min-Cost Flow in Nearly-Linear Time.Sally Dong, Yu Gao, Gramoz Goranci, Yin Tat Lee, Richard Peng, Sushant Sachdeva, Guanghao Ye
2022SODAUniversally-Optimal Distributed Shortest Paths and Transshipment via Graph-Based ℓGoran Zuzic, Gramoz Goranci, Mingquan Ye, Bernhard Haeupler, Xiaorui Sun
2021ALENEXFully DynamicGramoz Goranci, Monika Henzinger, Dariusz Leniowski, Christian Schulz, Alexander Svozil
2021FOCSMinor Sparsifiers and the Distributed Laplacian Paradigm.Sebastian Forster, Gramoz Goranci, Yang P. Liu, Richard Peng, Xiaorui Sun, Mingquan Ye
2021KDDLocal Algorithms for Estimating Effective Resistance.Pan Peng, Daniel Lopatta, Yuichi Yoshida, Gramoz Goranci
2021SODADynamic Maintenance of Low-Stretch Probabilistic Tree Embeddings with Applications.Sebastian Forster, Gramoz Goranci, Monika Henzinger
2021SODAThe Expander Hierarchy and its Applications to Dynamic Graph Algorithms.Gramoz Goranci, Harald Rcke, Thatchaphol Saranurak, Zihan Tan
2020FOCSFast Dynamic Cuts, Distances and Effective Resistances via Vertex Sparsifiers.Li Chen, Gramoz Goranci, Monika Henzinger, Richard Peng, Thatchaphol Saranurak
2020ICMLFaster Graph Embeddings via Coarsening.Matthew Fahrbach, Gramoz Goranci, Richard Peng, Sushant Sachdeva, Chi Wang
2019STOCFully dynamic spectral vertex sparsifiers and applications.David Durfee, Yu Gao, Gramoz Goranci, Richard Peng
2019STOCDynamic low-stretch trees via dynamic low-diameter decompositions.Sebastian Forster, Gramoz Goranci
2018ESAA Tree Structure For Dynamic Facility Location.Gramoz Goranci, Monika Henzinger, Dariusz Leniowski
2018ESADynamic Effective Resistances and Approximate Schur Complement on Separable Graphs.Gramoz Goranci, Monika Henzinger, Pan Peng
2017ESAImproved Guarantees for Vertex Sparsification in Planar Graphs.Gramoz Goranci, Monika Henzinger, Pan Peng
2017ESAThe Power of Vertex Sparsifiers in Dynamic Graph Algorithms.Gramoz Goranci, Monika Henzinger, Pan Peng
2016ESAIncremental Exact Min-Cut in Poly-logarithmic Amortized Update Time.Gramoz Goranci, Monika Henzinger, Mikkel Thorup
2016ICALPGraph Minors for Preserving Terminal Distances Approximately - Lower and Upper Bounds.Yun Kuen Cheung, Gramoz Goranci, Monika Henzinger
2016WAOAVertex Sparsification in Trees.Gramoz Goranci, Harald Rcke