{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T09:33:55Z","timestamp":1725701635346},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642330896"},{"type":"electronic","value":"9783642330902"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33090-2_41","type":"book-chapter","created":{"date-parts":[[2012,8,28]],"date-time":"2012-08-28T15:29:11Z","timestamp":1346167751000},"page":"467-478","source":"Crossref","is-referenced-by-count":0,"title":["A Polynomial Kernel for Proper Interval Vertex Deletion"],"prefix":"10.1007","author":[{"given":"Fedor V.","family":"Fomin","sequence":"first","affiliation":[]},{"given":"Saket","family":"Saurabh","sequence":"additional","affiliation":[]},{"given":"Yngve","family":"Villanger","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"41_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/978-3-642-16926-7_22","volume-title":"Graph Theoretic Concepts in Computer Science","author":"R. Bevern van","year":"2010","unstructured":"van Bevern, R., Komusiewicz, C., Moser, H., Niedermeier, R.: Measuring Indifference: Unit Interval Vertex Deletion. In: Thilikos, D.M. (ed.) WG 2010. LNCS, vol.\u00a06410, pp. 232\u2013243. Springer, Heidelberg (2010) 1,2,3"},{"key":"41_CR2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719796","volume-title":"Graph classes: a survey","author":"A. Brandst\u00e4dt","year":"1999","unstructured":"Brandst\u00e4dt, A., Le, V.B., Spinrad, J.P.: Graph classes: a survey. Society for Industrial and Applied Mathematics, Philadelphia (1999) 1,4"},{"key":"41_CR3","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. Inform. Process. Lett.\u00a058, 171\u2013176 (1996) 2","journal-title":"Inform. Process. Lett."},{"key":"41_CR4","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1016\/j.tcs.2005.10.004","volume":"351","author":"P. Damaschke","year":"2006","unstructured":"Damaschke, P.: Parameterized enumeration, transversals, and imperfect phylogeny reconstruction. Theor. Comp. Sc.\u00a0351, 337\u2013350 (2006) 6","journal-title":"Theor. Comp. Sc."},{"key":"41_CR5","doi-asserted-by":"publisher","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) 4"},{"key":"41_CR6","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1112\/jlms\/s1-35.1.85","volume":"35","author":"P. Erd\u0151s","year":"1960","unstructured":"Erd\u0151s, P., Rado, R.: Intersection theorems for systems of sets. J. London Math. Soc.\u00a035, 85\u201390 (1960) 5","journal-title":"J. London Math. Soc."},{"key":"41_CR7","series-title":"An EATCS Series","volume-title":"Texts in Theoretical Computer Science","author":"J. Flum","year":"2006","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. In: Texts in Theoretical Computer Science. An EATCS Series, Springer, Berlin (2006) 2,4,5"},{"unstructured":"Fomin, F.V., Saurabh, S., Villanger, Y.: A polynomial kernel for proper interval vertex deletion. CoRR, abs\/1204.4880 (2012) 7","key":"41_CR8"},{"key":"41_CR9","doi-asserted-by":"crossref","first-page":"835","DOI":"10.2140\/pjm.1965.15.835","volume":"15","author":"D.R. Fulkerson","year":"1965","unstructured":"Fulkerson, D.R., Gross, O.A.: Incidence matrices and interval graphs. Pacific J. Math.\u00a015, 835\u2013855 (1965) 4","journal-title":"Pacific J. Math."},{"key":"41_CR10","doi-asserted-by":"publisher","first-page":"539","DOI":"10.4153\/CJM-1964-055-5","volume":"16","author":"P.C. Gilmore","year":"1964","unstructured":"Gilmore, P.C., Hoffman, A.J.: A characterization of comparability graphs and of interval graphs. Canad. J. Math.\u00a016, 539\u2013548 (1964) 4","journal-title":"Canad. J. Math."},{"key":"41_CR11","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"M.C. Golumbic","year":"1980","unstructured":"Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York (1980) 8"},{"key":"41_CR12","doi-asserted-by":"publisher","first-page":"532","DOI":"10.1007\/s00453-011-9559-5","volume":"63","author":"S. Kratsch","year":"2012","unstructured":"Kratsch, S.: Polynomial kernelizations for min f+1 and max np. Algorithmica\u00a063, 532\u2013550 (2012) 2","journal-title":"Algorithmica"},{"key":"41_CR13","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/0022-0000(80)90060-4","volume":"20","author":"J.M. Lewis","year":"1980","unstructured":"Lewis, J.M., Yannakakis, M.: The Node-Deletion Problem for Hereditary Properties is NP-Complete. J. Comput. Syst. Sci.\u00a020, 219\u2013230 (1980) 1","journal-title":"J. Comput. Syst. Sci."},{"key":"41_CR14","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/0898-1221(93)90308-I","volume":"25","author":"P.J. Looges","year":"1993","unstructured":"Looges, P.J., Olariu, S.: Optimal greedy algorithms for indifference graphs. Computers & Mathematics with Applications\u00a025, 15\u201325 (1993) 4","journal-title":"Computers & Mathematics with Applications"},{"key":"41_CR15","doi-asserted-by":"publisher","first-page":"747","DOI":"10.1007\/s00453-008-9233-8","volume":"57","author":"D. Marx","year":"2010","unstructured":"Marx, D.: Chordal deletion is fixed-parameter tractable. Algorithmica\u00a057, 747\u2013768 (2010) 2,3","journal-title":"Algorithmica"},{"key":"41_CR16","series-title":"Oxford Lecture Series in Mathematics and its Applications","doi-asserted-by":"publisher","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 Lecture Series in Mathematics and its Applications, vol.\u00a031. Oxford University Press, Oxford (2006) 4"},{"key":"41_CR17","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/0020-0190(91)90245-D","volume":"37","author":"S. Olariu","year":"1991","unstructured":"Olariu, S.: An optimal greedy heuristic to color interval graphs. Inf. Process. Lett.\u00a037, 21\u201325 (1991) 4","journal-title":"Inf. Process. Lett."},{"unstructured":"Roberts, F.S.: Indifference graphs. In: Harary, F. (ed.) Proof Techniques in Graph Theory, pp. 139\u2013146 (1969) 4","key":"41_CR18"},{"key":"41_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/978-3-642-17493-3_22","volume-title":"Parameterized and Exact Computation","author":"Y. Villanger","year":"2010","unstructured":"Villanger, Y.: Proper Interval Vertex Deletion. In: Raman, V., Saurabh, S. (eds.) IPEC 2010. LNCS, vol.\u00a06478, pp. 228\u2013238. Springer, Heidelberg (2010) 2,5"},{"unstructured":"G.\u00a0Wegner, Eigenschaften der Nerven homologisch-einfacher Familien im Rn. PhD thesis, Dissertation G\u00f6ttingen (1967) 1,2,4","key":"41_CR20"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2012"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33090-2_41.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:54:56Z","timestamp":1620129296000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33090-2_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642330896","9783642330902"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33090-2_41","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}