{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:38:22Z","timestamp":1725557902869},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642131813"},{"type":"electronic","value":"9783642131820"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13182-0_6","type":"book-chapter","created":{"date-parts":[[2010,6,12]],"date-time":"2010-06-12T14:55:17Z","timestamp":1276354517000},"page":"60-71","source":"Crossref","is-referenced-by-count":2,"title":["The max quasi-independent set Problem"],"prefix":"10.1007","author":[{"given":"N.","family":"Bourgeois","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Giannakos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G.","family":"Lucarelli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"I.","family":"Milis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"V. Th.","family":"Paschos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"O.","family":"Potti\u00e9","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"598","DOI":"10.1007\/3-540-45995-2_51","volume-title":"LATIN 2002: Theoretical Informatics","author":"J. Abello","year":"2002","unstructured":"Abello, J., Resende, M.G.C., Sudarsky, S.: Massive quasi-clique detection. In: Rajsbaum, S. (ed.) LATIN 2002. LNCS, vol.\u00a02286, pp. 598\u2013612. Springer, Heidelberg (2002)"},{"issue":"2","key":"6_CR2","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1006\/jagm.1999.1062","volume":"34","author":"Y. Asahiro","year":"2000","unstructured":"Asahiro, Y., Iwama, K., Tamaki, H., Tokuyama, T.: Greedily finding a dense subgraph. Journal of Algorithms\u00a034(2), 203\u2013221 (2000)","journal-title":"Journal of Algorithms"},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"Boginski, V., Butenko, S., Pardalos, P.: Mining market data: a network approach. Computers and Operations Research (2005), \n                  \n                    http:\/\/www.sciencedirect.com","DOI":"10.1016\/j.cor.2005.01.027"},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"Bourgeois, N., Giannakos, A., Lucarelli, G., Milis, I., Paschos, V.T., Potti\u00e9, O.: The The Max Quasi-Independent Set Problem. Cahier du LAMSADE\u00a0(292) (2010)","DOI":"10.1007\/978-3-642-13182-0_6"},{"key":"6_CR5","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/0166-218X(84)90088-X","volume":"9","author":"D.G. Corneil","year":"1984","unstructured":"Corneil, D.G., Perl, Y.: Clustering and domination in perfect graphs. Discrete Applied Mathematics\u00a09, 27\u201339 (1984)","journal-title":"Discrete Applied Mathematics"},{"issue":"3","key":"6_CR6","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1007\/s004530010050","volume":"29","author":"U. Feige","year":"2001","unstructured":"Feige, U., Kortsarz, G., Peleg, D.: The dense k-subgraph problem. Algorithmica\u00a029(3), 410\u2013421 (2001)","journal-title":"Algorithmica"},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"Halld\u00f3rsson, M.M., Radhakrishnan, J.: Greed is good: approximating independent sets in sparse and bounded-degree graphs. In: Proceedings of STOC 1994, pp. 439\u2013448 (1994)","DOI":"10.1145\/195058.195221"},{"key":"6_CR8","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1038\/35011540","volume":"402","author":"L.H. Hartwell","year":"1999","unstructured":"Hartwell, L.H., Hopfield, J.J., Leibler, S., Murray, A.W.: From molecular to modular cell biology. Nature\u00a0402, C47\u2013C52 (1999)","journal-title":"Nature"},{"issue":"2","key":"6_CR9","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/S0166-218X(96)00030-3","volume":"74","author":"D.S. Hochbaum","year":"1997","unstructured":"Hochbaum, D.S., Goldschmidt, O.: k-edge subgraph problems. Discrete Applied Mathematics\u00a074(2), 159\u2013169 (1997)","journal-title":"Discrete Applied Mathematics"},{"key":"6_CR10","doi-asserted-by":"publisher","first-page":"619","DOI":"10.1137\/0208049","volume":"8","author":"M.S. Krishnamoorthy","year":"1979","unstructured":"Krishnamoorthy, M.S., Deo, N.: Node-deletion NP-complete problems. SIAM J. Comput.\u00a08, 619\u2013625 (1979)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"6_CR11","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/0022-0000(80)90060-4","volume":"20","author":"M. Yannakakis","year":"1980","unstructured":"Yannakakis, M., Lewis, J.: The node-deletion problem for hereditary properties is NP-complete. Journal of Computer and System Sciences\u00a020(2), 219\u2013230 (1980)","journal-title":"Journal of Computer and System Sciences"},{"key":"6_CR12","unstructured":"Zissimopoulos, V.: Private communication"},{"key":"6_CR13","doi-asserted-by":"crossref","unstructured":"Zuckerman, D.: Linear degree extractors and the inapproximability of max clique and chromatic number. In: Proceedings of STOC 2006, pp. 681\u2013690 (2006)","DOI":"10.1145\/1132516.1132612"}],"container-title":["Lecture Notes in Computer Science","Computer Science \u2013 Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13182-0_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T18:55:49Z","timestamp":1558292149000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13182-0_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642131813","9783642131820"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13182-0_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}