About Me
Ph.D. candidate in Computer Science at NJIT (Ying Wu College of Computing), specializing in algorithms, discrete optimization, and scalable computing. GPA: 3.68/4.00.
My Ph.D. advisor is Professor Ioannis Koutis. I work on graph algorithms, ranking from pairwise comparisons, scheduling, and high-performance computing.
I earned my Bachelor's degree in Computer Engineering (Computer Architecture) from Isfahan University of Technology (2015–2020), officially evaluated as equivalent to a U.S. Bachelor of Science in Computer Engineering.
GRE: Quantitative 170 (Perfect Score, 96th percentile).
Publications
- Interweaving Real-Time Jobs with Energy Harvesting to Maximize Throughput (Algorithmica 2025)
- Promoting Fairness and Priority in Selecting k-Winners Using IRV (KDD 2024)
- Minimum Weighted Feedback Arc Sets for Ranking from Pairwise Comparisons (arXiv 2024)
- Approximating Connected Maximum Cuts via Local Search (ESA 2023)
- Parallel Longest Common Subsequence Analysis in Chapel (IEEE HPEC 2023)
- Branch-and-Price for Cognitive Radio Resource Allocation (Ad Hoc Networks 2022)
Full list on my Google Scholar.
Projects
- Parallel Longest Common Subsequence Analysis (Chapel)
-
Course Scheduling System for Ying Wu College of Computing (Python + Gurobi)
Developed an integer linear programming (ILP)-based scheduler that assigns professors to courses while minimizing conflicts and policy violations. The system accounts for faculty availability, health/religious restrictions, course demand, and NJIT’s educational policies. It generates optimized schedules balancing fairness and efficiency across multiple constraints. This project was supervised by Professor Ioannis Koutis.
- Jigsaw Puzzle Solver
Experience
- Software Developer Intern – Canfield Scientific Inc. (Parsippany, NJ), Summer 2025
Contributed to the company’s dermatology imaging platform using C++ and Qt. Implemented modules for image capture, annotation, lesion tracking, and report generation. Debugged multi-camera acquisition workflows and optimized real-time processing pipelines.
- Research Assistant – NJIT, Jan 2022 – Mar 2023
Conducted research on algorithmic and optimization-based approaches for computational problems. Focused on:
- Parallel LCS in Chapel – Designed scalable parallel algorithms for sequence analysis (IEEE HPEC 2023).
- Energy-Efficient Real-Time Scheduling – Studied task scheduling with energy harvesting constraints (Algorithmica 2025).
- Local Search for Connected Max-Cut – Proposed new local search methods for approximating maximum connected cuts (ESA 2023).
- Teaching Assistant – NJIT, Apr 2023 – Present
TA for Data Structures and Algorithms. Responsibilities include grading, mentoring, and leading recitation sessions to support undergraduate students.
Achievements
🏆 Best Paper Award at WALCOM 2023 (Energy-efficient scheduling).
🏅 ACM ICPC: Multiple honorable mentions and high placements — 1st place (IU Online 2016), 4th (AUT Online 2016), 9th (Nationwide 2015), and 17th (Tehran Regional 2017).
🎯 GRE Quant: 170 (Perfect Score).
See my ICPC profile for details.
Peer Reviews
I have completed over 170 verified peer reviews for leading journals and conferences, including:
- Engineering Applications of Artificial Intelligence (25+)
- Journal of Combinatorial Optimization (11)
- Theoretical Computer Science (7)
- Journal of Scheduling (10)
- Computers & Industrial Engineering (17)
- ACM SIGKDD (6)
- Journal of Parallel and Distributed Computing (4)
- Information and Computation (6)
- And many others (see my Web of Science record).
Profiles
Google Scholar | ORCID | ResearchGate | LeetCode | HackerRank | UVA Online Judge | Instagram | Facebook
Miscellaneous
In my free time, I enjoy playing chess and analyzing classic games. I am also learning Spanish using the Duolingo app as part of my daily routine.
I also manage the Telegram channel @cspositions, which introduces computer science positions and has over 8,000 members.
Contact
Email: sv96@njit.edu