The following pages link to Ge Xia (Q423935):
Displaying 50 items.
- Kernelization for cycle transversal problems (Q423937) (← links)
- On the small cycle transversal of planar graphs (Q551170) (← links)
- On the stretch factor of Delaunay triangulations of points in convex position (Q621926) (← links)
- On the induced matching problem (Q657915) (← links)
- Improved upper bounds for vertex cover (Q708228) (← links)
- Improved local algorithms for spanner construction (Q714769) (← links)
- Labeled search trees and amortized analysis: Improved upper bounds for NP-hard problems (Q818673) (← links)
- Strong computational lower bounds via parameterized complexity (Q856413) (← links)
- Polynomial time approximation schemes and parameterized complexity (Q867860) (← links)
- Improved parameterized and exact algorithms for cut problems on trees (Q896125) (← links)
- The compatibility of binary characters on phylogenetic networks: Complexity and parameterized algorithms (Q930588) (← links)
- Seeing the trees and their branches in the network is hard (Q935159) (← links)
- On the pseudo-achromatic number problem (Q1006054) (← links)
- On parameterized exponential time complexity (Q1029333) (← links)
- On the parameterized complexity of monotone and antimonotone weighted circuit satisfiability (Q1680511) (← links)
- Parameterized top-\(K\) algorithms (Q1935815) (← links)
- There are plane spanners of degree 4 and moderate stretch factor (Q2349855) (← links)
- Computing the flip distance between triangulations (Q2408209) (← links)
- On certain geometric properties of the Yao-Yao graphs (Q2436661) (← links)
- On the computational hardness based on linear fpt-reductions (Q2498987) (← links)
- Tight lower bounds for certain parameterized NP-hard problems (Q2568440) (← links)
- Edge-disjoint packing of stars and cycles (Q2629232) (← links)
- Genus characterizes the complexity of certain graph problems: Some tight results (Q2641866) (← links)
- When Is Weighted Satisfiability FPT? (Q2842181) (← links)
- The Stretch Factor of the Delaunay Triangulation Is Less than 1.998 (Q2862205) (← links)
- Algorithms for Cut Problems on Trees (Q2942406) (← links)
- Flip Distance Is in FPT Time O(n+ k * c^k) (Q2955019) (← links)
- New and improved spanning ratios for Yao graphs (Q2970433) (← links)
- On the Small Cycle Transversal of Planar Graphs (Q3057617) (← links)
- On Spanners and Lightweight Spanners of Geometric Graphs (Q3068627) (← links)
- On Certain Geometric Properties of the Yao-Yao Graphs (Q3167364) (← links)
- Edge-Disjoint Packing of Stars and Cycles (Q3467879) (← links)
- On the Effective Enumerability of NP Problems (Q3499739) (← links)
- Parametric Duality and Kernelization: Lower Bounds and Upper Bounds on Kernel Size (Q3519389) (← links)
- Computing Lightweight Spanners Locally (Q3540243) (← links)
- Kernelization for Cycle Transversal Problems (Q3578384) (← links)
- Linear FPT reductions and computational lower bounds (Q3580971) (← links)
- Reconstructing Evolution of Natural Languages: Complexity and Parameterized Algorithms (Q3591313) (← links)
- On Parameterized Exponential Time Complexity (Q3630202) (← links)
- (Q4449224) (← links)
- There are Plane Spanners of Maximum Degree 4 (Q4635524) (← links)
- New and Improved Spanning Ratios for Yao Graphs (Q4635525) (← links)
- On the Induced Matching Problem (Q4910736) (← links)
- Algorithms and Computation (Q5191643) (← links)
- On the Pseudo-achromatic Number Problem (Q5302045) (← links)
- Mathematical Foundations of Computer Science 2004 (Q5311124) (← links)
- Improved upper bound on the stretch factor of delaunay triangulations (Q5404432) (← links)
- STACS 2005 (Q5710681) (← links)
- Computing and Combinatorics (Q5717021) (← links)
- Improved Parameterized Upper Bounds for Vertex Cover (Q5756684) (← links)
