Algorithmic complexity of proper labeling problems A Dehghan, MR Sadeghi, A Ahadi Theoretical Computer Science 495, 25-36, 2013 | 40 | 2013 |

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 | 23 | 2012 |

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 | 22 | 2012 |

On the Tanner graph cycle distribution of random LDPC, random protograph-based LDPC, and random quasi-cyclic LDPC code ensembles A Dehghan, AH Banihashemi IEEE Transactions on Information Theory 64 (6), 4438-4451, 2018 | 19 | 2018 |

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 | 15 | 2012 |

The Complexity of the Proper Orientation Number AD Arash Ahadi Information Processing Letters 113, 799-803, 2013 | 13 | 2013 |

On strongly planar not-all-equal 3SAT A Dehghan Journal of Combinatorial Optimization 32 (3), 721-724, 2016 | 11 | 2016 |

The inapproximability for the (0, 1)-additive number A Ahadi, A Dehghan Discrete Mathematics & Theoretical Computer Science 17 (3), 217-226, 2016 | 8 | 2016 |

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, 2014 | 8 | 2014 |

The complexity of the sigma chromatic number of cubic graphs A Dehghan, MR Sadeghi, A Ahadi Discrete Appl. Math., submitted, 2014 | 6* | 2014 |

On rainbow connection of strongly regular graphs A Ahadi, A Dehghan arXiv preprint arXiv:1001.3413, 2010 | 6 | 2010 |

Hardness Results on Finding Leafless Elementary Trapping Sets and Elementary Absorbing Sets of LDPC Codes A Dehghan, AH Banihashemi IEEE Transactions on Information Theory, 2019 | 4 | 2019 |

On computing the multiplicity of cycles in bipartite graphs using the degree distribution and the spectrum of the graph A Dehghan, AH Banihashemi IEEE Transactions on Information Theory 65 (6), 3778-3789, 2019 | 4 | 2019 |

On the algorithmic complexity of adjacent vertex closed distinguishing colorings number of graphs A Dehghan, M Mollahajiaghaei Discrete Applied Mathematics 218, 82-97, 2017 | 4 | 2017 |

The complexity of the zero-sum 3-flows A Dehghan, MR Sadeghi Information Processing Letters 115 (2), 316-320, 2014 | 4 | 2014 |

Finding leafless elementary trapping sets and elementary absorbing sets of LDPC codes is hard A Dehghan, AH Banihashemi 2018 IEEE International Symposium on Information Theory (ISIT), 1645-1649, 2018 | 3 | 2018 |

Asymptotic average number of different categories of trapping sets, absorbing sets and stopping sets in random regular and irregular LDPC code ensembles A Dehghan, AH Banihashemi IEEE Trans. Inf. Theory, 2017 | 3 | 2017 |

On the Lucky labeling of Graphs A Ahadi, A Dehghan, E Mollaahmadi arXiv preprint arXiv:1007.2480, 2010 | 3 | 2010 |

Asymptotic average number of different categories of trapping sets, absorbing sets and stopping sets in random LDPC code ensembles A Dehghan, AH Banihashemi 2018 IEEE International Symposium on Information Theory (ISIT), 1650-1654, 2018 | 2 | 2018 |

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 | 2 | 2017 |