{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T14:46:45Z","timestamp":1770994005759,"version":"3.50.1"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2007,7,6]],"date-time":"2007-07-06T00:00:00Z","timestamp":1183680000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2009,1]]},"DOI":"10.1007\/s00224-007-9032-7","type":"journal-article","created":{"date-parts":[[2007,7,5]],"date-time":"2007-07-05T17:30:23Z","timestamp":1183656623000},"page":"91-104","source":"Crossref","is-referenced-by-count":56,"title":["Applying Modular Decomposition to Parameterized Cluster Editing Problems"],"prefix":"10.1007","volume":"44","author":[{"given":"F\u00e1bio","family":"Protti","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maise","family":"Dantas da Silva","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jayme Luiz","family":"Szwarcfiter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,7,6]]},"reference":[{"key":"9032_CR1","unstructured":"Amit, N.: The bicluster graph editing problem. M.Sc. Thesis, Tel Aviv University (2004)"},{"key":"9032_CR2","doi-asserted-by":"crossref","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. Math. Oper. Res. 8, 170\u2013184 (1983)","journal-title":"Math. Oper. Res."},{"key":"9032_CR3","doi-asserted-by":"crossref","unstructured":"Bretscher, A., Corneil, D., Habib, M., Paul, C.: A simple linear time lexBFS cograph recognition algorithm. In: WG 2003. Lecture Notes in Computer Science, vol.\u00a02880, pp.\u00a0119\u2013130 (2003)","DOI":"10.1007\/978-3-540-39890-5_11"},{"key":"9032_CR4","doi-asserted-by":"crossref","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. Inf. Process. Lett. 58, 171\u2013176 (1996)","journal-title":"Inf. Process. Lett."},{"key":"9032_CR5","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/S0747-7171(08)80013-2","volume":"9","author":"D. Coppersmith","year":"1990","unstructured":"Coppersmith, D., Winograd, S.: Matrix multiplication via arithmetic progressions. J. Symb. Comput. 9, 251\u2013280 (1990)","journal-title":"J. Symb. Comput."},{"key":"9032_CR6","doi-asserted-by":"crossref","first-page":"360","DOI":"10.1006\/jagm.2001.1185","volume":"41","author":"E. Dahlhaus","year":"2001","unstructured":"Dahlhaus, E., Gustedt, J., McConnell, R.M.: Efficient and practical algorithms for sequential modular decomposition. J. Algorithms 41, 360\u2013387 (2001)","journal-title":"J. Algorithms"},{"key":"9032_CR7","doi-asserted-by":"crossref","unstructured":"Dantas da Silva, M., Protti, F., Szwarcfiter, J.L.: Applying modular decomposition to parameterized bicluster editing. In: IWPEC 2006\u2014Second International Workshop on Parameterized and Exact Computation, Zurich, Switzerland. Lecture Notes in Computer Science, vol.\u00a04169, pp.\u00a01\u201312 (2006)","DOI":"10.1007\/11847250_1"},{"issue":"4","key":"9032_CR8","doi-asserted-by":"crossref","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 J. Comput. 24(4), 873\u2013921 (1995)","journal-title":"SIAM J. Comput."},{"key":"9032_CR9","doi-asserted-by":"crossref","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]. Theor. Comput. Sci. 141, 109\u2013131 (1995)","journal-title":"Theor. Comput. Sci."},{"key":"9032_CR10","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized Complexity","author":"R.G. Downey","year":"1999","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, New York (1999)"},{"key":"9032_CR11","unstructured":"Fellows, M., Langston, M., Rosamond, F., Shaw, P.: Efficient parameterized preprocessing for cluster editing. Manuscript (2006)"},{"key":"9032_CR12","unstructured":"Fernau, H.: Parameterized Algorithms: A Graph-Theoretic Approach. University of Newcastle (2005)"},{"key":"9032_CR13","volume-title":"Parameterized Complexity Theory","author":"J. Flum","year":"2006","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, New York (2006)"},{"key":"9032_CR14","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1007\/BF02020961","volume":"18","author":"T. Gallai","year":"1967","unstructured":"Gallai, T.: Transitiv orientierbare Graphen. Acta Math. Acad. Sci. Hung. 18, 26\u201366 (1967)","journal-title":"Acta Math. Acad. Sci. Hung."},{"issue":"4","key":"9032_CR15","doi-asserted-by":"crossref","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 Comput. Syst. 38(4), 373\u2013392 (2005)","journal-title":"Theory Comput. Syst."},{"issue":"4","key":"9032_CR16","doi-asserted-by":"crossref","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 39(4), 321\u2013347 (2004)","journal-title":"Algorithmica"},{"key":"9032_CR17","doi-asserted-by":"crossref","unstructured":"Guo, J.: A more effective linear kernelization for Cluster Editing. In: Proceedings of the 1st International Symposium on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies (ESCAPE 2007), Hangzhou, China, April 2007. Lecture Notes in Computer Science (2007)","DOI":"10.1007\/978-3-540-74450-4_4"},{"key":"9032_CR18","doi-asserted-by":"crossref","unstructured":"Habib, M., Montgolfier, F., Paul, C.: A simple linear-time modular decomposition algorithm for graphs, using order extension. In: 9th Scandinavian Workshop on Algorithm Theory (SWAT 2004). Lecture Notes in Computer Science, vol.\u00a03111, pp.\u00a0187\u2013198 (2004)","DOI":"10.1007\/978-3-540-27810-8_17"},{"key":"9032_CR19","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. Discret. Math. 19, 257\u2013356 (1984)","journal-title":"Ann. Discret. Math."},{"key":"9032_CR20","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.\u00a0536\u2013545 (1994)"},{"key":"9032_CR21","first-page":"45","volume":"4","author":"R.M. McConnell","year":"2000","unstructured":"McConnell, R.M., Spinrad, J.P.: Ordered vertex partitioning. Discret. Math. Theor. Comput. Sci. 4, 45\u201360 (2000)","journal-title":"Discret. Math. Theor. Comput. Sci."},{"key":"9032_CR22","doi-asserted-by":"crossref","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. Discret. Appl. Math. 113, 109\u2013128 (1999)","journal-title":"Discret. Appl. Math."},{"key":"9032_CR23","doi-asserted-by":"crossref","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001","volume-title":"Invitation to Fixed-Parameter Algorithms","author":"R. Niedermeier","year":"2006","unstructured":"Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford University Press, Oxford (2006)"},{"key":"9032_CR24","doi-asserted-by":"crossref","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. Inf. Process. Lett. 73, 125\u2013129 (2000)","journal-title":"Inf. Process. Lett."},{"key":"9032_CR25","doi-asserted-by":"crossref","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. Discret. Appl. Math. 144, 173\u2013182 (2004)","journal-title":"Discret. Appl. Math."}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-007-9032-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-007-9032-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-007-9032-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T11:51:34Z","timestamp":1558698694000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-007-9032-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,7,6]]},"references-count":25,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2009,1]]}},"alternative-id":["9032"],"URL":"https:\/\/doi.org\/10.1007\/s00224-007-9032-7","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,7,6]]}}}