The SCEAS System
| |||||||

## Search the dblp DataBase
Ge Xia:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- 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.**[Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 2004, pp:150-160 [Conf] - Jianer Chen, Xiuzhen Huang, Iyad A. Kanj, Ge Xia
[Citation Graph (0, 0)][DBLP]*W*-Hardness Under Linear FPT-Reductions: Structural Properties and Further Applications. COCOON, 2005, pp:975-984 [Conf] - Iyad A. Kanj, Luay Nakhleh, Ge Xia
**Reconstructing Evolution of Natural Languages: Complexity and Parameterized Algorithms.**[Citation Graph (0, 0)][DBLP] COCOON, 2006, pp:299-308 [Conf] - Jianer Chen, Iyad A. Kanj, Ljubomir Perkovic, Eric Sedgwick, Ge Xia
**Genus Characterizes the Complexity of Graph Problems: Some Tight Results.**[Citation Graph (0, 0)][DBLP] ICALP, 2003, pp:845-856 [Conf] - Jianer Chen, Iyad A. Kanj, Ge Xia
**Labeled Search Trees and Amortized Analysis: Improved Upper Bounds for NP-Hard Problems.**[Citation Graph (0, 0)][DBLP] ISAAC, 2003, pp:148-157 [Conf] - Jianer Chen, Iyad A. Kanj, Jie Meng, Ge Xia, Fenghui Zhang
**On the Effective Enumerability of NP Problems.**[Citation Graph (0, 0)][DBLP] IWPEC, 2006, pp:215-226 [Conf] - Jianer Chen, Xiuzhen Huang, Iyad A. Kanj, Ge Xia
**Polynomial Time Approximation Schemes and Parameterized Complexity.**[Citation Graph (0, 0)][DBLP] MFCS, 2004, pp:500-512 [Conf] - Jianer Chen, Iyad A. Kanj, Ge Xia
**Improved Parameterized Upper Bounds for Vertex Cover.**[Citation Graph (0, 0)][DBLP] MFCS, 2006, pp:238-249 [Conf] - Jianer Chen, Henning Fernau, Iyad A. Kanj, Ge Xia
**Parametric Duality and Kernelization: Lower Bounds and Upper Bounds on Kernel Size.**[Citation Graph (0, 0)][DBLP] STACS, 2005, pp:269-280 [Conf] - Jianer Chen, Xiuzhen Huang, Iyad A. Kanj, Ge Xia
**Linear FPT reductions and computational lower bounds.**[Citation Graph (0, 0)][DBLP] STOC, 2004, pp:212-221 [Conf] - Jianer Chen, Iyad A. Kanj, Ge Xia
**Labeled Search Trees and Amortized Analysis: Improved Upper Bounds for NP-Hard Problems.**[Citation Graph (0, 0)][DBLP] Algorithmica, 2005, v:43, n:4, pp:245-273 [Journal] - Jianer Chen, Xiuzhen Huang, Iyad A. Kanj, Ge Xia
**Polynomial time approximation schemes and parameterized complexity.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2007, v:155, n:2, pp:180-193 [Journal] - 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.**[Citation Graph (0, 0)][DBLP] Inf. Comput., 2005, v:201, n:2, pp:216-231 [Journal] - Jianer Chen, Xiuzhen Huang, Iyad A. Kanj, Ge Xia
**On the computational hardness based on linear FPT-reductions.**[Citation Graph (0, 0)][DBLP] J. Comb. Optim., 2006, v:11, n:2, pp:231-247 [Journal] - Jianer Chen, Xiuzhen Huang, Iyad A. Kanj, Ge Xia
**Strong computational lower bounds via parameterized complexity.**[Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 2006, v:72, n:8, pp:1346-1367 [Journal] - Jianer Chen, Anxiao Jiang, Iyad A. Kanj, Ge Xia, Fenghui Zhang
**Separability and Topology Control of Quasi Unit Disk Graphs.**[Citation Graph (0, 0)][DBLP] INFOCOM, 2007, pp:2225-2233 [Conf] - Jianer Chen, Iyad A. Kanj, Ljubomir Perkovic, Eric Sedgwick, Ge Xia
**Genus characterizes the complexity of certain graph problems: Some tight results.**[Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 2007, v:73, n:6, pp:892-907 [Journal] **Kernelization for Cycle Transversal Problems.**[Citation Graph (, )][DBLP]**On the Dilation of Delaunay Triangulations of Points in Convex Position.**[Citation Graph (, )][DBLP]**Local Construction of Spanners in the 3-D Space.**[Citation Graph (, )][DBLP]**Strictly-Localized Construction of Near-Optimal Power Spanners for Wireless Ad-Hoc Networks.**[Citation Graph (, )][DBLP]**Seeing the Trees and Their Branches in the Forest is Hard.**[Citation Graph (, )][DBLP]**On the Induced Matching Problem.**[Citation Graph (, )][DBLP]**On Parameterized Exponential Time Complexity.**[Citation Graph (, )][DBLP]**Computing Lightweight Spanners Locally.**[Citation Graph (, )][DBLP]**On the Pseudo-achromatic Number Problem.**[Citation Graph (, )][DBLP]**The Compatibility of Binary Characters on Phylogenetic Networks: Complexity and Parameterized Algorithms.**[Citation Graph (, )][DBLP]
Search in 0.004secs, Finished in 0.006secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |