Ali Dehghan

Publication Activity (10 Years)

Years Active: 2009-2022
Publications (10 Years): 48

Top Topics

Minimum Distance

Bipartite Graph

Top Venues

IEEE Trans. Inf. Theory

Discret. Appl. Math.

Publications

Arash Ahadi, Mohsen Mollahajiaghaei, Ali Dehghan
On the Maximum Number of Non-attacking Rooks on a High-Dimensional Simplicial Chessboard. Graphs Comb. 38 (3) (2022)
Sima Naseri, Ali Dehghan, Amir H. Banihashemi
On Average Number of Cycles in Finite-Length Spatially Coupled LDPC Codes. ISIT (2022)
Ali Dehghan, Arash Ahadi
On the Proper Arc Labeling of Directed Graphs. Graphs Comb. 38 (1) (2022)
Ali Dehghan, Frédéric Havet
On the semi-proper orientations of graphs. Discret. Appl. Math. 296 (2021)
Arash Ahadi, Mohsen Mollahajiaghaei, Ali Dehghan
On the maximum number of non attacking rooks on a high-dimensional simplicial chessboard. CoRR (2021)
Ali Dehghan
On the in-out-proper orientations of graphs. Discret. Appl. Math. 302 (2021)
Ali Dehghan, Amir H. Banihashemi
On Finding Bipartite Graphs With a Small Number of Short Cycles and Large Girth. IEEE Trans. Inf. Theory 66 (10) (2020)
Ali Dehghan, Amir H. Banihashemi
On Computing the Number of Short Cycles in Bipartite Graphs Using the Spectrum of the Directed Edge Matrix. IEEE Trans. Inf. Theory 66 (10) (2020)
Massoud Masoumi, Ali Dehghan
Design and implementation of a ring oscillator-based physically unclonable function on field programmable gate array to enhance electronic security. Int. J. Electron. Secur. Digit. Forensics 12 (3) (2020)
Ali Dehghan, Amir H. Banihashemi
Counting Short Cycles in Bipartite Graphs: A Fast Technique/Algorithm and a Hardness Result. IEEE Trans. Commun. 68 (3) (2020)
Arash Ahadi, Ali Dehghan
(2/2/3)-SAT problem and its applications in dominating set problems. Discret. Math. Theor. Comput. Sci. 21 (4) (2019)
Ali Dehghan, Amir H. Banihashemi
From the Spectrum of the Adjacency Matrix to the Spectrum of Directed Edge Matrix: Counting Cycles of a Bipartite Graph Through a Simple Equation. ITW (2019)
Ali Dehghan, Amir H. Banihashemi
Cospectral Bipartite Graphs with the Same Degree Sequences but with Different Number of Large Cycles. Graphs Comb. 35 (6) (2019)
Ali Dehghan, Amir H. Banihashemi
On Computing the Multiplicity of Cycles in Bipartite Graphs Using the Degree Distribution and the Spectrum of the Graph. IEEE Trans. Inf. Theory 65 (6) (2019)
Ali Dehghan, Amir H. Banihashemi
On Computing the Number of Short Cycles in Bipartite Graphs Using the Spectrum of the Directed Edge Matrix. CoRR (2019)
Ali Dehghan, Amir H. Banihashemi
On the Computational Complexity of Finding Bipartite Graphs with a Small Number of Short Cycles and Large Girth. ITW (2019)
Ali Dehghan, Amir H. Banihashemi
Cospectral Bipartite Graphs with the Same Degree Sequences but with Different Number of Large Cycles. CoRR (2019)
Ali Dehghan, Amir H. Banihashemi
Asymptotic Average Multiplicity of Structures Within Different Categories of Trapping Sets, Absorbing Sets, and Stopping Sets in Random Regular and Irregular LDPC Code Ensembles. IEEE Trans. Inf. Theory 65 (10) (2019)
Ali Dehghan
On the semi-proper orientations of graphs. CoRR (2019)
Ali Dehghan, Amir H. Banihashemi
Hardness Results on Finding Leafless Elementary Trapping Sets and Elementary Absorbing Sets of LDPC Codes. IEEE Trans. Inf. Theory 65 (7) (2019)
Ali Dehghan, Amir H. Banihashemi
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. IEEE Trans. Inf. Theory 65 (4) (2019)
Ali Dehghan, Amir H. Banihashemi
Computing the Asymptotic Expected Multiplicity of Leafless Elementary Trapping Sets (LETSs) in Random Irregular LDPC Code Ensembles. ISTC (2018)
Ali Dehghan, Amir H. Banihashemi
On the Tanner Graph Cycle Distribution of Random LDPC, Random Protograph-Based LDPC, and Random Quasi-Cyclic LDPC Code Ensembles. IEEE Trans. Inf. Theory 64 (6) (2018)
Ali Dehghan, Amir H. Banihashemi
Finding Leafless Elementary Trapping Sets and Elementary Absorbing Sets of LDPC Codes is Hard. ISIT (2018)
Ali Dehghan, Amir H. Banihashemi
On Counting Short Cycles of LDPC Codes Using the Tanner Graph Spectrum. ISTC (2018)
Arash Ahadi, Ali Dehghan, Mohammad-Reza Sadeghi, Brett Stevens
On the algorithmic complexity of decomposing graphs into regular/irregular structures. CoRR (2018)
Ali Dehghan, Amir H. Banihashemi
Asymptotic Average Number of Different Categories of Trapping Sets, Absorbing Sets and Stopping Sets in Random LDPC Code Ensembles. ISIT (2018)
Ali Dehghan, Amir H. Banihashemi
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. ISIT (2018)
Ali Dehghan, Amir H. Banihashemi
On Computing the Multiplicity of Short Cycles in Bipartite Graphs Using the Degree Distribution and the Spectrum of the Graph. CoRR (2018)
Ali Dehghan, Mohammad-Reza Sadeghi, Arash Ahadi
Sigma Partitioning: Complexity and Random Graphs. Discret. Math. Theor. Comput. Sci. 20 (2) (2018)
Ali Dehghan, Mohammad-Reza Sadeghi, Arash Ahadi
Not-All-Equal and 1-in-Degree Decompositions: Algorithmic Complexity and Applications. CoRR (2018)
Ali Dehghan, Amir H. Banihashemi
Computing the Asymptotic Expected Multiplicity of Elementary Trapping Sets (ETSs) in Random LDPC Code Ensembles. ISTC (2018)
Ali Dehghan, Mohammad-Reza (Rafsanjani) Sadeghi, Arash Ahadi
Not-All-Equal and 1-in-Degree Decompositions: Algorithmic Complexity and Applications. Algorithmica 80 (12) (2018)
Arash Ahadi, Ali Dehghan, Morteza Saghafian
Is there any polynomial upper bound for the universal labeling of graphs? CoRR (2017)
Ali Dehghan, Amir H. Banihashemi
Hardness Results on Finding Leafless Elementary Trapping Sets and Elementary Absorbing Sets of LDPC Codes. CoRR (2017)
Arash Ahadi, Ali Dehghan, Mohsen Mollahajiaghaei
Algorithmic Complexity of Weakly Semiregular Partitioning and the Representation Number. CoRR (2017)
Ali Dehghan, Amir H. Banihashemi
On the Tanner Graph Cycle Distribution of Random LDPC, Random Protograph-Based LDPC, and Random Quasi-Cyclic LDPC Code Ensembles. CoRR (2017)
Ali Dehghan, Amir H. Banihashemi
Asymptotic Average Number of Different Categories of Trapping Sets, Absorbing Sets and Stopping Sets in Random Regular and Irregular LDPC Code Ensembles. CoRR (2017)
Arash Ahadi, Ali Dehghan, Morteza Saghafian
Is there any polynomial upper bound for the universal labeling of graphs? J. Comb. Optim. 34 (3) (2017)
Ali Dehghan, Amir H. Banihashemi
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. CoRR (2017)
Ali Dehghan, Mohammad-Reza Sadeghi
Colorful edge decomposition of graphs: Some polynomial cases. Discret. Appl. Math. 231 (2017)
Arash Ahadi, Ali Dehghan, Mohsen Mollahajiaghaei
Algorithmic complexity of weakly semiregular partitioning and the representation number. Theor. Comput. Sci. 674 (2017)
Ali Dehghan, Mohammad-Reza Sadeghi, Arash Ahadi
Algorithmic complexity of proper labeling problems. CoRR (2017)
Ali Dehghan, Mohsen Molla Haji Aghaei
On the algorithmic complexity of adjacent vertex closed distinguishing colorings number of graphs. Discret. Appl. Math. 218 (2017)
Arash Ahadi, Ali Dehghan
The inapproximability for the (0, 1)-additive number. Discret. Math. Theor. Comput. Sci. 17 (3) (2016)
Ali Dehghan
On strongly planar not-all-equal 3SAT. J. Comb. Optim. 32 (3) (2016)
Ali Dehghan, Mohammad-Reza Sadeghi
On the algorithmic complexity of zero-sum edge-coloring. Inf. Process. Lett. 116 (11) (2016)
Arash Ahadi, Ali Dehghan
(2/2/3)-SAT problem and its applications in dominating set problems. CoRR (2016)
Ali Dehghan, Mohammad-Reza Sadeghi, Arash Ahadi
On the Complexity of Deciding Whether the Regular Number is at Most Two. Graphs Comb. 31 (5) (2015)
Ali Dehghan, Mohammad-Reza Sadeghi
The complexity of the zero-sum 3-flows. Inf. Process. Lett. 115 (2) (2015)
Ali Dehghan, Mohammad-Reza Sadeghi, Arash Ahadi
On the complexity of deciding whether the regular number is at most two. CoRR (2014)
Ali Dehghan, Mohammad-Reza Sadeghi, Arash Ahadi
The Complexity of the Sigma Chromatic Number of Cubic Graphs. CoRR (2014)
Arash Ahadi, Ali Dehghan
The Complexity of the Proper Orientation Number CoRR (2013)
Arash Ahadi, Ali Dehghan
The complexity of the proper orientation number. Inf. Process. Lett. 113 (19-21) (2013)
Ali Dehghan, Mohammad-Reza Sadeghi, Arash Ahadi
Algorithmic complexity of proper labeling problems. Theor. Comput. Sci. 495 (2013)
Hamed Momeni, Massoud Masoumi, Ali Dehghan
A practical fault induction attack against an FPGA implementation of AES cryptosystem. WorldCIS (2013)
Arash Ahadi, Ali Dehghan
The Inapproximability for the (0, 1)-additive number. CoRR (2013)
Ali Dehghan, Arash Ahadi
Upper bounds for the 2-hued chromatic number of graphs in terms of the independence number. Discret. Appl. Math. 160 (15) (2012)
Arash Ahadi, Ali Dehghan, Mohammad Reza Kazemi, E. Mollaahmadi
Computation of lucky number of planar graphs is NP-hard. Inf. Process. Lett. 112 (4) (2012)
Arash Ahadi, Saieed Akbari, Ali Dehghan, Maryam Ghanbari
On the difference between chromatic number and dynamic chromatic number of graphs. Discret. Math. 312 (17) (2012)
Arash Ahadi, Ali Dehghan
Upper bounds for the 2-hued chromatic number of graphs in terms of the independence number. CoRR (2009)