The following pages link to Ali Dehghan (Q326465):
Displaying 36 items.
- On strongly planar not-all-equal 3SAT (Q326466) (← links)
- Algorithmic complexity of proper labeling problems (Q391137) (← links)
- (Q442372) (redirect page) (← links)
- On the difference between chromatic number and dynamic chromatic number of graphs (Q442373) (← links)
- The complexity of the zero-sum 3-flows (Q477676) (← links)
- On the complexity of deciding whether the regular number is at most two (Q497328) (← links)
- Algorithmic complexity of weakly semiregular partitioning and the representation number (Q528476) (← links)
- Upper bounds for the 2-hued chromatic number of graphs in terms of the independence number (Q713309) (← links)
- On the algorithmic complexity of adjacent vertex closed distinguishing colorings number of graphs (Q730489) (← links)
- Is there any polynomial upper bound for the universal labeling of graphs? (Q1680487) (← links)
- Not-all-equal and 1-in-degree decompositions: algorithmic complexity and applications (Q1799219) (← links)
- On the in-out-proper orientations of graphs (Q2043367) (← links)
- On the proper arc labeling of directed graphs (Q2062885) (← links)
- On the maximum number of non-attacking rooks on a high-dimensional simplicial chessboard (Q2117514) (← links)
- Cospectral bipartite graphs with the same degree sequences but with different number of large cycles (Q2287757) (← links)
- Colorful edge decomposition of graphs: some polynomial cases (Q2403802) (← links)
- The complexity of the proper orientation number (Q2445254) (← links)
- On the algorithmic complexity of zero-sum edge-coloring (Q2630333) (← links)
- On the semi-proper orientations of graphs (Q2663989) (← links)
- The inapproximability for the (0,1)-additive number (Q2816507) (← links)
- (Q3598557) (← links)
- (Q3621384) (← links)
- Sigma Partitioning: Complexity and Random Graphs (Q4611774) (← links)
- On Finding Bipartite Graphs With a Small Number of Short Cycles and Large Girth (Q5138789) (← links)
- On Computing the Number of Short Cycles in Bipartite Graphs Using the Spectrum of the Directed Edge Matrix (Q5138790) (← links)
- (Q5207845) (← links)
- Asymptotic Average Multiplicity of Structures Within Different Categories of Trapping Sets, Absorbing Sets, and Stopping Sets in Random Regular and Irregular LDPC Code Ensembles (Q5211424) (← links)
- 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 (Q5223914) (← links)
- On Computing the Multiplicity of Cycles in Bipartite Graphs Using the Degree Distribution and the Spectrum of the Graph (Q5224033) (← links)
- Hardness Results on Finding Leafless Elementary Trapping Sets and Elementary Absorbing Sets of LDPC Codes (Q5224073) (← links)
- On the Tanner Graph Cycle Distribution of Random LDPC, Random Protograph-Based LDPC, and Random Quasi-Cyclic LDPC Code Ensembles (Q5375587) (← links)
- Trailing-edge flow manipulation using streamwise finlets (Q5379085) (← links)
- (Q5407377) (← links)
- On Rainbow Connection of Strongly Regular Graphs (Q6217238) (← links)
- On the Lucky labeling of Graphs (Q6219737) (← links)
- On the algorithmic complexity of decomposing graphs into regular/irregular structures (Q6296967) (← links)