{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T07:35:37Z","timestamp":1725521737936},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540921813"},{"type":"electronic","value":"9783540921820"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-92182-0_74","type":"book-chapter","created":{"date-parts":[[2008,12,9]],"date-time":"2008-12-09T21:38:06Z","timestamp":1228858686000},"page":"848-858","source":"Crossref","is-referenced-by-count":2,"title":["Independent Sets of Maximum Weight in Apple-Free Graphs"],"prefix":"10.1007","author":[{"given":"Andreas","family":"Brandst\u00e4dt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tilo","family":"Klembt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vadim V.","family":"Lozin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Raffaele","family":"Mosca","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"74_CR1","doi-asserted-by":"publisher","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.\u00a0Nat.\u00a0Acad.\u00a0Sci.\u00a0USA\u00a043, 842\u2013844 (1957)","journal-title":"Proc.\u00a0Nat.\u00a0Acad.\u00a0Sci.\u00a0USA"},{"key":"74_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/11496915_20","volume-title":"Integer Programming and Combinatorial Optimization","author":"A. Brandst\u00e4dt","year":"2005","unstructured":"Brandst\u00e4dt, A., Ho\u00e0ng, C.T.: On Clique Separators, Nearly Chordal Graphs, and the Maximum Weight Stable Set Problem. In: J\u00fcnger, M., Kaibel, V. (eds.) IPCO 2005. LNCS, vol.\u00a03509, pp. 265\u2013275. Springer, Heidelberg (2005); Theoretical Computer Science\u00a0389, 295\u2013306 (2007)"},{"key":"74_CR3","series-title":"Lecture Notes in Computer Science","first-page":"505","volume-title":"Fundamentals of Computation Theory","author":"A. Brandst\u00e4dt","year":"2005","unstructured":"Brandst\u00e4dt, A., Le, V.B., Mahfud, S.: New applications of clique separator decomposition for the Maximum Weight Stable Set Problem. In: Li\u015bkiewicz, M., Reischuk, R. (eds.) FCT 2005. LNCS, vol.\u00a03623, pp. 505\u2013516. Springer, Heidelberg (2005); Theoretical Computer Science\u00a0370, 229\u2013239 (2007)"},{"key":"74_CR4","series-title":"SIAM Monographs on Discrete Math. Appl","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. SIAM Monographs on Discrete Math. Appl., vol.\u00a03. SIAM, Philadelphia (1999)"},{"issue":"3","key":"74_CR5","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1016\/j.jctb.2006.06.001","volume":"97","author":"M. Chudnovsky","year":"2007","unstructured":"Chudnovsky, M., Seymour, P.: The roots of the independence polynomial of a clawfree graph. J. Combin. Theory Ser. B\u00a097(3), 350\u2013357 (2007)","journal-title":"J. Combin. Theory Ser. B"},{"key":"74_CR6","doi-asserted-by":"publisher","first-page":"867","DOI":"10.1016\/j.jctb.2007.02.002","volume":"97","author":"M. Chudnovsky","year":"2007","unstructured":"Chudnovsky, M., Seymour, P.: Clawfree graphs I \u2013 Orientable prismatic graphs. J. Combin. Theory Ser. B\u00a097, 867\u2013901 (2007)","journal-title":"J. Combin. Theory Ser. B"},{"key":"74_CR7","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1016\/j.jctb.2007.06.006","volume":"98","author":"M. Chudnovsky","year":"2008","unstructured":"Chudnovsky, M., Seymour, P.: Clawfree graphs II \u2013 Nonorientable prismatic graphs. J. Combin. Theory Ser. B\u00a098, 249\u2013290 (2008)","journal-title":"J. Combin. Theory Ser. B"},{"key":"74_CR8","unstructured":"Chudnovsky, M., Seymour, P.: Clawfree graphs III \u2013 Circular interval graphs. J. Combin. Theory Ser. B (to appear)"},{"key":"74_CR9","unstructured":"Chudnovsky, M., Seymour, P.: Clawfree graphs IV \u2013 Decomposition theorem. J. Combin. Theory Ser. B (to appear)"},{"key":"74_CR10","unstructured":"Chudnovsky, M., Seymour, P.: Clawfree graphs V \u2013 Global structure. J. Combin. Theory Ser. B (to appear)"},{"key":"74_CR11","unstructured":"Chudnovsky, M., Seymour, P.: Clawfree graphs VI \u2013 The structure of quasi-line graphs (submitted)"},{"key":"74_CR12","unstructured":"Chudnovsky, M., Seymour, P.: Clawfree graphs VII \u2013 Coloring claw-free graphs (submitted)"},{"key":"74_CR13","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/0166-218X(81)90013-5","volume":"3","author":"D.G. Corneil","year":"1981","unstructured":"Corneil, D.G., Lerchs, H., Stewart, L.: Complement reducible graphs. Discrete Appl. Math.\u00a03, 163\u2013174 (1981)","journal-title":"Discrete Appl. Math."},{"key":"74_CR14","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/BF01195324","volume":"9","author":"C. Simone De","year":"1993","unstructured":"De Simone, C.: On the vertex packing problem. Graphs and Combinatorics\u00a09, 19\u201330 (1993)","journal-title":"Graphs and Combinatorics"},{"key":"74_CR15","doi-asserted-by":"publisher","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","volume":"17","author":"J. Edmonds","year":"1965","unstructured":"Edmonds, J.: Paths, trees and flowers. Canad. J. of Mathematics\u00a017, 449\u2013467 (1965)","journal-title":"Canad. J. of Mathematics"},{"key":"74_CR16","doi-asserted-by":"publisher","first-page":"125","DOI":"10.6028\/jres.069B.013","volume":"69B","author":"J. Edmonds","year":"1965","unstructured":"Edmonds, J.: Maximum matching and a polyhedron with 0,1-vertices. J.\u00a0Res.\u00a0Nat.\u00a0Bur. Standards Sect.\u00a0B\u00a069B, 125\u2013130 (1965)","journal-title":"J.\u00a0Res.\u00a0Nat.\u00a0Bur. Standards Sect.\u00a0B"},{"key":"74_CR17","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/S0012-365X(96)00045-3","volume":"164","author":"R. Faudree","year":"1997","unstructured":"Faudree, R., Flandrin, E., Ryj\u00e1\u010dek, Z.: Claw-free graphs \u2013 a survey. Discrete Math.\u00a0164, 87\u2013147 (1997)","journal-title":"Discrete Math."},{"key":"#cr-split#-74_CR18.1","unstructured":"Frank, A.: Some polynomial algorithms for certain graphs and hypergraphs. In: Proceedings of the Fifth British Combinatorial Conference (Univ. Aberdeen, Aberdeen 1975), pp. 211???226 (1975);"},{"key":"#cr-split#-74_CR18.2","unstructured":"Frank, A.: Some polynomial algorithms for certain graphs and hypergraphs. In: Proceedings of the Fifth British Combinatorial Conference (Univ. Aberdeen, Aberdeen 1975), pp. 211\u2013226 (1975); Congressus Numerantium No. XV, Utilitas Math., Winnipeg, Man. (1976)"},{"key":"74_CR19","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1137\/0201013","volume":"1","author":"F. Gavril","year":"1972","unstructured":"Gavril, F.: Algorithms for minimum coloring, maximum clique, minimum covering by cliques, and maximum independent set of a chordal graph. SIAM J.\u00a0Computing\u00a01, 180\u2013187 (1972)","journal-title":"SIAM J.\u00a0Computing"},{"key":"74_CR20","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/s00373-002-0517-5","volume":"19","author":"M.U. Gerber","year":"2003","unstructured":"Gerber, M.U., Lozin, V.V.: Robust algorithms for the stable set problem. Graphs and Combinatorics\u00a019, 347\u2013356 (2003)","journal-title":"Graphs and Combinatorics"},{"key":"74_CR21","series-title":"Annals of Discrete Mathematics","volume-title":"Algorithmic graph theory and perfect graphs","author":"M.C. Golumbic","year":"2004","unstructured":"Golumbic, M.C.: Algorithmic graph theory and perfect graphs, 2nd edn. Annals of Discrete Mathematics, vol.\u00a057. Elsevier Science B.V, Amsterdam (2004)","edition":"2"},{"key":"74_CR22","unstructured":"Lov\u00e1sz, L., Plummer, M.D.: Matching theory. Annals of Discrete Mathematics\u00a029 (1986)"},{"key":"74_CR23","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1016\/S0377-2217(99)00460-9","volume":"125","author":"V.V. Lozin","year":"2000","unstructured":"Lozin, V.V.: Stability in P 5- and banner-free graphs. European Journal of Operational Research\u00a0125, 292\u2013297 (2000)","journal-title":"European Journal of Operational Research"},{"key":"74_CR24","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1016\/0095-8956(80)90074-X","volume":"28","author":"G.J. Minty","year":"1980","unstructured":"Minty, G.J.: On maximal independent sets of vertices in claw-free graphs. J.\u00a0Combinatorial Theory, Ser. B\u00a028, 284\u2013304 (1980)","journal-title":"J.\u00a0Combinatorial Theory, Ser. B"},{"key":"74_CR25","first-page":"194","volume":"44","author":"D. Nakamura","year":"2001","unstructured":"Nakamura, D., Tamura, A.: A revision of Minty\u2019s algorithm for finding a maximum weight stable set of a claw-free graph. J.\u00a0Oper.\u00a0Res.\u00a0Soc.\u00a0Japan\u00a044, 194\u2013204 (2001)","journal-title":"J.\u00a0Oper.\u00a0Res.\u00a0Soc.\u00a0Japan"},{"key":"74_CR26","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/0095-8956(89)90019-1","volume":"47","author":"S. Olariu","year":"1989","unstructured":"Olariu, S.: The strong perfect graph conjecture for pan-free graphs. J. Combin. Th (B)\u00a047, 187\u2013191 (1989)","journal-title":"J. Combin. Th. (B)"},{"key":"74_CR27","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/0012-365X(90)90287-R","volume":"29","author":"N. Sbihi","year":"1980","unstructured":"Sbihi, N.: Algorithme de recherche d\u2019un stable de cardinalit\u00e9 maximum dans un graphe sans \u00e9toile. Discrete Math.\u00a029, 53\u201376 (1980)","journal-title":"Discrete Math."},{"key":"74_CR28","doi-asserted-by":"crossref","unstructured":"Spinrad, J.P.: Efficient Graph Representations, Fields Institute Monographs 19. American Mathematical Society, Providence (2003)","DOI":"10.1090\/fim\/019"},{"key":"74_CR29","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/0012-365X(85)90051-2","volume":"55","author":"R.E. Tarjan","year":"1985","unstructured":"Tarjan, R.E.: Decomposition by clique separators. Discrete Math.\u00a055, 221\u2013232 (1985)","journal-title":"Discrete Math."},{"key":"74_CR30","volume-title":"Topics on perfect graphs","author":"S.H. Whitesides","year":"1984","unstructured":"Whitesides, S.H.: A method for solving certain graph recognition and optimization problems, with applications to perfect graphs. In: Berge, C., Chv\u00e1tal, V. (eds.) Topics on perfect graphs. North-Holland, Amsterdam (1984)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-92182-0_74","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T23:44:29Z","timestamp":1557963869000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-92182-0_74"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540921813","9783540921820"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-92182-0_74","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}