Ali Dehghan

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