{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:38:02Z","timestamp":1759639082672},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540390985"},{"type":"electronic","value":"9783540391012"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11847250_1","type":"book-chapter","created":{"date-parts":[[2006,9,13]],"date-time":"2006-09-13T11:43:02Z","timestamp":1158147782000},"page":"1-12","source":"Crossref","is-referenced-by-count":9,"title":["Applying Modular Decomposition to Parameterized Bicluster Editing"],"prefix":"10.1007","author":[{"given":"F\u00e1bio","family":"Protti","sequence":"first","affiliation":[]},{"given":"Maise Dantas","family":"da Silva","sequence":"additional","affiliation":[]},{"given":"Jayme Luiz","family":"Szwarcfiter","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"1_CR1","unstructured":"Amit, N.: The Bicluster Graph Editing Problem, M.Sc. Thesis, Tel Aviv University (2004)"},{"key":"1_CR2","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1287\/moor.8.2.170","volume":"8","author":"H. Bauer","year":"1983","unstructured":"Bauer, H., M\u00f6hring, R.H.: A fast algorithm for the decomposition of graphs and posets. Mathematics of Operations Research\u00a08, 170\u2013184 (1983)","journal-title":"Mathematics of Operations Research"},{"key":"1_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/978-3-540-39890-5_11","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"A. Bretscher","year":"2003","unstructured":"Bretscher, A., Corneil, D.G., Habib, M., Paul, C.: A Simple Linear Time LexBFS Cograph Recognition Algorithm. In: Bodlaender, H.L. (ed.) WG 2003. LNCS, vol.\u00a02880, pp. 119\u2013130. Springer, Heidelberg (2003)"},{"key":"1_CR4","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/0020-0190(96)00050-6","volume":"58","author":"L. Cai","year":"1996","unstructured":"Cai, L.: Fixed-parameter tractability of graph modification problems for hereditary properties. Information Processing Letters\u00a058, 171\u2013176 (1996)","journal-title":"Information Processing Letters"},{"key":"1_CR5","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1006\/jagm.2001.1185","volume":"41","author":"E. Dahlhaus","year":"2001","unstructured":"Dahlhaus, E., Gustedt, J., McConnel, R.M.: Efficient and practical algorithms for sequential modular decomposition. Journal of Algorithms\u00a041, 360\u2013387 (2001)","journal-title":"Journal of Algorithms"},{"issue":"4","key":"1_CR6","doi-asserted-by":"publisher","first-page":"873","DOI":"10.1137\/S0097539792228228","volume":"24","author":"R.G. Downey","year":"1995","unstructured":"Downey, R.G., Fellows, M.R.: Fixed-parameter tractability and completeness I: Basic results. SIAM Journal on Computing\u00a024(4), 873\u2013921 (1995)","journal-title":"SIAM Journal on Computing"},{"key":"1_CR7","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/0304-3975(94)00097-3","volume":"141","author":"R.G. Downey","year":"1995","unstructured":"Downey, R.G., Fellows, M.R.: Fixed-parameter tractability and completeness II: On completeness for W[1]. Theoretical Computer Science\u00a0141, 109\u2013131 (1995)","journal-title":"Theoretical Computer Science"},{"key":"1_CR8","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg"},{"key":"1_CR9","unstructured":"Fernau, H.: Parameterized Algorithms: A Graph-Theoretic Approach, University of Newcastle (2005)"},{"key":"1_CR10","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1007\/BF02020961","volume":"18","author":"T. Gallai","year":"1967","unstructured":"Gallai, T.: Transitiv orientierbare graphen. Acta Math. Acad. Sci. Hungar.\u00a018, 26\u201366 (1967)","journal-title":"Acta Math. Acad. Sci. Hungar."},{"issue":"4","key":"1_CR11","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/s00224-004-1178-y","volume":"38","author":"J. Gramm","year":"2005","unstructured":"Gramm, J., Guo, J., H\u00fcffner, F., Niedermeier, R.: Graph-modeled data clustering: Fixed-parameter algorithms for clique generation. Theory of Computing Systems\u00a038(4), 373\u2013392 (2005)","journal-title":"Theory of Computing Systems"},{"issue":"4","key":"1_CR12","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/s00453-004-1090-5","volume":"39","author":"J. Gramm","year":"2004","unstructured":"Gramm, J., Guo, J., H\u00fcffner, F., Niedermeier, R.: Automated generation of search tree algorithms for hard graph modification problems. Algorithmica\u00a039(4), 321\u2013347 (2004)","journal-title":"Algorithmica"},{"key":"1_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/978-3-540-27810-8_17","volume-title":"Algorithm Theory - SWAT 2004","author":"M. Habib","year":"2004","unstructured":"Habib, M., de Montgolfier, F., Paul, C.: A simple linear-time modular decomposition algorithm for graphs, using order extension. In: Hagerup, T., Katajainen, J. (eds.) SWAT 2004. LNCS, vol.\u00a03111, pp. 187\u2013198. Springer, Heidelberg (2004)"},{"key":"1_CR14","first-page":"257","volume":"19","author":"R.H. M\u00f6hring","year":"1984","unstructured":"M\u00f6hring, R.H., Radermacher, F.J.: Substitution decomposition and connections with combinatorial optimization. Ann. Discrete Math.\u00a019, 257\u2013356 (1984)","journal-title":"Ann. Discrete Math."},{"key":"1_CR15","unstructured":"McConnell, R.M., Spinrad, J.P.: Linear-time modular decomposition and efficient transitive orientation of comparability graphs. In: Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, vol.\u00a05, pp. 536\u2013545 (1994)"},{"key":"1_CR16","first-page":"45","volume":"4","author":"R.M. McConnell","year":"2000","unstructured":"McConnell, R.M., Spinrad, J.P.: Ordered vertex partitioning. Discrete Mathematics and Theoretical Computer Science\u00a04, 45\u201360 (2000)","journal-title":"Discrete Mathematics and Theoretical Computer Science"},{"key":"1_CR17","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/S0166-218X(00)00391-7","volume":"113","author":"A. Natanzon","year":"1999","unstructured":"Natanzon, A., Shamir, R., Sharan, R.: Complexity classification of some edge modification problems. Discrete Applied Mathematics\u00a0113, 109\u2013128 (1999)","journal-title":"Discrete Applied Mathematics"},{"key":"1_CR18","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/S0020-0190(00)00004-1","volume":"73","author":"R. Niedermeier","year":"2000","unstructured":"Niedermeier, R., Rossmanith, P.: A general method to speed up fixed-parameter-tractable algorithms. Information Processing Letters\u00a073, 125\u2013129 (2000)","journal-title":"Information Processing Letters"},{"key":"1_CR19","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/j.dam.2004.01.007","volume":"144","author":"R. Shamir","year":"2004","unstructured":"Shamir, R., Sharan, R., Tsur, D.: Cluster graph modification problems. Discrete Applied Mathematics\u00a0144, 173\u2013182 (2004)","journal-title":"Discrete Applied Mathematics"}],"container-title":["Lecture Notes in Computer Science","Parameterized and Exact Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11847250_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,10]],"date-time":"2019-03-10T21:57:12Z","timestamp":1552255032000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11847250_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540390985","9783540391012"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/11847250_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}