{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T03:58:31Z","timestamp":1649131111614},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2010,8,14]],"date-time":"2010-08-14T00:00:00Z","timestamp":1281744000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2012,1]]},"DOI":"10.1007\/s10878-010-9343-5","type":"journal-article","created":{"date-parts":[[2010,8,13]],"date-time":"2010-08-13T13:11:40Z","timestamp":1281705100000},"page":"94-117","source":"Crossref","is-referenced-by-count":8,"title":["The max quasi-independent set problem"],"prefix":"10.1007","volume":"23","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. T.","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","published-online":{"date-parts":[[2010,8,14]]},"reference":[{"key":"9343_CR1","series-title":"LNCS","first-page":"598","volume-title":"Proceedings of LATIN 2002","author":"J Abello","year":"2002","unstructured":"Abello J, Resende MGC, Sudarsky S (2002) Massive quasi-clique detection. In: Proceedings of LATIN 2002. LNCS, vol\u00a02286. Springer, Berlin, pp\u00a0598\u2013612"},{"issue":"2","key":"9343_CR2","doi-asserted-by":"crossref","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 (2000) Greedily finding a dense subgraph. J Algorithms 34(2):203\u2013221","journal-title":"J Algorithms"},{"key":"9343_CR3","volume-title":"Graphs and hypergraphs","author":"C Berge","year":"1973","unstructured":"Berge C (1973) Graphs and hypergraphs. North-Holland, Amsterdam"},{"key":"9343_CR4","unstructured":"Boginski V, Butenko S, Pardalos P (2005) Mining market data: a network approach. Comput Oper Res. Available online at http:\/\/www.sciencedirect.com"},{"key":"9343_CR5","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0166-218X(84)90088-X","volume":"9","author":"DG Corneil","year":"1984","unstructured":"Corneil DG, Perl Y (1984) Clustering and domination in perfect graphs. Discrete Appl Math 9:27\u201339","journal-title":"Discrete Appl Math"},{"issue":"3","key":"9343_CR6","doi-asserted-by":"crossref","first-page":"410","DOI":"10.1007\/s004530010050","volume":"29","author":"U Feige","year":"2001","unstructured":"Feige U, Kortsarz G, Peleg D (2001) The dense k-subgraph problem. Algorithmica 29(3):410\u2013421","journal-title":"Algorithmica"},{"issue":"5","key":"9343_CR7","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/j.ipl.2005.10.012","volume":"97","author":"FV Fomin","year":"2006","unstructured":"Fomin FV, Hoie K (2006) Pathwidth of cubic graphs and exact algorithms. Inf Process Lett 97(5):191\u2013196","journal-title":"Inf Process Lett"},{"key":"9343_CR8","unstructured":"Goldberg AV (1984) Finding a maximum density subgraph. Technical report UCB CSD 84\/171, University of California, Berkeley, CA"},{"key":"9343_CR9","doi-asserted-by":"crossref","unstructured":"Halld\u00f3rsson MM, Radhakrishnan J (1994) Greed is good: approximating independent sets in sparse and bounded-degree graphs. In: Proceedings of STOC 1994, pp\u00a0439\u2013448","DOI":"10.1145\/195058.195221"},{"key":"9343_CR10","doi-asserted-by":"crossref","first-page":"C47","DOI":"10.1038\/35011540","volume":"402","author":"LH Hartwell","year":"1999","unstructured":"Hartwell LH, Hopfield JJ, Leibler S, Murray AW (1999) From molecular to modular cell biology. Nature 402:C47\u2013C52","journal-title":"Nature"},{"issue":"2","key":"9343_CR11","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/S0166-218X(96)00030-3","volume":"74","author":"DS Hochbaum","year":"1997","unstructured":"Hochbaum DS, Goldschmidt O (1997) k-edge subgraph problems. Discrete Appl Math 74(2):159\u2013169","journal-title":"Discrete Appl Math"},{"issue":"3","key":"9343_CR12","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/S0166-218X(00)00215-8","volume":"109","author":"A Jagota","year":"2001","unstructured":"Jagota A, Narasimhan G, \u0160olt\u00e9s \u013d (2001) A generalisation of maximal independent sets. Discrete Appl Math 109(3):223\u2013235","journal-title":"Discrete Appl Math"},{"key":"9343_CR13","doi-asserted-by":"crossref","first-page":"619","DOI":"10.1137\/0208049","volume":"8","author":"MS Krishnamoorthy","year":"1979","unstructured":"Krishnamoorthy MS, Deo N (1979) Node-deletion NP-complete problems. SIAM J Comput 8:619\u2013625","journal-title":"SIAM J Comput"},{"key":"9343_CR14","first-page":"394","volume":"20","author":"JC Picard","year":"1982","unstructured":"Picard JC, Queyranne M (1982) Selected applications of minimum cuts in networks. Inf Syst Oper Res 20:394\u2013422","journal-title":"Inf Syst Oper Res"},{"key":"9343_CR15","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1017\/S0963548300002042","volume":"5","author":"B Reed","year":"1996","unstructured":"Reed B (1996) Paths, stars and the number three. Comb Probab Comput 5:277\u2013295","journal-title":"Comb Probab Comput"},{"issue":"2","key":"9343_CR16","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/0022-0000(80)90060-4","volume":"20","author":"M Yannakakis","year":"1980","unstructured":"Yannakakis M, Lewis J (1980) The node-deletion problem for hereditary properties is NP-complete. J\u00a0Comput Syst Sci 20(2):219\u2013230","journal-title":"J\u00a0Comput Syst Sci"},{"key":"9343_CR17","doi-asserted-by":"crossref","unstructured":"Zuckerman D (2006) Linear degree extractors and the inapproximability of max clique and chromatic number. In: Proceedings of STOC 2006, pp\u00a0681\u2013690","DOI":"10.1145\/1132516.1132612"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-010-9343-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-010-9343-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-010-9343-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T16:20:59Z","timestamp":1559406059000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-010-9343-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,8,14]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,1]]}},"alternative-id":["9343"],"URL":"https:\/\/doi.org\/10.1007\/s10878-010-9343-5","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,8,14]]}}}