Biography of Parsa Kamalipour

Parsa Kamalipour is a dedicated graduate student currently pursuing a 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 Data Structures, Design and Analysis of Algorithms, Graph Theory, and Complexity Theory.

Parsa’s research interests span across various subfields within the algorithms domain, including Combinatorial Algorithms, Online Algorithms, Graph Algorithms, Graph Mining, Social Network Analysis, and Approximation & Randomized 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.

In addition to his research, Parsa is deeply committed to education. He has served as a Teaching Assistant (TA) for over 10 courses, primarily in Theoretical Computer Science. He has provided support for courses such as Design and Analysis of Algorithms, Data Structures, Discrete Math, and Data Mining. Currently, he is a tutorial and marker TA for COMP339 at Concordia University.

Parsa’s diverse experiences reflect his dedication to both research and teaching, showcasing his versatility and impact across academic disciplines. His long-term aspiration is to become a distinguished professor, contributing to the advancement of Theoretical Computer Science while inspiring future generations of researchers and students.