Theory and Applications of Algorithms

Assoz. Prof. Dr.techn. Gramoz Goranci, M.Sc.

Gramoz Goranci
Research Group Theory and Applications of Algorithms
Währinger Straße 29
1090 Wien
Room : 6.32
T: +43-1-4277-78312
gramoz.goranci(at)univie.ac.at
Personal homepage
u:cris portal

Courses

Publications

Fully Dynamic Spectral Sparsification for Directed Hypergraphs. / Forster, Sebastian; Goranci, Gramoz; Momeni, Ali.
43rd International Symposium on Theoretical Aspects of Computer Science (STACS 2026). 2026.

Publications: Contribution to book › Contribution to proceedings › Peer Reviewed

doi.org/10.48550/arXiv.2512.21671

Dynamic Hierarchical j-Tree Decomposition and Its Applications. / Goranci, Gramoz; Henzinger, Monika; Kiss, Peter et al.
ACM-SIAM Symposium on Discrete Algorithms (SODA26). 2026.

Publications: Contribution to book › Contribution to proceedings › Peer Reviewed

doi.org/10.1137/1.9781611978971.45

Tree Embedding in High Dimensions: Dynamic and Massively Parallel. / Goranci, Gramoz; Jiang, Shaofeng H.-C.; Kiss, Peter et al.
ACM-SIAM Symposium on Discrete Algorithms (SODA26). 2026.

Publications: Contribution to book › Contribution to proceedings › Peer Reviewed

doi.org/10.48550/arXiv.2510.22490

Fully Dynamic Algorithms for Chamfer Distance. / Goranci, Gramoz; Jiang, Shaofeng H.-C.; Kiss, Peter et al.
The 39th Annual Conference on Neural Information Processing Systems. 2025.

Publications: Contribution to book › Contribution to proceedings › Peer Reviewed

Nested Dissection Meets IPMs: Planar Min-Cost Flow in Nearly-Linear Time. / Dong, Sally; Gao, Yu; Goranci, Gramoz et al.
In: Journal of the Association for Computing Machinery, Vol. 72, No. 4, 27, 26.07.2025.

Publications: Contribution to journal › Article › Peer Reviewed

doi.org/10.1145/3744639

Fully Dynamic Euclidean Bi-Chromatic Matching in Sublinear Update Time (ICML 2025). / Goranci, Gramoz; Kiss, Peter; Patel, Neel et al.
42nd International Conference on Machine Learning (ICML 2025). 2025.

Publications: Contribution to book › Contribution to proceedings › Peer Reviewed

doi.org/10.48550/arXiv.2505.09010

Fully Dynamic Algorithms for Transitive Reduction. / Goranci, Gramoz; Karczmarz, Adam; Momeni, Ali et al.
52nd International Colloquium on Automata, Languages, and Programming, ICALP 2025. ed. / Keren Censor-Hillel; Fabrizio Grandoni; Joel Ouaknine; Gabriele Puppis. 2025. 92.

Publications: Contribution to book › Contribution to proceedings › Peer Reviewed

doi.org/10.4230/LIPIcs.ICALP.2025.92

Incremental Approximate Maximum Flow via Residual Graph Sparsification. / Goranci, Gramoz; Henzinger, Monika; Räcke, Harald et al.
52nd International Colloquium on Automata, Languages, and Programming, ICALP 2025. ed. / Keren Censor-Hillel; Fabrizio Grandoni; Joel Ouaknine; Gabriele Puppis. 2025. 91.

Publications: Contribution to book › Contribution to proceedings › Peer Reviewed

doi.org/10.4230/LIPICS.ICALP.2025.91

Fully Dynamic Algorithms for Transitive Reduction (HALG). / Goranci, Gramoz; Karczmarz, Adam; Momeni, Ali et al.
IGAFIT Highlights of Algorithms (HALG). 2025.

Publications: Contribution to book › Contribution to proceedings › Peer Reviewed

Fully Dynamic Euclidean Bi-Chromatic Matching in Sublinear Update Time. / Goranci, Gramoz; Kiss, Peter; Patel, Neel et al.
IGAFIT Highlights of Algorithms 2025. 2025.

Publications: Contribution to book › Contribution to proceedings › Peer Reviewed

1 - 10 out of 33

Projects

Dynamic Graph Sparsification - New Directions and Techniques

Goranci, Gramoz (Project Lead), Momeni Mohammadabadi, Ali (Co-Lead)
01/12/2026 30/11/2028
Not started

Vienna Graduate School on Computational Optimization

Pflug, Georg (Project Lead), Stelzer, Vera (Admin), Henzinger, Monika (Co-Lead), Bot, Radu Ioan (Cooperation Partner), Bomze, Immanuel (Cooperation Partner), Schichl, Hermann (Cooperation Partner), Neumaier, Arnold (Cooperation Partner), Raidl, Günther R. (Cooperation Partner), Scarinci, Teresa (Project Coordinator), Geiersbach, Caroline (Scientific Project Staff), Gabl, Markus (Scientific Project Staff), Böhm, Axel (Scientific Project Staff), Nguyen, Dang Khoa (Scientific Project Staff), Kimiaei, Morteza (Scientific Project Staff), Neumann, Stefan (Scientific Project Staff), Djukanovic, Marco (Scientific Project Staff), Horn, Matthias (Scientific Project Staff), Glanzer, Martin (Affiliated Project Staff), Birghila, Corina (Affiliated Project Staff), Brandstätter, Georg (Affiliated Project Staff), Luipersbeck, Martin (Affiliated Project Staff), Meier, Dennis (Affiliated Project Staff), Ponleitner, Bettina (Affiliated Project Staff), Goranci, Gramoz (Affiliated Project Staff), Kahr, Michael (Affiliated Project Staff), Klocker, Benedikt (Affiliated Project Staff), Hungerländer, Philipp (Affiliated Project Staff)
01/03/2016 29/02/2020
Finished

Talks

TCS Seminar - Static and Dynamic Cut-Based Tree Embeddings

Gramoz Goranci
Talk or oral contribution
23.4.2026

Static and Dynamic Cut-Based Tree Embeddings

Gramoz Goranci
MoMA (Modern Optimization Methods and Models in Algorithm Design)
Seminar/Workshop, Talk or oral contribution
23.11.2025 - 28.11.2025

Algorithms with Predictions

Gramoz Goranci
The AITHYRA Science School in Artificial Intelligence
Other, Talk or oral contribution
2.9.2025

Nested Dissection Meets IPMs: Planar Min-Cost Flow in Nearly-Linear Time

Gramoz Goranci
3rd Vienna Workshop on Computational Optimization
Seminar/Workshop, Talk or oral contribution
6.6.2025

Near-Optimal Approximate Fully-Dynamic All-Pairs Shortest Paths in Planar Graphs

Gramoz Goranci
Data Structures and Optimization for Fast Algorithms Reunion
Other, Talk or oral contribution
19.3.2025

Randomized Algorithms -- Karger's Global Minimum Cut algorithm

Gramoz Goranci
Simons School in Mathematics (Mathematik Macht Fredue) for gifted ukrainian high school students
Other, Talk or oral contribution
17.9.2024

Dynamic Facility Location in High Dimensional Spaces

Gramoz Goranci
41st International Conference on Machine Learning
Conference, Talk or oral contribution
24.7.2024

On Dynamic Graph Approximations: The case of j-Trees

Gramoz Goranci
Dagstuhl Seminar 23422 on “Graph Algorithms: Flow, Cuts and Network Design”
Seminar/Workshop, Talk or oral contribution
18.10.2023

On Dynamic Graph Approximations: The case of j-Trees

Gramoz Goranci
Talk or oral contribution
27.9.2023

On Dynamic Graph Approximations: The case of j-Trees

Gramoz Goranci
Talk or oral contribution
21.9.2023

Efficient Data Structures for Incremental Exact and Approximate Maximum Flow

Gramoz Goranci
50th International Colloquium on Automata, Languages, and Programming
Conference, Talk or oral contribution
11.7.2023

Dynamic graphs, vertex sparsifiers, tree approximations and beyond

Gramoz Goranci
Faculty Lunch, Faculty of Computer Science
Other, Talk or oral contribution
23.5.2023

Nested Dissection Meets IPMs: Planar Min-Cost Flow in Nearly-Linear Time

Gramoz Goranci
DBAI Research Seminar Talk
Seminar/Workshop, Talk or oral contribution
23.5.2023

Dynamic Low-Stretch Trees via Dynamic Low-Diameter Decompositions / Fully Dynamic Spectral Vertex Sparsifiers and Applications

Gramoz Goranci
ACM Symposium on Theory of Computing
Conference, Talk or oral contribution
25.6.2019 - 26.6.2019

A Tree Structure for Dynamic Facility Location

Gramoz Goranci
26th Annual European Symposium on Algorithms (ESA 2018)
Conference, Talk or oral contribution
20.8.2018

Dynamic Low-Stretch Trees via Dynamic Low-Diameter Decompositions

Gramoz Goranci
VGSCO Retreat
Seminar/Workshop, Talk or oral contribution
23.6.2018

The Power of Vertex Sparsifiers in Dynamic Graph Algorithms

Gramoz Goranci
HALG 2018: Highlights of Algorithms
Conference, Talk or oral contribution
4.6.2018

Fully Dynamic Low-Diameter Decomposition with Applications

Gramoz Goranci
Talk or oral contribution
16.3.2018

Improved Guarantees for Vertex Sparsification in Planar Graphs

Gramoz Goranci
The 25th Annual European Symposium on Algorithms
Conference, Talk or oral contribution
6.9.2017

The Power of Vertex Sparsifiers in Dynamic Graph Algorithms

Gramoz Goranci
The 25th Annual European Symposium on Algorithms
Conference, Talk or oral contribution
5.9.2017

Improved Upper and Lower Bounds for Vertex Sparsifiers

Gramoz Goranci
HALG 2017
Conference, Talk or oral contribution
10.6.2017

Dynamic Eletrical Flow in Minor-Free graphs

Gramoz Goranci
Talk or oral contribution
12.5.2017

Vertex Sparsification in Trees

Gramoz Goranci
Workshop on Approximation and Online Algorithms
Seminar/Workshop, Talk or oral contribution
25.8.2016

Incremental Exact Min-Cut in Poly-logarithmic Amortized Update Time

Gramoz Goranci
24th European Symposium on Algorithms
Conference, Talk or oral contribution
24.8.2016

Graph Minors for Preserving Terminal Distances Approximately - Lower and Upper Bounds

Gramoz Goranci
International Colloquium on Automata, Languages and Programming
Conference, Talk or oral contribution
15.7.2016
Back