Name:Parsa Kamalipour

Bio:

Parsa Kamalipour is a dedicated graduate student currently pursuing a Thesis-based Master of Computer Science at Concordia University, within the Department of Computer Science and Software Engineering (CSSE) at the Gina Cody School of Engineering and Computer Science. His academic journey is guided by a deep passion for Theoretical Computer Science, where he specializes in areas such as Design and Analysis of Algorithms, Graph Theory, Discrete Mathematics, Data Structures, and Complexity Theory. It goes without saying that Parsa’s expertise also includes a touch of Applied Mathematics, Software Engineering, and Data Mining.

Parsa’s research interests span across various subfields within the algorithms domain, including Combinatorial Optimization/Algorithms, Graph Algorithms, Graph Mining, Social Network Analysis, Approximation & Randomized Algorithms, and Online Algorithms. He is conducting research at the Algorithms & Complexity Lab under the supervision of Professor Hovhannes Harutyunyan, focusing on advancing the theoretical foundations of these topics.

Prior to his graduate studies, Parsa gained significant research experience as a Research Assistant at Vali-e-Asr University of Rafsanjan, where he concentrated on Algorithm Design and Graph Theory. He further expanded his research expertise at the University of Twente, where he applied Machine Learning techniques to improve Software Refactoring processes.

Country:Canada

Affiliation:Department of Computer Science and Software Engineering, Concordia University, Montreal, Canada

Research interests:Design & Analysis of Algorithms, Graph Theory, Combinatorial Optimization, Graph Mining, Social Networks Analysis, Approximation & Randomized Algorithms, Machine Learning, Software Refactoring, Data Structures, Computational complexity theory