Farhad Vadiee
/fæɾˈhɒːd vadiːiː/
PhD Candidate
I am currently in my fourth year pursuing a Ph.D. in the Algorithm Group within the Department of Informatics at the University of Bergen in Norway. Prior to this, I obtained my Master's degree from Sharif University of Technology in Iran. My research primarily revolves around parameterized algorithms, automated theorem proving, and model checking.
Currently, I hold a lecturer position at the Informatics Department and a Research Assistant position at MediaFutures.
- Algorithms and Optimization
- Parameterized Complexity
- Combinatorics
- Automated Deduction
- Model-checking
- Sketching and Algorithm Design, University of California, Berkeley (Simons Institute), October 2023
- Structural Graph Theory Bootcamp, Warsaw, September 2023
- FPT Fest 2023 in the honour of Mike Fellows, Bergen, June 2023
- 8th Czech-Slovak International Symposium on Graph Theory, Combinatorics, Algorithms, and Applications, Prague, July 2022
- Swedish Summer School in Computer Science, Stockholm, June, 2022
- Advances in Parameterized Graph Algorithms (APGA), Calpe, May 2022
- University of Trier, Germany, November 2021.
- From Width-Based Model Checking to Width-Based Automated Theorem Proving
Mateus de Oliveira Oliveira and Farhad Vadiee
37th AAAI Conference on Artificial Intelligence (AAAI 2023). Accepted. - Unitary Branching Programs: Learnability and Lower Bounds
Fidel Andino, Maria Kokkou, Mateus de Oliveira Oliveira, Farhad Vadiee
38-th International Conference on Machine Learning (ICML 2021) (accepted)
- Zygosity - Solver for Computing Twin-Width (Hueristic) (bitbucket)
- TreeWidzard - An Engine for Tree-Decomposition-Based Algorithms
- LUBP - Learning Unitary Branching Programs ( github )