Matroid and knapsack center problems DZ Chen, J Li, H Liang, H Wang Algorithmica 75, 27-52, 2016 | 53 | 2016 |

On rainbow-k-connectivity of random graphs J He, H Liang Information Processing Letters 112 (10), 406-410, 2012 | 30 | 2012 |

The hardness and approximation of the star p-hub center problem H Liang Operations Research Letters 41 (2), 138-141, 2013 | 28 | 2013 |

On the Complexity of *t*-Closeness Anonymization and Related ProblemsH Liang, H Yuan Database Systems for Advanced Applications: 18th International Conference …, 2013 | 26 | 2013 |

Controlling infection by blocking nodes and links simultaneously J He, H Liang, H Yuan Internet and Network Economics: 7th International Workshop, WINE 2011 …, 2011 | 26 | 2011 |

Detecting the Structure of Social Networks Using (*α*,*β*)-CommunitiesJ He, J Hopcroft, H Liang, S Suwajanakorn, L Wang Algorithms and Models for the Web Graph: 8th International Workshop, WAW …, 2011 | 25 | 2011 |

Extracting the Core Structure of Social Networks Using (α, β)-Communities L Wang, J Hopcroft, J He, H Liang, S Suwajanakorn Internet Mathematics 9 (1), 58-81, 2013 | 17 | 2013 |

On the complexity of connectivity in cognitive radio networks through spectrum assignment H Liang, T Lou, H Tan, Y Wang, D Yu Journal of Combinatorial Optimization 29, 472-487, 2015 | 12 | 2015 |

Reversing longest previous factor tables is hard J He, H Liang, G Yang Algorithms and Data Structures: 12th International Symposium, WADS 2011, New …, 2011 | 12 | 2011 |

Complexity of Total {*k*}-Domination and Related ProblemsJ He, H Liang Frontiers in Algorithmics and Algorithmic Aspects in Information and …, 2011 | 9 | 2011 |

On the Signed (Total) -Domination Number of a Graph H Liang arXiv preprint arXiv:1204.4827, 2012 | 8 | 2012 |

Improved approximation for spanning star forest in dense graphs J He, H Liang Journal of Combinatorial Optimization 25 (2), 255-264, 2013 | 5 | 2013 |

On variants of the spanning star forest problem J He, H Liang Frontiers in Algorithmics and Algorithmic Aspects in Information and …, 2011 | 5 | 2011 |

Computing Roman domatic number of graphs H Tan, H Liang, R Wang, J Zhou Information Processing Letters 116 (9), 554-559, 2016 | 4 | 2016 |

Space-Efficient Approximation Scheme for Circular Earth Mover Distance J Brody, H Liang, X Sun LATIN 2012: Theoretical Informatics, 97-108, 2012 | 4 | 2012 |

Word-reordering for statistical machine translation using trigram language model J He, H Liang Proceedings of 5th International Joint Conference on Natural Language …, 2011 | 4 | 2011 |

Limiting negations in bounded treewidth and upward planar circuits J He, H Liang, JMN Sarma Mathematical Foundations of Computer Science 2010: 35th International …, 2010 | 4 | 2010 |

Optimal collapsing protocol for multiparty pointer jumping H Liang Theory of Computing Systems 54 (1), 13-23, 2014 | 3 | 2014 |

The Algorithmic Complexity of *k*-Domatic Partition of GraphsH Liang Theoretical Computer Science: 7th IFIP TC 1/WG 2.2 International Conference …, 2012 | 3 | 2012 |

Asymptotically optimal algorithms for running Max and Min Filters on random inputs M Li, H Liang, S Liu, CK Poon, H Yuan IEEE Transactions on Signal Processing 66 (13), 3421-3435, 2018 | 2 | 2018 |