1. A 5k kernel for P2-packing in net-free graphs;Chang,2014
2. Kernels for packing and covering problems;Chen;Theor. Comput. Sci.,2019
3. Improved approximation for 3-dimensional matching via bounded pathwidth local search;Cygan,2013
4. Blow-ups, win/win's, and crown rules: some new directions in FPT;Fellows,2003
5. An n5/2 algorithm for maximum matchings in bipartite graphs;Hopcroft;SIAM J. Comput.,1973