{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:15:34Z","timestamp":1759637734222},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540401766"},{"type":"electronic","value":"9783540448495"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-44849-7_17","type":"book-chapter","created":{"date-parts":[[2007,8,10]],"date-time":"2007-08-10T06:26:17Z","timestamp":1186727177000},"page":"108-119","source":"Crossref","is-referenced-by-count":18,"title":["Graph-Modeled Data Clustering: Fixed-Parameter Algorithms for Clique Generation"],"prefix":"10.1007","author":[{"given":"Jens","family":"Gramm","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiong","family":"Guo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Falk","family":"H\u00fcffner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rolf","family":"Niedermeier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,5,13]]},"reference":[{"key":"17_CR1","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0012-365X(00)00199-0","volume":"229","author":"J. Alber","year":"2001","unstructured":"J. Alber, J. Gramm, and R. Niedermeier. Faster exact solutions for hard problems: a parameterized point of view. Discrete Mathematics, 229:3\u201327, 2001.","journal-title":"Discrete Mathematics"},{"issue":"3\/4","key":"17_CR2","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1089\/106652799318274","volume":"6","author":"A. Ben-Dor","year":"1999","unstructured":"A. Ben-Dor, R. Shamir, and Z. Yakhini. Clustering gene expression patterns. Journal of Computational Biology, 6(3\/4):281\u2013297, 1999.","journal-title":"Journal of Computational Biology"},{"key":"17_CR3","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/0020-0190(96)00050-6","volume":"58","author":"L. Cai","year":"1996","unstructured":"Leizhen Cai. Fixed-parameter tractability of graph modification problems for hereditary properties. Information Processing Letters, 58:171\u2013176, 1996.","journal-title":"Information Processing Letters"},{"key":"17_CR4","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1006\/jagm.2001.1186","volume":"41","author":"J. Chen","year":"2001","unstructured":"J. Chen, I. Kanj, and W. Jia Vertex cover: further observations and further improvements. Journal of Algorithms, 41:280\u2013301, 2001.","journal-title":"Journal of Algorithms"},{"key":"17_CR5","doi-asserted-by":"crossref","unstructured":"R. G. Downey and M. R. Fellows. Parameterized Complexity. Springer. 1999.","DOI":"10.1007\/978-1-4612-0515-9"},{"key":"17_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/3-540-36383-1_3","volume-title":"Experimental Algorithmics","author":"M. R. Fellows","year":"2002","unstructured":"M. R. Fellows. Parameterized complexity: the main ideas and connections to practical computing. In Experimental Algorithmics, number 2547 in LNCS, pages 51\u201377, 2002. Springer."},{"key":"17_CR7","doi-asserted-by":"crossref","unstructured":"J. Gramm, J. Guo, F. H\u00fcffner, and R. Niedermeier. Automated generation of search tree algorithms for graph modification problems. Manuscript in preparation, March 2003.","DOI":"10.1007\/978-3-540-39658-1_58"},{"key":"17_CR8","first-page":"191","volume":"79","author":"P. Hansen","year":"1997","unstructured":"P. Hansen and B. Jaumard. Cluster analysis and mathematical programming. Mathematical Programming, 79:191\u2013215, 1997.","journal-title":"Mathematical Programming"},{"key":"17_CR9","unstructured":"A. K. Jain and R. C. Dubes. Algorithms for clustering data. Prentice Hall, 1988."},{"issue":"5","key":"17_CR10","doi-asserted-by":"publisher","first-page":"1906","DOI":"10.1137\/S0097539796303044","volume":"28","author":"H. Kaplan","year":"1999","unstructured":"H. Kaplan, R. Shamir, and R. E. Tarjan. Tractability of parameterized completion problems on chordal, strongly chordal, and proper interval graphs. SIAM Journal on Computing, 28(5):1906\u20131922, 1999.","journal-title":"SIAM Journal on Computing"},{"key":"17_CR11","doi-asserted-by":"publisher","first-page":"997","DOI":"10.1016\/S0304-3975(01)00414-5","volume":"289","author":"S. Khot","year":"2002","unstructured":"S. Khot and V. Raman. Parameterized complexity of finding subgraphs with hereditary properties. Theoretical Computer Science, 289:997\u20131008, 2002.","journal-title":"Theoretical Computer Science"},{"issue":"1\u20132","key":"17_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(98)00017-6","volume":"223","author":"O. Kullmann","year":"1999","unstructured":"O. Kullmann. New methods for 3-SAT decision and worst-case analysis. Theoretical Computer Science, 223(1\u20132):1\u201372, 1999.","journal-title":"Theoretical Computer Science"},{"key":"17_CR13","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1006\/jagm.1998.0996","volume":"31","author":"M. Mahajan","year":"1999","unstructured":"M. Mahajan and V. Raman. Parameterizing above guaranteed values: MaxSat and MaxCut. Journal of Algorithms, 31:335\u2013354, 1999.","journal-title":"Journal of Algorithms"},{"key":"17_CR14","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/S0166-218X(00)00391-7","volume":"113","author":"A. Natanzon","year":"2001","unstructured":"A. Natanzon, R. Shamir, and R. Sharan. Complexity classification of some edge modification problems. Discrete Applied Mathematics, 113:109\u2013128, 2001.","journal-title":"Discrete Applied Mathematics"},{"key":"17_CR15","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/S0020-0190(00)00004-1","volume":"73","author":"R. Niedermeier","year":"2000","unstructured":"R. Niedermeier and P. Rossmanith. A general method to speed up fixed parameter-tractable algorithms. Information Processing Letters, 73:125\u2013129, 2000.","journal-title":"Information Processing Letters"},{"key":"17_CR16","doi-asserted-by":"crossref","unstructured":"R. Niedermeier and P. Rossmanith. On efficient fixed-parameter algorithms for Weighted Vertex Cover. Journal of Algorithms, to appear, 2003.","DOI":"10.1016\/S0196-6774(03)00005-1"},{"key":"17_CR17","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1007\/3-540-36379-3_33","volume-title":"Proc. of 28th WG","author":"R. Shamir","year":"2002","unstructured":"R. Shamir, R. Sharan, and D. Tsur. Cluster graph modification problems. In Proc. of 28th WG, number 2573 in LNCS, pages 379\u2013390, 2002, Springer."},{"key":"17_CR18","unstructured":"R. Sharan and R. Shamir. CLICK: A clustering algorithm with applications to gene expression analysis. In Proc. of 8th ISMB, pp. 307\u2013316, 2000. AAAI Press."},{"key":"17_CR19","unstructured":"R. Sharan and R. Shamir. Algorithmic approaches to clustering gene expression data. In T. Jiang et al. (eds): Current Topics in Computational Molecular Biology, pages 269\u2013300, The MIT Press. 2002."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44849-7_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T18:12:25Z","timestamp":1556734345000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44849-7_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540401766","9783540448495"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-44849-7_17","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}