معرفی
Gramoz Goranci is an Assistant Professor in the Faculty of Computer Science, specializing in dynamic graph algorithms, optimization, and theoretical computer science. His research focuses on developing efficient algorithms for dynamic graphs, including problems such as shortest paths, facility location, and spectral sparsification.
Research Interests: His work spans dynamic algorithms for planar graphs, approximation algorithms, graph sparsification, and optimization techniques. Key areas include incremental and decremental algorithms for network flow, facility location, and clustering problems. He explores the intersection of electrical flows, oblivious routing, and spectral methods to design efficient solutions for modern computational challenges.
Publications: Goranci's recent work emphasizes dynamic graph algorithms, with contributions to Euclidean facility location, Steiner tree problems, and spectral hypergraph sparsification. His 2025 papers advance sublinear-time dynamic algorithms for bi-chromatic matching and transitive reduction, while 2024 research includes near-optimal shortest paths in planar graphs and high-dimensional facility location.
Professional Contributions: He co-organized the 2024 Austrian Computer Science Day and contributed to the Vienna Graduate School on Computational Optimization (2016-2020). His research is supported by grants focusing on dynamic algorithms and graph sparsification.
Labs/Groups: He leads the Theory and Applications of Algorithms research group, focusing on algorithmic foundations with applications in network analysis and optimization.
