Upper bounds for the 2-hued chromatic number of graphs in terms of the independence number. - Ali Dehghan 001; Arash Ahadi (Discret. Appl. Math., 2012)

On the difference between chromatic number and dynamic chromatic number of graphs. - Arash Ahadi; Saieed Akbari; Ali Dehghan 001; Maryam Ghanbari (Discret. Math., 2012)

Computation of lucky number of planar graphs is NP-hard. - Arash Ahadi; Ali Dehghan 001; Mohammad Reza Kazemi 001; E. Mollaahmadi (Inf. Process. Lett., 2012)

Touring Disjoint Polygons Problem Is NP-Hard. - Arash Ahadi; Amirhossein Mozafari; Alireza Zarei (COCOA, 2013)

Silver Block Intersection Graphs of Steiner 2-Designs. - Arash Ahadi; Nazli Besharati; Ebadollah S. Mahmoodian; M. Mortezaeefar (Graphs Comb., 2013)

The complexity of the proper orientation number. - Arash Ahadi; Ali Dehghan 001 (Inf. Process. Lett., 2013)

Algorithmic complexity of proper labeling problems. - Ali Dehghan 001; Mohammad-Reza Sadeghi 001; Arash Ahadi (Theor. Comput. Sci., 2013)

The Complexity of the Sigma Chromatic Number of Cubic Graphs. - Ali Dehghan 001; Mohammad-Reza Sadeghi 001; Arash Ahadi (CoRR, 2014)

Touring a sequence of disjoint polygons: Complexity and extension. - Arash Ahadi; Amirhossein Mozafari; Alireza Zarei (Theor. Comput. Sci., 2014)

On the Complexity of Deciding Whether the Regular Number is at Most Two. - Ali Dehghan 001; Mohammad-Reza Sadeghi 001; Arash Ahadi (Graphs Comb., 2015)

The inapproximability for the (0, 1)-additive number. - Arash Ahadi; Ali Dehghan 001 (Discret. Math. Theor. Comput. Sci., 2016)

Touring Convex Polygons in Polygonal Domain Fences. - Arash Ahadi; Amirhossein Mozafari; Alireza Zarei (COCOA (2), 2017)

Is there any polynomial upper bound for the universal labeling of graphs? - Arash Ahadi; Ali Dehghan 001; Morteza Saghafian (J. Comb. Optim., 2017)

Algorithmic complexity of weakly semiregular partitioning and the representation number. - Arash Ahadi; Ali Dehghan 001; Mohsen Mollahajiaghaei (Theor. Comput. Sci., 2017)

Not-All-Equal and 1-in-Degree Decompositions: Algorithmic Complexity and Applications. - Ali Dehghan 001; Mohammad-Reza (Rafsanjani) Sadeghi; Arash Ahadi (Algorithmica, 2018)

On the algorithmic complexity of decomposing graphs into regular/irregular structures. - Arash Ahadi; Ali Dehghan 001; Mohammad-Reza Sadeghi 001; Brett Stevens (CoRR, 2018)

Sigma Partitioning: Complexity and Random Graphs. - Ali Dehghan 001; Mohammad-Reza Sadeghi 001; Arash Ahadi (Discret. Math. Theor. Comput. Sci., 2018)

(2/2/3)-SAT problem and its applications in dominating set problems. - Arash Ahadi; Ali Dehghan 001 (Discret. Math. Theor. Comput. Sci., 2019)

Connecting guards with minimum Steiner points inside simple polygons. - Arash Ahadi; Alireza Zarei (Theor. Comput. Sci., 2019)

On the Maximum Number of Non-attacking Rooks on a High-Dimensional Simplicial Chessboard. - Arash Ahadi; Mohsen Mollahajiaghaei; Ali Dehghan 001 (Graphs Comb., 2022)

On the Proper Arc Labeling of Directed Graphs. - Ali Dehghan 001; Arash Ahadi (Graphs Comb., 2022)

Optimal Sensor Deception to Deviate from an Allowed Itinerary. - Hazhar Rahmani; Arash Ahadi; Jie Fu 002 (CoRR, 2023)

Improved Wake-Up Time For Euclidean Freeze-Tag Problem. - Sharareh Alipour; Arash Ahadi; Kajal Baghestani (CoRR, 2025)