The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Ge Xia: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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]
  2. Jianer Chen, Xiuzhen Huang, Iyad A. Kanj, Ge Xia
    W-Hardness Under Linear FPT-Reductions: Structural Properties and Further Applications. [Citation Graph (0, 0)][DBLP]
    COCOON, 2005, pp:975-984 [Conf]
  3. 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]
  4. 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]
  5. 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]
  6. 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]
  7. 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]
  8. 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]
  9. 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]
  10. 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]
  11. 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]
  12. 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]
  13. 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]
  14. 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]
  15. 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]
  16. 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]
  17. 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]

  18. Kernelization for Cycle Transversal Problems. [Citation Graph (, )][DBLP]


  19. On the Dilation of Delaunay Triangulations of Points in Convex Position. [Citation Graph (, )][DBLP]


  20. Local Construction of Spanners in the 3-D Space. [Citation Graph (, )][DBLP]


  21. Strictly-Localized Construction of Near-Optimal Power Spanners for Wireless Ad-Hoc Networks. [Citation Graph (, )][DBLP]


  22. Seeing the Trees and Their Branches in the Forest is Hard. [Citation Graph (, )][DBLP]


  23. On the Induced Matching Problem. [Citation Graph (, )][DBLP]


  24. On Parameterized Exponential Time Complexity. [Citation Graph (, )][DBLP]


  25. Computing Lightweight Spanners Locally. [Citation Graph (, )][DBLP]


  26. On the Pseudo-achromatic Number Problem. [Citation Graph (, )][DBLP]


  27. The Compatibility of Binary Characters on Phylogenetic Networks: Complexity and Parameterized Algorithms. [Citation Graph (, )][DBLP]


Search in 0.037secs, Finished in 0.039secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002