| 2023 | STACS | An 𝒪(3.82 | Haohong Li, Ge Xia |
| 2022 | STACS | Near-Optimal Algorithms for Point-Line Covering Problems. | Jianer Chen, Qin Huang, Iyad Kanj, Ge Xia |
| 2021 | ISAAC | Streaming Algorithms for Graph k-Matching with Optimal or Near-Optimal Update Time. | Jianer Chen, Qin Huang, Iyad Kanj, Qian Li, Ge Xia |
| 2020 | AAAI | On the Problem of Covering a 3-D Terrain. | Eduard Eiben, Isuru S. Godage, Iyad Kanj, Ge Xia |
| 2017 | WADS | The Complexity of Tree Partitioning. | Zhao An, Qilong Feng, Iyad A. Kanj, Ge Xia |
| 2015 | COCOA | Edge-Disjoint Packing of Stars and Cycles. | Minghui Jiang, Ge Xia, Yong Zhang |
| 2015 | STACS | Flip Distance Is in FPT Time O(n+ k * c^k). | Iyad A. Kanj, Ge Xia |
| 2014 | COCOA | 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 |
| 2013 | WADS | When Is Weighted Satisfiability FPT? | Iyad A. Kanj, Ge Xia |
| 2012 | COCOA | On Certain Geometric Properties of the Yao-Yao Graphs. | Iyad A. Kanj, Ge Xia |
| 2010 | AAIM | Kernelization for Cycle Transversal Problems. | Ge Xia, Yong Zhang |
| 2010 | Algosensors | Improved Local Algorithms for Spanner Construction. | Iyad A. Kanj, Ge Xia |
| 2010 | WG | On the Small Cycle Transversal of Planar Graphs. | Ge Xia, Yong Zhang |
| 2009 | DCOSS | Local Construction of Spanners in the 3-D Space. | Iyad A. Kanj, Ge Xia, Fenghui Zhang |
| 2009 | TAMC | On Parameterized Exponential Time Complexity. | Jianer Chen, Iyad A. Kanj, Ge Xia |
| 2008 | STACS | On the Induced Matching Problem. | Iyad A. Kanj, Michael J. Pelsmajer, Ge Xia, Marcus Schaefer |
| 2008 | WG | On the Pseudo-achromatic Number Problem. | Jianer Chen, Iyad A. Kanj, Jie Meng, Ge Xia, Fenghui Zhang |
| 2007 | INFOCOM | Separability and Topology Control of Quasi Unit Disk Graphs. | Jianer Chen, Anxiao Jiang, Iyad A. Kanj, Ge Xia, Fenghui Zhang |
| 2006 | COCOON | Reconstructing Evolution of Natural Languages: Complexity and Parameterized Algorithms. | Iyad A. Kanj, Luay Nakhleh, Ge Xia |
| 2006 | MFCS | Improved Parameterized Upper Bounds for Vertex Cover. | Jianer Chen, Iyad A. Kanj, Ge Xia |
| 2005 | COCOON | Untitled record | Jianer Chen, Xiuzhen Huang, Iyad A. Kanj, Ge Xia |
| 2005 | STACS | Parametric Duality and Kernelization: Lower Bounds and Upper Bounds on Kernel Size. | Jianer Chen, Henning Fernau, Iyad A. Kanj, Ge Xia |
| 2004 | MFCS | Polynomial Time Approximation Schemes and Parameterized Complexity. | Jianer Chen, Xiuzhen Huang, Iyad A. Kanj, Ge Xia |
| 2004 | STOC | Linear FPT reductions and computational lower bounds. | Jianer Chen, Xiuzhen Huang, Iyad A. Kanj, Ge Xia |
| 2003 | ICALP | Genus Characterizes the Complexity of Graph Problems: Some Tight Results. | Jianer Chen, Iyad A. Kanj, Ljubomir Perkovic, Eric Sedgwick, Ge Xia |
| 2003 | ISAAC | Labeled Search Trees and Amortized Analysis: Improved Upper Bounds for NP-Hard Problems. | Jianer Chen, Iyad A. Kanj, Ge Xia |