{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:59:20Z","timestamp":1725559160541},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540261995"},{"type":"electronic","value":"9783540321026"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11496915_20","type":"book-chapter","created":{"date-parts":[[2010,7,14]],"date-time":"2010-07-14T12:40:39Z","timestamp":1279111239000},"page":"265-275","source":"Crossref","is-referenced-by-count":7,"title":["On Clique Separators, Nearly Chordal Graphs, and the Maximum Weight Stable Set Problem"],"prefix":"10.1007","author":[{"given":"Andreas","family":"Brandst\u00e4dt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ch\u00ednh T.","family":"Ho\u00e0ng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"20_CR1","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/S0166-218X(03)00387-1","volume":"132","author":"V.E. Alekseev","year":"2004","unstructured":"Alekseev, V.E.: On easy and hard hereditary classes of graphs with respect to the independent set problem. Discrete Applied Math.\u00a0132, 17\u201326 (2004)","journal-title":"Discrete Applied Math."},{"key":"20_CR2","doi-asserted-by":"publisher","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 Applied Math.\u00a0145, 3\u201310 (2004)","journal-title":"Discrete Applied Math."},{"key":"20_CR3","unstructured":"Bang-Jensen, J., Huang, J., MacGillivray, G., Yeo, A.: Domination in convex bipartite and convex-round graphs (2002) (manuscript)"},{"key":"20_CR4","doi-asserted-by":"publisher","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 Applied Math.\u00a0129, 285\u2013303 (2003)","journal-title":"Discrete Applied Math."},{"key":"20_CR5","volume-title":"SIAM Monographs on Discrete Math. Appl.","author":"A. Brandst\u00e4dt","year":"1999","unstructured":"Brandst\u00e4dt, A., Le, V.B., Spinrad, J.P.: Graph Classes: A Survey. In: SIAM Monographs on Discrete Math. Appl., vol.\u00a03. SIAM, Philadelphia (1999)"},{"key":"20_CR6","doi-asserted-by":"publisher","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 Applied Math.\u00a0108, 301\u2013308 (2001)","journal-title":"Discrete Applied Math."},{"key":"20_CR7","unstructured":"Chudnovsky, M., Robertson, N., Seymour, P., Thomas, R.: The Strong Perfect Graph Theorem (2002) (manuscript)"},{"key":"20_CR8","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-Burlingham, L.K.: Complement reducible graphs. Discrete Applied Math.\u00a03, 163\u2013174 (1981)","journal-title":"Discrete Applied Math."},{"key":"20_CR9","first-page":"249","volume":"43","author":"D.G. Corneil","year":"1984","unstructured":"Corneil, D.G., Perl, Y., Stewart, L.K.: Cographs: recognition, applications, and algorithms. Congressus Numer.\u00a043, 249\u2013258 (1984)","journal-title":"Congressus Numer."},{"key":"20_CR10","doi-asserted-by":"publisher","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. Computing\u00a014, 926\u2013934 (1985)","journal-title":"SIAM J. Computing"},{"key":"20_CR11","first-page":"83","volume":"19","author":"C. Ebenegger","year":"1984","unstructured":"Ebenegger, C., Hammer, P.L., de Werra, D.: Pseudo-Boolean functions and stability of graphs. Annals Discrete Math.\u00a019, 83\u201398 (1984)","journal-title":"Annals Discrete Math."},{"key":"#cr-split#-20_CR12.1","unstructured":"Frank, A.: Some polynomial algorithms for certain graphs and hypergraphs. In: Proceedings of the Fifth British Combinatorial Conference, pp. 211???226. Univ. Aberdeen, Aberdeen (1975);"},{"key":"#cr-split#-20_CR12.2","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, Man (1976)"},{"key":"20_CR13","doi-asserted-by":"publisher","first-page":"314","DOI":"10.1016\/0196-6774(88)90023-5","volume":"9","author":"M.C. Golumbic","year":"1988","unstructured":"Golumbic, M.C., Hammer, P.L.: Stability in circular-arc graphs. J. Algorithms\u00a09, 314\u2013320 (1988)","journal-title":"J. Algorithms"},{"key":"20_CR14","doi-asserted-by":"publisher","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\u00a01, 169\u2013197 (1981)","journal-title":"Combinatorica"},{"issue":"B","key":"20_CR15","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/0095-8956(85)90089-9","volume":"38","author":"P.L. Hammer","year":"1985","unstructured":"Hammer, P.L., Mahadev, N.V.R., de Werra, D.: Stability in CAN-free graphs. J. Combin. Th.\u00a038(B), 23\u201330 (1985)","journal-title":"J. Combin. Th."},{"key":"20_CR16","doi-asserted-by":"publisher","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\u00a05, 141\u2013147 (1985)","journal-title":"Combinatorica"},{"key":"20_CR17","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\n                        5- and banner-free graphs. European J. Oper. Res.\u00a0125, 292\u2013297 (2000)","journal-title":"European J. Oper. Res."},{"key":"20_CR18","doi-asserted-by":"publisher","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.\u00a0201, 189\u2013241 (1999)","journal-title":"Discrete Math."},{"key":"20_CR19","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. Annals of Discrete Math.\u00a019, 257\u2013356 (1984)","journal-title":"Annals of Discrete Math."},{"key":"20_CR20","doi-asserted-by":"publisher","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\n                        6-free graphs. Discrete Applied Math.\u00a092, 177\u2013191 (1999)","journal-title":"Discrete Applied Math."},{"key":"20_CR21","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\u00a015, 307\u2013309 (1974)","journal-title":"Commun. Math. Univ. Carolinae"},{"key":"20_CR22","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":"20_CR23","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","Integer Programming and Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11496915_20.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T02:40:21Z","timestamp":1619491221000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11496915_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540261995","9783540321026"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/11496915_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}