6 citations · 22 across the 7 of their papers we have counts for
7 papers
Optimal Rendezvous Strategies for Different Environments in Cognitive Radio Networks
Haisheng Tan, Jiajun Yu, Hongyu Liang +2
In Cognitive Radio Networks (CRNs), the secondary users (SUs) are allowed to access the licensed channels opportunistically. A fundamental and essential operation for SUs is to est…
Matroid and Knapsack Center Problems
Danny Z. Chen, Jian Li, Hongyu Liang +1
In the classic -center problem, we are given a metric graph, and the objective is to open nodes as centers such that the maximum distance from any vertex to its closest cent…
On the Complexity of -Closeness Anonymization and Related Problems
Hongyu Liang, Hao Yuan
An important issue in releasing individual data is to protect the sensitive information from being leaked and maliciously utilized. Famous privacy preserving principles that aim to…
On the Complexity of Connectivity in Cognitive Radio Networks Through Spectrum Assignment
Hongyu Liang, Tiancheng Lou, Haisheng Tan +2
Cognitive Radio Networks (CRNs) are considered as a promising solution to the spectrum shortage problem in wireless communication. In this paper, we initiate the first systematic s…
Signed and Minus Domination in Complete Multipartite Graphs
Hongyu Liang
In this paper we determine the exact values of the signed domination number, signed total domination number, and minus domination number of complete multipartite graphs, which subs…
On the Signed (Total) -Domination Number of a Graph
Hongyu Liang
Let be a positive integer and be a graph of minimum degree at least . A function is called a \emph{signed -dominating function} of $…