Ali Dehghan

Identifiers

• name variant Ali Dehghan 0.60 · backfill

Papers (21)

1. Humanity's Last Exam cs.LG · 2025 · author #171
2. Cospectral Bipartite Graphs with the Same Degree Sequences but with Different Number of Large Cycles cs.DM · 2019 · author #1
3. On the semi-proper orientations of graphs cs.DM · 2019 · author #1
4. On Computing the Number of Short Cycles in Bipartite Graphs Using the Spectrum of the Directed Edge Matrix cs.IT · 2019 · author #1
5. On Computing the Multiplicity of Cycles in Bipartite Graphs Using the Degree Distribution and the Spectrum of the Graph cs.DM · 2018 · author #1
6. On the algorithmic complexity of decomposing graphs into regular/irregular structures cs.DM · 2018 · author #2
7. Not-All-Equal and 1-in-Degree Decompositions: Algorithmic Complexity and Applications cs.DM · 2018 · author #1
8. Hardness Results on Finding Leafless Elementary Trapping Sets and Elementary Absorbing Sets of LDPC Codes cs.IT · 2017 · author #1
9. 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 cs.IT · 2017 · author #1
10. Asymptotic Average Multiplicity of Structures within Different Categories of Trapping Sets, Absorbing Sets and Stopping Sets in Random Regular and Irregular LDPC Code Ensembles cs.IT · 2017 · author #1
11. Is there any polynomial upper bound for the universal labeling of graphs? math.CO · 2017 · author #2
12. Algorithmic complexity of proper labeling problems cs.DM · 2017 · author #1
13. Algorithmic Complexity of Weakly Semiregular Partitioning and the Representation Number math.CO · 2017 · author #2
14. On the Tanner Graph Cycle Distribution of Random LDPC, Random Protograph-Based LDPC, and Random Quasi-Cyclic LDPC Code Ensembles cs.IT · 2017 · author #1
15. On the algorithmic complexity of adjacent vertex closed distinguishing colorings number of graphs math.CO · 2016 · author #1
16. On the complexity of deciding whether the regular number is at most two math.CO · 2014 · author #1
17. The inapproximability for the (0,1)-additive number math.CO · 2013 · author #2
18. The Complexity of the Proper Orientation Number cs.CC · 2013 · author #2
19. On the Lucky labeling of Graphs math.CO · 2010 · author #2
20. On Rainbow Connection of Strongly Regular Graphs math.CO · 2010 · author #2
21. Upper bounds for the 2-hued chromatic number of graphs in terms of the independence number math.CO · 2009 · author #2

Mentions

• 1403.1182 #1 · backfill · confidence 0.70 Ali Dehghan
• 1306.0182 #2 · backfill · confidence 0.70 Ali Dehghan
• 1305.6432 #2 · backfill · confidence 0.70 Ali Dehghan
• 1007.2480 #2 · backfill · confidence 0.70 Ali Dehghan
• 1001.3413 #2 · backfill · confidence 0.70 Ali Dehghan
• 0911.4199 #2 · backfill · confidence 0.70 Ali Dehghan

Frequent Coauthors

• Arash Ahadi 11 shared papers
• Amir H. Banihashemi 7 shared papers
• Mohammad-Reza Sadeghi 4 shared papers
• Mohsen Mollahajiaghaei 2 shared papers
• Aakaash Nattanmai 1 shared papers
• Aaron Kirtland 1 shared papers
• Aarush Sinha 1 shared papers
• Abdallah Galal 1 shared papers
• Abdelkader Dendane 1 shared papers
• Abdurrahim Yilmaz 1 shared papers
• Abhijeet Saha 1 shared papers
• Abhishek Shukla 1 shared papers
• Abram Jackson 1 shared papers
• Adam Bouyamourn 1 shared papers
• Adam Jones 1 shared papers
• Adam Khoja 1 shared papers
• Adam Wecker 1 shared papers
• Adam Zweiger 1 shared papers
• Adithya Shenoy 1 shared papers
• Aditya Malusare 1 shared papers