Mingyu Xiao
Cited by
Cited by
Exact algorithms for maximum independent set
M Xiao, H Nagamochi
Information and Computation 255, 126-146, 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
Simple and improved parameterized algorithms for multiterminal cuts
M Xiao
Theory of Computing Systems 46, 723-736, 2010
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
New parameterized algorithms for the edge dominating set problem
M Xiao, T Kloks, SH Poon
Theoretical Computer Science 511, 147-158, 2013
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
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
Balanced Clustering: A Uniform Model and Fast Algorithm.
W Lin, Z He, M Xiao
IJCAI, 2987-2993, 2019
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
Kernelization and parameterized algorithms for 3-path vertex cover
M Xiao, S Kou
International Conference on Theory and Applications of Models of Computation …, 2017
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
A simple and fast algorithm for maximum independent set in 3-degree graphs
M Xiao
WALCOM: Algorithms and Computation: 4th International Workshop, WALCOM 2010 …, 2010
Finding minimum 3-way cuts in hypergraphs
M Xiao
Information Processing Letters 110 (14-15), 554-558, 2010
A note on vertex cover in graphs with maximum degree 3
M Xiao
International Computing and Combinatorics Conference, 150-159, 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
A refined exact algorithm for edge dominating set
M Xiao, H Nagamochi
Theoretical Computer Science 560, 207-216, 2014
On a generalization of Nemhauser and Trotter's local optimization theorem
M Xiao
Journal of Computer and System Sciences 84, 97-106, 2017
An Improved Divide-and-Conquer Algorithm for Finding All Minimum k-Way Cuts
M Xiao
International Symposium on Algorithms and Computation, 208-219, 2008
Improvement on vertex cover and independent set problem for low-degree graphs.
MY Xiao, JE Chen, XL Han
Jisuanji Xuebao(Chin. J. Comput.) 28 (2), 153-160, 2005
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
The system can't perform the operation now. Try again later.
Articles 1–20