Technische Universität Wien
Institute of Logic and Computation
Favoritenstraße 9–11, E192-01
Robert Ganian is an associate professor at the Vienna University of Technology (TU Wien) and a member of the Algorithms and Complexity Group. His main research interests are centered around the parameterized algorithms and complexity paradigm, with a special focus on the applications of this paradigm in artificial intelligence research.
Research Grants and Funding:
- Principal Investigator of FWF START Project Y1329: Parameterized Analysis in Artificial Intelligence – ParAI (approx. € 1 150 000, 2021-2027).
- Principal Investigator of WWTF Project ICT22-029: Parameterized Graph Drawing – PGD (approx. € 780 000 divided among two PIs, 2023-2027).
- Co-investigator and vice-chair of admission for the LogiCS@TUWien Marie Skłodowska-Curie COFUND doctoral programme (approx. € 5 300 000 divided among 13 co-investigators, 2021-2026).
- Principal Investigator of bilateral Czech-Austrian OeAD projects Structural Approaches in Stability Under Diversity Constraints (approx. € 10 000, 2021-2023) and Anonymizing User Data: A Parameterized Perspective (approx. € 4 000, 2022).
- Principal Investigator of FWF stand-alone project P31336: New Frontiers for Parameterized Complexity – NFPC (approx. € 250 000, 2018-2022).
- Coordinator of FWF stand-alone project P26696: Exploiting New Types of Structure for Fixed Parameter Tractability – X-TRACT (approx. € 350 000, 2015-2018).
Program Committee and Editorial Duties:
- Senior Program Committee member of the AAAI Conference on Artificial Intelligence (AAAI, annual).
- Senior Program Committee member of the International Joint Conference on Artificial Intelligence (IJCAI, annual).
- Program Committee member of the Conference on Neural Information Processing Systems (NeurIPS, annual).
- Program Committee member of the 35th International Workshop on Combinatorial Algorithms (IWOCA 2024).
- Organizer of the minisymposium on Fixed-Parameter Tractability in Machine Learning at FPT Fest 2023 in Bergen, Norway.
- Program Committee member of the 24th International Symposium on Fundamentals in Computation Theory (FCT 2023).
- Program Committee member of the 48th and 49th International Symposium on Current Trends in Theory and Practice of Computer Science (SOFSEM 2023 and SOFSEM 2024).
- Program Committee Co-Chair of the 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022).
- Program Committee member of the 17th International Symposium on Parameterized and Exact Computation (IPEC 2022).
- Invited Speaker at the 2022 Lorentz Workshop on Graph Decompositions: Small Width, Big Challenges.
- Program Committee member of the Ninth International Conference on Learning Representations (ICLR 2021).
- Program Committee member of the 47th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2021).
- Program Committee member of the Workshop on Model Counting (MCW-2020), co-located with the 23rd International Conference on Theory and Applications of Satisfiability Testing (SAT 2020).
- Guest Editor of the GROW 2017 and GROW 2019 special issues of Discrete Applied Mathematics.
Other Academic Activities:
- Organization Co-chair of the 32nd International Symposium on Graph Drawing and Network Visualization (GD 2024), to be held in Vienna.
- Organizer of Dagstuhl seminar 23162 New Frontiers of Parameterized Complexity in Graph Drawing in 2023 (Approx. 30 participants).
- Steering Committee member of the Workshop on Graph Classes, Optimization, and Width Parameters (GROW).
- Award Committee Co-Chair of the VCLA International Student Awards.
- Co-location & Competition Chair of the 31st International Joint Conference on Artificial Intelligence (IJCAI 2022).
- Organizer of Dagstuhl seminar 21293 Parameterized Complexity in Graph Drawing in 2021. (Approx. 30 participants).
- Co-chair of the 9th Workshop on Graph Classes, Optimization, and Width Parameters (GROW 2019) in Vienna. (Approx. 50 participants)
- Organization co-chair of ALGO 2017 in Vienna; ALGO is an annual congress combining the premier algorithmic conference European Symposium on Algorithms and a number of other specialized conferences and workshops. (300+ participants)
- Organizer of the Parameterized Complexity Summer School (PCSS 2017) in Vienna. (100+ participants)
- Invited by the organizers to give a series of tutorials at the European Summer School in Logic, Language and Information (ESSLLI 2017) in Toulouse. (Approx. 400 participants)
- Organizer of the workshop on Parameterized Complexity of Computational Reasoning (PCCR 2014) in Vienna. (40+ participants)
- Member of the organizing team of the Symposium on Structure in Hard Combinatorial Problems (STRUCTURE 2013) in Vienna. (40+ participants)
- Liana Khazaliya: from 2022
- Mathis Rocton: from 2022
- Viktoriia Korchemna: from 2021.
- Thekla Hamm: 2018-2022.
- Eduard Eiben (co-advisor): 2014-2018.
Publications: A full list of publications is available here.