Mingyu Xiao
Mingyu Xiao
School of Computer Science and Engineering, The University of Electronic Science and
Verified email at uestc.edu.cn - Homepage
Cited by
Cited by
Exact algorithms for maximum independent set
M Xiao, H Nagamochi
Information and Computation 255, 126-146, 2017
Simple and improved parameterized algorithms for multiterminal cuts
M Xiao
Theory of Computing Systems 46 (4), 723-736, 2010
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
New parameterized algorithms for the edge dominating set problem
M Xiao, T Kloks, SH Poon
Theoretical Computer Science 511, 147-158, 2013
A note on vertex cover in graphs with maximum degree 3
M Xiao
International Computing and Combinatorics Conference, 150-159, 2010
A simple and fast algorithm for maximum independent set in 3-degree graphs
M Xiao
International Workshop on Algorithms and Computation, 281-292, 2010
A refined exact algorithm for edge dominating set
M Xiao, H Nagamochi
Theoretical Computer Science 560, 207-216, 2014
Finding minimum 3-way cuts in hypergraphs
M Xiao
Information Processing Letters 110 (14-15), 554-558, 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
An improved exact algorithm for undirected feedback vertex set
M Xiao, H Nagamochi
Journal of Combinatorial Optimization 30 (2), 214-241, 2015
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
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
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
On a generalization of Nemhauser and Trotter's local optimization theorem
M Xiao
Journal of Computer and System Sciences 84, 97-106, 2017
Parameterized edge dominating set in graphs with degree bounded by 3
M Xiao, H Nagamochi
Theoretical Computer Science 508, 2-15, 2013
An exact algorithm for maximum independent set in degree-5 graphs
M Xiao, H Nagamochi
Discrete Applied Mathematics 199, 137-155, 2016
Tight Approximation Ratio of a General Greedy Splitting Algorithm for the Minimum k-Way Cut Problem
M Xiao, L Cai, ACC Yao
Algorithmica 59 (4), 510-520, 2011
Exact and parameterized algorithms for edge dominating set in 3-degree graphs
M Xiao
International Conference on Combinatorial Optimization and Applications, 387-400, 2010
An improved divide-and-conquer algorithm for finding all minimum k-way cuts
M Xiao
International Symposium on Algorithms and Computation, 208-219, 2008
The system can't perform the operation now. Try again later.
Articles 1–20