{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,20]],"date-time":"2025-11-20T06:22:43Z","timestamp":1763619763087},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2010,2,21]],"date-time":"2010-02-21T00:00:00Z","timestamp":1266710400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2011,8]]},"DOI":"10.1007\/s10479-010-0720-3","type":"journal-article","created":{"date-parts":[[2010,2,19]],"date-time":"2010-02-19T22:44:40Z","timestamp":1266619480000},"page":"359-370","source":"Crossref","is-referenced-by-count":8,"title":["Complexity results for equistable graphs and related classes"],"prefix":"10.1007","volume":"188","author":[{"given":"Martin","family":"Milani\u010d","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"James","family":"Orlin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G\u00e1bor","family":"Rudolf","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,2,21]]},"reference":[{"key":"720_CR1","series-title":"Lecture notes in computer science","first-page":"849","volume-title":"Proceedings of ISAAC 2008","author":"A. Brandst\u00e4dt","year":"2008","unstructured":"Brandst\u00e4dt, A., Klembt, T., Lozin, V. V., & Mosca, R. (2008). On independent vertex sets in subclasses of apple-free graphs. In Lecture notes in computer science : Vol. 5369. Proceedings of ISAAC 2008 (pp. 849\u2013859). Berlin: Springer."},{"key":"720_CR2","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/j.tcs.2006.10.035","volume":"70","author":"A. Brandst\u00e4dt","year":"2007","unstructured":"Brandst\u00e4dt, A., Le, V. B., & Mahfud, S. (2007). New applications of clique separator decomposition for the maximum weight stable set problem. Theoretical Computer Science, 70, 229\u2013239.","journal-title":"Theoretical Computer Science"},{"key":"720_CR3","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/S0020-0190(02)00291-0","volume":"84","author":"A. Brandst\u00e4dt","year":"2002","unstructured":"Brandst\u00e4dt, A., & Mahfud, S. (2002). Maximum weight stable set on graphs without claw and co-claw (and similar graph classes) can be solved in linear time. Information Processing Letters, 84, 251\u2013259.","journal-title":"Information Processing Letters"},{"key":"720_CR4","unstructured":"Erd\u0151s, P. (1955). Problems and results from additive number theory, Colloq. Th\u00e9orie des nombres (pp.\u00a0127\u2013137), Bruxells."},{"key":"720_CR5","volume-title":"Computers and intractability. A guide to the theory of NP-completeness","author":"M. R. Garey","year":"1979","unstructured":"Garey, M. R., & Johnson, D. S. (1979). Computers and intractability. A guide to the theory of NP-completeness. New York: Freeman."},{"key":"720_CR6","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/S0166-218X(97)00093-0","volume":"80","author":"V. Giakoumakis","year":"1997","unstructured":"Giakoumakis, V., & Rusu, I. (1997). Weighted parameters in $(P_{5},\\overline{P}_{5})$ -free graphs. Discrete Applied Mathematics, 80, 255\u2013261.","journal-title":"Discrete Applied Mathematics"},{"key":"720_CR7","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/S0166-218X(03)00397-4","volume":"132","author":"E. Korach","year":"2003","unstructured":"Korach, E., & Peled, U. N. (2003). Equistable series-parallel graphs. Stability in graphs and related topics. Discrete Applied Mathematics, 132, 149\u2013162.","journal-title":"Discrete Applied Mathematics"},{"key":"720_CR8","doi-asserted-by":"crossref","first-page":"462","DOI":"10.1016\/j.dam.2006.06.018","volume":"156","author":"E. Korach","year":"2008","unstructured":"Korach, E., Peled, U. N., & Rotics, U. (2008). Equistable distance-hereditary graphs. Discrete Applied Mathematics, 156, 462\u2013477.","journal-title":"Discrete Applied Mathematics"},{"key":"720_CR9","doi-asserted-by":"crossref","first-page":"595","DOI":"10.1016\/j.jda.2008.04.001","volume":"4","author":"V. V. Lozin","year":"2008","unstructured":"Lozin, V. V., & Milani\u010d, M. (2008). A polynomial algorithm to find an independent set of maximum weight in a fork-free graph. Journal of Discrete Algorithms, 4, 595\u2013604.","journal-title":"Journal of Discrete Algorithms"},{"key":"720_CR10","series-title":"Annals of discrete mathematics","volume-title":"Threshold graphs and related topics","author":"N. V. R. Mahadev","year":"1995","unstructured":"Mahadev, N. V. R., & Peled, U. N. (1995). Threshold graphs and related topics. Annals of discrete mathematics, 56. Amsterdam: North-Holland."},{"key":"720_CR11","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1002\/jgt.3190180307","volume":"18","author":"N. V. R. Mahadev","year":"1994","unstructured":"Mahadev, N. V. R., Peled, U. N., & Sun, F. (1994). Equistable graphs. J. Graph Theory, 18, 281\u2013299.","journal-title":"J. Graph Theory"},{"key":"720_CR12","unstructured":"Milani\u010d, M., & Rudolf, G. (2009). Structural results for equistable graphs and related graph classes (RUTCOR Research Report 25-2009)."},{"key":"720_CR13","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1016\/j.disc.2007.03.044","volume":"308","author":"R. Mosca","year":"2008","unstructured":"Mosca, R. (2008). Stable sets of maximum weight in (P 7, banner)-free graphs. Discrete Mathematics, 308, 20\u201333.","journal-title":"Discrete Mathematics"},{"key":"720_CR14","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0012-365X(90)90286-Q","volume":"29","author":"C. Payan","year":"1980","unstructured":"Payan, C. (1980). A class of threshold and domishold graphs: equistable and equidominating graphs. Discrete Mathematics, 29, 47\u201352.","journal-title":"Discrete Mathematics"},{"key":"720_CR15","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/S0166-218X(03)00401-3","volume":"132","author":"U. N. Peled","year":"2003","unstructured":"Peled, U. N., & Rotics, U. (2003). Equistable chordal graphs. Stability in graphs and related topics. Discrete Applied Mathematics, 132, 203\u2013210.","journal-title":"Discrete Applied Mathematics"},{"key":"720_CR16","first-page":"42","volume":"2","author":"A. Rubin","year":"1981","unstructured":"Rubin, A. (1981). A note on sum-distinct sets and a problem of Erd\u0151s. Abstracts of the AMS, 2, 42.","journal-title":"Abstracts of the AMS"},{"key":"720_CR17","first-page":"118","volume-title":"Proceedings 11th annual ACM symposium on theory of computing","author":"A. Shamir","year":"1979","unstructured":"Shamir, A. (1979). On the cryptocomplexity of knapsack systems. In Proceedings 11th annual ACM symposium on theory of computing (pp. 118\u2013129). New York: Association for Computing Machinery."},{"key":"720_CR18","unstructured":"van Emde Boas, P. (1981). Another NP-complete partition problem and the complexity of computing short vectors in a lattice (Report No. 81-04). Department of Mathematics, University of Amsterdam."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-010-0720-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-010-0720-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-010-0720-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T14:08:00Z","timestamp":1559138880000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-010-0720-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,2,21]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011,8]]}},"alternative-id":["720"],"URL":"https:\/\/doi.org\/10.1007\/s10479-010-0720-3","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,2,21]]}}}