Arash Ahadi

Publication Activity (10 Years)

Years Active: 2009-2023
Publications (10 Years): 18

Top Topics

Labeling Problems

Spatial Coherence

Top Venues

Theor. Comput. Sci.

Discret. Math. Theor. Comput. Sci.

Publications

Hazhar Rahmani, Arash Ahadi, Jie Fu
Optimal Sensor Deception to Deviate from an Allowed Itinerary. CoRR (2023)
Arash Ahadi, Mohsen Mollahajiaghaei, Ali Dehghan
On the Maximum Number of Non-attacking Rooks on a High-Dimensional Simplicial Chessboard. Graphs Comb. 38 (3) (2022)
Ali Dehghan, Arash Ahadi
On the Proper Arc Labeling of Directed Graphs. Graphs Comb. 38 (1) (2022)
Arash Ahadi, Mohsen Mollahajiaghaei, Ali Dehghan
On the maximum number of non attacking rooks on a high-dimensional simplicial chessboard. CoRR (2021)
Arash Ahadi, Ali Dehghan
(2/2/3)-SAT problem and its applications in dominating set problems. Discret. Math. Theor. Comput. Sci. 21 (4) (2019)
Arash Ahadi, Alireza Zarei
Connecting guards with minimum Steiner points inside simple polygons. Theor. Comput. Sci. 775 (2019)
Arash Ahadi, Ali Dehghan, Mohammad-Reza Sadeghi, Brett Stevens
On the algorithmic complexity of decomposing graphs into regular/irregular structures. CoRR (2018)
Ali Dehghan, Mohammad-Reza Sadeghi, Arash Ahadi
Sigma Partitioning: Complexity and Random Graphs. Discret. Math. Theor. Comput. Sci. 20 (2) (2018)
Ali Dehghan, Mohammad-Reza Sadeghi, Arash Ahadi
Not-All-Equal and 1-in-Degree Decompositions: Algorithmic Complexity and Applications. CoRR (2018)
Ali Dehghan, Mohammad-Reza (Rafsanjani) Sadeghi, Arash Ahadi
Not-All-Equal and 1-in-Degree Decompositions: Algorithmic Complexity and Applications. Algorithmica 80 (12) (2018)
Arash Ahadi, Amirhossein Mozafari, Alireza Zarei
Touring Convex Polygons in Polygonal Domain Fences. COCOA (2) (2017)
Arash Ahadi, Ali Dehghan, Morteza Saghafian
Is there any polynomial upper bound for the universal labeling of graphs? CoRR (2017)
Arash Ahadi, Ali Dehghan, Mohsen Mollahajiaghaei
Algorithmic Complexity of Weakly Semiregular Partitioning and the Representation Number. CoRR (2017)
Arash Ahadi, Ali Dehghan, Morteza Saghafian
Is there any polynomial upper bound for the universal labeling of graphs? J. Comb. Optim. 34 (3) (2017)
Arash Ahadi, Ali Dehghan, Mohsen Mollahajiaghaei
Algorithmic complexity of weakly semiregular partitioning and the representation number. Theor. Comput. Sci. 674 (2017)
Ali Dehghan, Mohammad-Reza Sadeghi, Arash Ahadi
Algorithmic complexity of proper labeling problems. CoRR (2017)
Arash Ahadi, Ali Dehghan
The inapproximability for the (0, 1)-additive number. Discret. Math. Theor. Comput. Sci. 17 (3) (2016)
Arash Ahadi, Ali Dehghan
(2/2/3)-SAT problem and its applications in dominating set problems. CoRR (2016)
Ali Dehghan, Mohammad-Reza Sadeghi, Arash Ahadi
On the Complexity of Deciding Whether the Regular Number is at Most Two. Graphs Comb. 31 (5) (2015)
Ali Dehghan, Mohammad-Reza Sadeghi, Arash Ahadi
On the complexity of deciding whether the regular number is at most two. CoRR (2014)
Arash Ahadi, Amirhossein Mozafari, Alireza Zarei
Touring a sequence of disjoint polygons: Complexity and extension. Theor. Comput. Sci. 556 (2014)
Ali Dehghan, Mohammad-Reza Sadeghi, Arash Ahadi
The Complexity of the Sigma Chromatic Number of Cubic Graphs. CoRR (2014)
Arash Ahadi, Ali Dehghan
The Complexity of the Proper Orientation Number CoRR (2013)
Arash Ahadi, Ali Dehghan
The complexity of the proper orientation number. Inf. Process. Lett. 113 (19-21) (2013)
Ali Dehghan, Mohammad-Reza Sadeghi, Arash Ahadi
Algorithmic complexity of proper labeling problems. Theor. Comput. Sci. 495 (2013)
Arash Ahadi, Amirhossein Mozafari, Alireza Zarei
Touring Disjoint Polygons Problem Is NP-Hard. COCOA (2013)
Arash Ahadi, Nazli Besharati, Ebadollah S. Mahmoodian, M. Mortezaeefar
Silver Block Intersection Graphs of Steiner 2-Designs. Graphs Comb. 29 (4) (2013)
Arash Ahadi, Ali Dehghan
The Inapproximability for the (0, 1)-additive number. CoRR (2013)
Ali Dehghan, Arash Ahadi
Upper bounds for the 2-hued chromatic number of graphs in terms of the independence number. Discret. Appl. Math. 160 (15) (2012)
Arash Ahadi, Ali Dehghan, Mohammad Reza Kazemi, E. Mollaahmadi
Computation of lucky number of planar graphs is NP-hard. Inf. Process. Lett. 112 (4) (2012)
Arash Ahadi, Saieed Akbari, Ali Dehghan, Maryam Ghanbari
On the difference between chromatic number and dynamic chromatic number of graphs. Discret. Math. 312 (17) (2012)
Arash Ahadi, Ali Dehghan
Upper bounds for the 2-hued chromatic number of graphs in terms of the independence number. CoRR (2009)