| Publication | Date of Publication | Type |
|---|
On the maximum number of non-attacking rooks on a high-dimensional simplicial chessboard
Graphs and Combinatorics | 2022-03-21 | Paper |
On the proper arc labeling of directed graphs
Graphs and Combinatorics | 2022-01-03 | Paper |
On the in-out-proper orientations of graphs
Discrete Applied Mathematics | 2021-08-02 | Paper |
On the semi-proper orientations of graphs
Discrete Applied Mathematics | 2021-04-20 | Paper |
On Finding Bipartite Graphs With a Small Number of Short Cycles and Large Girth
IEEE Transactions on Information Theory | 2020-12-04 | Paper |
On Computing the Number of Short Cycles in Bipartite Graphs Using the Spectrum of the Directed Edge Matrix
IEEE Transactions on Information Theory | 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
IEEE Transactions on Information Theory | 2020-01-28 | Paper |
Cospectral bipartite graphs with the same degree sequences but with different number of large cycles
Graphs and Combinatorics | 2020-01-21 | Paper |
(2/2/3)-SAT problem and its applications in dominating set problems
(available as arXiv preprint) | 2020-01-13 | Paper |
| (2/2/3)-SAT problem and its applications in dominating set problems | 2020-01-13 | Paper |
Hardness Results on Finding Leafless Elementary Trapping Sets and Elementary Absorbing Sets of LDPC Codes
IEEE Transactions on Information Theory | 2019-07-19 | Paper |
On computing the multiplicity of cycles in bipartite graphs using the degree distribution and the spectrum of the graph
IEEE Transactions on Information Theory | 2019-07-19 | 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
IEEE Transactions on Information Theory | 2019-07-19 | Paper |
Trailing-edge flow manipulation using streamwise finlets
Journal of Fluid Mechanics | 2019-05-28 | Paper |
Sigma partitioning: complexity and random graphs
(available as arXiv preprint) | 2019-01-21 | Paper |
| Sigma partitioning: complexity and random graphs | 2019-01-21 | Paper |
Not-all-equal and 1-in-degree decompositions: algorithmic complexity and applications
Algorithmica | 2018-10-18 | Paper |
On the Tanner Graph Cycle Distribution of Random LDPC, Random Protograph-Based LDPC, and Random Quasi-Cyclic LDPC Code Ensembles
IEEE Transactions on Information Theory | 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?
Journal of Combinatorial Optimization | 2017-11-16 | Paper |
Colorful edge decomposition of graphs: some polynomial cases
Discrete Applied Mathematics | 2017-09-12 | Paper |
Algorithmic complexity of weakly semiregular partitioning and the representation number
Theoretical Computer Science | 2017-05-12 | Paper |
On the algorithmic complexity of adjacent vertex closed distinguishing colorings number of graphs
Discrete Applied Mathematics | 2016-12-28 | Paper |
On strongly planar not-all-equal 3SAT
Journal of Combinatorial Optimization | 2016-10-12 | Paper |
The inapproximability for the \((0,1)\)-additive number
Discrete Mathematics and Theoretical Computer Science. DMTCS | 2016-08-23 | Paper |
The inapproximability for the \((0,1)\)-additive number
Discrete Mathematics and Theoretical Computer Science. DMTCS | 2016-08-23 | Paper |
On the algorithmic complexity of zero-sum edge-coloring
Information Processing Letters | 2016-07-27 | Paper |
On the complexity of deciding whether the regular number is at most two
Graphs and Combinatorics | 2015-09-24 | Paper |
The complexity of the zero-sum 3-flows
Information Processing Letters | 2014-12-09 | Paper |
The complexity of the proper orientation number
Information Processing Letters | 2014-04-14 | Paper |
| On the complexity of the colorful directed paths in vertex coloring of digraphs | 2014-04-07 | Paper |
Algorithmic complexity of proper labeling problems
Theoretical Computer Science | 2014-01-10 | Paper |
Upper bounds for the 2-hued chromatic number of graphs in terms of the independence number
Discrete Applied Mathematics | 2012-10-26 | Paper |
On the difference between chromatic number and dynamic chromatic number of graphs
Discrete Mathematics | 2012-08-10 | Paper |
Computation of lucky number of planar graphs is NP-hard
Information Processing Letters | 2012-05-04 | Paper |
| On the Lucky labeling of Graphs | 2010-07-15 | Paper |
| On Rainbow Connection of Strongly Regular Graphs | 2010-01-19 | Paper |
| scientific article; zbMATH DE number 5545321 (Why is no real title available?) | 2009-04-21 | Paper |
| Characteristics of subcritical flow over vertical drops with sloping aprons | 2009-02-03 | Paper |
