{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T17:13:27Z","timestamp":1704129207902},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2005,9,1]],"date-time":"2005-09-01T00:00:00Z","timestamp":1125532800000},"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":[[2005,9]]},"DOI":"10.1007\/s10479-005-2452-3","type":"journal-article","created":{"date-parts":[[2005,8,30]],"date-time":"2005-08-30T02:51:26Z","timestamp":1125370286000},"page":"179-187","source":"Crossref","is-referenced-by-count":11,"title":["Packing r-Cliques in Weighted Chordal Graphs"],"prefix":"10.1007","volume":"138","author":[{"given":"P.","family":"Hell","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Klein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"L. T.","family":"Nogueira","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"F.","family":"Protti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"2452_CR1","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0012-365X(94)00296-U","volume":"152","author":"A. Brandst\u00e4dt","year":"1996","unstructured":"Brandst\u00e4dt, A. (1996). \u201cPartitions of Graphs Into One or Two Independent Sets and Cliques.\u201d Discrete Mathematics 152, 47\u201354.","journal-title":"Discrete Mathematics"},{"key":"2452_CR2","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/S0166-218X(98)00116-4","volume":"89","author":"A. Brandst\u00e4dt","year":"1998","unstructured":"Brandst\u00e4dt, A. (1998). \u201cThe Complexity of Some Problems Related to Graph 3-Colorability.\u201d Discrete Applied Mathematics 89, 59\u201373.","journal-title":"Discrete Applied Mathematics"},{"key":"2452_CR3","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0166-218X(92)90275-F","volume":"24","author":"K. Cameron","year":"1989","unstructured":"Cameron, K. (1989). \u201cInduced Matchings.\u201d Discrete Applied Mathematics 24, 97\u2013102.","journal-title":"Discrete Applied Mathematics"},{"key":"2452_CR4","unstructured":"Farber, M. (1982). \u201cApplications of Linear Programming Duality to Problems Involving Independence and Domination.\u201d Ph.D. Thesis, Rutgers University."},{"key":"2452_CR5","doi-asserted-by":"crossref","unstructured":"Feder, T., P. Hell, S. Klein, and R. Motwani. (1999). \u201cComplexity of Graph Partition Problems.\u201d In F.W. Thatcher and R. E. Miller (eds.), Proceedings of the 31st Annual ACM Symposium on Theory of Computing\u2014STOC'99. New York: Plenum Press, pp. 464\u2013472.","DOI":"10.1145\/301250.301373"},{"key":"2452_CR6","unstructured":"Foldes, S. and P. Hammer. (1977). \u201cSplit Graphs.\u201d F. Hoffman et al. (eds.). Proc. 8th Southeastern Conf. on Combinatorics, Graph Theory and Computing, Louisiana State Univ., Baton Rouge, Louisiana, pp. 311\u2013315."},{"key":"2452_CR7","unstructured":"Frank, A. (1976). \u201cSome Polynomial Algorithms for Certain Graphs and Hypergraphs.\u201d In Proceeding 5th British Combin. Conf. Congressus Numerantium No. XV, Utilitas Math., Winnipeg."},{"key":"2452_CR8","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","volume":"1","author":"M.R. Garey","year":"1976","unstructured":"Garey, M.R., D.S. Johnson, and L. Stockmeyer. (1976). \u201cSome Simplified NP-Complete Graph Problems.\u201d Theoretical Computer Science 1, 237\u2013267.","journal-title":"Theoretical Computer Science"},{"key":"2452_CR9","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"M.C. Golumbic","year":"1980","unstructured":"Golumbic, M.C. (1980). Algorithmic Graph Theory and Perfect Graphs. New York: Academic Press."},{"key":"2452_CR10","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/S0166-218X(03)00371-8","volume":"141","author":"P. Hell","year":"2004","unstructured":"Hell, P., S. Klein, L.T. Nogueira, and F. Protti. (2004). \u201cPartitioning Chordal Graphs into Independent Sets and Cliques.\u201d Discrete Applied Mathematics 141, 185\u2013194.","journal-title":"Discrete Applied Mathematics"},{"key":"2452_CR11","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"R.M. Karp","year":"1972","unstructured":"Karp, R.M. (1972). \u201cReducibility Among Combinatorial Problems.\u201d In R.E. Milner and J.W. Thatcher (eds.), Complexity of Computer Computations. New York: Plenum Press, pp. 85\u2013103."},{"key":"2452_CR12","unstructured":"Nogueira, L.T. (1999). \u201cGrafos Split e Grafos Split Generalizados.\u201d Master Thesis, COPPE-Sistemas, Universidade Federal do Rio de Janeiro, Brazil, (In Portuguese)."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-005-2452-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-005-2452-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-005-2452-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T17:59:34Z","timestamp":1559152774000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-005-2452-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,9]]},"references-count":12,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2005,9]]}},"alternative-id":["2452"],"URL":"https:\/\/doi.org\/10.1007\/s10479-005-2452-3","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,9]]}}}