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

[30] J. Flum and M. Grohe. Parameterized Complexity Theory . Springer, 2006.

[31] F. V. Fomin, F. Grandoni, and D. Kratsch. Some new techniques in design and anal-

ysis of exact (exponential) algorithms. Bulletin of the EATCS , 87:47-77, 2005.

[32] M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory

of NP-Completeness . W. H. Freeman, 1979.

[33] J. Gramm, J. Guo, F. H uffner, and R. Niedermeier. Automated generation of search

tree algorithms for hard graph modification problems. Algorithmica , 39(4):321-347,
2004.

[34] J. Gramm, J. Guo, F. H uffner, and R. Niedermeier. Graph-modeled data clustering:

Exact algorithms for clique generation. Theory of Computing Systems , 38(4):373-
392, 2005.

[35] J. Gramm, J. Guo, F. H uffner, and R. Niedermeier. Data reduction, exact, and heuris-

tic algorithms for clique cover. In Proc. 8th ALENEX , pages 86-94. SIAM, 2006.
Long version to appear under the title “Data reduction and exact algorithms for clique
cover” in ACM Journal of Experimental Algorithmics .

[36] J. Gramm, J. Guo, F. H uffner, R. Niedermeier, H.-P. Piepho, and R. Schmid. Al-

gorithms for compact letter displays: Comparison and evaluation. Computational
Statistics & Data Analysis , 2006. To appear.

[37] J.-L. Guillaume and M. Latapy. Bipartite structure of all complex networks. Informa-

tion Processing Letters , 90(5):215-221, 2004.

[38] J. Guo. A more effective linear kernelization for cluster editing. In Proc. ESCAPE ,

LNCS. Springer, 2007. To appear.

[39] J. Guo and R. Niedermeier. Invitation to data reduction and problem kernelization.

ACM SIGACT News , 38(1):31-45, 2007.

[40] J. Guo, R. Niedermeier, and S. Wernicke. Parameterized complexity of generalized

Vertex Cover problems. In Proc. 9th WADS , volume 3608 of LNCS , pages 36-48.
Springer, 2005. Long version to appear under the title “Parameterized complexity of
Vertex Cover variants” in Theory of Computing Systems .

[41] A. Gyarfas. A simple lower bound on edge coverings by cliques. Discrete Mathemat-

ics , 85(1):103-104, 1990.

n 1 − . [42] J. Hastad. Clique is hard to approximate within Acta Mathematica ,

182(1):105-142, 1999.

[43] K. Holzapfel, S. Kosub, M. G. Maaß, and H. Taubig. The complexity of detecting

fixed-density clusters. Discrete Applied Mathematics , 154(11):1547-1562, 2006.

[44] H. Ito, K. Iwama, and T. Osumi. Linear-time enumeration of isolated cliques. In Proc.

13th ESA , volume 3669 of LNCS , pages 119-130. Springer, 2005.

[45] H. Kawaji, Y. Takenaka, and H. Matsuda. Graph-based clustering for finding dis-

tant relationships in a large set of protein sequences. Bioinformatics , 20(2):243-252,
2004.

[46] H. Kawaji, Y. Yamaguchi, H. Matsuda, and A. Hashimoto. A graph-based clustering

method for a large set of sequences using a graph partitioning algorithm. Genome
Informatics , 12:93-102, 2001.

[47] E. Kellerman. Determination of keyword conflict. IBM Technical Disclosure Bulletin ,

16(2):544-546, 1973.

[48] J. Kleinberg and E. Tardos. Algorithm Design . Addison Wesley, 2005.

[49] C. Komusiewicz. Various isolation concepts for the enumeration of dense subgraphs.