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)
-
Combinatorial Optimization Agent (Python)
Built a retrieval-assisted system for translating natural-language descriptions of combinatorial optimization problems into structured ILP/LP formulations. The project combines schema retrieval, deterministic grounding, structural formulation checks, and solver-backed validation on a restricted subset, with reproducible benchmark artifacts and documentation. It supports research on reliable natural-language-to-optimization modeling and LLM-assisted mathematical programming workflows.
- 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).
- Graduate Teaching Assistant – Department of Computer Science, NJIT, Apr 2023 – Present
Supported computer science instruction through grading, student mentoring, office-hour-style assistance, exam support, Canvas grading, project evaluation, and course software support. My teaching work has included Data Structures and Algorithms and CS 388 / CodePath Intermediate Android Development. For CS 388, I reviewed GitHub-based programming labs and final projects, managed repository access and submission issues, used CodePath and Canvas grading workflows, communicated with students about submissions, monitored in-class project progress when the instructor was away, and generated GitHub contribution analyses to help evaluate team participation.
Teaching
Graduate Teaching Assistant, Department of Computer Science, NJIT (Apr 2023 – Present)
- Supported computer science courses through grading, mentoring, office-hour-style help, exam support, Canvas grading, programming-project review, and student communication.
- TA support for Data Structures and Algorithms, including grading, mentoring, and helping students understand algorithmic and programming concepts.
- TA support for CS 388 / CodePath Intermediate Android Development, including review of GitHub-based lab and project submissions, repository-access troubleshooting, CodePath/Canvas grading workflows, and project-status communication.
- Covered class/project activity when needed by taking attendance, monitoring in-class project progress, and reporting status to the instructor.
- Generated GitHub contribution analyses for team projects to support fair evaluation of student participation.
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).
See my ICPC profile for details.
Peer Reviews
I have completed 190+ verified peer reviews across AI, machine learning, optimization, theoretical computer science, operations research, and parallel computing venues. Selected Web of Science / ORCID-recorded review activity includes:
- Engineering Applications of Artificial Intelligence (29)
- Computers & Industrial Engineering (18)
- Journal of Combinatorial Optimization (16)
- International Journal of Foundations of Computer Science (15)
- Journal of Scheduling (12)
- Discrete Mathematics, Algorithms and Applications (11)
- Theoretical Computer Science (7)
- Journal of Parallel and Distributed Computing (7)
- ACM SIGKDD / KDD (6)
- ACM Transactions on Parallel Computing (6)
- Information and Computation (6)
- ACM International Conference on Multimedia Retrieval (5)
- Additional reviews include Information Processing Letters, Operations Research Perspectives, INFORMS Journal on Computing, IEEE Transactions venues, Theory and Decision, Graphs and Combinatorics, Public Transport, and others (see my Web of Science record).
Profiles
Google Scholar | ORCID | ResearchGate | LeetCode | HackerRank | UVA Online Judge | Instagram | Facebook
Contact
Email: sv96@njit.edu