Hongyu Liang

From MaRDI portal
Person:284338

Available identifiers

zbMath Open liang.hongyuMaRDI QIDQ284338

List of research outcomes





PublicationDate of PublicationType
Total \(\{k\}\)-domination in special graphs2022-03-07Paper
Asymptotically Optimal Algorithms for Running Max and Min Filters on Random Inputs2019-02-12Paper
On the complexity of connectivity in cognitive radio networks through spectrum assignment2016-12-19Paper
Signed and minus domination in complete multipartite graphs.2016-10-26Paper
Matroid and knapsack center problems2016-06-28Paper
Computing Roman domatic number of graphs2016-05-18Paper
Average-case complexity of the min-sum matrix product problem2015-12-08Paper
Optimal Algorithms for Running Max and Min Filters on Random Inputs2015-10-29Paper
Average-Case Complexity of the Min-Sum Matrix Product Problem2015-09-11Paper
On the complexity of connectivity in cognitive radio networks through spectrum assignment2015-02-16Paper
On the signed (total) \(k\)-domination number of a graph2014-08-12Paper
Some sharp bounds on the negative decision number of graphs2014-07-30Paper
On the \(k\)-edge-incident subgraph problem and its variants2014-04-23Paper
Optimal collapsing protocol for multiparty pointer jumping2014-03-25Paper
https://portal.mardi4nfdi.de/entity/Q54010632014-03-12Paper
Satisfiability with index dependency2014-02-11Paper
Extracting the Core Structure of Social Networks Using (α, β)-Communities2013-06-28Paper
The hardness and approximation of the star \(p\)-hub center problem2013-05-14Paper
Improved approximation for spanning star forest in dense graphs2013-03-25Paper
Matroid and knapsack center problems2013-03-19Paper
The algorithmic complexity of \(k\)-domatic partition of graphs2012-09-21Paper
Computational complexity of the negative decision number of graphs2012-09-05Paper
On rainbow-\(k\)-connectivity of random graphs2012-07-20Paper
Space-Efficient Approximation Scheme for Circular Earth Mover Distance2012-06-29Paper
Reversing longest previous factor tables is hard2011-08-12Paper
Detecting the Structure of Social Networks Using (α,β)-Communities2011-06-08Paper
Complexity of Total {k}-Domination and Related Problems2011-06-03Paper
On variants of the spanning star forest problem2011-06-03Paper
An improved approximation algorithm for spanning star forest in dense graphs2011-01-10Paper
Satisfiability with index dependency2010-12-09Paper
Limiting negations in bounded treewidth and upward planar circuits2010-09-03Paper

Research outcomes over time

This page was built for person: Hongyu Liang