معرفی
Gramoz Goranci is an Assistant Professor (tenure-track) of Algorithms in the Department of Computer Science at the University of Vienna. He leads research in algorithm design with strong interdisciplinary connections to optimization, graph theory, and machine learning. He is a member of the Research Group Theory and Applications of Algorithms and a board member of the Research Network Data Science.
His research focuses on the design of fast dynamic algorithms for large-scale optimization problems, combining techniques from combinatorial data structures, algorithmic graph theory, numerical linear algebra, and metric embeddings. His work emphasizes both theoretical guarantees and practical efficiency.
The recent publications highlight a consistent trend in dynamic and incremental graph algorithms, particularly in shortest paths, connectivity, flow, and facility location problems. His work increasingly bridges theoretical computer science with applications in machine learning and high-dimensional data. Keywords across publications include dynamic algorithms, graph sparsification, electrical flows, and optimization in metric spaces.
- FWF ESPRIT grant (supporting PostDoc Peter Kiss)
He advises a growing team of researchers, including PostDoc Peter Kiss and PhD students Eva Szilagyi and Ali Momeni Mohammadabadi. His research is supported by independent funding and collaborations with leading institutions like ETH Zürich, University of Toronto, and UC Berkeley's Simons Institute. He has served on program committees of top conferences including FOCS, STOC, SODA, ICML, ESA, and ALENEX.
He is actively involved in the academic community through seminars and talks at institutions such as ETH Zürich, University of Warwick, and Google Research. His team contributes to foundational work in dynamic graph algorithms and their applications in data science.
