default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAli Dehghan 0001
Person information
- affiliation: Carleton University, Canada
- affiliation: Amirkabir University of Technology, Iran
Other persons with the same name
- Ali Dehghan 0002 — California Lutheran University, Thousand Oaks, CA, USA
- Ali Dehghan 0003 — University of Victoria, BC, Canada
- Ali Dehghan 0004 — University of La Verne, College of Business and Public Health, CA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2022
[j31]Ali Dehghan
, Arash Ahadi:
On the Proper Arc Labeling of Directed Graphs. Graphs Comb. 38(1): 1 (2022)- [j30]Arash Ahadi, Mohsen Mollahajiaghaei, Ali Dehghan:
On the Maximum Number of Non-attacking Rooks on a High-Dimensional Simplicial Chessboard. Graphs Comb. 38(3): 52 (2022) - 2021
- [j29]Ali Dehghan, Frédéric Havet:
On the semi-proper orientations of graphs. Discret. Appl. Math. 296: 9-25 (2021) - [j28]Ali Dehghan:
On the in-out-proper orientations of graphs. Discret. Appl. Math. 302: 129-138 (2021) - 2020
- [j27]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): 243-261 (2020) - [j26]Ali Dehghan, Amir H. Banihashemi:
Counting Short Cycles in Bipartite Graphs: A Fast Technique/Algorithm and a Hardness Result. IEEE Trans. Commun. 68(3): 1378-1390 (2020) - [j25]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): 6024-6036 (2020) - [j24]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): 6037-6047 (2020) - 2019
- [j23]Arash Ahadi, Ali Dehghan:
(2/2/3)-SAT problem and its applications in dominating set problems. Discret. Math. Theor. Comput. Sci. 21(4) (2019) - [j22]Ali Dehghan, Amir H. Banihashemi:
Cospectral Bipartite Graphs with the Same Degree Sequences but with Different Number of Large Cycles. Graphs Comb. 35(6): 1673-1693 (2019) - [j21]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): 2062-2074 (2019) - [j20]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): 3778-3789 (2019) - [j19]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): 4307-4315 (2019) - [j18]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): 6022-6043 (2019) - 2018
- [j17]Ali Dehghan, Mohammad-Reza (Rafsanjani) Sadeghi, Arash Ahadi:
Not-All-Equal and 1-in-Degree Decompositions: Algorithmic Complexity and Applications. Algorithmica 80(12): 3704-3727 (2018) - [j16]Ali Dehghan, Mohammad-Reza Sadeghi, Arash Ahadi:
Sigma Partitioning: Complexity and Random Graphs. Discret. Math. Theor. Comput. Sci. 20(2) (2018) - [j15]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): 4438-4451 (2018) - 2017
- [j14]Ali Dehghan, Mohsen Molla Haji Aghaei:
On the algorithmic complexity of adjacent vertex closed distinguishing colorings number of graphs. Discret. Appl. Math. 218: 82-97 (2017) - [j13]Ali Dehghan, Mohammad-Reza Sadeghi:
Colorful edge decomposition of graphs: Some polynomial cases. Discret. Appl. Math. 231: 155-165 (2017) - [j12]Arash Ahadi, Ali Dehghan, Morteza Saghafian:
Is there any polynomial upper bound for the universal labeling of graphs? J. Comb. Optim. 34(3): 760-770 (2017) - [j11]Arash Ahadi, Ali Dehghan, Mohsen Mollahajiaghaei:
Algorithmic complexity of weakly semiregular partitioning and the representation number. Theor. Comput. Sci. 674: 60-72 (2017) - 2016
- [j10]Arash Ahadi, Ali Dehghan:
The inapproximability for the (0, 1)-additive number. Discret. Math. Theor. Comput. Sci. 17(3): 217-226 (2016) - [j9]Ali Dehghan, Mohammad-Reza Sadeghi:
On the algorithmic complexity of zero-sum edge-coloring. Inf. Process. Lett. 116(11): 660-667 (2016) - [j8]Ali Dehghan:
On strongly planar not-all-equal 3SAT. J. Comb. Optim. 32(3): 721-724 (2016) - 2015
- [j7]Ali Dehghan, Mohammad-Reza Sadeghi, Arash Ahadi:
On the Complexity of Deciding Whether the Regular Number is at Most Two. Graphs Comb. 31(5): 1359-1365 (2015) - [j6]Ali Dehghan, Mohammad-Reza Sadeghi:
The complexity of the zero-sum 3-flows. Inf. Process. Lett. 115(2): 316-320 (2015) - 2013
- [j5]Arash Ahadi, Ali Dehghan:
The complexity of the proper orientation number. Inf. Process. Lett. 113(19-21): 799-803 (2013) - [j4]Ali Dehghan, Mohammad-Reza Sadeghi, Arash Ahadi:
Algorithmic complexity of proper labeling problems. Theor. Comput. Sci. 495: 25-36 (2013) - 2012
- [j3]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): 2142-2146 (2012) - [j2]Arash Ahadi, Saieed Akbari, Ali Dehghan, Maryam Ghanbari:
On the difference between chromatic number and dynamic chromatic number of graphs. Discret. Math. 312(17): 2579-2583 (2012) - [j1]Arash Ahadi, Ali Dehghan, Mohammad Reza Kazemi, E. Mollaahmadi:
Computation of lucky number of planar graphs is NP-hard. Inf. Process. Lett. 112(4): 109-112 (2012)
Conference and Workshop Papers
- 2022
- [c10]Sima Naseri, Ali Dehghan, Amir H. Banihashemi:
On Average Number of Cycles in Finite-Length Spatially Coupled LDPC Codes. ISIT 2022: 378-383 - 2019
- [c9]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: 1-5 - [c8]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: 1-5 - 2018
- [c7]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: 1640-1644 - [c6]Ali Dehghan, Amir H. Banihashemi:
Finding Leafless Elementary Trapping Sets and Elementary Absorbing Sets of LDPC Codes is Hard. ISIT 2018: 1645-1649 - [c5]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: 1650-1654 - [c4]Ali Dehghan, Amir H. Banihashemi:
Computing the Asymptotic Expected Multiplicity of Leafless Elementary Trapping Sets (LETSs) in Random Irregular LDPC Code Ensembles. ISTC 2018: 1-5 - [c3]Ali Dehghan, Amir H. Banihashemi:
Computing the Asymptotic Expected Multiplicity of Elementary Trapping Sets (ETSs) in Random LDPC Code Ensembles. ISTC 2018: 1-5 - [c2]Ali Dehghan, Amir H. Banihashemi:
On Counting Short Cycles of LDPC Codes Using the Tanner Graph Spectrum. ISTC 2018: 1-5 - 2013
- [c1]Hamed Momeni, Massoud Masoumi, Ali Dehghan:
A practical fault induction attack against an FPGA implementation of AES cryptosystem. WorldCIS 2013: 134-138
Informal and Other Publications
- 2021
- [i20]Arash Ahadi, Mohsen Mollahajiaghaei, Ali Dehghan:
On the maximum number of non attacking rooks on a high-dimensional simplicial chessboard. CoRR abs/2102.00535 (2021) - 2019
- [i19]Ali Dehghan, Amir H. Banihashemi:
On Computing the Number of Short Cycles in Bipartite Graphs Using the Spectrum of the Directed Edge Matrix. CoRR abs/1903.08332 (2019) - [i18]Ali Dehghan:
On the semi-proper orientations of graphs. CoRR abs/1905.02867 (2019) - [i17]Ali Dehghan, Amir H. Banihashemi:
Cospectral Bipartite Graphs with the Same Degree Sequences but with Different Number of Large Cycles. CoRR abs/1905.13228 (2019) - 2018
- [i16]Ali Dehghan, Mohammad-Reza Sadeghi, Arash Ahadi:
Not-All-Equal and 1-in-Degree Decompositions: Algorithmic Complexity and Applications. CoRR abs/1801.04472 (2018) - [i15]Arash Ahadi, Ali Dehghan, Mohammad-Reza Sadeghi, Brett Stevens:
On the algorithmic complexity of decomposing graphs into regular/irregular structures. CoRR abs/1801.08876 (2018) - [i14]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 abs/1806.01433 (2018) - 2017
- [i13]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 abs/1701.02379 (2017) - [i12]Arash Ahadi, Ali Dehghan, Mohsen Mollahajiaghaei:
Algorithmic Complexity of Weakly Semiregular Partitioning and the Representation Number. CoRR abs/1701.05934 (2017) - [i11]Ali Dehghan, Mohammad-Reza Sadeghi, Arash Ahadi:
Algorithmic complexity of proper labeling problems. CoRR abs/1701.06669 (2017) - [i10]Arash Ahadi, Ali Dehghan, Morteza Saghafian:
Is there any polynomial upper bound for the universal labeling of graphs? CoRR abs/1701.06685 (2017) - [i9]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 abs/1705.06798 (2017) - [i8]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 abs/1711.10539 (2017) - [i7]Ali Dehghan, Amir H. Banihashemi:
Hardness Results on Finding Leafless Elementary Trapping Sets and Elementary Absorbing Sets of LDPC Codes. CoRR abs/1711.10543 (2017) - 2016
- [i6]Arash Ahadi, Ali Dehghan:
(2/2/3)-SAT problem and its applications in dominating set problems. CoRR abs/1605.01319 (2016) - 2014
- [i5]Ali Dehghan, Mohammad-Reza Sadeghi, Arash Ahadi:
On the complexity of deciding whether the regular number is at most two. CoRR abs/1403.1182 (2014) - [i4]Ali Dehghan, Mohammad-Reza Sadeghi, Arash Ahadi:
The Complexity of the Sigma Chromatic Number of Cubic Graphs. CoRR abs/1403.6288 (2014) - 2013
- [i3]Arash Ahadi, Ali Dehghan:
The Complexity of the Proper Orientation Number. CoRR abs/1305.6432 (2013) - [i2]Arash Ahadi, Ali Dehghan:
The Inapproximability for the (0, 1)-additive number. CoRR abs/1306.0182 (2013) - 2009
- [i1]Arash Ahadi, Ali Dehghan:
Upper bounds for the 2-hued chromatic number of graphs in terms of the independence number. CoRR abs/0911.4199 (2009)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:45 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
