{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T03:05:41Z","timestamp":1743044741571,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319123394"},{"type":"electronic","value":"9783319123400"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-12340-0_34","type":"book-chapter","created":{"date-parts":[[2014,10,20]],"date-time":"2014-10-20T04:27:23Z","timestamp":1413779243000},"page":"408-419","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["A Polynomial Turing-Kernel for Weighted Independent Set in Bull-Free Graphs"],"prefix":"10.1007","author":[{"given":"St\u00e9phan","family":"Thomass\u00e9","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicolas","family":"Trotignon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kristina","family":"Vu\u0161kovi\u0107","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,10,21]]},"reference":[{"key":"34_CR1","doi-asserted-by":"publisher","DOI":"10.1002\/9780470277331","volume-title":"The Probabilistic Method","author":"N Alon","year":"2008","unstructured":"Alon, N., Spencer, J.H.: The Probabilistic Method. Wiley, New York (2008)"},{"issue":"8","key":"34_CR2","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1016\/j.jcss.2009.04.001","volume":"75","author":"H Bodlaender","year":"2009","unstructured":"Bodlaender, H., Downey, R., Fellows, M., Hermelin, D.: On problems without polynomial kernels. J. Comput. Syst. Sci. 75(8), 423\u2013434 (2009)","journal-title":"J. Comput. Syst. Sci."},{"key":"34_CR3","unstructured":"Brandst\u00e4dt, A., Mosca, R.: Maximum weight independent sets in odd-hole-free graphs without dart or without bull (preprint)"},{"issue":"1","key":"34_CR4","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/j.jctb.2011.07.003","volume":"102","author":"M Chudnovsky","year":"2012","unstructured":"Chudnovsky, M.: The structure of bull-free graphs I: Three-edge-paths with center and anticenters. J. Comb. Theory B 102(1), 233\u2013251 (2012)","journal-title":"J. Comb. Theory B"},{"issue":"1","key":"34_CR5","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1016\/j.jctb.2011.07.002","volume":"102","author":"M Chudnovsky","year":"2012","unstructured":"Chudnovsky, M.: The structure of bull-free graphs II and III: A summary. J. Comb. Theory B 102(1), 252\u2013282 (2012)","journal-title":"J. Comb. Theory B"},{"key":"34_CR6","unstructured":"Chudnovsky, M.: The structure of bull-free graphs II: Elementary trigraphs (manuscript)"},{"key":"34_CR7","unstructured":"Chudnovsky, M.: The structure of bull-free graphs III: Global structure (manuscript)"},{"key":"34_CR8","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/j.jda.2011.12.012","volume":"14","author":"K Dabrowski","year":"2012","unstructured":"Dabrowski, K., Lozin, V., M\u00fcller, H., Rautenbach, D.: Parameterized complexity of the weighted independent set problem beyond graphs of bounded clique number. J. Discrete Algorithms 14, 207\u2013213 (2012)","journal-title":"J. Discrete Algorithms"},{"key":"34_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized Complexity: Monographs in Computer Science","author":"RG Downey","year":"1999","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity: Monographs in Computer Science. Springer, New York (1999)"},{"issue":"1","key":"34_CR10","first-page":"9","volume":"11","author":"A Farrugia","year":"2004","unstructured":"Farrugia, A.: Vertex-partitioning into fixed additive induced-hereditary properties is NP-hard. Electr. J. Comb. 11(1), 9 (2004)","journal-title":"Electr. J. Comb."},{"key":"34_CR11","series-title":"Lecture Notes in Computer Science","volume-title":"LATIN 2012: Theoretical Informatics","year":"2012","unstructured":"Fern\u00e1ndez-Baca, D. (ed.): LATIN 2012. LNCS, vol. 7256. Springer, Heidelberg (2012)"},{"key":"34_CR12","unstructured":"Fernau, H., Fomin, F., Lokshtanov, D., Raible, D., Saurabh, S., Villanger, Y.: Kernels for problems with no kernel: on out-trees with many leaves. In: STACS 2009"},{"key":"34_CR13","doi-asserted-by":"crossref","unstructured":"Habib, M., Mamcarz, A., de Montgolfier, F.: Algorithms for some $$H$$-join decompositions. In: Fern\u00e1ndez-Baca [11], pp. 446\u2013457","DOI":"10.1007\/978-3-642-29344-3_38"},{"issue":"1","key":"34_CR14","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.cosrev.2010.01.001","volume":"4","author":"M Habib","year":"2010","unstructured":"Habib, M., Paul, C.: A survey of the algorithmic aspects of modular decomposition. Comput. Sci. Rev. 4(1), 41\u201359 (2010)","journal-title":"Comput. Sci. Rev."},{"key":"34_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/978-3-319-03898-8_18","volume-title":"Parameterized and Exact Computation","author":"D Hermelin","year":"2013","unstructured":"Hermelin, D., Kratsch, S., So\u0142tys, K., Wahlstr\u00f6m, M., Wu, X.: A completeness theory for polynomial (turing) kernelization. In: Gutin, G., Szeider, S. (eds.) IPEC 2013. LNCS, vol. 8246, pp. 202\u2013215. Springer, Heidelberg (2013)"},{"key":"34_CR16","unstructured":"Lokshtanov, D.: New methods in parameterized algorithms and complexity. Ph.D. Thesis, University of Bergen (2009)"},{"key":"34_CR17","doi-asserted-by":"crossref","unstructured":"Lokshtanov, D., Vatshelle, M., Villanger, Y.: Independent set in $$p_5$$-free graphs in polynomial time, 2014. In: SODA 2014","DOI":"10.1137\/1.9781611973402.43"},{"key":"34_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/978-3-540-27810-8_23","volume-title":"Algorithm Theory - SWAT 2004","author":"K Makino","year":"2004","unstructured":"Makino, K., Uno, T.: New algorithms for enumerating all maximal cliques. In: Hagerup, T., Katajainen, J. (eds.) SWAT 2004. LNCS, vol. 3111, pp. 260\u2013272. Springer, Heidelberg (2004)"},{"key":"34_CR19","first-page":"307","volume":"15","author":"S Poljak","year":"1974","unstructured":"Poljak, S.: A note on the stable sets and coloring of graphs. Commentationes Math. Univ. Carol. 15, 307\u2013309 (1974)","journal-title":"Commentationes Math. Univ. Carol."},{"issue":"1","key":"34_CR20","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/0097-3165(72)90019-2","volume":"13","author":"N Sauer","year":"1972","unstructured":"Sauer, N.: On the density of families of sets. J. Comb. Theory Ser. A 13(1), 145\u2013147 (1972)","journal-title":"J. Comb. Theory Ser. A"},{"key":"34_CR21","volume-title":"Combinatorial Optimization, Polyhedra and Efficiency","author":"A Schrijver","year":"2003","unstructured":"Schrijver, A.: Combinatorial Optimization, Polyhedra and Efficiency, vol. A, B and C. Springer, New York (2003)"},{"issue":"3","key":"34_CR22","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1137\/0206036","volume":"6","author":"S Tsukiyama","year":"1977","unstructured":"Tsukiyama, S., Ide, M., Ariyoshi, H., Shirakawa, I.: A new algorithm for generating all the maximal independent sets. SIAM J. Comput. 6(3), 505\u2013517 (1977)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-12340-0_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,20]],"date-time":"2023-02-20T14:50:54Z","timestamp":1676904654000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-12340-0_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319123394","9783319123400"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-12340-0_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"21 October 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}