Ali Dehghan
Tytuł
Cytowane przez
Cytowane przez
Rok
Algorithmic complexity of proper labeling problems
A Dehghan, MR Sadeghi, A Ahadi
Theoretical Computer Science 495, 25-36, 2013
502013
On the Tanner graph cycle distribution of random LDPC, random protograph-based LDPC, and random quasi-cyclic LDPC code ensembles
A Dehghan, AH Banihashemi
IEEE Transactions on Information Theory 64 (6), 4438-4451, 2018
402018
Computation of lucky number of planar graphs is NP-hard
A Ahadi, A Dehghan, M Kazemi, E Mollaahmadi
Information processing letters 112 (4), 109-112, 2012
352012
On the difference between chromatic number and dynamic chromatic number of graphs
A Ahadi, S Akbari, A Dehghan, M Ghanbari
Discrete mathematics 312 (17), 2579-2583, 2012
322012
The Complexity of the Proper Orientation Number
AD Arash Ahadi
Information Processing Letters 113, 799-803, 2013
202013
Upper bounds for the 2-hued chromatic number of graphs in terms of the independence number
A Dehghan, A Ahadi
Discrete Applied Mathematics 160 (15), 2142-2146, 2012
202012
On strongly planar not-all-equal 3SAT
A Dehghan
Journal of Combinatorial Optimization 32 (3), 721-724, 2016
142016
On computing the multiplicity of cycles in bipartite graphs using the degree distribution and the spectrum of the graph
A Dehghan, AH Banihashemi
IEEE Transactions on Information Theory 65 (6), 3778-3789, 2019
122019
On the complexity of deciding whether the regular number is at most two
A Dehghan, MR Sadeghi, A Ahadi
Graphs and Combinatorics 31 (5), 1359-1365, 2014
122014
Is there any polynomial upper bound for the universal labeling of graphs?
A Ahadi, A Dehghan, M Saghafian
Journal of Combinatorial Optimization 34 (3), 760-770, 2017
92017
The inapproximability for the (0, 1)-additive number
A Ahadi, A Dehghan
Discrete Mathematics & Theoretical Computer Science 17 (3), 217-226, 2016
92016
The complexity of the sigma chromatic number of cubic graphs
A Dehghan, MR Sadeghi, A Ahadi
arXiv preprint arXiv:1403.6288, 2014
9*2014
On the semi-proper orientations of graphs
A Dehghan, F Havet
Discrete Applied Mathematics 296, 9-25, 2021
72021
Hardness results on finding leafless elementary trapping sets and elementary absorbing sets of LDPC codes
A Dehghan, AH Banihashemi
IEEE Transactions on Information Theory 65 (7), 4307-4315, 2019
62019
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
A Dehghan, AH Banihashemi
IEEE Transactions on Information Theory 65 (4), 2062-2074, 2018
62018
On the algorithmic complexity of adjacent vertex closed distinguishing colorings number of graphs
A Dehghan, M Mollahajiaghaei
Discrete Applied Mathematics 218, 82-97, 2017
62017
On rainbow connection of strongly regular graphs
A Ahadi, A Dehghan
arXiv preprint arXiv:1001.3413, 2010
62010
Service quality gaps and six sigma with a case study on CCG (customer centric group)
A Shahin, A Dehghan, A Albadvi
Proc Sec Intl Conf Six Sigma Glasgow, 50-64, 2006
52006
On computing the number of short cycles in bipartite graphs using the spectrum of the directed edge matrix
A Dehghan, AH Banihashemi
IEEE Transactions on Information Theory 66 (10), 6037-6047, 2020
32020
Asymptotic average multiplicity of structures within different categories of trapping sets, absorbing sets, and stopping sets in random regular and irregular LDPC code ensembles
A Dehghan, AH Banihashemi
IEEE Transactions on Information Theory 65 (10), 6022-6043, 2019
32019
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20