Ge Xia

Publication Activity (10 Years)

Years Active: 2003-2024
Publications (10 Years): 18

Top Venues

CoRR

STACS

Theor. Comput. Sci.

COCOA

Texas A&M University, College Station, USA (PHD)

Education History

Texas A&M University, College Station, USA

PHD

Publications

Jianer Chen, Qin Huang, Iyad Kanj, Ge Xia
Nearly Time-Optimal Kernelization Algorithms for the Line-Cover Problem with Big Data. Algorithmica 86 (8) (2024)
Jianer Chen, Qin Huang, Iyad Kanj, Qian Li, Ge Xia
Streaming Algorithms for Graph k-Matching with Optimal or Near-Optimal Update Time. CoRR (2023)
Haohong Li, Ge Xia
) Time FPT Algorithm for Convex Flip Distance. STACS (2023)
Jianer Chen, Qin Huang, Iyad Kanj, Ge Xia
Near-Optimal Algorithms for Point-Line Covering Problems. STACS (2022)
Haohong Li, Ge Xia
An $O(3.82^k)$ Time FPT Algorithm for Convex Flip Distance. CoRR (2022)
Jianer Chen, Qin Huang, Iyad Kanj, Ge Xia
Near-optimal algorithms for point-line fitting problems. J. Comput. Geom. 13 (1) (2022)
Jianer Chen, Qin Huang, Iyad Kanj, Ge Xia
Optimal Streaming Algorithms for Graph Matching. CoRR (2021)
Jianer Chen, Qin Huang, Iyad Kanj, Qian Li, Ge Xia
Streaming Algorithms for Graph k-Matching with Optimal or Near-Optimal Update Time. ISAAC (2021)
Jianer Chen, Qin Huang, Iyad Kanj, Ge Xia
Near-Optimal Algorithms for Point-Line Covering Problems. CoRR (2020)
Zhao An, Qilong Feng, Iyad Kanj, Ge Xia
The Complexity of Tree Partitioning. Algorithmica 82 (9) (2020)
Eduard Eiben, Isuru S. Godage, Iyad Kanj, Ge Xia
On the Problem of Covering a 3-D Terrain. AAAI (2020)
Iyad A. Kanj, Eric Sedgwick, Ge Xia
Computing the Flip Distance Between Triangulations. Discret. Comput. Geom. 58 (2) (2017)
Zhao An, Qilong Feng, Iyad A. Kanj, Ge Xia
The Complexity of Tree Partitioning. WADS (2017)
Iyad A. Kanj, Dimitrios M. Thilikos, Ge Xia
On the parameterized complexity of monotone and antimonotone weighted circuit satisfiability. Inf. Comput. 257 (2017)
Zhao An, Qilong Feng, Iyad A. Kanj, Ge Xia
The Complexity of Tree Partitioning. CoRR (2017)
Tiange Liu, Qiguang Miao, Pengfei Xu, Yubing Tong, Jianfeng Song, Ge Xia, Yun Yang, Xiaojie Zhai
A contour-line color layer separation algorithm based on fuzzy clustering and region growing. Comput. Geosci. 88 (2016)
Minghui Jiang, Ge Xia, Yong Zhang
Edge-disjoint packing of stars and cycles. Theor. Comput. Sci. 640 (2016)
Qiguang Miao, Ying Cao, Ge Xia, Maoguo Gong, Jiachen Liu, Jianfeng Song
RBoost: Label Noise-Robust Boosting Algorithm Based on a Nonconvex Loss Function and the Numerically Stable Base Learners. IEEE Trans. Neural Networks Learn. Syst. 27 (11) (2016)
Luis Barba, Prosenjit Bose, Mirela Damian, Rolf Fagerberg, Wah Loon Keng, Joseph O'Rourke, André van Renssen, Perouz Taslakian, Sander Verdonschot, Ge Xia
New and improved spanning ratios for Yao graphs. J. Comput. Geom. 6 (2) (2015)
Nicolas Bonichon, Iyad A. Kanj, Ljubomir Perkovic, Ge Xia
There are Plane Spanners of Degree 4 and Moderate Stretch Factor. Discret. Comput. Geom. 53 (3) (2015)
Minghui Jiang, Ge Xia, Yong Zhang
Edge-Disjoint Packing of Stars and Cycles. COCOA (2015)
Iyad A. Kanj, Ge Xia
Flip Distance Is in FPT Time O(n+ k * c^k). STACS (2015)
Iyad A. Kanj, Guohui Lin, Tian Liu, Weitian Tong, Ge Xia, Jinhui Xu, Boting Yang, Fenghui Zhang, Peng Zhang, Binhai Zhu
Improved parameterized and exact algorithms for cut problems on trees. Theor. Comput. Sci. 607 (2015)
Iyad A. Kanj, Ge Xia
Flip Distance is in FPT time $O(n+ k \cdot c^k)$. CoRR (2014)
Iyad A. Kanj, Guohui Lin, Tian Liu, Weitian Tong, Ge Xia, Jinhui Xu, Boting Yang, Fenghui Zhang, Peng Zhang, Binhai Zhu
Algorithms for Cut Problems on Trees. COCOA (2014)
Nicolas Bonichon, Iyad A. Kanj, Ljubomir Perkovic, Ge Xia
There are Plane Spanners of Maximum Degree 4. CoRR (2014)
Iyad A. Kanj, Ge Xia
On certain geometric properties of the Yao-Yao graphs. J. Comb. Optim. 27 (1) (2014)
Nicolas Bonichon, Iyad A. Kanj, Ljubomir Perkovic, Ge Xia
There are Plane Spanners of Maximum Degree 4. SoCG (2014)
Luis Barba, Prosenjit Bose, Mirela Damian, Rolf Fagerberg, Wah Loon Keng, Joseph O'Rourke, André van Renssen, Perouz Taslakian, Sander Verdonschot, Ge Xia
New and Improved Spanning Ratios for Yao Graphs. SoCG (2014)
Iyad A. Kanj, Guohui Lin, Tian Liu, Weitian Tong, Ge Xia, Jinhui Xu, Boting Yang, Fenghui Zhang, Peng Zhang, Binhai Zhu
Algorithms for Cut Problems on Trees CoRR (2013)
Wah Loon Keng, Ge Xia
The Yao Graph $Y_5$ is a Spanner. CoRR (2013)
Iyad A. Kanj, Ge Xia
When Is Weighted Satisfiability FPT? WADS (2013)
Ge Xia
The Stretch Factor of the Delaunay Triangulation Is Less than 1.998. SIAM J. Comput. 42 (4) (2013)
Iyad A. Kanj, Ge Xia, Binhai Zhu
The Radiation Hybrid Map Construction Problem Is FPT. ISBRA (2013)
Jianer Chen, Iyad A. Kanj, Jie Meng, Ge Xia, Fenghui Zhang
algorithms. Theor. Comput. Sci. 470 (2013)
Iyad A. Kanj, Ge Xia
Improved local algorithms for spanner construction. Theor. Comput. Sci. 453 (2012)
Ge Xia, Yong Zhang
Kernelization for cycle transversal problems. Discret. Appl. Math. 160 (7-8) (2012)
Jonathan P. Jenkins, Iyad A. Kanj, Ge Xia, Fenghui Zhang
Local Construction of Spanners in the 3D Space. IEEE Trans. Mob. Comput. 11 (7) (2012)
Iyad A. Kanj, Ge Xia
On Certain Geometric Properties of the Yao-Yao Graphs. COCOA (2012)
Ge Xia, Liang Zhang
Toward the Tight Bound of the Stretch Factor of Delaunay Triangulations. CCCG (2011)
Iyad A. Kanj, Michael J. Pelsmajer, Marcus Schaefer, Ge Xia
On the induced matching problem. J. Comput. Syst. Sci. 77 (6) (2011)
Shiliang Cui, Iyad A. Kanj, Ge Xia
On the stretch factor of Delaunay triangulations of points in convex position. Comput. Geom. 44 (2) (2011)
Ge Xia, Yong Zhang
On the small cycle transversal of planar graphs. Theor. Comput. Sci. 412 (29) (2011)
Iyad A. Kanj, Ge Xia
What makes normalized weighted satisfiability tractable CoRR (2011)
Jianer Chen, Anxiao Jiang, Iyad A. Kanj, Ge Xia, Fenghui Zhang
Separability and topology control of quasi unit disk graphs. Wirel. Networks 17 (1) (2011)
Ge Xia
Improved upper bound on the stretch factor of delaunay triangulations. SCG (2011)
Ge Xia
The Stretch Factor of the Delaunay Triangulation Is Less Than 1.998 CoRR (2011)
Ge Xia, Yong Zhang
On the Small Cycle Transversal of Planar Graphs. WG (2010)
Ge Xia, Yong Zhang
Kernelization for Cycle Transversal Problems. AAIM (2010)
Jianer Chen, Iyad A. Kanj, Ge Xia
Improved upper bounds for vertex cover. Theor. Comput. Sci. 411 (40-42) (2010)
Iyad A. Kanj, Ljubomir Perkovic, Ge Xia
On Spanners and Lightweight Spanners of Geometric Graphs. SIAM J. Comput. 39 (6) (2010)
Iyad A. Kanj, Ge Xia
Improved Local Algorithms for Spanner Construction. ALGOSENSORS (2010)
Jianer Chen, Iyad A. Kanj, Jie Meng, Ge Xia, Fenghui Zhang
On the pseudo-achromatic number problem. Theor. Comput. Sci. 410 (8-10) (2009)
Jianer Chen, Iyad A. Kanj, Ge Xia
On Parameterized Exponential Time Complexity. TAMC (2009)
Iyad A. Kanj, Ge Xia, Fenghui Zhang
Local Construction of Spanners in the 3-D Space. DCOSS (2009)
Iyad A. Kanj, Ljubomir Perkovic, Ge Xia
Local Construction of Near-Optimal Power Spanners for Wireless Ad Hoc Networks. IEEE Trans. Mob. Comput. 8 (4) (2009)
Jianer Chen, Iyad A. Kanj, Ge Xia
On parameterized exponential time complexity. Theor. Comput. Sci. 410 (27-29) (2009)
Shiliang Cui, Iyad A. Kanj, Ge Xia
On the Dilation of Delaunay Triangulations of Points in Convex Position. CCCG (2009)
Iyad A. Kanj, Luay Nakhleh, Cuong Than, Ge Xia
Seeing the trees and their branches in the network is hard. Theor. Comput. Sci. 401 (1-3) (2008)
Iyad A. Kanj, Luay Nakhleh, Ge Xia
The Compatibility of Binary Characters on Phylogenetic Networks: Complexity and Parameterized Algorithms. Algorithmica 51 (2) (2008)
Iyad A. Kanj, Michael J. Pelsmajer, Ge Xia, Marcus Schaefer
On the Induced Matching Problem. STACS (2008)
Iyad A. Kanj, Ljubomir Perkovic, Ge Xia
Computing Lightweight Spanners Locally. DISC (2008)
Jianer Chen, Iyad A. Kanj, Jie Meng, Ge Xia, Fenghui Zhang
On the Pseudo-achromatic Number Problem. WG (2008)
Jianer Chen, Anxiao Jiang, Iyad A. Kanj, Ge Xia, Fenghui Zhang
Separability and Topology Control of Quasi Unit Disk Graphs. INFOCOM (2007)
Iyad A. Kanj, Ljubomir Perkovic, Ge Xia
Strictly-Localized Construction of Near-Optimal Power Spanners for Wireless Ad-Hoc Networks. DIALM-POMC (2007)
Iyad A. Kanj, Luay Nakhleh, Cuong Than, Ge Xia
Seeing the Trees and Their Branches in the Forest is Hard. ICTCS (2007)
Jianer Chen, Iyad A. Kanj, Ljubomir Perkovic, Eric Sedgwick, Ge Xia
Genus characterizes the complexity of certain graph problems: Some tight results. J. Comput. Syst. Sci. 73 (6) (2007)
Jianer Chen, Xiuzhen Huang, Iyad A. Kanj, Ge Xia
Polynomial time approximation schemes and parameterized complexity. Discret. Appl. Math. 155 (2) (2007)
Jianer Chen, Henning Fernau, Iyad A. Kanj, Ge Xia
Parametric Duality and Kernelization: Lower Bounds and Upper Bounds on Kernel Size. SIAM J. Comput. 37 (4) (2007)
Iyad A. Kanj, Luay Nakhleh, Ge Xia
Reconstructing Evolution of Natural Languages: Complexity and Parameterized Algorithms. COCOON (2006)
Jianer Chen, Xiuzhen Huang, Iyad A. Kanj, Ge Xia
On the computational hardness based on linear FPT-reductions. J. Comb. Optim. 11 (2) (2006)
Jianer Chen, Iyad A. Kanj, Jie Meng, Ge Xia, Fenghui Zhang
On the Effective Enumerability of NP Problems. IWPEC (2006)
Jianer Chen, Iyad A. Kanj, Ge Xia
Improved Parameterized Upper Bounds for Vertex Cover. MFCS (2006)
Jianer Chen, Xiuzhen Huang, Iyad A. Kanj, Ge Xia
Strong computational lower bounds via parameterized complexity. J. Comput. Syst. Sci. 72 (8) (2006)
Jianer Chen, Iyad A. Kanj, Ge Xia
Labeled Search Trees and Amortized Analysis: Improved Upper Bounds for NP-Hard Problems. Algorithmica 43 (4) (2005)
Jianer Chen, Xiuzhen Huang, Iyad A. Kanj, Ge Xia
-Hardness Under Linear FPT-Reductions: Structural Properties and Further Applications. COCOON (2005)
Jianer Chen, Benny Chor, Mike Fellows, Xiuzhen Huang, David W. Juedes, Iyad A. Kanj, Ge Xia
Tight lower bounds for certain parameterized NP-hard problems. Inf. Comput. 201 (2) (2005)
Jianer Chen, Henning Fernau, Iyad A. Kanj, Ge Xia
Parametric Duality and Kernelization: Lower Bounds and Upper Bounds on Kernel Size. STACS (2005)
Jianer Chen, Xiuzhen Huang, Iyad A. Kanj, Ge Xia
Polynomial Time Approximation Schemes and Parameterized Complexity. MFCS (2004)
Jianer Chen, Xiuzhen Huang, Iyad A. Kanj, Ge Xia
Linear FPT reductions and computational lower bounds. STOC (2004)
Jianer Chen, Benny Chor, Mike Fellows, Xiuzhen Huang, David W. Juedes, Iyad A. Kanj, Ge Xia
Tight Lower Bounds for Certain Parameterized NP-Hard Problems. Computational Complexity Conference (2004)
Jianer Chen, Iyad A. Kanj, Ge Xia
Labeled Search Trees and Amortized Analysis: Improved Upper Bounds for NP-Hard Problems. ISAAC (2003)
Jianer Chen, Iyad A. Kanj, Ljubomir Perkovic, Eric Sedgwick, Ge Xia
Genus Characterizes the Complexity of Graph Problems: Some Tight Results. ICALP (2003)

Ge Xia.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Ge Xia