Volunteering · Vali-e-Asr University of Rafsanjan, Vali-e-Asr University Scientific Association of Computer Engineering · RafsanjÄn, Kerman, Iran ·
position: Scientific Committee Member
Location: Rafsanjan, Iran
Date: May 2019 â Jun 2021
Vali-e-Asr University Scientific Association of Computer Engineering is the leading student chapter for Computer Engineering students.
Some of the responsibilities of this association are mentioned below:
Introduction ceremony for the first-year students
Book translation
holding up workshops and competitions
writing monthly journal
holding up conferences
holding up events, namely: startup weekend, summer Bootcamp
Volunteering · Vali-e-Asr University of Rafsanjan, Vali-e-Asr Video Games Association · RafsanjÄn, Kerman, Iran ·
position: Executive Committee Member
Location: Rafsanjan, Iran
Date: Oct 2020 â Jun 2021
Video Games Association of Vali-e-Asr University is a student chapter that promotes games and raises consciousness about their positive effects on society. Board members of this association teach students game development and art design for free.
Volunteering · Vali-e-Asr University of Rafsanjan, Vali-e-Asr University Scientific Association of Computer Engineering · RafsanjÄn, Kerman, Iran ·
position: Member of Teaching Staff
Location: Rafsanjan, Iran
Date: Sep 2021 â Jun 2022
Vali-e-Asr Collegiate Programming Contest (VCPC) is the leading programming contest at Vali-e-Asr University. Questions are algorithmically based, and solving them requires excellent comprehension of numerous computer science concepts.
Volunteering · Vali-e-Asr University of Rafsanjan, Vali-e-Asr University Scientific Association of Computer Engineering · RafsanjÄn, Kerman, Iran ·
Related to: Vali-e-Asr University Scientific Association of Computer Engineering
Location: Rafsanjan, Iran
Date: July 2022 â Sep 2023
My job is to bridge remarkable students and professors, nominate and present eligible Teaching Assistants for each course to professors, accumulate a prominent team of TAs per course, give my experiences to new TAs and prepare them to be accomplished teaching assistants.
Volunteering · Vali-e-Asr University of Rafsanjan, Vali-e-Asr University Scientific Association of Computer Engineering · RafsanjÄn, Kerman, Iran ·
Related to: Vali-e-Asr University Scientific Association of Computer Engineering
Location: Rafsanjan, Iran
Date: Nov 2022 â Sep 2023
My job is to bridge remarkable students and professors, nominate and present eligible Research Assistants for each professors, accumulate a prominent team of RAs, give my experiences to new RAs and prepare them to be accomplished Research assistants.
Co-founded a small indie game development team and jointly developed an open-source game prototype (Uncertainty).
Led technical design discussions and contributed to gameplay logic, architecture, and project planning.
Maintained the project repository on GitHub and coordinated development tasks within the team.
Developed Uncertainty, a 3D action-adventure space-shooter game built with Unity 2019.4.16f1 (C#) for Windows and macOS.
Collaborated on a modular game architecture emphasizing scalability, reliability, and performance, including serialization and asset integration workflows. ïżŒ
Designed and implemented core gameplay mechanics, including player controls, enemy behaviors, and boss encounters within a modular Unity architecture.
Applied design patterns and SOLID principles to support code maintainability and reusable game logic. ïżŒ
Managed source code and development workflow using Git, coordinated team efforts, and integrated assets from Blender, Krita, and other tools.
Coordinated development tasks and project planning in a part-time team environment, meeting defined delivery milestones.ïżŒ
Published and maintained the project as open-source on GitHub (MIT license), accruing community engagement (61 stars and 15 forks).
Undergraduate Course Project & For Fun! · Vali-e-Asr University of Rafsanjan, Department of Computer Engineering & Null References: Game Development Team · RafsanjÄn & Kerman & Yazd, Iran ·
Uncertainty is an action-adventure space-shooter game, and currently, Itâs under development.
We have utilized the beta version of this game as our âSoftware Engineering Labâ course project.
Our game is an open-source game hosted on GitHub.
Itâs made with Unity3D
Currently, our team isnât at its peak since all its members are busy at university. Still, weâre looking forward to continuing the Uncertainty and eventually finishing it when weâre free.
Evaluation of Scalable Training Strategies for Graph Neural Networks - Graduate Course Project · Concordia University · Montreal, Quebec ·
Designed and implemented scalable GNN-based community detection pipelines using GCN and GraphSAGE architectures with full-batch training, neighbor sampling, and graph partitioning strategies.
Conducted extensive experiments on SBM (1K, 10K), CORA, and Reddit datasets, demonstrating that neighbor sampling and graph partitioning enable training on large graphs where full-batch methods fail due to memory constraints.
Achieved up to 90% accuracy on SBM (10K nodes) with graph partitioning while reducing memory footprint, and enabled scalable training on Reddit where full-batch methods resulted in out-of-memory failures.
Analyzed trade-offs between accuracy, training time, and memory usage, providing practical guidelines for scalable GNN deployment in real-world large-scale social networks.
Experimental Study of Network Flow Optimization Algorithms - Graduate Course Project · Concordia University · Montreal, Quebec ·
Implemented the Successive Shortest Path algorithm from scratch, including residual graph construction, BellmanâFord based minimum-cost path extraction, and flow augmentation logic.
Designed and executed large-scale experimental evaluation on randomized Euclidean directed graphs across 28 configurations with varying density (đ), capacity bounds, and cost regimes.
Compared SSP, Capacity Scaling, Scaling-SSP, and PrimalâDual algorithms using metrics including total cost, flow value, number of augmenting paths, mean path length, and proportional path length.
Demonstrated that the PrimalâDual algorithm consistently achieves optimal minimum cost, while SSP achieves competitive performance in sparse regimes and degrades in dense graphs.
Recommended citation: Fahimeh Dabaghi-Zarandi, Parsa Kamalipour, "Community detection in complex network based on an improved random algorithm using local and global network information." Journal of Network and Computer Applications, vol.206, p.103492, August 2022. https://doi.org/10.1016/j.jnca.2022.103492
Published in Journal of Network and Computer Applications ·
screenshot
Journal: Journal of Network and Computer Applications (JNCA)
Impact Factor (2026): 8.0 - Q1
CiteScore (2026): 20.3
Ranking in CS, Software Engineering (2021): 8/110
DOI: https://doi.org/10.1016/j.jnca.2022.103492
Recommended citation: Fahimeh Dabaghi-Zarandi, Parsa Kamalipour, "Community detection in complex network based on an improved random algorithm using local and global network information." Journal of Network and Computer Applications, vol.206, p.103492, August 2022. https://doi.org/10.1016/j.jnca.2022.103492
Recommended citation: I. H. Moghadam, M. M. Afkhami, P. Kamalipour and V. Zaytsev, "Extending Refactoring Detection to Kotlin: A Dataset and Comparative Study," 2024 IEEE International Conference on Software Analysis, Evolution and Reengineering (SANER), Rovaniemi, Finland, 2024, pp. 267-271, doi: 10.1109/SANER60148.2024.00034. http://dx.doi.org/10.1109/SANER60148.2024.00034
Recommended citation: I. H. Moghadam, M. M. Afkhami, P. Kamalipour and V. Zaytsev, "Extending Refactoring Detection to Kotlin: A Dataset and Comparative Study," 2024 IEEE International Conference on Software Analysis, Evolution and Reengineering (SANER), Rovaniemi, Finland, 2024, pp. 267-271, doi: 10.1109/SANER60148.2024.00034. http://dx.doi.org/10.1109/SANER60148.2024.00034
Recommended citation: P. Kamalipour and H. A. Harutyunyan, "From Dense Graphs to Meaningful Communities: Assessing Community Quality Using Geodesic Distance Modularity on Metric Backbone-Sparsified Networks," 2025 12th International Conference on Social Networks Analysis, Management and Security (SNAMS), Vienna, Austria, 2025, pp. 234-241, doi: 10.1109/SNAMS67467.2025.11391193. https://doi.org/10.1109/SNAMS67467.2025.11391193
Recommended citation: P. Kamalipour and H. A. Harutyunyan, "From Dense Graphs to Meaningful Communities: Assessing Community Quality Using Geodesic Distance Modularity on Metric Backbone-Sparsified Networks," 2025 12th International Conference on Social Networks Analysis, Management and Security (SNAMS), Vienna, Austria, 2025, pp. 234-241, doi: 10.1109/SNAMS67467.2025.11391193. https://doi.org/10.1109/SNAMS67467.2025.11391193
Undergraduate level · Vali-e-Asr University of Rafsanjan, Department of Computer Engineering · RafsanjÄn, Kerman, Iran ·
Field of Research: Community Detection (Graph Algorithms)
Supervisor: Dr. Fahimeh Dabaghi-Zarandi
Department: âComputer Engineeringâ department of âVali-e-Asr University of Rafsanjanâ.
Date: Aug 2021 â March 2024
My key role consisted of:
Conducted a comprehensive review of prior work in graph-based community detection.
Designed and implemented CRLG, a randomized community detection framework leveraging both local and global network information.
Developed weighted probabilistic seeding and similarity-driven community assignment with heuristic community merging.
Implemented and evaluated the framework in MATLAB and Python, including validation, testing, and performance tuning.
Evaluated on real-world networks and GN/LFR benchmarks, achieving up to 10% improvement over LCDR, MOACO, Node2Vec-SC, NE-N2V, CDASS, and TS using NMI, modularity, and density metrics.
Researching Algorithms Design & Analysis, Graph Theory, and Social Network Analysis
Working in the Algorithms & Complexity Lab
Under the supervision of Professor Hovhannes Harutyunyan
Date: Aug 2024 â Now
My key role consisted of:
Designed Spider, a graph community detection algorithm combining geodesic expansion, modularity-guided refinement, and greedy merge matching.
Benchmarked Spider on 14 real-world networks (up to 8,035 nodes / 183,663 edges) against Leiden, Louvain, and Infomap, achieving 8â15% improvements in NMI, modularity, and F1-score.
Applied metric backbone sparsification, achieving an average 65% edge reduction, and introduced Weighted Average Geodesic Distance Modularity (wGDM) to normalize and balance GDM for local community quality evaluation.
Built a fully reproducible experimental pipeline with fixed random seeds, baseline implementations, and automated evaluation scripts.
Coding Bootcamp · Vali-e-Asr University Scientific Association of Computer Engineering · RafsanjÄn, Kerman, Iran ·
Summer Coding Bootcamp, the most extensive online event held by the Vali-e-Asr University Scientific Association of Computer Engineering, took place in the summer of 2022.
This coding Bootcamp is something Iâm proud to be a part of, both as an instructor and as a part of the crew that made it happen.
Python and its prevalent packages, Git, and GitHub are the topics covered in this Bootcamp.
Undergraduate course · Vali-e-Asr University of Rafsanjan, Department of Computer Engineering · RafsanjÄn, Kerman, Iran ·
Course: Artificial intelligence
Course instructor: Dr. Amir Hossein Hadjahmadi
Semester: Fall 2022
Team size: 4 TAs
My key role consisted of:
Teaching Uninformed & Informed Search Strategies, CSP, Local Search, Adversarial Search, Game Theory, Basic Machine Learning, and knowledge-based system to undergraduate students of Computer engineering
Correcting studentsâ homework
Holding up recitation class
managing and arranging other TAs with the help of the other Head TA
Designing Assignments and Projects for students
consulting the professor and planning the course syllabus together with the help of the other Head TA
Helping and guiding the students to thrive in the course they took
Undergraduate course · Department of Computer Science and Software Engineering (CSSE), Gina Cody School of Engineering and Computer Science, Concordia University · Montreal, QC, Canada ·
Course: COMP 339 [Combinatorics]
Course instructor: Professor. Hovhannes Harutyunyan
Semester: Fall 2024
TA Type:
Marker for 65 hours
Tutorial Leader for 48 hours
My key role consisted of:
Marking students assignments
Holding up one section of tutorial classes weekly for the whole semseter
Designing and creating LaTeX files of the assignments
Helping, answering questions, emails and guiding the students to thrive in the course they took
Undergraduate course · Department of Computer Science and Software Engineering (CSSE), Gina Cody School of Engineering and Computer Science, Concordia University · Montreal, QC, Canada ·
Course: COMP 335 [Introduction to Theoretical Computer Science]
Course instructor: Dr. Denis Pankratov & Dr. Ali Jannatpour
Semester: Fall 2024
TA Type:
Marker for 66 hours
My key role consisted of:
Marking students assignments
Helping, answering questions, emails and guiding the students to thrive in the course they took
Undergraduate course · Department of Computer Science and Software Engineering (CSSE), Gina Cody School of Engineering and Computer Science, Concordia University · Montreal, QC, Canada ·
Course: COMP 348 [Principles of Programming Languages]
Undergraduate course · Department of Computer Science and Software Engineering (CSSE), Gina Cody School of Engineering and Computer Science, Concordia University · Montreal, QC, Canada ·
Course: COMP 465 [Design and Analysis of Algorithms]
Course instructor: Professor Hovhannes Harutyunyan
Undergraduate course · Department of Computer Science and Software Engineering (CSSE), Gina Cody School of Engineering and Computer Science, Concordia University · Montreal, QC, Canada ·
Course: SOEN 363 [Data Systems for Software Engineers]
Undergraduate course · Department of Computer Science and Software Engineering (CSSE), Gina Cody School of Engineering and Computer Science, Concordia University · Montreal, QC, Canada ·
Course: COMP 335 [Introduction to Theoretical Computer Science]
Course instructor: Dr. Denis Pankratov
Semester: First Half of Summer 2025
TA Type:
Marker for ?? hours
My key role consisted of:
Marking students assignments
Helping, answering questions, emails and guiding the students to thrive in the course they took
Undergraduate course · Department of Computer Science and Software Engineering (CSSE), Gina Cody School of Engineering and Computer Science, Concordia University · Montreal, QC, Canada ·
Course: COMP 348 [Principles of Programming Languages]
Course instructor: Dr. Ali Jannatpour & Dr. Kaustubha Mendhurwar
Undergraduate course · Department of Computer Science and Software Engineering (CSSE), Gina Cody School of Engineering and Computer Science, Concordia University · Montreal, QC, Canada ·
Course: COMP 233 [Probability and Statistics for Computer Science]