Parsa Kamalipour
Parsa is currently pursuing a (Thesis-based) Master of Computer Science degree at Concordia University in the Department of Computer Science and Software Engineering (CSSE), at the Gina Cody School of Engineering and Computer Science. He is conducting research at the Algorithms & Complexity Lab under the supervision of Professor Hovhannes Harutyunyan, where his thesis, Geodesic-Compact Community Detection and Quality Assessment in Social Networks, is expected to be completed in 2027. Parsaâs true expertise is Theoretical Computer Science with an additional touch of Applied Mathematics, Software Engineering, and Data Mining.
Parsa has a keen interest in areas such as Design and Analysis of Algorithms, Graph Theory, Discrete Mathematics, Data Structures, and Complexity Theory. His research interest spans various subcategories within the algorithms domain, including Combinatorial Optimization/Algorithms, Graph Algorithms, Graph Mining, Social Network Analysis, Approximation & Randomized Algorithms, and Online Algorithms. Read more about Parsa â
Explore This Site
Selected Recent News
September 2026
đ Excited to share that Iâve been selected as the Graduate Teaching Assistant for four courses this Fall 2026 semester!
đ Courses:
- COEN 311 â Computer Organization and Software â Lab Demonstrator
- COEN 317 â MicroprocessorâBased Systems â Lab Demonstrator
- SOEN 363 â Data Systems for Software Engineers â Tutorial Instructor, POD, and Marker
- COMP 339 â Combinatorics â Tutorial Instructor
May 2026
đ I am honoured to have received the Deanâs Excellence Award for Excellence in Teaching by a Teaching Assistant, awarded by the Gina Cody School of Engineering and Computer Science at Concordia University.
February 2026
đ My paper âSpider Community Detection: Seeded Geodesic Expansion with Modularity-Guided Refinement and Greedy Merge Matchingâ is now published in the journal Computers, vol. 15, no. 2, article 83. Read it here
January 2026
I am pleased to share that my paper âSpider Community Detection: Seeded Geodesic Expansion with Modularity-Guided Refinement and Greedy Merge Matchingâ has been accepted for publication in the journal Computers, Special Issue: Recent Advances in Social Networks and Social Media.
đ Excited to share that Iâve been selected as the Graduate Teaching Assistant for four courses this Winter 2026 semester!
Itâs an honor to continue contributing to student learning across multiple areas of computer science and software engineering at Concordia University. đ Courses:
- COMP 248 â Object-Oriented Programming I â Lab Demonstrator
- SOEN 363 â Data Systems for Software Engineers â Tutorial Instructor and Marker
- COEN 311 â Computer Organization and Software â Lab Demonstrator
- COEN 317 â MicroprocessorâBased Systems â Lab Demonstrator
December 2025
I am pleased to share that I was awarded the Concordia Conference and Exposition Allowance by Concordia University in 2025, in recognition of conference-related scholarly activities.
November 2025
I am pleased to share that my paper âFrom Dense Graphs to Meaningful Communities: Assessing Community Quality Using Geodesic Distance Modularity on Metric Backbone-Sparsified Networksâ has been accepted for publication and presentation at the 12th International Conference on Social Networks Analysis, Management and Security (SNAMS 2025).
The paper was presented in Vienna, Austria, during November 25â28, 2025.
Last updated: September 14, 2026