1. The inapproximability for the (0,1)-additive number;Ahadi;Discrete Math. Theor. Comput. Sci.,2016
2. Computation of lucky number of planar graphs is NP-hard;Ahadi;Inform. Process. Lett.,2012
3. Algorithmic complexity of proper labeling problems;Ahadi;Theoret. Comput. Sci.,2013
4. On the complexity of deciding whether the regular number is at most two;Ahadi;Graphs Combin.,2015
5. A. Ahadi, A. Dehghan, M.-R. Sadeghi, B. Stevens, Partitioning the edges of graph into regular, locally regular and/or locally irregular subgraphs is hard no matter which you choose, 2015, submitted for publication.