Upper bounds for the 2-hued chromatic number of graphs in terms of the independence number. - Ali Dehghan 001; Arash Ahadi (Discret. Appl. Math., 2012)

On the difference between chromatic number and dynamic chromatic number of graphs. - Arash Ahadi; Saieed Akbari; Ali Dehghan 001; Maryam Ghanbari (Discret. Math., 2012)

Computation of lucky number of planar graphs is NP-hard. - Arash Ahadi; Ali Dehghan 001; Mohammad Reza Kazemi 001; E. Mollaahmadi (Inf. Process. Lett., 2012)

A practical fault induction attack against an FPGA implementation of AES cryptosystem. - Hamed Momeni; Massoud Masoumi; Ali Dehghan 001 (WorldCIS, 2013)

The complexity of the proper orientation number. - Arash Ahadi; Ali Dehghan 001 (Inf. Process. Lett., 2013)

Algorithmic complexity of proper labeling problems. - Ali Dehghan 001; Mohammad-Reza Sadeghi 001; Arash Ahadi (Theor. Comput. Sci., 2013)

The Complexity of the Sigma Chromatic Number of Cubic Graphs. - Ali Dehghan 001; Mohammad-Reza Sadeghi 001; Arash Ahadi (CoRR, 2014)

On the Complexity of Deciding Whether the Regular Number is at Most Two. - Ali Dehghan 001; Mohammad-Reza Sadeghi 001; Arash Ahadi (Graphs Comb., 2015)

The complexity of the zero-sum 3-flows. - Ali Dehghan 001; Mohammad-Reza Sadeghi 001 (Inf. Process. Lett., 2015)

The inapproximability for the (0, 1)-additive number. - Arash Ahadi; Ali Dehghan 001 (Discret. Math. Theor. Comput. Sci., 2016)

On the algorithmic complexity of zero-sum edge-coloring. - Ali Dehghan 001; Mohammad-Reza Sadeghi 001 (Inf. Process. Lett., 2016)

On strongly planar not-all-equal 3SAT. - Ali Dehghan 001 (J. Comb. Optim., 2016)

Asymptotic Average Number of Different Categories of Trapping Sets, Absorbing Sets and Stopping Sets in Random Regular and Irregular LDPC Code Ensembles. - Ali Dehghan 001; Amir H. Banihashemi (CoRR, 2017)

On the algorithmic complexity of adjacent vertex closed distinguishing colorings number of graphs. - Ali Dehghan 001; Mohsen Molla Haji Aghaei (Discret. Appl. Math., 2017)

Colorful edge decomposition of graphs: Some polynomial cases. - Ali Dehghan 001; Mohammad-Reza Sadeghi 001 (Discret. Appl. Math., 2017)

Is there any polynomial upper bound for the universal labeling of graphs? - Arash Ahadi; Ali Dehghan 001; Morteza Saghafian (J. Comb. Optim., 2017)

Algorithmic complexity of weakly semiregular partitioning and the representation number. - Arash Ahadi; Ali Dehghan 001; Mohsen Mollahajiaghaei (Theor. Comput. Sci., 2017)

From Cages to Trapping Sets: A New Technique to Derive Tight Upper Bounds on the Minimum Size of Trapping Sets and Minimum Distance of LDPC Codes. - Ali Dehghan 001; Amir H. Banihashemi (ISIT, 2018)

Finding Leafless Elementary Trapping Sets and Elementary Absorbing Sets of LDPC Codes is Hard. - Ali Dehghan 001; Amir H. Banihashemi (ISIT, 2018)

Asymptotic Average Number of Different Categories of Trapping Sets, Absorbing Sets and Stopping Sets in Random LDPC Code Ensembles. - Ali Dehghan 001; Amir H. Banihashemi (ISIT, 2018)

Computing the Asymptotic Expected Multiplicity of Leafless Elementary Trapping Sets (LETSs) in Random Irregular LDPC Code Ensembles. - Ali Dehghan 001; Amir H. Banihashemi (ISTC, 2018)

Computing the Asymptotic Expected Multiplicity of Elementary Trapping Sets (ETSs) in Random LDPC Code Ensembles. - Ali Dehghan 001; Amir H. Banihashemi (ISTC, 2018)

On Counting Short Cycles of LDPC Codes Using the Tanner Graph Spectrum. - Ali Dehghan 001; Amir H. Banihashemi (ISTC, 2018)

Not-All-Equal and 1-in-Degree Decompositions: Algorithmic Complexity and Applications. - Ali Dehghan 001; Mohammad-Reza (Rafsanjani) Sadeghi; Arash Ahadi (Algorithmica, 2018)

On the algorithmic complexity of decomposing graphs into regular/irregular structures. - Arash Ahadi; Ali Dehghan 001; Mohammad-Reza Sadeghi 001; Brett Stevens (CoRR, 2018)

On Computing the Multiplicity of Short Cycles in Bipartite Graphs Using the Degree Distribution and the Spectrum of the Graph. - Ali Dehghan 001; Amir H. Banihashemi (CoRR, 2018)

Sigma Partitioning: Complexity and Random Graphs. - Ali Dehghan 001; Mohammad-Reza Sadeghi 001; Arash Ahadi (Discret. Math. Theor. Comput. Sci., 2018)

On the Tanner Graph Cycle Distribution of Random LDPC, Random Protograph-Based LDPC, and Random Quasi-Cyclic LDPC Code Ensembles. - Ali Dehghan 001; Amir H. Banihashemi (IEEE Trans. Inf. Theory, 2018)

On the Computational Complexity of Finding Bipartite Graphs with a Small Number of Short Cycles and Large Girth. - Ali Dehghan 001; Amir H. Banihashemi (ITW, 2019)

From the Spectrum of the Adjacency Matrix to the Spectrum of Directed Edge Matrix: Counting Cycles of a Bipartite Graph Through a Simple Equation. - Ali Dehghan 001; Amir H. Banihashemi (ITW, 2019)

On the semi-proper orientations of graphs. - Ali Dehghan 001 (CoRR, 2019)

(2/2/3)-SAT problem and its applications in dominating set problems. - Arash Ahadi; Ali Dehghan 001 (Discret. Math. Theor. Comput. Sci., 2019)

Cospectral Bipartite Graphs with the Same Degree Sequences but with Different Number of Large Cycles. - Ali Dehghan 001; Amir H. Banihashemi (Graphs Comb., 2019)

Asymptotic Average Multiplicity of Structures Within Different Categories of Trapping Sets, Absorbing Sets, and Stopping Sets in Random Regular and Irregular LDPC Code Ensembles. - Ali Dehghan 001; Amir H. Banihashemi (IEEE Trans. Inf. Theory, 2019)

From Cages to Trapping Sets and Codewords: A Technique to Derive Tight Upper Bounds on the Minimum Size of Trapping Sets and Minimum Distance of LDPC Codes. - Ali Dehghan 001; Amir H. Banihashemi (IEEE Trans. Inf. Theory, 2019)

On Computing the Multiplicity of Cycles in Bipartite Graphs Using the Degree Distribution and the Spectrum of the Graph. - Ali Dehghan 001; Amir H. Banihashemi (IEEE Trans. Inf. Theory, 2019)

Hardness Results on Finding Leafless Elementary Trapping Sets and Elementary Absorbing Sets of LDPC Codes. - Ali Dehghan 001; Amir H. Banihashemi (IEEE Trans. Inf. Theory, 2019)

Design and implementation of a ring oscillator-based physically unclonable function on field programmable gate array to enhance electronic security. - Massoud Masoumi; Ali Dehghan 001 (Int. J. Electron. Secur. Digit. Forensics, 2020)

Counting Short Cycles in Bipartite Graphs: A Fast Technique/Algorithm and a Hardness Result. - Ali Dehghan 001; Amir H. Banihashemi (IEEE Trans. Commun., 2020)

On Finding Bipartite Graphs With a Small Number of Short Cycles and Large Girth. - Ali Dehghan 001; Amir H. Banihashemi (IEEE Trans. Inf. Theory, 2020)

On Computing the Number of Short Cycles in Bipartite Graphs Using the Spectrum of the Directed Edge Matrix. - Ali Dehghan 001; Amir H. Banihashemi (IEEE Trans. Inf. Theory, 2020)

On the in-out-proper orientations of graphs. - Ali Dehghan 001 (Discret. Appl. Math., 2021)

On the semi-proper orientations of graphs. - Ali Dehghan 001; Frédéric Havet (Discret. Appl. Math., 2021)

On Average Number of Cycles in Finite-Length Spatially Coupled LDPC Codes. - Sima Naseri; Ali Dehghan 001; Amir H. Banihashemi (ISIT, 2022)

On the Maximum Number of Non-attacking Rooks on a High-Dimensional Simplicial Chessboard. - Arash Ahadi; Mohsen Mollahajiaghaei; Ali Dehghan 001 (Graphs Comb., 2022)

On the Proper Arc Labeling of Directed Graphs. - Ali Dehghan 001; Arash Ahadi (Graphs Comb., 2022)