{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:40:30Z","timestamp":1740109230478,"version":"3.37.3"},"reference-count":5,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2016,11,4]],"date-time":"2016-11-04T00:00:00Z","timestamp":1478217600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2017,7]]},"DOI":"10.1007\/s10107-016-1080-9","type":"journal-article","created":{"date-parts":[[2016,11,4]],"date-time":"2016-11-04T00:48:45Z","timestamp":1478220525000},"page":"157-165","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["An \n                $$\\mathcal{O}(m\\log n)$$\n                \n                    \n                                    \n                        \n                            O\n                            (\n                            m\n                            log\n                            n\n                            )\n                        \n                    \n                \n             algorithm for the weighted stable set problem in claw-free graphs with \n                $$\\alpha ({G}) \\le 3$$\n                \n                    \n                                    \n                        \n                            \u03b1\n                            (\n                            G\n                            )\n                            \u2264\n                            3"],"prefix":"10.1007","volume":"164","author":[{"given":"Paolo","family":"Nobili","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1458-2449","authenticated-orcid":false,"given":"Antonio","family":"Sassano","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,11,4]]},"reference":[{"key":"1080_CR1","doi-asserted-by":"crossref","first-page":"842","DOI":"10.1073\/pnas.43.9.842","volume":"43","author":"C Berge","year":"1957","unstructured":"Berge, C.: Two theorems in graph theory. Proc. Natl. Acad. Sci. USA 43, 842\u2013844 (1957)","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"1080_CR2","doi-asserted-by":"crossref","unstructured":"Chudnovsky, M., Seymour, P.D.: The structure of claw-free graphs. In: Surveys in Combinatorics, pp. 153\u2013171 (2005)","DOI":"10.1017\/CBO9780511734885.008"},{"issue":"4","key":"1080_CR3","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1145\/2629600","volume":"61","author":"Y Faenza","year":"2014","unstructured":"Faenza, Y., Oriolo, G., Stauffer, G.: Solving the weighted stable set problem in claw-free graphs via decomposition. J. ACM 61(4), 20 (2014)","journal-title":"J. ACM"},{"issue":"3\u20134","key":"1080_CR4","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/S0020-0190(00)00047-8","volume":"74","author":"T Kloks","year":"2000","unstructured":"Kloks, T., Kratsch, D., M\u00fcller, H.: Finding and counting small induced subgraphs efficiently. Inf. Process. Lett. 74(3\u20134), 115\u2013121 (2000)","journal-title":"Inf. Process. Lett."},{"key":"1080_CR5","unstructured":"Nobili, P. Sassano, A.: An \n                        $${O}(n^2 \\log n)$$\n                        \n                            \n                                            \n                                \n                                    O\n                                    (\n                                    \n                                        n\n                                        2\n                                    \n                                    log\n                                    n\n                                    )\n                                \n                            \n                        \n                     algorithm for the weighted stable set problem in claw-free graphs, CoRR abs\/1501.05775. \n                        http:\/\/arxiv.org\/abs\/1501.05775"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-016-1080-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-016-1080-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-016-1080-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,9]],"date-time":"2017-06-09T03:10:04Z","timestamp":1496977804000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-016-1080-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,11,4]]},"references-count":5,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2017,7]]}},"alternative-id":["1080"],"URL":"https:\/\/doi.org\/10.1007\/s10107-016-1080-9","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"type":"print","value":"0025-5610"},{"type":"electronic","value":"1436-4646"}],"subject":[],"published":{"date-parts":[[2016,11,4]]}}}