I am Mahdi Belbasi, a third year Ph.D. candidate of theoretical computer science at Penn State University working under the supervision of Martin Fürer. Generally speaking, I am interested in anything related to theoretical CS and combinatorics. Going into depth, my current focus is on Fixed Parameter Tractable (FPT) algorithms, and Approximation Algorithms.
I have done my undergrad in computer engineering and mathematics at Sharif University of Technology, Tehran, Iran. I did my undergrad project (thesis) with Ebadollah Mahmoodian which was about The Chromatic Number of Finite Group Cayley Tables.
- Approximation Algorithms
- Graph Algorithms and Algebraic Graph Theory
- Fixed Parameter Tractable Algorithms
- Computational Complexity
- Theoretical Machine Learning
Courses (as a teaching assistant):
- CMPSC 464 (Theory of Computation) - Fall 2017
- CMPSC 465 (Algorithm Design) - Spring 2018
- CSE 565 (Grad-Level Algorithm Design) - Fall 2018
- "Saving Space by Dynamic Algebraization Based on Tree Decomposition: Minimum Dominating Set", Mahdi Belbasi, Martin Fürer, 2017 (In process)
- "A Space-efficient Parametrized Algorithm for the Hamiltonian Cycle Problem by Dynamic Algebraziation", Mahdi Belbasi, Martin Fürer, 2018 (In process)