6 citations · 6 across the 5 of their papers we have counts for
6 papers
Remote Matching: Exact-Cardinality Approximation and Tight UGC Hardness
Arash Ahadi, Morteza Alimi, Sharareh Alipour +1
In the unrestricted max--min metric -join problem, one seeks an even terminal set maximizing the cost of a minimum -join. Iwata and Ravi gave a factor- approximation…
Multiset Colorings of Random Graphs Across Density Regimes
Arash Ahadi, Sharareh Alipour
We show that almost every graph admits a partition of its vertex set into three parts such that no two adjacent vertices have the same number of neighbors in each of the three part…
Extremal List Gaps and Inapproximability in Additive Graph Labeling
Arash Ahadi, Sharareh Alipour
We study a vertex-labeling analogue of the -- problem and its list version. For a labeling , let . The additive n…
Improved Wake-Up Time For Euclidean Freeze-Tag Problem
Sharareh Alipour, Arash Ahadi, Kajal Baghestani
The Freeze-Tag Problem (FTP) involves activating a set of initially asleep robots as quickly as possible, starting from a single awake robot. Once activated, a robot can assist in…
Geometric Freeze-Tag Problem
Sharareh Alipour, Kajal Baghestani, Mahdis Mirzaei +1
We study the Freeze-Tag Problem (FTP), introduced by Arkin et al. (SODA'02), where the goal is to wake up a group of robots, starting from a single active robot. Our focus is o…
Utilizing ChatGPT in a Data Structures and Algorithms Course: A Teaching Assistant's Perspective
Pooriya Jamie, Reyhaneh Hajihashemi, Sharareh Alipour
Integrating large language models (LLMs) like ChatGPT into computer science education offers transformative potential for complex courses such as data structures and algorithms (DS…