Recent Publications:

2006:

• Strong Computational Lower Bounds via Parameterized Complexity,
  J. Chen, X. Huang, I. Kanj, and G. Xia,
  Journal paper accepted to Journal of Computer and System Sciences, 2006.

• Efficient Biopolymer Structure-sequence Alignment,
  Y. Song, C. Liu, X. Huang, R. Malmberg, Y. Xu and L. Cai,
  Journal paper accepted to IEEE/ACM Transactions on Computational Biology and Bioinformatics, 2006.

• Maximum Common Subgraph: Some Upper Bound and Lower Bound Results,
  X. Huang, J. Lai and S. F. Jennings,
  Journal paper accepted to BMC Bioinformatics, 2006.

• Parameterized Computation for Biopolymer Sequence Problems,
  L. Cai, X. Huang, C. Liu, F. Rosamond and Y. Song,
  The Computer Journal, Special Issue in Parameterized Complexity, to appear, 2006.

• Protein Tertiary Structure Prediction via Protein Threading: a Survey,
  X. Huang, L. Cai, and E. Hood,
  Plant Biotechnology Journal, to appear, 2006.

• Fixed-Parameter Approximation: Conceptual Framework and Approximability Results,
  L. Cai and X. Huang
  Proceedings of International Workshop on Parameterized and Exact Computation (IWPEC'06),
  Lecture Notes in computer Science 4169, pp. 96-108, 2006.

• Lower Bounds and Parameterized Approach for Longest Common Subsequence,
  X. Huang,
  12th Annual International Computing and Combinatorics Conference (COCOON'06),
  Lecture Notes in computer Science 4112, pp. 136-145, 2006.

• On PTAS for Planar Graph Problems,
  X. Huang and J. Chen,
  The 4th IFIP International Conference on Theoretical Computer Science,
  Published by SSBM (Springer Science and Business Media), pp. 299-314, 2006.

• Maximum Common Subgraph: Upper Bound and Lower Bound Results,
  X. Huang and J. Lai,
  Proceedings of Symposium of Computations in Bioinformatics and Bioscience (SCBB'06),
  IEEE Computer Society, pp. 40-47, 2006.

• Negative Result on Maximum Common Subgraph of Two Graphs,
  X. Huang,
  14th Annual International conference on Intelligent Systems for Molecular Biology (ISMB'06), poster, 2006.

• Parameterized Computation of LCS for Two Sequences,
  Y. Lin, J. Jenness, and X. Huang
  Proceedings of the International Conference on Bioinformatics & Computational Biology (BIOCOMP'06), 2006.

• Structural Study on Proteins in Maize Silk,
  X. Huang,
  Proceedings of the 4th World Congress of Computers in Agriculture (WCCA'06), pp. 803-806, 2006.

• Negative-Weight Cycle Algorithms,
  X. Huang,
  Proceedings of the 2006 International Conference on Foundations of Computer Science (FCS'06), 2006.

2005:

• On the computational hardness based on linear FPT-reductions,
  J. Chen, X. Huang, I. Kanj, and G. Xia,
  Journal paper accepted to Journal of Combinatorial Optimization, 2005.

• Polynomial time approximation schemes and parameterized complexity,
  J. Chen, X. Huang, I Kanj and G. Xia,
  Journal paper accepted to Discrete Applied Mathematics, 2005.

• Tight lower bounds for certain parameterized NP-hard problems,
  J. Chen, B. Chor, M. Fellows, X. Huang, D. Juedes, I. Kanj and G. Xia,
  Journal paper in Information and Computation 201, pp. 216-231, 2005.

• Efficient parameterized algorithm for biopolymer structure-sequence alignment,
  Y. Song, C. Liu, X. Huang, R. Malmberg, Y. Xu, and L. Cai,
  in procceedings of 5th Workshop on Algorithms in BioInformatics (WABI 2005), Spain,
  Lecture Notes in Bioinformatics (LNBI), vol. 3692, pp. 376-388, 2005.

• W-hardness under linear FPT-reductions: structural properties and further applications,
  J. Chen, X. Huang, I Kanj and G. Xia,
  in proceedings of the Eleventh International Computing and Combinatorics Conference (COCOON 2005),
  Lecture Notes in Computer Science, vol. 3595, pp. 975-984, 2005.

• Applications of parameterized computation in computational biology,
  X. Huang,
  2005 Biotechnology Conference, Technical proceedings, computational biology, ISBN 0-9767958-0-6, vol. 1, pp. 524-527, 2005.

• W-hardness under linear FPT-reductions: structural properties and further applications,
  J. Chen, X. Huang, I Kanj and G. Xia,
  Technical Report, Department of Computer Science, Texas A&M University, 2005.

2004:

• Linear FPT Reductions and Computational Lower Bounds (extended abstract),
  J. Chen, X. Huang, I Kanj and G. Xia,
  in proceedings of the 36th ACM Symposium on Theory of Computing (STOC 2004), pp. 212-221, 2004.

• Tight Lower Bounds for Certain Parameterized NP-hard Problems,
  J. Chen, B. Chor, M. Fellows, X. Huang, D. Juedes, I. Kanj and G. Xia,
  in proceedings of the 19th IEEE Conference on Computational Complexity (CCC 2004), pp. 150-160, 2004.

• Polynomial Time Approximation Schemes and Parameterized Complexity,
  J. Chen, X. Huang, I Kanj and G. Xia,
  in proceedings of the 29th International Symposium on Mathematical Foundations of Computer Science (MFCS 2004),
  Lecture Notes in Computer Science, vol. 3153, pp. 500-512, 2004.

• Strong computational lower bounds via parameterized complexity,
  J. Chen, X. Huang, I Kanj and G. Xia,
  Technical Report, Department of Computer Science, Texas A&M University, 2004.

Recent Talks:

• Efficient Algorithms for Protein Tertiary Structure Prediction, At University of Arkansas for Medical Sciences (UAMS), 2006.

• Structure-Sequence Alignment, at University of Arkansas at Fayetteville (UAF), 2006.

• Structural Study on Proteins in Maize Silk, at the 4th World Congress of Computers in Agriculture, 2006.

• Parameterized Computation in Bioinformatics, at Arkansas Biosciences Institute (ABI), Arkansas State University, 2005.

• Linear FPT-Reductions: Structural Properties and Applications, at the Eleventh International Computing and Combinatorics Conference (COCOON 2005).

• Parameterized Computation and Bioinformatics, at School of Computer Science and Technology, Shandong University, 2005.

• Vertex Cover and Clique - A Flavor of Bioinformatics, at School of Computer Information and Engineering, Shandong University of Finance, 2005.

• Finding Maximum Common Subgraph, X. Huang, at Combinatorics in the South-Central U.S. Annual Conference, 2005.