Arash Ahadi

36 papers C 1Journal 32Unranked 3
YearRankTypeTitle / Venue / Authors
2026 J jnl
Geometric freeze-tag problem.
Auton. Agents Multi Agent Syst.
Sharareh Alipour, Arash Ahadi, Kajal Baghestani, Soroush Sahraei, Mahdis Mirzaei
2025 — conf
Guarding Polygons With Mutually Visible π-Guards.
CCCG
Arash Ahadi, Ahmad Biniaz, Mohammad Hashemi, Ali Nakhaeisharif
2025 — conf
Improved Wake-Up Time For Euclidean Freeze-Tag Problem.
CCCG
Sharareh Alipour, Arash Ahadi, Kajal Baghestani
2025 J jnl
Improved Wake-Up Time For Euclidean Freeze-Tag Problem.
CoRR
Sharareh Alipour, Arash Ahadi, Kajal Baghestani
2023 J jnl
Optimal Sensor Deception to Deviate from an Allowed Itinerary.
CoRR
Hazhar Rahmani, Arash Ahadi, Jie Fu
2022 J jnl
On the Maximum Number of Non-attacking Rooks on a High-Dimensional Simplicial Chessboard.
Graphs Comb.
Arash Ahadi, Mohsen Mollahajiaghaei, Ali Dehghan
2022 J jnl
On the Proper Arc Labeling of Directed Graphs.
Graphs Comb.
Ali Dehghan, Arash Ahadi
2021 J jnl
On the maximum number of non attacking rooks on a high-dimensional simplicial chessboard.
CoRR
Arash Ahadi, Mohsen Mollahajiaghaei, Ali Dehghan
2019 J jnl
(2/2/3)-SAT problem and its applications in dominating set problems.
Discret. Math. Theor. Comput. Sci.
Arash Ahadi, Ali Dehghan
2019 J jnl
Connecting guards with minimum Steiner points inside simple polygons.
Theor. Comput. Sci.
Arash Ahadi, Alireza Zarei
2018 J jnl
Not-All-Equal and 1-in-Degree Decompositions: Algorithmic Complexity and Applications.
Algorithmica
Ali Dehghan, Mohammad-Reza (Rafsanjani) Sadeghi, Arash Ahadi
2018 J jnl
Not-All-Equal and 1-in-Degree Decompositions: Algorithmic Complexity and Applications.
CoRR
Ali Dehghan, Mohammad-Reza Sadeghi, Arash Ahadi
2018 J jnl
On the algorithmic complexity of decomposing graphs into regular/irregular structures.
CoRR
Arash Ahadi, Ali Dehghan, Mohammad-Reza Sadeghi, Brett Stevens
2018 J jnl
Sigma Partitioning: Complexity and Random Graphs.
Discret. Math. Theor. Comput. Sci.
Ali Dehghan, Mohammad-Reza Sadeghi, Arash Ahadi
2017 J jnl
Algorithmic Complexity of Weakly Semiregular Partitioning and the Representation Number.
CoRR
Arash Ahadi, Ali Dehghan, Mohsen Mollahajiaghaei
2017 J jnl
Algorithmic complexity of proper labeling problems.
CoRR
Ali Dehghan, Mohammad-Reza Sadeghi, Arash Ahadi
2017 J jnl
Algorithmic complexity of weakly semiregular partitioning and the representation number.
Theor. Comput. Sci.
Arash Ahadi, Ali Dehghan, Mohsen Mollahajiaghaei
2017 J jnl
Is there any polynomial upper bound for the universal labeling of graphs?
CoRR
Arash Ahadi, Ali Dehghan, Morteza Saghafian
2017 J jnl
Is there any polynomial upper bound for the universal labeling of graphs?
J. Comb. Optim.
Arash Ahadi, Ali Dehghan, Morteza Saghafian
2017 — conf
Touring Convex Polygons in Polygonal Domain Fences.
COCOA (2)
Arash Ahadi, Amirhossein Mozafari, Alireza Zarei
2016 J jnl
(2/2/3)-SAT problem and its applications in dominating set problems.
CoRR
Arash Ahadi, Ali Dehghan
2016 J jnl
The inapproximability for the (0, 1)-additive number.
Discret. Math. Theor. Comput. Sci.
Arash Ahadi, Ali Dehghan
2015 J jnl
On the Complexity of Deciding Whether the Regular Number is at Most Two.
Graphs Comb.
Ali Dehghan, Mohammad-Reza Sadeghi, Arash Ahadi
2014 J jnl
On the complexity of deciding whether the regular number is at most two.
CoRR
Ali Dehghan, Mohammad-Reza Sadeghi, Arash Ahadi
2014 J jnl
The Complexity of the Sigma Chromatic Number of Cubic Graphs.
CoRR
Ali Dehghan, Mohammad-Reza Sadeghi, Arash Ahadi
2014 J jnl
Touring a sequence of disjoint polygons: Complexity and extension.
Theor. Comput. Sci.
Arash Ahadi, Amirhossein Mozafari, Alireza Zarei
2013 J jnl
Algorithmic complexity of proper labeling problems.
Theor. Comput. Sci.
Ali Dehghan, Mohammad-Reza Sadeghi, Arash Ahadi
2013 J jnl
Silver Block Intersection Graphs of Steiner 2-Designs.
Graphs Comb.
Arash Ahadi, Nazli Besharati, Ebadollah S. Mahmoodian, M. Mortezaeefar
2013 J jnl
The Complexity of the Proper Orientation Number
CoRR
Arash Ahadi, Ali Dehghan
2013 J jnl
The Inapproximability for the (0, 1)-additive number.
CoRR
Arash Ahadi, Ali Dehghan
2013 J jnl
The complexity of the proper orientation number.
Inf. Process. Lett.
Arash Ahadi, Ali Dehghan
2013 C conf
Touring Disjoint Polygons Problem Is NP-Hard.
COCOA
Arash Ahadi, Amirhossein Mozafari, Alireza Zarei
2012 J jnl
Computation of lucky number of planar graphs is NP-hard.
Inf. Process. Lett.
Arash Ahadi, Ali Dehghan, Mohammad Reza Kazemi, E. Mollaahmadi
2012 J jnl
On the difference between chromatic number and dynamic chromatic number of graphs.
Discret. Math.
Arash Ahadi, Saieed Akbari, Ali Dehghan, Maryam Ghanbari
2012 J jnl
Upper bounds for the 2-hued chromatic number of graphs in terms of the independence number.
Discret. Appl. Math.
Ali Dehghan, Arash Ahadi
2009 J jnl
Upper bounds for the 2-hued chromatic number of graphs in terms of the independence number.
CoRR
Arash Ahadi, Ali Dehghan