Ali Dehghan

发表

On the algorithmic complexity of adjacent vertex closed distinguishing colorings number of graphs

Ali Dehghan, Mohsen Molla Haji Aghaei, Ali Dehghan, 2016, Discret. Appl. Math..

The complexity of the zero-sum 3-flows

Mohammad-Reza Sadeghi, Ali Dehghan, 2015, Inf. Process. Lett..

On the algorithmic complexity of decomposing graphs into regular/irregular structures pdf

Brett Stevens, Mohammad-Reza Sadeghi, Ali Dehghan, 2018, ArXiv.

On the difference between chromatic number and dynamic chromatic number of graphs

Saieed Akbari, Maryam Ghanbari, Ali Dehghan, 2012, Discret. Math..

The inapproximability for the (0, 1)-additive number

Ali Dehghan, Arash Ahadi, A. Ahadi, 2013, Discret. Math. Theor. Comput. Sci..

Computing the Asymptotic Expected Multiplicity of Elementary Trapping Sets (ETSs) in Random LDPC Code Ensembles

Amir H. Banihashemi, Ali Dehghan, 2018, 2018 IEEE 10th International Symposium on Turbo Codes & Iterative Information Processing (ISTC).

On Computing the Number of Short Cycles in Bipartite Graphs Using the Spectrum of the Directed Edge Matrix

Amir H. Banihashemi, Ali Dehghan, A. Banihashemi, 2019, IEEE Transactions on Information Theory.

Asymptotic Average Number of Different Categories of Trapping Sets, Absorbing Sets and Stopping Sets in Random LDPC Code Ensembles

Amir H. Banihashemi, Ali Dehghan, 2018, 2018 IEEE International Symposium on Information Theory (ISIT).

Algorithmic complexity of proper labeling problems

Mohammad-Reza Sadeghi, Ali Dehghan, Arash Ahadi, 2013, Theor. Comput. Sci..

Sigma Partitioning: Complexity and Random Graphs

Mohammad-Reza Sadeghi, Ali Dehghan, Arash Ahadi, 2014, Discret. Math. Theor. Comput. Sci..

On Finding Bipartite Graphs With a Small Number of Short Cycles and Large Girth

Amir H. Banihashemi, Ali Dehghan, A. Banihashemi, 2020, IEEE Transactions on Information Theory.

On Computing the Multiplicity of Cycles in Bipartite Graphs Using the Degree Distribution and the Spectrum of the Graph

Amir H. Banihashemi, Ali Dehghan, A. Banihashemi, 2018, IEEE Transactions on Information Theory.

Finding Leafless Elementary Trapping Sets and Elementary Absorbing Sets of LDPC Codes is Hard

Amir H. Banihashemi, Ali Dehghan, 2018, 2018 IEEE International Symposium on Information Theory (ISIT).

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

Amir H. Banihashemi, Ali Dehghan, 2018, 2018 IEEE International Symposium on Information Theory (ISIT).

The Complexity of the Sigma Chromatic Number of Cubic Graphs pdf

Mohammad-Reza Sadeghi, Ali Dehghan, Arash Ahadi, 2014, ArXiv.

A practical fault induction attack against an FPGA implementation of AES cryptosystem

Ali Dehghan, Massoud Masoumi, Hamed Momeni, 2013, World Congress on Internet Security (WorldCIS-2013).

Upper bounds for the 2-hued chromatic number of graphs in terms of the independence number pdf

Ali Dehghan, Arash Ahadi, A. Ahadi, 2009, Discret. Appl. Math..

Algorithmic complexity of weakly semiregular partitioning and the representation number

Ali Dehghan, Arash Ahadi, Mohsen Mollahajiaghaei, 2017, Theor. Comput. Sci..

Asymptotic Average Multiplicity of Structures Within Different Categories of Trapping Sets, Absorbing Sets, and Stopping Sets in Random Regular and Irregular LDPC Code Ensembles

Amir H. Banihashemi, Ali Dehghan, 2019, IEEE Transactions on Information Theory.

Is there any polynomial upper bound for the universal labeling of graphs?

Ali Dehghan, Arash Ahadi, Morteza Saghafian, 2016, Journal of Combinatorial Optimization.

The complexity of the proper orientation number pdf

Ali Dehghan, Arash Ahadi, A. Ahadi, 2013, Inf. Process. Lett..

(2/2/3)-SAT problem and its applications in dominating set problems

Ali Dehghan, Arash Ahadi, A. Ahadi, 2016, Discret. Math. Theor. Comput. Sci..

Not-All-Equal and 1-in-Degree Decompositions: Algorithmic Complexity and Applications

Mohammad-Reza Sadeghi, Ali Dehghan, Arash Ahadi, 2018, Algorithmica.

On the Complexity of Deciding Whether the Regular Number is at Most Two

Mohammad-Reza Sadeghi, Ali Dehghan, Arash Ahadi, 2014, Graphs and Combinatorics.

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

Amir H. Banihashemi, Ali Dehghan, A. Banihashemi, 2017, IEEE Transactions on Information Theory.

Computing the Asymptotic Expected Multiplicity of Leafless Elementary Trapping Sets (LETSs) in Random Irregular LDPC Code Ensembles

Amir H. Banihashemi, Ali Dehghan, 2018, 2018 IEEE 10th International Symposium on Turbo Codes & Iterative Information Processing (ISTC).

Design and implementation of a ring oscillator-based physically unclonable function on field programmable gate array to enhance electronic security

Ali Dehghan, Massoud Masoumi, 2020, Int. J. Electron. Secur. Digit. Forensics.

Cospectral Bipartite Graphs with the Same Degree Sequences but with Different Number of Large Cycles

Amir H. Banihashemi, Ali Dehghan, A. Banihashemi, 2019, Graphs and Combinatorics.

Asymptotic Average Number of Different Categories of Trapping Sets, Absorbing Sets and Stopping Sets in Random Regular and Irregular LDPC Code Ensembles pdf

Amir H. Banihashemi, Ali Dehghan, 2017, ArXiv.

On Counting Short Cycles of LDPC Codes Using the Tanner Graph Spectrum

Amir H. Banihashemi, Ali Dehghan, 2018, 2018 IEEE 10th International Symposium on Turbo Codes & Iterative Information Processing (ISTC).

Colorful edge decomposition of graphs: Some polynomial cases

Mohammad-Reza Sadeghi, Ali Dehghan, Mohammad-Reza Sadeghi, 2017, Discret. Appl. Math..

Hardness Results on Finding Leafless Elementary Trapping Sets and Elementary Absorbing Sets of LDPC Codes

Amir H. Banihashemi, Ali Dehghan, 2019, IEEE Transactions on Information Theory.

On the Tanner Graph Cycle Distribution of Random LDPC, Random Protograph-Based LDPC, and Random Quasi-Cyclic LDPC Code Ensembles

Amir H. Banihashemi, Ali Dehghan, A. Banihashemi, 2017, IEEE Transactions on Information Theory.

On the algorithmic complexity of zero-sum edge-coloring

Mohammad-Reza Sadeghi, Ali Dehghan, Mohammad-Reza Sadeghi, 2016, Inf. Process. Lett..

On the semi-proper orientations of graphs pdf

Ali Dehghan, Ali Dehghan, 2019, Discret. Appl. Math..

On strongly planar not-all-equal 3SAT

Ali Dehghan, 2016, J. Comb. Optim..

On the Maximum Number of Non-attacking Rooks on a High-Dimensional Simplicial Chessboard pdf

Ali Dehghan, Arash Ahadi, Mohsen Mollahajiaghaei, 2021, Graphs and Combinatorics.

On the in-out-proper orientations of graphs

Ali Dehghan, Ali Dehghan, 2021, Discret. Appl. Math..

On the Proper Arc Labeling of Directed Graphs

Ali Dehghan, Arash Ahadi, A. Ahadi, 2021, Graphs and Combinatorics.

On Rainbow Connection of Strongly Regular Graphs

Ali Dehghan, Arash Ahadi, 2010 .

On the Lucky labeling of Graphs

Ali Dehghan, Arash Ahadi, Esmael Mollaahmadi, 2010 .