Get started
Author

Arash Ahadi

Observed names: A. Ahadi, Ahadi, Arash
ORCID: 0009-0008-9617-1301
Observed ORCID: 0009-0008-9617-1301
OpenAlex ID: A5068460188
Algorithmic complexity of proper labeling problems
2013 · Ali Dehghan, Mohammad-Reza Sadeghi, et al. · Theoretical Computer Science · 46
On the difference between chromatic number and dynamic chromatic number of graphs
2011 · A. Ahadi, S. Akbari, et al. · Discrete Mathematics · 34
PDF
The complexity of the proper orientation number
2013 · A. Ahadi, A. Dehghan · Information Processing Letters · 25
PDF
Computation of lucky number of planar graphs is NP-hard
2011 · A. Ahadi, A. Dehghan, et al. · Information Processing Letters · 25
Touring a sequence of disjoint polygons: Complexity and extension
2014 · Arash Ahadi, Amirhossein Mozafari, et al. · Theoretical Computer Science · 19
Upper bounds for the 2-hued chromatic number of graphs in terms of the independence number
2012 · A. Dehghan, A. Ahadi · Discrete Applied Mathematics · 19
The inapproximability for the $(0,1)$-additive number
2016 · Arash Ahadi, Ali Dehghan · Discrete Mathematics & Theoretical Computer Science · 7
PDF
The Complexity of the Sigma Chromatic Number of Cubic Graphs
2014 · Ali Dehghan, Mohammad‐Reza Sadeghi, et al. · arXiv (Cornell University) · 6
$(2/2/3)$-SAT problem and its applications in dominating set problems
2019 · Arash Ahadi, Ali Dehghan · Discrete Mathematics & Theoretical Computer Science · 4
PDF
Sigma Partitioning: Complexity and Random Graphs
2018 · Ali Dehghan, Mohammad-Reza Sadeghi, et al. · Discrete Mathematics & Theoretical Computer Science · 4
PDF
Touring Disjoint Polygons Problem Is NP-Hard
2013 · Arash Ahadi, Amirhossein Mozafari, et al. · Lecture notes in computer science · 3
Silver Block Intersection Graphs of Steiner 2-Designs
2012 · A. Ahadi, Nazli Besharati, et al. · Graphs and Combinatorics · 3
PDF
On Rainbow Connection of Strongly Regular Graphs
2010 · Ahadi, Arash, Dehghan, Ali · arXiv (Cornell University) · 3
PDF
Connecting guards with minimum Steiner points inside simple polygons
2018 · Arash Ahadi, Alireza Zarei · Theoretical Computer Science · 2
PDF
Not-All-Equal and 1-in-Degree Decompositions: Algorithmic Complexity and Applications
2018 · Ali Dehghan, Mohammad-Reza Sadeghi, et al. · Algorithmica · 2
PDF
On the algorithmic complexity of decomposing graphs into regular/irregular structures
2018 · Ahadi, Arash, Dehghan, Ali, et al. · arXiv (Cornell University) · 2
PDF
On the Lucky labeling of Graphs
2010 · Ahadi, Arash, Dehghan, Ali, et al. · arXiv (Cornell University) · 2
PDF
Local Infection in Uniform Hypergraphs
2025 · Arash Ahadi, Ahmad Biniaz · SSRN Electronic Journal · 1
On the Maximum Number of Non-attacking Rooks on a High-Dimensional Simplicial Chessboard
2022 · Arash Ahadi, Mohsen Mollahajiaghaei, et al. · Graphs and Combinatorics · 1
PDF
Algorithmic complexity of weakly semiregular partitioning and the representation number
2017 · Arash Ahadi, Ali Dehghan, et al. · Theoretical Computer Science · 1
PDF
Local Infection in Uniform Hypergraphs
2026 · Arash Ahadi, Ahmad Biniaz · Theoretical Computer Science
Remote Matching: Exact-Cardinality Approximation and Tight UGC Hardness
2026 · Ahadi, Arash, Alimi, Morteza, et al. · arXiv (Cornell University)
PDF
Multiset Colorings of Random Graphs Across Density Regimes
2026 · Ahadi, Arash, Alipour, Sharareh · arXiv (Cornell University)
PDF
Extremal List Gaps and Inapproximability in Additive Graph Labeling
2026 · Ahadi, Arash, Alipour, Sharareh · arXiv (Cornell University)
PDF
Geometric freeze-tag problem
2026 · Sharareh Alipour, Arash Ahadi, et al. · Autonomous Agents and Multi-Agent Systems
Works count: 30
Citation count: 209
H-index: 7
I10-index: 6
Year
Topic
Type