{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:15:13Z","timestamp":1759637713558,"version":"3.37.3"},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2020,1,6]],"date-time":"2020-01-06T00:00:00Z","timestamp":1578268800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,6]],"date-time":"2020-01-06T00:00:00Z","timestamp":1578268800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100004271","name":"Sapienza Universit\u00e0 di Roma","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004271","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100005728","name":"Universit\u00e0 del Salento","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100005728","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2021,3]]},"DOI":"10.1007\/s10107-019-01461-5","type":"journal-article","created":{"date-parts":[[2020,1,6]],"date-time":"2020-01-06T16:02:42Z","timestamp":1578326562000},"page":"409-437","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["An $${\\mathcal {O}}(n^2 \\log {n})$$ algorithm for the weighted stable set problem in claw-free graphs"],"prefix":"10.1007","volume":"186","author":[{"given":"Paolo","family":"Nobili","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1458-2449","authenticated-orcid":false,"given":"Antonio","family":"Sassano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,1,6]]},"reference":[{"issue":"4","key":"1461_CR1","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1002\/net.3230130406","volume":"13","author":"MO Ball","year":"1983","unstructured":"Ball, M.O., Derigs, U.: An analysis of alternative strategies for implementing matching algorithms. Networks 13(4), 517\u2013549 (1983)","journal-title":"Networks"},{"key":"1461_CR2","doi-asserted-by":"publisher","unstructured":"Chudnovsky, M., Seymour, P.D.: The structure of claw-free graphs. In: Surveys in Combinatorics (2005). https:\/\/doi.org\/10.1017\/CBO9780511734885.008","DOI":"10.1017\/CBO9780511734885.008"},{"issue":"4","key":"1461_CR3","doi-asserted-by":"publisher","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":"1","key":"1461_CR4","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1006\/jctb.1993.1052","volume":"59","author":"J Fouquet","year":"1993","unstructured":"Fouquet, J.: A strengthening of Ben Rebea\u2019s lemma. J. Comb. Theory Ser. B 59(1), 35\u201340 (1993)","journal-title":"J. Comb. Theory Ser. B"},{"key":"1461_CR5","unstructured":"Gabow, H.N.: Data structures for weighted matching and nearest common ancestors with linking. In: SODA, pp. 434\u2013443 (1990)"},{"key":"1461_CR6","doi-asserted-by":"crossref","unstructured":"Galil, Z., Micali, S., Gabow, H.N.: Priority queues with variable priority and an O(EV log V) algorithm for finding a maximal weighted matching in general graphs. In: 23rd Annual Symposium on Foundations of Computer Science, Chicago, Illinois, USA, 3\u20135 November 1982, pp. 255\u2013261 (1982)","DOI":"10.1109\/SFCS.1982.36"},{"issue":"3\u20134","key":"1461_CR7","doi-asserted-by":"publisher","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":"1461_CR8","unstructured":"Lov\u00e1sz, L., Plummer, M.: Matching theory. In: Annals of Discrete Mathematics, 29. North-Holland Mathematics Studies, 121. Amsterdam etc.: North-Holland. XXXIII, 544 p. (1986)"},{"key":"1461_CR9","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1016\/0095-8956(80)90074-X","volume":"28","author":"GJ Minty","year":"1980","unstructured":"Minty, G.J.: On maximal independent sets of vertices in claw-free graphs. J. Comb. Theory Ser. B 28, 284\u2013304 (1980)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"C","key":"1461_CR10","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/j.disopt.2016.01.002","volume":"19","author":"P Nobili","year":"2016","unstructured":"Nobili, P., Sassano, A.: An $${O}(n \\sqrt{m})$$ algorithm for the weighted stable set problem in Claw, Net-free graphs with $$\\alpha ({G}) \\ge 4$$. Discrete Optim. 19(C), 63\u201378 (2016). https:\/\/doi.org\/10.1016\/j.disopt.2016.01.002","journal-title":"Discrete Optim."},{"issue":"1","key":"1461_CR11","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/s10107-016-1080-9","volume":"164","author":"P Nobili","year":"2017","unstructured":"Nobili, P., Sassano, A.: An $${O}(m \\log n)$$ algorithm for the weighted stable set problem in claw-free graphs with $$\\alpha ({G}) \\le 3$$. Math. Program. 164(1), 157\u2013165 (2017). https:\/\/doi.org\/10.1007\/s10107-016-1080-9","journal-title":"Math. Program."},{"key":"1461_CR12","volume-title":"Combinatorial Optimization: Polyhedra and Efficiency","author":"A Schrijver","year":"2003","unstructured":"Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency. Springer, Berlin (2003)"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-019-01461-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-019-01461-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-019-01461-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,11]],"date-time":"2021-02-11T09:51:05Z","timestamp":1613037065000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-019-01461-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,1,6]]},"references-count":12,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2021,3]]}},"alternative-id":["1461"],"URL":"https:\/\/doi.org\/10.1007\/s10107-019-01461-5","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"type":"print","value":"0025-5610"},{"type":"electronic","value":"1436-4646"}],"subject":[],"published":{"date-parts":[[2020,1,6]]},"assertion":[{"value":"9 February 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 December 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 January 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}