| Exact algorithms for maximum independent set M Xiao, H Nagamochi Information and Computation 255, 126-146, 2017 | 266 | 2017 |
| Confining sets and avoiding bottleneck cases: A simple maximum independent set algorithm in degree-3 graphs M Xiao, H Nagamochi Theoretical Computer Science 469, 92-104, 2013 | 78 | 2013 |
| Balanced Clustering: A Uniform Model and Fast Algorithm. W Lin, Z He, M Xiao IJCAI, 2987-2993, 2019 | 62 | 2019 |
| A Fast Algorithm to Compute Maximum k-Plexes in Social Network Analysis M Xiao, W Lin, Y Dai, Y Zeng Proceedings of the AAAI conference on Artificial Intelligence 31 (1), 2017 | 60 | 2017 |
| Enumerating Maximal k-Plexes with Worst-Case Time Guarantee Y Zhou, J Xu, Z Guo, M Xiao, Y Jin Proceedings of the AAAI conference on Artificial Intelligence 34 (03), 2442-2449, 2020 | 59 | 2020 |
| Simple and improved parameterized algorithms for multiterminal cuts M Xiao Theory of Computing Systems 46 (4), 723-736, 2010 | 59 | 2010 |
| Improving maximum k-plex solver via second-order reduction and graph color bounding Y Zhou, S Hu, M Xiao, ZH Fu Proceedings of the AAAI Conference on Artificial Intelligence 35 (14), 12453 …, 2021 | 58 | 2021 |
| Exact algorithms for the maximum dissociation set and minimum 3-path vertex cover problems M Xiao, S Kou Theoretical Computer Science 657, 86-97, 2017 | 56 | 2017 |
| New parameterized algorithms for the edge dominating set problem M Xiao, T Kloks, SH Poon Theoretical Computer Science 511, 147-158, 2013 | 46 | 2013 |
| Listing maximal k-plexes in large real-world graphs Z Wang, Y Zhou, M Xiao, B Khoussainov Proceedings of the ACM Web Conference 2022, 1517-1527, 2022 | 42 | 2022 |
| An exact algorithm for TSP in degree-3 graphs via circuit procedure and amortization on connectivity structure M Xiao, H Nagamochi Algorithmica 74 (2), 713-741, 2016 | 39 | 2016 |
| Kernelization and parameterized algorithms for 3-path vertex cover M Xiao, S Kou International Conference on Theory and Applications of Models of Computation …, 2017 | 36 | 2017 |
| Computing maximum k-defective cliques in massive graphs X Chen, Y Zhou, JK Hao, M Xiao Computers & Operations Research 127, 105131, 2021 | 35 | 2021 |
| Efficient reductions and a fast algorithm of maximum weighted independent set M Xiao, S Huang, Y Zhou, B Ding Proceedings of the Web Conference 2021, 3930-3940, 2021 | 33 | 2021 |
| A simple and fast algorithm for maximum independent set in 3-degree graphs M Xiao International Workshop on Algorithms and Computation, 281-292, 2010 | 32 | 2010 |
| New results on polynomial inapproximabilityand fixed parameter approximability of edge dominating set B Escoffier, J Monnot, VT Paschos, M Xiao Theory of Computing Systems 56 (2), 330-346, 2015 | 31 | 2015 |
| Finding minimum 3-way cuts in hypergraphs M Xiao Information Processing Letters 110 (14-15), 554-558, 2010 | 30 | 2010 |
| On a generalization of Nemhauser and Trotter's local optimization theorem M Xiao Journal of Computer and System Sciences 84, 97-106, 2017 | 29 | 2017 |
| A note on vertex cover in graphs with maximum degree 3 M Xiao International Computing and Combinatorics Conference, 150-159, 2010 | 29 | 2010 |
| A refined exact algorithm for edge dominating set M Xiao, H Nagamochi Theoretical Computer Science 560, 207-216, 2014 | 27 | 2014 |
Benedict Sheung-Hung PoonAssociate Professor, University of Nottingham Ningbo ChinaVerified email at nottingham.edu.cn
