Ali Dehghan

Available identifiers

zbMath Open dehghan.ali-aMaRDI QIDQ326465

List of research outcomes

Publication	Date of Publication	Type
On the maximum number of non-attacking rooks on a high-dimensional simplicial chessboard	2022-03-21	Paper
On the proper arc labeling of directed graphs	2022-01-03	Paper
On the in-out-proper orientations of graphs	2021-08-02	Paper
On the semi-proper orientations of graphs	2021-04-20	Paper
On Finding Bipartite Graphs With a Small Number of Short Cycles and Large Girth	2020-12-04	Paper
On Computing the Number of Short Cycles in Bipartite Graphs Using the Spectrum of the Directed Edge Matrix	2020-12-04	Paper
Asymptotic Average Multiplicity of Structures Within Different Categories of Trapping Sets, Absorbing Sets, and Stopping Sets in Random Regular and Irregular LDPC Code Ensembles	2020-01-28	Paper
Cospectral bipartite graphs with the same degree sequences but with different number of large cycles	2020-01-21	Paper
https://portal.mardi4nfdi.de/entity/Q5207845	2020-01-13	Paper
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	2019-07-19	Paper
On Computing the Multiplicity of Cycles in Bipartite Graphs Using the Degree Distribution and the Spectrum of the Graph	2019-07-19	Paper
Hardness Results on Finding Leafless Elementary Trapping Sets and Elementary Absorbing Sets of LDPC Codes	2019-07-19	Paper
Trailing-edge flow manipulation using streamwise finlets	2019-05-28	Paper
Sigma Partitioning: Complexity and Random Graphs	2019-01-21	Paper
Not-all-equal and 1-in-degree decompositions: algorithmic complexity and applications	2018-10-18	Paper
On the Tanner Graph Cycle Distribution of Random LDPC, Random Protograph-Based LDPC, and Random Quasi-Cyclic LDPC Code Ensembles	2018-09-14	Paper
On the algorithmic complexity of decomposing graphs into regular/irregular structures	2018-01-25	Paper
Is there any polynomial upper bound for the universal labeling of graphs?	2017-11-16	Paper
Colorful edge decomposition of graphs: some polynomial cases	2017-09-12	Paper
Algorithmic complexity of weakly semiregular partitioning and the representation number	2017-05-12	Paper
On the algorithmic complexity of adjacent vertex closed distinguishing colorings number of graphs	2016-12-28	Paper
On strongly planar not-all-equal 3SAT	2016-10-12	Paper
The inapproximability for the (0,1)-additive number	2016-08-23	Paper
On the algorithmic complexity of zero-sum edge-coloring	2016-07-27	Paper
On the complexity of deciding whether the regular number is at most two	2015-09-24	Paper
The complexity of the zero-sum 3-flows	2014-12-09	Paper
The complexity of the proper orientation number	2014-04-14	Paper
https://portal.mardi4nfdi.de/entity/Q5407377	2014-04-07	Paper
Algorithmic complexity of proper labeling problems	2014-01-10	Paper
Upper bounds for the 2-hued chromatic number of graphs in terms of the independence number	2012-10-26	Paper
On the difference between chromatic number and dynamic chromatic number of graphs	2012-08-10	Paper
On the Lucky labeling of Graphs	2010-07-15	Paper
On Rainbow Connection of Strongly Regular Graphs	2010-01-19	Paper
https://portal.mardi4nfdi.de/entity/Q3621384	2009-04-21	Paper
https://portal.mardi4nfdi.de/entity/Q3598557	2009-02-03	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Ali Dehghan