The SCEAS System
| |||||||

## Search the dblp DataBase
Xiuzhen Huang:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Yuan Lin, Jeff Jenness, Xiuzhen Huang
**Parameterized Computation of LCS for Two Sequences.**[Citation Graph (0, 0)][DBLP] BIOCOMP, 2006, pp:31-40 [Conf] - 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] - Xiuzhen Huang
**Lower Bounds and Parameterized Approach for Longest Common Subsequence.**[Citation Graph (0, 0)][DBLP] COCOON, 2006, pp:136-145 [Conf] - Xiuzhen Huang
**Negative-Weight Cycle Algorithms.**[Citation Graph (0, 0)][DBLP] FCS, 2006, pp:109-115 [Conf] - Xiuzhen Huang, Jing Lai
**Maximum Common Subgraph: Upper Bound and Lower Bound Results.**[Citation Graph (0, 0)][DBLP] IMSCCS (1), 2006, pp:40-47 [Conf] - Liming Cai, Xiuzhen Huang
**Fixed-Parameter Approximation: Conceptual Framework and Approximability Results.**[Citation Graph (0, 0)][DBLP] IWPEC, 2006, pp:96-108 [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, 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] - Yinglei Song, Chunmei Liu, Xiuzhen Huang, Russell L. Malmberg, Ying Xu, Liming Cai
**Efficient Parameterized Algorithm for Biopolymer Structure-Sequence Alignment.**[Citation Graph (0, 0)][DBLP] WABI, 2005, pp:376-388 [Conf] - 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] - Yinglei Song, Chunmei Liu, Xiuzhen Huang, Russell L. Malmberg, Ying Xu, Liming Cai
**Efficient Parameterized Algorithms for Biopolymer Structure-Sequence Alignment.**[Citation Graph (0, 0)][DBLP] IEEE/ACM Trans. Comput. Biology Bioinform., 2006, v:3, n:4, pp:423-432 [Journal] **On PTAS for Planar Graph Problems.**[Citation Graph (, )][DBLP]**K-Means Clustering Algorithms: Implementation and Comparison.**[Citation Graph (, )][DBLP]**Parameterized Graph Problems in Computational Biology.**[Citation Graph (, )][DBLP]**Fixed-Parameter Approximation: Conceptual Framework and Approximability Results.**[Citation Graph (, )][DBLP]**Maximum common subgraph: some upper bound and lower bound results.**[Citation Graph (, )][DBLP]**A practical comparison of two K-Means clustering algorithms.**[Citation Graph (, )][DBLP]**Parameterized Complexity and Biopolymer Sequence Comparison.**[Citation Graph (, )][DBLP]
Search in 0.258secs, Finished in 0.260secs | |||||||

| |||||||

| |||||||

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