{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:28:37Z","timestamp":1725564517811},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540207795"},{"type":"electronic","value":"9783540246183"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24618-3_30","type":"book-chapter","created":{"date-parts":[[2010,9,5]],"date-time":"2010-09-05T07:31:03Z","timestamp":1283671863000},"page":"349-360","source":"Crossref","is-referenced-by-count":1,"title":["Avoiding Forbidden Submatrices by Row Deletions"],"prefix":"10.1007","author":[{"given":"Sebastian","family":"Wernicke","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jochen","family":"Alber","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jens","family":"Gramm","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiong","family":"Guo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rolf","family":"Niedermeier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"30_CR1","doi-asserted-by":"crossref","unstructured":"Brandst\u00e4dt, A., Le, V.B., Spinrad, J.P.: Graph Classes: A Survey. SIAM Monographs on Discrete Mathematics and Applications (1999)","DOI":"10.1137\/1.9780898719796"},{"key":"30_CR2","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, New York (1979)"},{"key":"30_CR3","doi-asserted-by":"crossref","unstructured":"Gramm, J., Guo, J., H\u00fcffner, F., Niedermeier, R.: Graph-Modeled Data Clustering: Fixed-Parameter Algorithms for Clique Generation. In: Petreschi, R., Persiano, G., Silvestri, R. (eds.) CIAC 2003. LNCS, vol.\u00a02653, pp. 108\u2013119. Springer, Heidelberg (2003)","DOI":"10.1007\/3-540-44849-7_17"},{"key":"30_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"642","DOI":"10.1007\/978-3-540-39658-1_58","volume-title":"Algorithms - ESA 2003","author":"J. Gramm","year":"2003","unstructured":"Gramm, J., Guo, J., H\u00fcffner, F., Niedermeier, R.: Automated Generation of Search Tree Algorithms for Graph Modification Problems. In: Di Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol.\u00a02832, pp. 642\u2013653. Springer, Heidelberg (2003)"},{"key":"30_CR5","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/0166-218X(94)00054-H","volume":"60","author":"B. Klinz","year":"1995","unstructured":"Klinz, B., Rudolf, R., Woeginger, G.J.: Permuting Matrices to Avoid Forbidden Submatrices. Discrete Applied Mathematics\u00a060, 223\u2013248 (1995)","journal-title":"Discrete Applied Mathematics"},{"key":"30_CR6","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/S0166-218X(00)00391-7","volume":"113","author":"A. Natanzon","year":"2001","unstructured":"Natanzon, A., Shamir, R., Sharan, R.: Complexity Classification of Some Edge Modification Problems. Discrete Applied Mathematics\u00a0113, 109\u2013128 (2001)","journal-title":"Discrete Applied Mathematics"},{"key":"30_CR7","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/S1570-8667(03)00009-1","volume":"1","author":"R. Niedermeier","year":"2003","unstructured":"Niedermeier, R., Rossmanith, P.: An Efficient Fixed-Parameter Algorithm for 3- Hitting Set. Journal of Discrete Algorithms\u00a01, 89\u2013102 (2003)","journal-title":"Journal of Discrete Algorithms"},{"key":"30_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1007\/3-540-45471-3_37","volume-title":"Algorithm Theory - SWAT 2002","author":"I. Pe\u2019er","year":"2002","unstructured":"Pe\u2019er, I., Shamir, R., Sharan, R.: On the Generality of Phylogenies from Incomplete Directed Characters. In: Penttonen, M., Schmidt, E.M. (eds.) SWAT 2002. LNCS, vol.\u00a02368, pp. 358\u2013367. Springer, Heidelberg (2002)"},{"key":"30_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/3-540-36379-3_33","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"R. Shamir","year":"2002","unstructured":"Shamir, R., Sharan, R., Tsur, D.: Cluster Graph Modification Problems. In: Ku\u010dera, L. (ed.) WG 2002. LNCS, vol.\u00a02573, pp. 379\u2013390. Springer, Heidelberg (2002)"},{"key":"30_CR10","unstructured":"Sharan, R.: Graph Modification Problems and Their Applications to Genomic Research. Ph.D. Thesis, School of Computer Science, Tel-Aviv University (2002)"},{"key":"30_CR11","unstructured":"Wernicke, S.: On the Algorithmic Tractability of Single Nucleotide Polymorphism (SNP) Analysis and Related Problems. Diploma Thesis, WSI f\u00fcr Informatik, Universit \u00e4t T\u00fcbingen (September 2003)"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2004: Theory and Practice of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24618-3_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,3]],"date-time":"2019-06-03T13:36:44Z","timestamp":1559569004000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24618-3_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540207795","9783540246183"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24618-3_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}