Follow
Arash Ahadi
Arash Ahadi
Ph.D graduate from Sharif University of Technology
No verified email
Title
Cited by
Cited by
Year
Algorithmic complexity of proper labeling problems
A Dehghan, MR Sadeghi, A Ahadi
Theoretical Computer Science 495, 25-36, 2013
572013
On the difference between chromatic number and dynamic chromatic number of graphs
A Ahadi, S Akbari, A Dehghan, M Ghanbari
Discrete mathematics 312 (17), 2579-2583, 2012
462012
Computation of lucky number of planar graphs is NP-hard
A Ahadi, A Dehghan, M Kazemi, E Mollaahmadi
Information processing letters 112 (4), 109-112, 2012
402012
Touring a sequence of disjoint polygons: Complexity and extension
A Ahadi, A Mozafari, A Zarei
Theoretical Computer Science 556, 45-54, 2014
252014
The complexity of the proper orientation number
A Ahadi, A Dehghan
Information Processing Letters 113 (19-21), 799-803, 2013
252013
Upper bounds for the 2-hued chromatic number of graphs in terms of the independence number
A Dehghan, A Ahadi
Discrete applied mathematics 160 (15), 2142-2146, 2012
242012
On the complexity of deciding whether the regular number is at most two
A Dehghan, MR Sadeghi, A Ahadi
Graphs and Combinatorics 31 (5), 1359-1365, 2015
152015
Is there any polynomial upper bound for the universal labeling of graphs?
A Ahadi, A Dehghan, M Saghafian
Journal of Combinatorial Optimization 34, 760-770, 2017
132017
Touring disjoint polygons problem is NP-hard
A Ahadi, A Mozafari, A Zarei
International Conference on Combinatorial Optimization and Applications, 351-360, 2013
82013
-SAT problem and its applications in dominating set problems
A Ahadi, A Dehghan
Discrete Mathematics & Theoretical Computer Science 21 (Graph Theory), 2019
72019
The inapproximability for the -additive number
A Ahadi, A Dehghan
Discrete Mathematics & Theoretical Computer Science 17 (Graph Theory), 2016
72016
On rainbow connection of strongly regular graphs
A Ahadi, A Dehghan
arXiv preprint arXiv:1001.3413, 2010
52010
Sigma partitioning: complexity and random graphs
A Dehghan, MR Sadeghi, A Ahadi
Discrete Mathematics & Theoretical Computer Science 20 (Graph Theory), 2018
32018
Silver block intersection graphs of steiner 2-designs
A Ahadi, N Besharati, ES Mahmoodian, M Mortezaeefar
Graphs and Combinatorics 29 (4), 735-746, 2013
32013
Connecting guards with minimum Steiner points inside simple polygons
A Ahadi, A Zarei
Theoretical Computer Science 775, 26-31, 2019
22019
Not-all-equal and 1-in-degree decompositions: algorithmic complexity and applications
A Dehghan, MR Sadeghi, A Ahadi
Algorithmica 80 (12), 3704-3727, 2018
22018
On the maximum number of non-attacking rooks on a high-dimensional simplicial chessboard
A Ahadi, M Mollahajiaghaei, A Dehghan
Graphs and Combinatorics 38 (3), 52, 2022
12022
On the algorithmic complexity of decomposing graphs into regular/irregular structures
A Ahadi, A Dehghan, MR Sadeghi, B Stevens
arXiv preprint arXiv:1801.08876, 2018
12018
Algorithmic complexity of weakly semiregular partitioning and the representation number
A Ahadi, A Dehghan, M Mollahajiaghaei
Theoretical Computer Science 674, 60-72, 2017
12017
On the Proper Arc Labeling of Directed Graphs
A Dehghan, A Ahadi
Graphs and Combinatorics 38, 1-19, 2022
2022
The system can't perform the operation now. Try again later.
Articles 1–20