Fixed-Parameter Algorithms for Graph-Modeled Data Clustering - Clustering Challenges in Biological Network - page 25

Cardell. A network-based analysis of the late-phase reaction of the skin. The Journal
of Allergy and Clinical Immunology , 118(1):220-225, 2006.

[10] S. Butenko and W. E. Wilhelm. Clique-detection models in computational biochem-

istry and genomics. European Journal of Operational Research , 173(1):1-17, 2006.

[11] L. Cai, J. Chen, R. Downey, and M. R. Fellows. Advice classes of parameterized

tractability. Annals of Pure and Applied Logic , 84:119-138, 1997.

[12] L. Sunil Chandran and Fabrizio Grandoni. Refined memorisation for Vertex Cover.

Information Processing Letters , 93(3):125-131, 2005.

[13] M. Charikar, V. Guruswami, and A. Wirth. Clustering with qualitative information.

Journal of Computer and System Sciences , 71(3):360-383, 2005.

[14] J. Cheetham, F. K. H. A. Dehne, A. Rau-Chaplin, U. Stege, and P. J. Taillon. Solving

large FPT problems on coarse-grained parallel machines. Journal of Computer and
System Sciences , 67(4):691-706, 2003.

[15] J. Chen, I. A. Kanj, and G. Xia. Improved parameterized upper bounds for Vertex

Cover. In Proc. 31st MFCS , volume 4162 of LNCS , pages 238-249. Springer, 2006.

[16] E. J. Chesler, L. Lu, S. Shou, Y. Qu, J. Gu, J. Wang, H. C. Hsu, J. D. Mountz, N. E.

Baldwin, M. A. Langston, D. W. Threadgill, K. F. Manly, and R. W. Williams. Com-
plex trait analysis of gene expression uncovers polygenic and pleiotropic networks
that modulate nervous system function. Nature Genetics , 37:233-242, 2005.

[17] M. Chlebık and J. Chlebıkova. Improvement of Nemhauser-Trotter theorem and its

applications in parameterized complexity. In Proc. 9th SWAT , volume 3111 of LNCS ,
pages 174-186. Springer, 2004.

[18] B. Chor, M. R. Fellows, and D. W. Juedes. Linear kernels in linear time, or how

to save k colors in O ( n 2 ) steps. In Proc. 30th WG , volume 3353 of LNCS , pages
257-269. Springer, 2004.

[19] T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms .

MIT Press, 2nd edition, 2001.

[20] P. Damaschke. On the fixed-parameter enumerability of Cluster Editing. In Proc. 31st

WG , volume 3787 of LNCS , pages 283-294. Springer, 2005.

[21] P. Damaschke. Parameterized enumeration, transversals, and imperfect phylogeny

reconstruction. Theoretical Computer Science , 351(3):337-350, 2006.

[22] M. Davis, G. Logemann, and D. W. Loveland. A machine program for theorem-

proving. Communications of the ACM , 5(7):394-397, 1962.

[23] F. K. H. A. Dehne, M. A. Langston, X. Luo, S. Pitre, P. Shaw, and Y. Zhang. The

Cluster Editing problem: Implementations and experiments. In Proc. 2nd IWPEC ,
volume 4169 of LNCS , pages 13-24. Springer, 2006.

[24] R. Diestel. Graph Theory . Springer, 3rd edition, 2005.

[25] R. G. Downey and M. R. Fellows. Parameterized Complexity . Springer, 1999.

[26] L. Drori and D. Peleg. Faster exact solutions for some NP-hard problems. Theoretical

Computer Science , 287(2):473-499, 2002.

[27] D. Eppstein. Quasiconvex analysis of backtracking algorithms. In Proc. 15th SODA ,

pages 788-797. ACM/SIAM, 2004.

[28] M. R. Fellows, M. A. Langston, F. Rosamond, and P. Shaw. Polynomial-time linear

kernelization for Cluster Editing. Manuscript, 2006.

[29] A. Felner, R. E. Korf, and S. Hanan. Additive pattern database heuristics. Journal of

Artificial Intelligence Research , 21:1-39, 2004.