Ge Xia

According to our database, Ge Xia authored at least 64 papers between 2003 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

An 풪(3.82^k) Time sf FPT Algorithm for Convex Flip Distance.

Haohong Li, Ge Xia

Discret. Comput. Geom., April, 2025

2024

Nearly Time-Optimal Kernelization Algorithms for the Line-Cover Problem with Big Data.

Jianer Chen, Qin Huang, Iyad Kanj, Ge Xia

Algorithmica, August, 2024

2023

An 𝒪(3.82^k) Time FPT Algorithm for Convex Flip Distance.

Haohong Li, Ge Xia

Proceedings of the 40th International Symposium on Theoretical Aspects of Computer Science, 2023

2022

Near-optimal algorithms for point-line fitting problems.

Jianer Chen, Qin Huang, Iyad Kanj, Ge Xia

J. Comput. Geom., 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 Covering Problems.

Jianer Chen, Qin Huang, Iyad Kanj, Ge Xia

Proceedings of the 39th International Symposium on Theoretical Aspects of Computer Science, 2022

2021

Optimal Streaming Algorithms for Graph Matching.

Jianer Chen, Qin Huang, Iyad Kanj, Ge Xia

CoRR, 2021

Streaming Algorithms for Graph k-Matching with Optimal or Near-Optimal Update Time.

Jianer Chen, Qin Huang, Iyad Kanj, Qian Li, Ge Xia

Proceedings of the 32nd International Symposium on Algorithms and Computation, 2021

2020

On the Problem of Covering a 3-D Terrain.

Eduard Eiben, Isuru S. Godage, Iyad Kanj, Ge Xia

Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2017

On the parameterized complexity of monotone and antimonotone weighted circuit satisfiability.

Iyad A. Kanj, Dimitrios M. Thilikos, Ge Xia

Inf. Comput., 2017

Computing the Flip Distance Between Triangulations.

Iyad A. Kanj, Eric Sedgwick, Ge Xia

Discret. Comput. Geom., 2017

The Complexity of Tree Partitioning.

Zhao An, Qilong Feng, Iyad A. Kanj, Ge Xia

Proceedings of the Algorithms and Data Structures - 15th International Symposium, 2017

2016

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

Qiguang Miao, Ying Cao, Ge Xia, Maoguo Gong, Jiachen Liu, Jianfeng Song

IEEE Trans. Neural Networks Learn. Syst., 2016

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

Tiange Liu, Qiguang Miao, Pengfei Xu, Yubing Tong, Jianfeng Song, Ge Xia, Yun Yang, Xiaojie Zhai

Comput. Geosci., 2016

2015

Improved parameterized and exact algorithms for cut problems on trees.

Iyad A. Kanj, Guohui Lin, Tian Liu, Weitian Tong, Ge Xia, Jinhui Xu, Boting Yang, Fenghui Zhang, Peng Zhang, Binhai Zhu

Theor. Comput. Sci., 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

Flip Distance Is in FPT Time O(n+ k * c^k).

Iyad A. Kanj, Ge Xia

Proceedings of the 32nd International Symposium on Theoretical Aspects of Computer Science, 2015

Edge-Disjoint Packing of Stars and Cycles.

Minghui Jiang, Ge Xia, Yong Zhang

Proceedings of the Combinatorial Optimization and Applications, 2015

2014

Flip Distance is in FPT time $O(n+ k \cdot c^k)$.

Iyad A. Kanj, Ge Xia

CoRR, 2014

There are Plane Spanners of Maximum Degree 4.

Nicolas Bonichon, Iyad A. Kanj, Ljubomir Perkovic, Ge Xia

Proceedings of the 30th Annual Symposium on Computational Geometry, 2014

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

Proceedings of the 30th Annual Symposium on Computational Geometry, 2014

Algorithms for Cut Problems on Trees.

Iyad A. Kanj, Guohui Lin, Tian Liu, Weitian Tong, Ge Xia, Jinhui Xu, Boting Yang, Fenghui Zhang, Peng Zhang, Binhai Zhu

Proceedings of the Combinatorial Optimization and Applications, 2014

2013

Parameterized top-<i>K</i> algorithms.

Jianer Chen, Iyad A. Kanj, Jie Meng, Ge Xia, Fenghui Zhang

Theor. Comput. Sci., 2013

The Stretch Factor of the Delaunay Triangulation Is Less than 1.998.

Ge Xia

SIAM J. Comput., 2013

The Yao Graph $Y_5$ is a Spanner.

Wah Loon Keng, Ge Xia

CoRR, 2013

When Is Weighted Satisfiability FPT?

Iyad A. Kanj, Ge Xia

Proceedings of the Algorithms and Data Structures - 13th International Symposium, 2013

The Radiation Hybrid Map Construction Problem Is FPT.

Iyad A. Kanj, Ge Xia, Binhai Zhu

Proceedings of the Bioinformatics Research and Applications, 9th International Symposium, 2013

2012

Local Construction of Spanners in the 3D Space.

Jonathan P. Jenkins, Iyad A. Kanj, Ge Xia, Fenghui Zhang

IEEE Trans. Mob. Comput., 2012

On Certain Geometric Properties of the Yao-Yao Graphs.

Iyad A. Kanj, Ge Xia

Proceedings of the Combinatorial Optimization and Applications, 2012

2011

What makes normalized weighted satisfiability tractable

Iyad A. Kanj, Ge Xia

CoRR, 2011

On the stretch factor of Delaunay triangulations of points in convex position.

Shiliang Cui, Iyad A. Kanj, Ge Xia

Comput. Geom., 2011

Improved upper bound on the stretch factor of delaunay triangulations.

Ge Xia

Proceedings of the 27th ACM Symposium on Computational Geometry, 2011

Toward the Tight Bound of the Stretch Factor of Delaunay Triangulations.

Ge Xia, Liang Zhang

Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011

2010

Improved upper bounds for vertex cover.

Jianer Chen, Iyad A. Kanj, Ge Xia

Theor. Comput. Sci., 2010

On Spanners and Lightweight Spanners of Geometric Graphs.

Iyad A. Kanj, Ljubomir Perkovic, Ge Xia

SIAM J. Comput., 2010

On the Small Cycle Transversal of Planar Graphs.

Ge Xia, Yong Zhang

Proceedings of the Graph Theoretic Concepts in Computer Science, 2010

Improved Local Algorithms for Spanner Construction.

Iyad A. Kanj, Ge Xia

Proceedings of the Algorithms for Sensor Systems, 2010

Kernelization for Cycle Transversal Problems.

Ge Xia, Yong Zhang

Proceedings of the Algorithmic Aspects in Information and Management, 2010

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 Parameterized Exponential Time Complexity.

Jianer Chen, Iyad A. Kanj, Ge Xia

Proceedings of the Theory and Applications of Models of Computation, 6th Annual Conference, 2009

Local Construction of Spanners in the 3-D Space.

Iyad A. Kanj, Ge Xia, Fenghui Zhang

Proceedings of the Distributed Computing in Sensor Systems, 2009

On the Dilation of Delaunay Triangulations of Points in Convex Position.

Shiliang Cui, Iyad A. Kanj, Ge Xia

Proceedings of the 21st Annual Canadian Conference on Computational Geometry, 2009

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

The Compatibility of Binary Characters on Phylogenetic Networks: Complexity and Parameterized Algorithms.

Iyad A. Kanj, Luay Nakhleh, Ge Xia

Algorithmica, 2008

On the Pseudo-achromatic Number Problem.

Jianer Chen, Iyad A. Kanj, Jie Meng, Ge Xia, Fenghui Zhang

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2008

Computing Lightweight Spanners Locally.

Iyad A. Kanj, Ljubomir Perkovic, Ge Xia

Proceedings of the Distributed Computing, 22nd International Symposium, 2008

On the Induced Matching Problem.

Iyad A. Kanj, Michael J. Pelsmajer, Ge Xia, Marcus Schaefer

Proceedings of the STACS 2008, 2008

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

Separability and Topology Control of Quasi Unit Disk Graphs.

Jianer Chen, Anxiao Jiang, Iyad A. Kanj, Ge Xia, Fenghui Zhang

Proceedings of the INFOCOM 2007. 26th IEEE International Conference on Computer Communications, 2007

Seeing the Trees and Their Branches in the Forest is Hard.

Iyad A. Kanj, Luay Nakhleh, Cuong Than, Ge Xia

Proceedings of the Theoretical Computer Science, 10th Italian Conference, 2007

Strictly-Localized Construction of Near-Optimal Power Spanners for Wireless Ad-Hoc Networks.

Iyad A. Kanj, Ljubomir Perkovic, Ge Xia

Proceedings of the DIALM-POMC International Workshop on Foundations of Mobile Computing, 2007

2006

Strong computational lower bounds via parameterized complexity.

Jianer Chen, Xiuzhen Huang, Iyad A. Kanj, Ge Xia

J. Comput. Syst. Sci., 2006

On the computational hardness based on linear FPT-reductions.

Jianer Chen, Xiuzhen Huang, Iyad A. Kanj, Ge Xia

J. Comb. Optim., 2006

Improved Parameterized Upper Bounds for Vertex Cover.

Jianer Chen, Iyad A. Kanj, Ge Xia

Proceedings of the Mathematical Foundations of Computer Science 2006, 2006

On the Effective Enumerability of NP Problems.

Jianer Chen, Iyad A. Kanj, Jie Meng, Ge Xia, Fenghui Zhang

Proceedings of the Parameterized and Exact Computation, Second International Workshop, 2006

Reconstructing Evolution of Natural Languages: Complexity and Parameterized Algorithms.

Iyad A. Kanj, Luay Nakhleh, Ge Xia

Proceedings of the Computing and Combinatorics, 12th Annual International Conference, 2006

2005

Parameterized algorithms and computational lower bounds: a structural approach.

Ge Xia

PhD thesis, 2005

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

Jianer Chen, Henning Fernau, Iyad A. Kanj, Ge Xia

Proceedings of the STACS 2005, 2005

<i>W</i>-Hardness Under Linear FPT-Reductions: Structural Properties and Further Applications.

Jianer Chen, Xiuzhen Huang, Iyad A. Kanj, Ge Xia

Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

2004

Linear FPT reductions and computational lower bounds.

Jianer Chen, Xiuzhen Huang, Iyad A. Kanj, Ge Xia

Proceedings of the 36th Annual ACM Symposium on Theory of Computing, 2004

Polynomial Time Approximation Schemes and Parameterized Complexity.

Jianer Chen, Xiuzhen Huang, Iyad A. Kanj, Ge Xia

Proceedings of the Mathematical Foundations of Computer Science 2004, 2004

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

Proceedings of the 19th Annual IEEE Conference on Computational Complexity (CCC 2004), 2004

2003

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

Jianer Chen, Iyad A. Kanj, Ge Xia

Proceedings of the Algorithms and Computation, 14th International Symposium, 2003

Genus Characterizes the Complexity of Graph Problems: Some Tight Results.

Jianer Chen, Iyad A. Kanj, Ljubomir Perkovic, Eric Sedgwick, Ge Xia

Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003