{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T16:41:53Z","timestamp":1725813713980},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319135236"},{"type":"electronic","value":"9783319135243"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-13524-3_24","type":"book-chapter","created":{"date-parts":[[2014,12,2]],"date-time":"2014-12-02T17:51:38Z","timestamp":1417542698000},"page":"282-293","source":"Crossref","is-referenced-by-count":1,"title":["Improved FPT Algorithms for Weighted Independent Set in Bull-Free Graphs"],"prefix":"10.1007","author":[{"given":"Henri Perret","family":"du Cray","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ignasi","family":"Sau","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,12,3]]},"reference":[{"issue":"1","key":"24_CR1","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 centers and anticenters. J. Comb. Theor. B 102(1), 233\u2013251 (2012)","journal-title":"J. Comb. Theor. B"},{"issue":"1","key":"24_CR2","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. Theor. B 102(1), 252\u2013282 (2012)","journal-title":"J. Comb. Theor. B"},{"key":"24_CR3","doi-asserted-by":"crossref","unstructured":"Chudnovsky, M., Seymour P.D.: The structure of claw-free graphs. In: Surveys in Combinatorics, London Mathematical Society Lecture Note Series, vol. 327, pp. 153\u2013171. Cambridge University Press, Cambridge (2005)","DOI":"10.1017\/CBO9780511734885.008"},{"issue":"50","key":"24_CR4","doi-asserted-by":"publisher","first-page":"6982","DOI":"10.1016\/j.tcs.2011.09.010","volume":"412","author":"M Cygan","year":"2011","unstructured":"Cygan, M., Philip, G., Pilipczuk, M., Pilipczuk, M., Wojtaszczyk, J.O.: Dominating set is fixed parameter tractable in claw-free graphs. Theoret. Comput. Sci. 412(50), 6982\u20137000 (2011)","journal-title":"Theoret. Comput. Sci."},{"key":"24_CR5","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.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":"24_CR6","volume-title":"Graph Theory","author":"R Diestel","year":"2005","unstructured":"Diestel, R.: Graph Theory, vol. 173. Springer, Heidelberg (2005)"},{"key":"24_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized Complexity","author":"RG Downey","year":"1999","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1999)"},{"key":"24_CR8","unstructured":"Feghali, C., Abu-Khzam, F.N., M\u00fcller, H.: NP-hardness results for partitioning graphs into disjoint cliques and a triangle-free subgraph. CoRR, arxiv:1403.5248 (2014)"},{"key":"24_CR9","volume-title":"Parameterized Complexity Theory","author":"J Flum","year":"2006","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Heidelberg (2006)"},{"key":"24_CR10","volume-title":"Computers and Intractability: A Guide to the Theory of NP-completeness","author":"M Garey","year":"1979","unstructured":"Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-completeness. Freeman, San Francisco (1979)"},{"key":"24_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"624","DOI":"10.1007\/978-3-642-33090-2_54","volume-title":"Algorithms \u2013 ESA 2012","author":"Danny Hermelin","year":"2012","unstructured":"Hermelin, Danny, Mnich, Matthias, van Leeuwen, Erik Jan: Parameterized complexity of induced H-matching on claw-free graphs. In: Epstein, Leah, Ferragina, Paolo (eds.) ESA 2012. LNCS, vol. 7501, pp. 624\u2013635. Springer, Heidelberg (2012)"},{"key":"24_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1007\/978-3-642-22006-7_39","volume-title":"Automata, Languages and Programming","author":"Danny Hermelin","year":"2011","unstructured":"Hermelin, Danny, Mnich, Matthias, van Leeuwen, Erik Jan, Woeginger, Gerhard J.: Domination when the stars are out. In: Aceto, Luca, Henzinger, Monika, Sgall, Ji\u0159\u00ed (eds.) ICALP 2011, Part I. LNCS, vol. 6755, pp. 462\u2013473. Springer, Heidelberg (2011)"},{"key":"24_CR13","doi-asserted-by":"crossref","unstructured":"Kanj, I.A., Szeider, S.: On the subexponential time complexity of CSP. In: Proceedings of the 27th AAAI Conference on Artificial Intelligence (2013)","DOI":"10.1609\/aaai.v27i1.8609"},{"key":"24_CR14","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/j.disc.2014.06.001","volume":"332","author":"N Lichiardopol","year":"2014","unstructured":"Lichiardopol, N.: New lower bounds on independence number in triangle-free graphs in terms of order, maximum degree and girth. Discrete Math. 332, 55\u201359 (2014)","journal-title":"Discrete Math."},{"key":"24_CR15","first-page":"41","volume":"105","author":"D Lokshtanov","year":"2011","unstructured":"Lokshtanov, D., Marx, D., Saurabh, S.: Lower bounds based on the exponential time hypothesis. Bull. EATCS 105, 41\u201372 (2011)","journal-title":"Bull. EATCS"},{"issue":"2","key":"24_CR16","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/0166-218X(92)90041-8","volume":"35","author":"OJ Murphy","year":"1992","unstructured":"Murphy, O.J.: Computing independent sets in graphs with large girth. Discrete Appl. Math. 35(2), 167\u2013170 (1992)","journal-title":"Discrete Appl. Math."},{"key":"24_CR17","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. 31. Oxford University Press, Oxford (2006)"},{"key":"24_CR18","doi-asserted-by":"crossref","unstructured":"Perret du Cray, H., Sau, I.: Improved FPT algorithms for weighted independent set in bull-free graphs. CoRR, arXiv:1407.1706 (2014)","DOI":"10.1007\/978-3-319-13524-3_24"},{"key":"24_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 Mathematicae Universitatis Carolinae 15, 307\u2013309 (1974)","journal-title":"Commentationes Mathematicae Universitatis Carolinae"},{"issue":"1","key":"24_CR20","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/S0095-8956(03)00042-X","volume":"89","author":"N Robertson","year":"2003","unstructured":"Robertson, N., Seymour, P.D.: Graph minors. XVI. Excluding a non-planar graph. J. Comb. Theor. B 89(1), 43\u201376 (2003)","journal-title":"J. Comb. Theor. B"},{"key":"24_CR21","doi-asserted-by":"crossref","unstructured":"Thomass\u00e9, S., Trotignon, N., Vu\u0161kovi\u0107, K.: Parameterized algorithm for weighted independent set problem in bull-free graphs. CoRR, arXiv:1310.6205 . Short version to appear in the Proceedings of the 40th International Workshop on Graph-Theoretic Concepts in Computer Science (WG), June 2014 (2013)","DOI":"10.1007\/978-3-319-12340-0_34"}],"container-title":["Lecture Notes in Computer Science","Parameterized and Exact Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-13524-3_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,30]],"date-time":"2023-07-30T11:30:52Z","timestamp":1690716652000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-13524-3_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319135236","9783319135243"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-13524-3_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}