Genus Characterizes the Complexity of Graph Problems: Some Tight Results. - Jianer Chen; Iyad A. Kanj; Ljubomir Perkovic; Eric Sedgwick; Ge Xia (ICALP, 2003)

Linear FPT reductions and computational lower bounds. - Jianer Chen; Xiuzhen Huang; Iyad A. Kanj; Ge Xia (STOC, 2004)

W-Hardness Under Linear FPT-Reductions: Structural Properties and Further Applications. - Jianer Chen; Xiuzhen Huang; Iyad A. Kanj; Ge Xia (COCOON, 2005)

Labeled Search Trees and Amortized Analysis: Improved Upper Bounds for NP-Hard Problems. - Jianer Chen; Iyad A. Kanj; Ge Xia (Algorithmica, 2005)

Tight lower bounds for certain parameterized NP-hard problems. - Jianer Chen; Benny Chor; Mike Fellows; Xiuzhen Huang; David W. Juedes; Iyad A. Kanj; Ge Xia (Inf. Comput., 2005)

Parameterized algorithms and computational lower bounds: a structural approach. - Ge Xia (2005)

Reconstructing Evolution of Natural Languages: Complexity and Parameterized Algorithms. - Iyad A. Kanj; Luay Nakhleh; Ge Xia (COCOON, 2006)

On the Effective Enumerability of NP Problems. - Jianer Chen; Iyad A. Kanj; Jie Meng; Ge Xia; Fenghui Zhang (IWPEC, 2006)

Improved Parameterized Upper Bounds for Vertex Cover. - Jianer Chen; Iyad A. Kanj; Ge Xia (MFCS, 2006)

On the computational hardness based on linear FPT-reductions. - Jianer Chen; Xiuzhen Huang; Iyad A. Kanj; Ge Xia (J. Comb. Optim., 2006)

Strong computational lower bounds via parameterized complexity. - Jianer Chen; Xiuzhen Huang; Iyad A. Kanj; Ge Xia (J. Comput. Syst. Sci., 2006)

Strictly-Localized Construction of Near-Optimal Power Spanners for Wireless Ad-Hoc Networks. - Iyad A. Kanj; Ljubomir Perkovic; Ge Xia (DIALM-POMC, 2007)

Seeing the Trees and Their Branches in the Forest is Hard. - Iyad A. Kanj; Luay Nakhleh; Cuong Than; Ge Xia (ICTCS, 2007)

Polynomial time approximation schemes and parameterized complexity. - Jianer Chen; Xiuzhen Huang; Iyad A. Kanj; Ge Xia (Discret. Appl. Math., 2007)

Genus characterizes the complexity of certain graph problems: Some tight results. - Jianer Chen; Iyad A. Kanj; Ljubomir Perkovic; Eric Sedgwick; Ge Xia (J. Comput. Syst. Sci., 2007)

Parametric Duality and Kernelization: Lower Bounds and Upper Bounds on Kernel Size. - Jianer Chen; Henning Fernau; Iyad A. Kanj; Ge Xia (SIAM J. Comput., 2007)

Computing Lightweight Spanners Locally. - Iyad A. Kanj; Ljubomir Perkovic; Ge Xia (DISC, 2008)

The Compatibility of Binary Characters on Phylogenetic Networks: Complexity and Parameterized Algorithms. - Iyad A. Kanj; Luay Nakhleh; Ge Xia (Algorithmica, 2008)

Seeing the trees and their branches in the network is hard. - Iyad A. Kanj; Luay Nakhleh; Cuong Than; Ge Xia (Theor. Comput. Sci., 2008)

On the Dilation of Delaunay Triangulations of Points in Convex Position. - Shiliang Cui; Iyad A. Kanj; Ge Xia (CCCG, 2009)

Local Construction of Spanners in the 3-D Space. - Iyad A. Kanj; Ge Xia; Fenghui Zhang (DCOSS, 2009)

On the pseudo-achromatic number problem. - Jianer Chen; Iyad A. Kanj; Jie Meng; Ge Xia; Fenghui Zhang (Theor. Comput. Sci., 2009)

On parameterized exponential time complexity. - Jianer Chen; Iyad A. Kanj; Ge Xia (Theor. Comput. Sci., 2009)

Local Construction of Near-Optimal Power Spanners for Wireless Ad Hoc Networks. - Iyad A. Kanj; Ljubomir Perkovic; Ge Xia (IEEE Trans. Mob. Comput., 2009)

On Spanners and Lightweight Spanners of Geometric Graphs. - Iyad A. Kanj; Ljubomir Perkovic; Ge Xia (SIAM J. Comput., 2010)

Improved upper bounds for vertex cover. - Jianer Chen; Iyad A. Kanj; Ge Xia (Theor. Comput. Sci., 2010)

Toward the Tight Bound of the Stretch Factor of Delaunay Triangulations. - Ge Xia; Liang Zhang (CCCG, 2011)

Improved upper bound on the stretch factor of delaunay triangulations. - Ge Xia (SCG, 2011)

On the stretch factor of Delaunay triangulations of points in convex position. - Shiliang Cui; Iyad A. Kanj; Ge Xia (Comput. Geom., 2011)

What makes normalized weighted satisfiability tractable - Iyad A. Kanj; Ge Xia (CoRR, 2011)

On the induced matching problem. - Iyad A. Kanj; Michael J. Pelsmajer; Marcus Schaefer 001; Ge Xia (J. Comput. Syst. Sci., 2011)

On the small cycle transversal of planar graphs. - Ge Xia; Yong Zhang 053 (Theor. Comput. Sci., 2011)

Separability and topology control of quasi unit disk graphs. - Jianer Chen; Anxiao Jiang; Iyad A. Kanj; Ge Xia; Fenghui Zhang (Wirel. Networks, 2011)

Kernelization for cycle transversal problems. - Ge Xia; Yong Zhang 053 (Discret. Appl. Math., 2012)

Improved local algorithms for spanner construction. - Iyad A. Kanj; Ge Xia (Theor. Comput. Sci., 2012)

Local Construction of Spanners in the 3D Space. - Jonathan P. Jenkins; Iyad A. Kanj; Ge Xia; Fenghui Zhang (IEEE Trans. Mob. Comput., 2012)

The Radiation Hybrid Map Construction Problem Is FPT. - Iyad A. Kanj; Ge Xia; Binhai Zhu (ISBRA, 2013)

When Is Weighted Satisfiability FPT? - Iyad A. Kanj; Ge Xia (WADS, 2013)

The Yao Graph $Y_5$ is a Spanner. - Wah Loon Keng; Ge Xia (CoRR, 2013)

The Stretch Factor of the Delaunay Triangulation Is Less than 1.998. - Ge Xia (SIAM J. Comput., 2013)

Parameterized top-K algorithms. - Jianer Chen; Iyad A. Kanj; Jie Meng; Ge Xia; Fenghui Zhang (Theor. Comput. Sci., 2013)

Algorithms for Cut Problems on Trees. - Iyad A. Kanj; Guohui Lin; Tian Liu 001; Weitian Tong; Ge Xia; Jinhui Xu 001; Boting Yang; Fenghui Zhang; Peng Zhang 008; Binhai Zhu (COCOA, 2014)

There are Plane Spanners of Maximum Degree 4. - Nicolas Bonichon; Iyad A. Kanj; Ljubomir Perkovic; Ge Xia (SoCG, 2014)

Flip Distance is in FPT time $O(n+ k cdot c^k)$. - Iyad A. Kanj; Ge Xia (CoRR, 2014)

On certain geometric properties of the Yao-Yao graphs. - Iyad A. Kanj; Ge Xia (J. Comb. Optim., 2014)

Flip Distance Is in FPT Time O(n+ k * c^k). - Iyad A. Kanj; Ge Xia (STACS, 2015)

There are Plane Spanners of Degree 4 and Moderate Stretch Factor. - Nicolas Bonichon; Iyad A. Kanj; Ljubomir Perkovic; Ge Xia (Discret. Comput. Geom., 2015)

New and improved spanning ratios for Yao graphs. - Luis Barba; Prosenjit Bose; Mirela Damian; Rolf Fagerberg; Wah Loon Keng; Joseph O'Rourke; André van Renssen; Perouz Taslakian; Sander Verdonschot; Ge Xia (J. Comput. Geom., 2015)

Improved parameterized and exact algorithms for cut problems on trees. - Iyad A. Kanj; Guohui Lin; Tian Liu 001; Weitian Tong; Ge Xia; Jinhui Xu 001; Boting Yang; Fenghui Zhang; Peng Zhang 008; Binhai Zhu (Theor. Comput. Sci., 2015)

A contour-line color layer separation algorithm based on fuzzy clustering and region growing. - Tiange Liu; Qiguang Miao; Pengfei Xu 003; Yubing Tong; Jianfeng Song; Ge Xia; Yun Yang; Xiaojie Zhai (Comput. Geosci., 2016)

Edge-disjoint packing of stars and cycles. - Minghui Jiang 001; Ge Xia; Yong Zhang 053 (Theor. Comput. Sci., 2016)

RBoost: Label Noise-Robust Boosting Algorithm Based on a Nonconvex Loss Function and the Numerically Stable Base Learners. - Qiguang Miao; Ying Cao 003; Ge Xia; Maoguo Gong; Jiachen Liu; Jianfeng Song (IEEE Trans. Neural Networks Learn. Syst., 2016)

Computing the Flip Distance Between Triangulations. - Iyad A. Kanj; Eric Sedgwick; Ge Xia (Discret. Comput. Geom., 2017)

On the parameterized complexity of monotone and antimonotone weighted circuit satisfiability. - Iyad A. Kanj; Dimitrios M. Thilikos; Ge Xia (Inf. Comput., 2017)

On the Problem of Covering a 3-D Terrain. - Eduard Eiben; Isuru S. Godage; Iyad Kanj; Ge Xia (AAAI, 2020)

The Complexity of Tree Partitioning. - Zhao An; Qilong Feng; Iyad Kanj; Ge Xia (Algorithmica, 2020)

Streaming Algorithms for Graph k-Matching with Optimal or Near-Optimal Update Time. - Jianer Chen; Qin Huang; Iyad Kanj; Qian Li 012; Ge Xia (ISAAC, 2021)

Optimal Streaming Algorithms for Graph Matching. - Jianer Chen; Qin Huang; Iyad Kanj; Ge Xia (CoRR, 2021)

Near-Optimal Algorithms for Point-Line Covering Problems. - Jianer Chen; Qin Huang; Iyad Kanj; Ge Xia (STACS, 2022)

An $O(3.82^k)$ Time FPT Algorithm for Convex Flip Distance. - Haohong Li; Ge Xia (CoRR, 2022)

Near-optimal algorithms for point-line fitting problems. - Jianer Chen; Qin Huang; Iyad Kanj; Ge Xia (J. Comput. Geom., 2022)

An 𝒪(3.82k) Time FPT Algorithm for Convex Flip Distance. - Haohong Li; Ge Xia (STACS, 2023)

Nearly Time-Optimal Kernelization Algorithms for the Line-Cover Problem with Big Data. - Jianer Chen; Qin Huang; Iyad Kanj; Ge Xia (Algorithmica, 2024)

An 풪(3.82k) Time sf FPT Algorithm for Convex Flip Distance. - Haohong Li; Ge Xia (Discret. Comput. Geom., 2025)