In my spare time, I still like to think about some interesting problems in theoretical computer science. See below for a list of my publications.

I am reachable through hongyuliang86 AT gmail DOT com.

• Asymptotically Optimal Algorithms for Running Max and Min Filters on Random Inputs
  Minming Li, Hongyu Liang, Shengxin Liu, Chung Keung Poon, Hao Yuan [DOI]
  IEEE Transactions on Signal Processing. Preliminary version in COCOON 2015.

• Computing Roman Domatic Numer of Graphs
  Haisheng Tan, Hongyu Liang, Rui Wang, Jipeng Zhou [DOI]
  Information Processing Letters, 116(9):554-559, 2016.

• Average-Case Complexity of the Min-Sum Matrix Product Problem
  Ken Fong, Minming Li, Hongyu Liang, Linji Yang, Hao Yuan [DOI]
  Theoretical Computer Science, 609:76-86, 2016. Preliminary version in ISAAC 2014.

• Matroid and Knapsack Center Problems
  Danny Z. Chen, Jian Li, Hongyu Liang, Haitao Wang [DOI]
  Algorithmica, 75(1):27-52, 2016. Preliminary version in IPCO 2013.

• Optimal Rendezvous Strategies for Different Environments in Cognitive Radio Networks
  Haisheng Tan, Jiajun Yu, Hongyu Liang, Rui Wang, Zhenhua Han [DOI]
  MSWiM 2015

• Optimal Algorithms for Running Max and Min Filters on Random Inputs
  Hongyu Liang, Shengxin Liu, Hao Yuan [DOI]
  COCOON 2015

• Average-Case Complexity of the Min-Sum Matrix Product Problem
  Ken Fong, Minming Li, Hongyu Liang, Linji Yang, Hao Yuan [DOI]
  ISAAC 2014

• Optimal Collapsing Protocol for Multiparty Pointer Jumping
  Hongyu Liang [DOI]
  Theory of Computing Systems, 54(1):13-23, 2014

• On the k-edge-incident Subgraph Problem and Its Variants
  Hongyu Liang [DOI]
  Discrete Applied Mathematics, 161(18):2985-2991, 2013

• On the Complexity of Connectivity in Cognitive Radio Networks Through Spectrum Assignment
  Hongyu Liang, Tiancheng Lou, Haisheng Tan, Amy Yuexuan Wang, Dongxiao Yu [arXiv][DOI]
  Journal of Combinatorial Optimization, 29(2):472-487, 2015.

• Some Sharp Bounds on the Negative Decision Number of Graphs
  Hongyu Liang [DOI]
  Discussiones Mathematicae Graph Theory, 33(4):649-656, 2013

• The Complexity of Computing Signed (Total) Domatic Numbers of Graphs
  Rui Li, Hongyu Liang [PDF]
  Journal of Combinatorial Mathematics and Combinatorial Computing, 87:181-190, 2013

• On the Signed (Total) k-domination Number of a Graph
  Hongyu Liang [arXiv]
  Journal of Combinatorial Mathematics and Combinatorial Computing, 89:87-99, 2014.

• Signed and Minus Domination in Complete Multipartite Graphs
  Hongyu Liang [arXiv]
  Accepted to Ars Combinatoria

• On the Complexity of t-Closeness Anonymization and Related Problems
  Hongyu Liang, Hao Yuan [arXiv][DOI]
  DASFAA 2013. Best Paper Award.

• Matroid and Knapsack Center Problems
  Danny Chen, Jian Li, Hongyu Liang, Haitao Wang [arXiv][DOI]
  IPCO 2013

• Improved Approximation for Spanning Star Forest in Dense Graphs
  Jing He, Hongyu Liang [DOI]
  Journal of Combinatorial Optimization, 25:255-264, 2013. Preliminary version in COCOA 2010.

• Extracting the Core Structure of Social Networks Using (\alpha, \beta)-Communities
  Liaoruo Wang, John Hopcroft, Jing He, Hongyu Liang, Supasorn Suwajanakorn [DOI]
  Internet Mathematics, 9(1):58-81, 2013. Preliminary version in WAW 2011.

• The Hardness and Approximation of the Star p-hub Center Problem
  Hongyu Liang [DOI]
  Operations Research Letters, 41(2):138-141, 2013.

• Complexity of Connectivity in Cognitive Radio Networks Through Spectrum Assignment
  Hongyu Liang, Tiancheng Lou, Haisheng Tan, Amy Yuexuan Wang, Dongxiao Yu [DOI]
  ALGOSENSORS 2012

• Satisfiability with Index Dependency
  Hongyu Liang, Jing He [PDF][DOI]
  Journal of Computer Science and Technology, 27(4):668-677, 2012. Invited paper. Preliminary version in ISAAC 2010.

• Computational Complexity of the Negative Decision Number of Graphs
  Hongyu Liang [PDF]
  Australasian Journal of Combinatorics, 53:191-205, 2012.

• On Rainbow-k-Connectivity of Random Graphs
  Jing He, Hongyu Liang [DOI]
  Information Processing Letters, 112(10):406-410, 2012.

• Space-Efficient Approximation Scheme for Circular Earth Mover Distance
  Joshua Brody, Hongyu Liang, Xiaoming Sun [DOI]
  LATIN 2012

• The Algorithmic Complexity of k-Domatic Partition of Graphs
  Hongyu Liang [DOI]
  IFIP TCS 2012

• Controlling Infection by Blocking Nodes and Links Simultaneously
  Jing He, Hongyu Liang, Hao Yuan [DOI] [full version]
  WINE 2011

• Word-reordering for Statistical Machine Translation Using Trigram Language Model
  Jing He, Hongyu Liang [PDF]
  IJCNLP 2011

• Reversing Longest Previous Factor Tables is Hard
  Jing He, Hongyu Liang, Guang Yang [DOI]
  WADS 2011

• Detecting the Structure of Social Networks Using (\alpha,\beta)-Communities
  Jing He, John Hopcroft, Hongyu Liang, Supasorn Suwajanakorn, Liaoruo Wang [PDF] [DOI]
  WAW 2011

• On Variants of the Spanning Star Forest Problem
  Jing He, Hongyu Liang [PDF] [DOI]
  FAW-AAIM 2011. Best Student Paper Award.

• Complexity of Total {k}-Domination and Related Problems
  Jing He, Hongyu Liang [DOI] [PDF] (fixed a bug in the conference version)
  FAW-AAIM 2011

• Satisfiability with Index Dependency
  Hongyu Liang, Jing He [PDF] [DOI]
  ISAAC 2010. Best Student Paper Award.

• An Improved Approximation Algorithm for Spanning Star Forest in Dense Graphs
  Jing He, Hongyu Liang [PDF] [DOI]
  COCOA 2010

• Limiting Negations in Bounded Treewidth and Upward Planar Circuits
  Jing He, Hongyu Liang, Jayalal Sarma M.N. [DOI]
  MFCS 2010