Ali Momeni
_________________________
_________________________
About Me:
I am a third-year PhD student at the University of Vienna in the Theory and Applications of Algorithms group. I am very fortunate to be advised by Gramoz Goranci.
Research Interests:
I am broadly interested in algorithm design and its connections to optimization and graph theory, with a focus on developing fast dynamic algorithms for classic optimization problems. I aim to bring together tools from many areas, including combinatorial data structures, algorithmic graph theory, and numerical linear algebra.
Contact:
ali.momeni[at]univie.ac.at
Office:
Room 6.50, Währinger Str. 29, 1090 Vienna, Austria
Bibliographic Info:
[DBLP] [Google Scholar] [ORCID]
2026
[5] Fully Dynamic Spectral Sparsification for Directed Hypergraphs, with Sebastian Forster and Gramoz Goranci, In 43rd International Symposium on Theoretical Aspects of Computer Science (STACS), 2026. [arXiv]
[4] Dynamic Hierarchical j-Tree Decomposition and Its Applications, with Gramoz Goranci, Monika Henzinger, Peter Kiss, and Gernot Zöcklein, In 37th ACM-SIAM Symposium on Discrete Algorithms (SODA), 2026.
[3] Finding d-Cuts in Graphs of Bounded Diameter, Graphs of Bounded Radius and H-Free Graphs, with Felicia Lucke, Daniël Paulusma, and Siani Smith, In Algorithmica, 2026. [arXiv] [proceedings]
2025
[2] Fully Dynamic Algorithms for Transitive Reduction, with Gramoz Goranci, Adam Karczmarz, and Nikos Parotsidis, In 52nd International Colloquium on Automata, Languages and Programming (ICALP), 2025. [arXiv] [proceedings]
2024
[1] Finding d-Cuts in Graphs of Bounded Diameter, Graphs of Bounded Radius and H-Free Graphs, with Felicia Lucke, Daniël Paulusma, and Siani Smith, In 50th International Workshop on Graph-Theoretic Concepts in Computer Science (WG), 2024. [arXiv] [proceedings]
Algorithms and Data Structures 2, Instructor, University of Vienna. [Spring 2025]
Mathematical Foundations of Computer Science 1, Teaching Assistant, University of Vienna. [Fall 2024] [Spring 2025] [Fall 2025]