{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:33:38Z","timestamp":1759638818161},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2008,3,14]],"date-time":"2008-03-14T00:00:00Z","timestamp":1205452800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2010,4]]},"DOI":"10.1007\/s00453-008-9176-0","type":"journal-article","created":{"date-parts":[[2008,3,13]],"date-time":"2008-03-13T15:18:51Z","timestamp":1205421531000},"page":"383-393","source":"Crossref","is-referenced-by-count":22,"title":["On Independent Vertex Sets in Subclasses of\u00a0Apple-Free Graphs"],"prefix":"10.1007","volume":"56","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","published-online":{"date-parts":[[2008,3,14]]},"reference":[{"key":"9176_CR1","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/j.dam.2003.09.003","volume":"145","author":"V.E. Alekseev","year":"2004","unstructured":"Alekseev, V.E., Lozin, V.V.: Augmenting graphs for independent sets. Discrete Appl. Math. 145, 3\u201310 (2004)","journal-title":"Discrete Appl. Math."},{"key":"9176_CR2","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/S0166-218X(02)00571-1","volume":"129","author":"A. Brandst\u00e4dt","year":"2003","unstructured":"Brandst\u00e4dt, A., Dragan, F.F.: On the linear and circular structure of (claw,net)-free graphs. Discrete Appl. Math. 129, 285\u2013303 (2003)","journal-title":"Discrete Appl. Math."},{"key":"9176_CR3","doi-asserted-by":"crossref","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 3509, pp. 265\u2013275 (2005)","DOI":"10.1007\/11496915_20"},{"key":"9176_CR4","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1016\/S0166-218X(00)00239-0","volume":"108","author":"A. Brandst\u00e4dt","year":"2001","unstructured":"Brandst\u00e4dt, A., Lozin, V.V.: A note on \u03b1-redundant vertices in graphs. Discrete Appl. Math. 108, 301\u2013308 (2001)","journal-title":"Discrete Appl. Math."},{"key":"9176_CR5","series-title":"SIAM Monographs on Discrete Math. Appl.","doi-asserted-by":"crossref","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)"},{"key":"9176_CR6","doi-asserted-by":"crossref","first-page":"1662","DOI":"10.1137\/S0097539799357775","volume":"30","author":"A. Brandst\u00e4dt","year":"2000","unstructured":"Brandst\u00e4dt, A., Dragan, F.F., K\u00f6hler, E.: Linear time algorithms for Hamiltonian problems on (claw,net)-free graphs. SIAM J. Comput. 30, 1662\u20131677 (2000)","journal-title":"SIAM J. Comput."},{"key":"9176_CR7","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/j.tcs.2006.10.035","volume":"370","author":"A. Brandst\u00e4dt","year":"2007","unstructured":"Brandst\u00e4dt, A., Le, V.B., Mahfud, S.: New applications of clique separator decomposition for the Maximum Weight Stable Set problem. Theor. Comp. Sci. 370, 229\u2013239 (2007). Extended abstract in: FCT 2005, LNCS 3623, 505\u2013516 (2005)","journal-title":"Theor. Comp. Sci."},{"key":"9176_CR8","series-title":"London Math. Soc. Lecture Note Series","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1017\/CBO9780511734885.008","volume-title":"Surveys in Combinatorics 2005","author":"M. Chudnovsky","year":"2005","unstructured":"Chudnovsky, M., Seymour, P.: The structure of clawfree graphs. In: Surveys in Combinatorics 2005. London Math. Soc. Lecture Note Series, vol. 327, pp. 153\u2013171. Cambridge University Press, Cambridge (2005)"},{"key":"9176_CR9","doi-asserted-by":"crossref","first-page":"51","DOI":"10.4007\/annals.2006.164.51","volume":"164","author":"M. Chudnovsky","year":"2006","unstructured":"Chudnovsky, M., Robertson, N., Seymour, P., Thomas, R.: The strong perfect graph theorem. Ann. Math. 164, 51\u2013229 (2006)","journal-title":"Ann. Math."},{"key":"9176_CR10","doi-asserted-by":"crossref","first-page":"926","DOI":"10.1137\/0214065","volume":"14","author":"D.G. Corneil","year":"1985","unstructured":"Corneil, D.G., Perl, Y., Stewart, L.K.: A linear recognition algorithm for cographs. SIAM J. Comput. 14, 926\u2013934 (1985)","journal-title":"SIAM J. Comput."},{"key":"9176_CR11","doi-asserted-by":"crossref","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 Comb. 9, 19\u201330 (1993)","journal-title":"Graphs Comb."},{"key":"9176_CR12","first-page":"297","volume-title":"The Theory and Applications of Graphs","author":"D. Duffus","year":"1981","unstructured":"Duffus, D., Gould, R.J., Jacobson, M.S.: Forbidden subgraphs and the Hamiltonian theme. In: The Theory and Applications of Graphs (Kalamazoo, Mich. 1980), pp. 297\u2013316. Wiley, New York (1981)"},{"key":"9176_CR13","unstructured":"Frank, A.: Some polynomial algorithms for certain graphs and hypergraphs. In: Proceedings of the Fifth British Combinatorial Conference, pp. 211\u2013226. Univ. Aberdeen, Aberdeen (1975). Congressus Numerantium No. XV. Utilitas Math., Winnipeg (1976)"},{"key":"9176_CR14","doi-asserted-by":"crossref","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 Comb. 19, 347\u2013356 (2003)","journal-title":"Graphs Comb."},{"key":"9176_CR15","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/S0166-218X(03)00395-0","volume":"132","author":"M.U. Gerber","year":"2003","unstructured":"Gerber, M.U., Hertz, A., Lozin, V.V.: Stable sets in two subclasses of banner-free graphs. Discrete Appl. Math. 132, 121\u2013136 (2003)","journal-title":"Discrete Appl. Math."},{"key":"9176_CR16","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"M.C. Golumbic","year":"1980","unstructured":"Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Academic Press, San Diego (1980)"},{"key":"9176_CR17","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/BF02579273","volume":"1","author":"M. Gr\u00f6tschel","year":"1981","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., Schrijver, A.: The ellipsoid method and its consequences in combinatorial optimization. Combinatorica 1, 169\u2013197 (1981)","journal-title":"Combinatorica"},{"key":"9176_CR18","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/BF02579377","volume":"5","author":"P.L. Hammer","year":"1985","unstructured":"Hammer, P.L., Mahadev, N.V.R., de Werra, D.: The struction of a graph: Application to CN-free graphs. Combinatorica 5, 141\u2013147 (1985)","journal-title":"Combinatorica"},{"key":"9176_CR19","doi-asserted-by":"crossref","first-page":"2755","DOI":"10.1016\/j.disc.2006.04.022","volume":"306","author":"A. Kelmans","year":"2006","unstructured":"Kelmans, A.: On Hamiltonicity of (claw,net)-free graphs. Discrete Math. 306, 2755\u20132761 (2006)","journal-title":"Discrete Math."},{"key":"9176_CR20","doi-asserted-by":"crossref","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. Eur. J. Oper. Res. 125, 292\u2013297 (2000)","journal-title":"Eur. J. Oper. Res."},{"key":"9176_CR21","unstructured":"Lozin, V.V., Milani\u010d, M.: Maximum independent sets in graphs of low degree. In: Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms SODA, pp. 874\u2013880 (2007)"},{"key":"9176_CR22","unstructured":"Mahadev, N.V.R.: Vertex deletion and stability number. Research Report OR WR 90\/2, Dept. of Mathematics, Swiss Federal Institute of Technology (1990)"},{"key":"9176_CR23","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/S0012-365X(98)00319-7","volume":"201","author":"R.M. McConnell","year":"1999","unstructured":"McConnell, R.M., Spinrad, J.: Modular decomposition and transitive orientation. Discrete Math. 201, 189\u2013241 (1999)","journal-title":"Discrete Math."},{"key":"9176_CR24","volume-title":"Algorithmic Developments and Complexity Results for Finding Maximum and Exact Independent Sets in Graphs","author":"M. Milani\u010d","year":"2007","unstructured":"Milani\u010d, M.: Algorithmic Developments and Complexity Results for Finding Maximum and Exact Independent Sets in Graphs. Rutgers University Press, New Brunswick (2007)"},{"key":"9176_CR25","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1016\/0095-8956(80)90074-X","volume":"28","author":"G.M. Minty","year":"1980","unstructured":"Minty, G.M.: On maximal independent sets of vertices in claw-free graphs. J. Comb. Theory B 28, 284\u2013304 (1980)","journal-title":"J. Comb. Theory B"},{"key":"9176_CR26","first-page":"257","volume":"19","author":"R.H. M\u00f6hring","year":"1984","unstructured":"M\u00f6hring, R.H., Radermacher, F.J.: Substitution decomposition for discrete structures and connections with combinatorial optimization. Ann. Discrete Math. 19, 257\u2013356 (1984)","journal-title":"Ann. Discrete Math."},{"key":"9176_CR27","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/S0166-218X(99)00046-3","volume":"92","author":"R. Mosca","year":"1999","unstructured":"Mosca, R.: Stable sets in certain P 6-free graphs. Discrete Appl. Math. 92, 177\u2013191 (1999)","journal-title":"Discrete Appl. Math."},{"key":"9176_CR28","doi-asserted-by":"crossref","unstructured":"Mosca, R.: Stable sets of maximum weight in (P 7,banner)-free graphs. Discrete Math. (2008, to appear)","DOI":"10.1016\/j.disc.2007.03.044"},{"key":"9176_CR29","doi-asserted-by":"crossref","first-page":"194","DOI":"10.15807\/jorsj.44.194","volume":"44","author":"D. Nakamura","year":"2001","unstructured":"Nakamura, D., Tamura, A.: A revision of Minty\u2019s algorithm for finding a maximum weighted stable set of a claw-free graph. J. Oper. Res. Soc. Jpn. 44, 194\u2013204 (2001)","journal-title":"J. Oper. Res. Soc. Jpn."},{"key":"9176_CR30","doi-asserted-by":"crossref","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. Comb. Theory B 47, 187\u2013191 (1989)","journal-title":"J. Comb. Theory B"},{"key":"9176_CR31","first-page":"307","volume":"15","author":"S. Poljak","year":"1974","unstructured":"Poljak, S.: A note on stable sets and colorings of graphs. Commun. Math. Univ. Carolinae 15, 307\u2013309 (1974)","journal-title":"Commun. Math. Univ. Carolinae"},{"key":"9176_CR32","series-title":"Fields Institute Monographs","doi-asserted-by":"crossref","DOI":"10.1090\/fim\/019","volume-title":"Efficient Graph Representations","author":"J.P. Spinrad","year":"2003","unstructured":"Spinrad, J.P.: Efficient Graph Representations. Fields Institute Monographs, vol.\u00a019. American Mathematical Society, Providence (2003)"},{"key":"9176_CR33","doi-asserted-by":"crossref","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. 55, 221\u2013232 (1985)","journal-title":"Discrete Math."},{"key":"9176_CR34","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":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-008-9176-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-008-9176-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-008-9176-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T13:45:01Z","timestamp":1559137501000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-008-9176-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,3,14]]},"references-count":34,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2010,4]]}},"alternative-id":["9176"],"URL":"https:\/\/doi.org\/10.1007\/s00453-008-9176-0","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,3,14]]}}}