The following pages link to Mingyu Xiao (Q255261):
Displayed 50 items.
- An improved exact algorithm for TSP in graphs of maximum degree 4 (Q255262) (← links)
- An exact algorithm for TSP in degree-3 graphs via circuit procedure and amortization on connectivity structure (Q262259) (← links)
- On a generalization of Nemhauser and Trotter's local optimization theorem (Q340561) (← links)
- Parameterized edge dominating set in graphs with degree bounded by 3 (Q388085) (← links)
- New parameterized algorithms for the edge dominating set problem (Q392035) (← links)
- A refined exact algorithm for edge dominating set (Q477194) (← links)
- Exact algorithms for the maximum dissociation set and minimum 3-path vertex cover problems (Q507444) (← links)
- Tight approximation ratio of a general greedy splitting algorithm for the minimum \(k\)-way cut problem (Q633844) (← links)
- Complexity and kernels for bipartition into degree-bounded induced graphs (Q730002) (← links)
- An FPT algorithm for edge subset feedback edge set (Q763477) (← links)
- Finding minimum 3-way cuts in hypergraphs (Q765477) (← links)
- An improved upper bound for SAT (Q820534) (← links)
- An exact algorithm for maximum independent set in degree-5 graphs (Q896662) (← links)
- Simple and improved parameterized algorithms for multiterminal cuts (Q987378) (← links)
- A \((3+\epsilon)k\)-vertex kernel for edge-disjoint triangle packing (Q1628680) (← links)
- A refined algorithm for maximum independent set in degree-4 graphs (Q1680494) (← links)
- Confining sets and avoiding bottleneck cases: a simple maximum independent set algorithm in degree-3 graphs (Q1935804) (← links)
- FPTASs for trimming weighted trees (Q1935805) (← links)
- Exact algorithms for maximum independent set (Q2013558) (← links)
- A simple and improved parameterized algorithm for bicluster editing (Q2059879) (← links)
- Parameterized algorithms and complexity for the traveling purchaser problem and its variants (Q2084609) (← links)
- A fast algorithm for SAT in terms of formula length (Q2118334) (← links)
- Parameterized algorithms and kernels for almost induced matching (Q2210504) (← links)
- A quadratic vertex kernel for feedback arc set in bipartite tournaments (Q2258074) (← links)
- Parameterized algorithms for the Traveling Purchaser problem with additional constraints (Q2300071) (← links)
- Improved parameterized algorithms and kernels for mixed domination (Q2310753) (← links)
- Some reduction operations to pairwise compatibility graphs (Q2338220) (← links)
- New results on polynomial inapproximability and fixed parameter approximability of Edge Dominating Set (Q2345984) (← links)
- Exact algorithms for dominating induced matching based on graph partition (Q2352792) (← links)
- An improved exact algorithm for undirected feedback vertex set (Q2355979) (← links)
- Linear kernels for separating a graph into components of bounded size (Q2361357) (← links)
- Exact algorithms for maximum induced matching (Q2407101) (← links)
- An improved kernel for planar vertex-disjoint triangle packing (Q2672577) (← links)
- The \((3, 3)\)-colorability of planar graphs without 4-cycles and 5-cycles (Q2685340) (← links)
- A further improvement on approximating TTP-2 (Q2695281) (← links)
- Exact algorithms for maximum weighted independent set on sparse graphs (extended abstract) (Q2695332) (← links)
- A Parameterized Algorithm for Bounded-Degree Vertex Deletion (Q2817850) (← links)
- An Improved Exact Algorithm for Undirected Feedback Vertex Set (Q2867116) (← links)
- Exact Algorithms for Maximum Independent Set (Q2872097) (← links)
- A Refined Exact Algorithm for Edge Dominating Set (Q2898046) (← links)
- A Quadratic Vertex Kernel for Feedback Arc Set in Bipartite Tournaments (Q2912782) (← links)
- An Improved Exact Algorithm for TSP in Degree-4 Graphs (Q2914313) (← links)
- Complexity and Kernels for Bipartition into Degree-bounded Induced Graphs (Q2942649) (← links)
- An Improved Exact Algorithm for Maximum Induced Matching (Q2948473) (← links)
- Kernelization and Parameterized Algorithms for 3-Path Vertex Cover (Q2988857) (← links)
- Parameterized Edge Dominating Set in Cubic Graphs (Q3004660) (← links)
- Exact and Parameterized Algorithms for Edge Dominating Set in 3-Degree Graphs (Q3066473) (← links)
- New Parameterized Algorithms for the Edge Dominating Set Problem (Q3088075) (← links)
- Almost Induced Matching: Linear Kernels and Parameterized Algorithms (Q3181060) (← links)
- A Simple and Fast Algorithm for Maximum Independent Set in 3-Degree Graphs (Q3404455) (← links)