Ge Xia

发表

A note on parameterized exponential time complexity

Iyad A. Kanj, Jianer Chen, Ge Xia, 2003 .

Labeled Search Trees and Amortized Analysis: Improved Upper Bounds for NP-Hard Problems

Ge Xia, Iyad A. Kanj, Jianer Chen, 2003, Algorithmica.

Tight lower bounds for certain parameterized NP-hard problems

Iyad A. Kanj, B. Chor, D. Juedes, 2004, Proceedings. 19th IEEE Annual Conference on Computational Complexity, 2004..

New enumeration algorithm for protein structure comparison and classification

Ge Xia, Xiuzhen Huang, Iyad A. Kanj, 2013, BMC Genomics.

Local Algorithms for Constructing Spanners : Improved Bounds

Iyad A. Kanj, Ge Xia, 2010 .

3 O ct 2 01 6 Computing the flip distance between triangulations

Iyad A. Kanj, E. Sedgwick, Ge Xia, 2018 .

On certain geometric properties of the Yao–Yao graphs

Ge Xia, Iyad A. Kanj, Ge Xia, 2014, J. Comb. Optim..

Strictly Localized Construction of Planar Bounded-Degree Spanners of Unit Disk Graphs

Iyad A. Kanj, Ge Xia, Ljubomir Perkovic, 2022 .

An $O(3.82^k)$ Time FPT Algorithm for Convex Flip Distance

Ge Xia, Haohong Li, 2022, ArXiv.

Local Construction of Spanners in the 3D Space

Ge Xia, Fenghui Zhang, Iyad A. Kanj, 2009, IEEE Transactions on Mobile Computing.

Tight lower bounds for certain parameterized NP-hard problems

Ge Xia, Jianer Chen, Xiuzhen Huang, 2004, Proceedings. 19th IEEE Annual Conference on Computational Complexity, 2004..

Seeing the trees and their branches in the network is hard

Ge Xia, Luay Nakhleh, Iyad A. Kanj, 2007, Theor. Comput. Sci..

The Radiation Hybrid Map Construction Problem Is FPT

Ge Xia, Binhai Zhu, Iyad A. Kanj, 2013, ISBRA.

Parameterized algorithms and computational lower bounds: a structural approach

Ge Xia, Ge Xia, 2005 .

Genus characterizes the complexity of certain graph problems: Some tight results

Ge Xia, Jianer Chen, Ljubomir Perkovic, 2007, J. Comput. Syst. Sci..

Strong computational lower bounds via parameterized complexity

Ge Xia, Jianer Chen, Xiuzhen Huang, 2006, J. Comput. Syst. Sci..

Tight lower bounds for certain parameterized NP-hard problems

Ge Xia, Jianer Chen, Xiuzhen Huang, 2004, Proceedings. 19th IEEE Annual Conference on Computational Complexity, 2004..

Linear FPT reductions and computational lower bounds

Ge Xia, Jianer Chen, Xiuzhen Huang, 2004, STOC '04.

Improved Parameterized Upper Bounds for Vertex Cover

Ge Xia, Jianer Chen, Iyad A. Kanj, 2006, MFCS.

Parameterized top-K algorithms

Ge Xia, Jianer Chen, Fenghui Zhang, 2013, Theor. Comput. Sci..

On the Effective Enumerability of NP Problems

Ge Xia, Jianer Chen, Fenghui Zhang, 2006, IWPEC.

On the computational hardness based on linear FPT-reductions

Ge Xia, Jianer Chen, Xiuzhen Huang, 2006, J. Comb. Optim..

Polynomial time approximation schemes and parameterized complexity

Ge Xia, Jianer Chen, Xiuzhen Huang, 2007, Discret. Appl. Math..

Genus Characterizes the Complexity of Graph Problems: Some Tight Results

Ge Xia, Jianer Chen, Ljubomir Perkovic, 2003, ICALP.

On the parameterized complexity of monotone and antimonotone weighted circuit satisfiability

Dimitrios M. Thilikos, Ge Xia, Iyad A. Kanj, 2017, Inf. Comput..

When Is Weighted Satisfiability FPT?

Ge Xia, Iyad A. Kanj, Ge Xia, 2013, WADS.

Algorithms for Cut Problems on Trees pdf

Ge Xia, Peng Zhang, Boting Yang, 2013, COCOA.

What makes normalized weighted satisfiability tractable pdf

Ge Xia, Iyad A. Kanj, Ge Xia, 2011, ArXiv.

On the induced matching problem

Ge Xia, Michael J. Pelsmajer, Marcus Schaefer, 2011, J. Comput. Syst. Sci..

Improved upper bounds for vertex cover

Ge Xia, Jianer Chen, Iyad A. Kanj, 2010, Theor. Comput. Sci..

RBoost: Label Noise-Robust Boosting Algorithm Based on a Nonconvex Loss Function and the Numerically Stable Base Learners

Maoguo Gong, Ge Xia, Qiguang Miao, 2016, IEEE Transactions on Neural Networks and Learning Systems.

Kernelization for cycle transversal problems

Ge Xia, Yong Zhang, Ge Xia, 2010, Discret. Appl. Math..

Complexity Issues on PTAS

Ge Xia, Jianer Chen, Jianer Chen, 2013 .

There are Plane Spanners of Degree 4 and Moderate Stretch Factor

Ge Xia, Ljubomir Perkovic, Nicolas Bonichon, 2015, Discret. Comput. Geom..

The Stretch Factor of the Delaunay Triangulation Is Less than 1.998

Ge Xia, Ge Xia, 2011, SIAM J. Comput..

Improved local algorithms for spanner construction

Ge Xia, Iyad A. Kanj, Ge Xia, 2010, Theor. Comput. Sci..

On Spanners and Lightweight Spanners of Geometric Graphs

Ge Xia, Ljubomir Perkovic, Iyad A. Kanj, 2010, SIAM J. Comput..

Parametric Duality and Kernelization: Lower Bounds and Upper Bounds on Kernel Size

Ge Xia, Henning Fernau, Jianer Chen, 2005, SIAM J. Comput..

A contour-line color layer separation algorithm based on fuzzy clustering and region growing

Yun Yang, Yubing Tong, Ge Xia, 2016, Comput. Geosci..

The Complexity of Tree Partitioning

Ge Xia, Iyad A. Kanj, Qilong Feng, 2017, Algorithmica.

Simplicity is Beauty: Improved Upper Bounds for Vertex Cover

Ge Xia, Iyad A. Kanj, Jianer Chen, 2005 .

On the pseudo-achromatic number problem

Ge Xia, Jianer Chen, Fenghui Zhang, 2008, Theor. Comput. Sci..