Ge Xia

	2009
30		Iyad A. Kanj, Ge Xia, Fenghui Zhang: Local Construction of Spanners in the 3-D Space. DCOSS 2009: 315-328
29		Jianer Chen, Iyad A. Kanj, Ge Xia: On Parameterized Exponential Time Complexity. TAMC 2009: 168-177
28		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): 460-474 (2009)
27		Jianer Chen, Iyad A. Kanj, Ge Xia: On parameterized exponential time complexity. Theor. Comput. Sci. 410(27-29): 2641-2648 (2009)
26		Jianer Chen, Iyad A. Kanj, Jie Meng, Ge Xia, Fenghui Zhang: On the pseudo-achromatic number problem. Theor. Comput. Sci. 410(8-10): 818-829 (2009)
	2008
25		Iyad A. Kanj, Ljubomir Perkovic, Ge Xia: Computing Lightweight Spanners Locally. DISC 2008: 365-378
24		Iyad A. Kanj, Michael J. Pelsmajer, Ge Xia, Marcus Schaefer: On the Induced Matching Problem. STACS 2008: 397-408
23		Jianer Chen, Iyad A. Kanj, Jie Meng, Ge Xia, Fenghui Zhang: On the Pseudo-achromatic Number Problem. WG 2008: 78-89
22		Iyad A. Kanj, Luay Nakhleh, Ge Xia: The Compatibility of Binary Characters on Phylogenetic Networks: Complexity and Parameterized Algorithms. Algorithmica 51(2): 99-128 (2008)
21		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): 153-164 (2008)
	2007
20		Iyad A. Kanj, Ljubomir Perkovic, Ge Xia: Strictly-Localized Construction of Near-Optimal Power Spanners for Wireless Ad-Hoc Networks. DIALM-POMC 2007
19		Iyad A. Kanj, Luay Nakhleh, Cuong Than, Ge Xia: Seeing the Trees and Their Branches in the Forest is Hard. ICTCS 2007: 82-93
18		Jianer Chen, Anxiao Jiang, Iyad A. Kanj, Ge Xia, Fenghui Zhang: Separability and Topology Control of Quasi Unit Disk Graphs. INFOCOM 2007: 2225-2233
17		Jianer Chen, Xiuzhen Huang, Iyad A. Kanj, Ge Xia: Polynomial time approximation schemes and parameterized complexity. Discrete Applied Mathematics 155(2): 180-193 (2007)
16		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): 892-907 (2007)
15		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): 1077-1106 (2007)
	2006
14		Iyad A. Kanj, Luay Nakhleh, Ge Xia: Reconstructing Evolution of Natural Languages: Complexity and Parameterized Algorithms. COCOON 2006: 299-308
13		Jianer Chen, Iyad A. Kanj, Jie Meng, Ge Xia, Fenghui Zhang: On the Effective Enumerability of NP Problems. IWPEC 2006: 215-226
12		Jianer Chen, Iyad A. Kanj, Ge Xia: Improved Parameterized Upper Bounds for Vertex Cover. MFCS 2006: 238-249
11		Jianer Chen, Xiuzhen Huang, Iyad A. Kanj, Ge Xia: On the computational hardness based on linear FPT-reductions. J. Comb. Optim. 11(2): 231-247 (2006)
10		Jianer Chen, Xiuzhen Huang, Iyad A. Kanj, Ge Xia: Strong computational lower bounds via parameterized complexity. J. Comput. Syst. Sci. 72(8): 1346-1367 (2006)
	2005
9		Jianer Chen, Xiuzhen Huang, Iyad A. Kanj, Ge Xia: W-Hardness Under Linear FPT-Reductions: Structural Properties and Further Applications. COCOON 2005: 975-984
8		Jianer Chen, Henning Fernau, Iyad A. Kanj, Ge Xia: Parametric Duality and Kernelization: Lower Bounds and Upper Bounds on Kernel Size. STACS 2005: 269-280
7		Jianer Chen, Iyad A. Kanj, Ge Xia: Labeled Search Trees and Amortized Analysis: Improved Upper Bounds for NP-Hard Problems. Algorithmica 43(4): 245-273 (2005)
6		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): 216-231 (2005)
	2004
5		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. IEEE Conference on Computational Complexity 2004: 150-160
4		Jianer Chen, Xiuzhen Huang, Iyad A. Kanj, Ge Xia: Polynomial Time Approximation Schemes and Parameterized Complexity. MFCS 2004: 500-512
3		Jianer Chen, Xiuzhen Huang, Iyad A. Kanj, Ge Xia: Linear FPT reductions and computational lower bounds. STOC 2004: 212-221
	2003
2		Jianer Chen, Iyad A. Kanj, Ljubomir Perkovic, Eric Sedgwick, Ge Xia: Genus Characterizes the Complexity of Graph Problems: Some Tight Results. ICALP 2003: 845-856
1		Jianer Chen, Iyad A. Kanj, Ge Xia: Labeled Search Trees and Amortized Analysis: Improved Upper Bounds for NP-Hard Problems. ISAAC 2003: 148-157

Coauthor Index

1	Jianer Chen	[1] [2] [3] [4] [5] [6] [7] [8] [9] [10] [11] [12] [13] [15] [16] [17] [18] [23] [26] [27] [29]
2	Benny Chor	[5] [6]
3	Michael R. Fellows (Mike Fellows)	[5] [6]
4	Henning Fernau	[8] [15]
5	Xiuzhen Huang	[3] [4] [5] [6] [9] [10] [11] [17]
6	Anxiao Jiang	[18]
7	David W. Juedes	[5] [6]
8	Iyad A. Kanj	[1] [2] [3] [4] [5] [6] [7] [8] [9] [10] [11] [12] [13] [14] [15] [16] [17] [18] [19] [20] [21] [22] [23] [24] [25] [26] [27] [28] [29] [30]
9	Jie Meng	[13] [23] [26]
10	Luay Nakhleh	[14] [19] [21] [22]
11	Michael J. Pelsmajer	[24]
12	Ljubomir Perkovic	[2] [16] [20] [25] [28]
13	Marcus Schaefer	[24]
14	Eric Sedgwick	[2] [16]
15	Cuong Than	[19] [21]
16	Fenghui Zhang	[13] [18] [23] [26] [30]