{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T16:08:16Z","timestamp":1725552496515},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642121999"},{"type":"electronic","value":"9783642122002"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-12200-2_46","type":"book-chapter","created":{"date-parts":[[2010,4,21]],"date-time":"2010-04-21T09:53:05Z","timestamp":1271843585000},"page":"527-538","source":"Crossref","is-referenced-by-count":2,"title":["Kernelization through Tidying"],"prefix":"10.1007","author":[{"given":"Ren\u00e9","family":"van Bevern","sequence":"first","affiliation":[]},{"given":"Hannes","family":"Moser","sequence":"additional","affiliation":[]},{"given":"Rolf","family":"Niedermeier","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"46_CR1","unstructured":"Abu-Khzam, F.N.: A kernelization algorithm for d-Hitting Set. J.\u00a0Comput. System Sci. (2009) (Available electronically)"},{"key":"46_CR2","unstructured":"Balasundaram, B., Butenko, S., Hicks, I.V.: Clique relaxations in social network analysis: The maximum k-plex problem. Oper. Res. (2009) (Avaiable electronically)"},{"key":"46_CR3","unstructured":"van Bevern, R.: A quadratic-vertex problem kernel for s-plex cluster vertex deletion. Studienarbeit, Friedrich-Schiller-Universit\u00e4t Jena, Germany (2009)"},{"issue":"4","key":"46_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. Inf. Process. Lett.\u00a058(4), 171\u2013176 (1996)","journal-title":"Inf. Process. Lett."},{"issue":"3","key":"46_CR5","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1038\/ng1518","volume":"37","author":"E.J. Chesler","year":"2005","unstructured":"Chesler, E.J., Lu, L., Shou, S., Qu, Y., Gu, J., Wang, J., Hsu, H.C., Mountz, J.D., Baldwin, N.E., Langston, M.A., Threadgill, D.W., Manly, K.F., Williams, R.W.: Complex trait analysis of gene expression uncovers polygenic and pleiotropic networks that modulate nervous system function. Nat. Genet.\u00a037(3), 233\u2013242 (2005)","journal-title":"Nat. Genet."},{"key":"46_CR6","doi-asserted-by":"publisher","first-page":"1517","DOI":"10.1086\/523109","volume":"196","author":"V.J. Cook","year":"2007","unstructured":"Cook, V.J., Sun, S.J., Tapia, J., Muth, S.Q., Arg\u00fcello, D.F., Lewis, B.L., Rothenberg, R.B., McElroy, P.D.: The Network Analysis Project\u00a0Team. Transmission network analysis in tuberculosis contact investigations. J.\u00a0Infect. Dis.\u00a0196, 1517\u20131527 (2007)","journal-title":"J.\u00a0Infect. Dis."},{"key":"46_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1007\/978-3-642-02158-9_20","volume-title":"Algorithmic Aspects in Information and Management","author":"J. Guo","year":"2009","unstructured":"Guo, J., Komusiewicz, C., Niedermeier, R., Uhlmann, J.: A more relaxed model for graph-based data clustering: s-plex editing. In: Goldberg, A.V., Zhou, Y. (eds.) AAIM 2009. LNCS, vol.\u00a05564, pp. 226\u2013239. Springer, Heidelberg (2009)"},{"issue":"1","key":"46_CR8","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/1233481.1233493","volume":"38","author":"J. Guo","year":"2007","unstructured":"Guo, J., Niedermeier, R.: Invitation to data reduction and problem kernelization. SIGACT News\u00a038(1), 31\u201345 (2007)","journal-title":"SIGACT News"},{"key":"46_CR9","doi-asserted-by":"crossref","unstructured":"H\u00fcffner, F., Komusiewicz, C., Moser, H., Niedermeier, R.: Fixed-parameter algorithms for cluster vertex deletion. Theory Comput. Syst. (2009) (Available electronically)","DOI":"10.1007\/s00224-008-9150-x"},{"key":"46_CR10","first-page":"601","volume-title":"Proc. 26th STACS","author":"S. Kratsch","year":"2009","unstructured":"Kratsch, S.: Polynomial kernelizations for MIN F\n \n \n \n $^{\\mbox{+}} \\mathrm{\\Pi}_{\\mbox{1}}$\n and MAX NP. In: Proc. 26th STACS, pp. 601\u2013612. IBFI Dagstuhl, Germany (2009)"},{"key":"46_CR11","doi-asserted-by":"crossref","unstructured":"Marx, D., Schlotter, I.: Parameterized graph cleaning problems. Discrete Appl. Math., (2009) (Available electronically)","DOI":"10.1016\/j.dam.2009.06.022"},{"key":"46_CR12","first-page":"861","volume-title":"Proc. 2nd ARES","author":"N. Memon","year":"2007","unstructured":"Memon, N., Kristoffersen, K.C., Hicks, D.L., Larsen, H.L.: Detecting critical regions in covert networks: A case study of 9\/11 terrorists network. In: Proc. 2nd ARES, pp. 861\u2013870. IEEE Computer Society Press, Los Alamitos (2007)"},{"key":"46_CR13","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1080\/0022250X.1978.9989883","volume":"6","author":"S.B. Seidman","year":"1978","unstructured":"Seidman, S.B., Foster, B.L.: A graph-theoretic generalization of the clique concept. J.\u00a0Math. Sociol.\u00a06, 139\u2013154 (1978)","journal-title":"J.\u00a0Math. Sociol."},{"issue":"1-2","key":"46_CR14","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 Appl. Math.\u00a0144(1-2), 173\u2013182 (2004)","journal-title":"Discrete Appl. Math."}],"container-title":["Lecture Notes in Computer Science","LATIN 2010: Theoretical Informatics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-12200-2_46","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T13:15:47Z","timestamp":1578489347000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-12200-2_46"}},"subtitle":["A Case Study Based on s-Plex Cluster Vertex Deletion"],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642121999","9783642122002"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-12200-2_46","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}