Arash Ahadi
Arash Ahadi
Verified email at mehr.sharif.edu
TitleCited byYear
Algorithmic complexity of proper labeling problems
A Dehghan, MR Sadeghi, A Ahadi
Theoretical Computer Science 495, 25-36, 2013
392013
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
212012
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
212012
Touring a sequence of disjoint polygons: complexity and extension
A Ahadi, A Mozafari, A Zarei
Theoretical Computer Science 556, 45-54, 2014
152014
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
142012
The complexity of the proper orientation number
A Ahadi, A Dehghan
Information Processing Letters 113 (19-21), 799-803, 2013
132013
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
82015
The inapproximability for the (0, 1)-additive number
A Ahadi, A Dehghan
arXiv preprint arXiv:1306.0182, 2013
82013
Touring disjoint polygons problem is NP-hard
A Ahadi, A Mozafari, A Zarei
International Conference on Combinatorial Optimization and Applications, 351-360, 2013
62013
On rainbow connection of strongly regular graphs
A Ahadi, A Dehghan
arXiv preprint arXiv:1001.3413, 2010
62010
The complexity of the sigma chromatic number of cubic graphs
A Dehghan, MR Sadeghi, A Ahadi
Discrete Appl. Math., submitted, 2014
5*2014
Is there any polynomial upper bound for the universal labeling of graphs?
A Ahadi, A Dehghan, M Saghafian
Journal of Combinatorial Optimization 34 (3), 760-770, 2017
22017
Silver block intersection graphs of steiner 2-designs
A Ahadi, N Besharati, ES Mahmoodian, M Mortezaeefar
Graphs and Combinatorics 29 (4), 735-746, 2013
22013
Connecting guards with minimum Steiner points inside simple polygons
A Ahadi, A Zarei
Theoretical Computer Science 775, 26-31, 2019
12019
Not-All-Equal and 1-in-Degree Decompositions: Algorithmic Complexity and Applications
A Dehghan, MR Sadeghi, A Ahadi
Algorithmica 80 (12), 3704-3727, 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 algorithmic complexity of decomposing graphs into regular/irregular structures
A Ahadi, A Dehghan, MR Sadeghi, B Stevens
arXiv preprint arXiv:1801.08876, 2018
2018
Touring Convex Polygons in Polygonal Domain Fences
A Ahadi, A Mozafari, A Zarei
International Conference on Combinatorial Optimization and Applications, 61-75, 2017
2017
vorheriger Artikel Neighbor-sum-distinguishing edge choosability o... nächster Artikel Disconnected-critical graphs
A Ahadi, A Dehghan, M Saghafian
Journal of Combinatorial Optimization 23 (2016), 2017
2017
The inapproximability for the -additive number
A Dehghan, A Ahadi
Discrete Mathematics & Theoretical Computer Science 17, 2016
2016
The system can't perform the operation now. Try again later.
Articles 1–20