{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:46:29Z","timestamp":1725558389800},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642137303"},{"type":"electronic","value":"9783642137310"}],"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-13731-0_7","type":"book-chapter","created":{"date-parts":[[2010,6,10]],"date-time":"2010-06-10T07:00:50Z","timestamp":1276153250000},"page":"62-73","source":"Crossref","is-referenced-by-count":17,"title":["A Bottom-Up Method and Fast Algorithms for max independent set"],"prefix":"10.1007","author":[{"given":"Nicolas","family":"Bourgeois","sequence":"first","affiliation":[]},{"given":"Bruno","family":"Escoffier","sequence":"additional","affiliation":[]},{"given":"Vangelis Th.","family":"Paschos","sequence":"additional","affiliation":[]},{"given":"Johan M. M.","family":"van Rooij","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"7_CR1","unstructured":"Beigel, R.: Finding maximum independent sets in sparse and general graphs. In: Proc. SODA\u201999, pp. 856\u2013857 (1999)"},{"key":"7_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/978-3-540-79723-4_7","volume-title":"Parameterized and Exact Computation","author":"N. Bourgeois","year":"2008","unstructured":"Bourgeois, N., Escoffier, B., Paschos, V.T.: An\u00a0O\n                *(1.0977\n                  n\n                ) exact algorithm for max independent set in sparse graphs. In: Grohe, M., Niedermeier, R. (eds.) IWPEC 2008. LNCS, vol.\u00a05018, pp. 55\u201365. Springer, Heidelberg (2008)"},{"key":"7_CR3","unstructured":"Bourgeois, N., Escoffier, B., Paschos, V.T., van Rooij, J.M.M.: Fast Algorithms for Max Independent Set in Graphs of Small Average Degree. CoRR, abs\/0901.1563 (2009)"},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"Fomin, F.V., Grandoni, F., Kratsch, D.: A measure and conquer approach for the analysis of exact algorithms. Journal of the ACM\u00a056(5) (2009)","DOI":"10.1145\/1552285.1552286"},{"key":"7_CR5","unstructured":"Kneis, J., Langer, A., Rossmanith, P.: A Fine-grained Analysis of a Simple Independent Set Algorithm. In: Proc. FSTTCS 2009, pp. 287\u2013298 (2009)"},{"key":"7_CR6","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/j.jda.2008.09.004","volume":"7","author":"I. Razgon","year":"2009","unstructured":"Razgon, I.: Faster computation of maximum independent set and parameterized vertex cover for graphs with maximum degree\u00a03. J. Discrete Algorithms\u00a07, 191\u2013212 (2009)","journal-title":"J. Discrete Algorithms"},{"issue":"3","key":"7_CR7","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1016\/0196-6774(86)90032-5","volume":"7","author":"J.M. Robson","year":"1986","unstructured":"Robson, J.M.: Algorithms for maximum independent sets. J. Algorithms\u00a07(3), 425\u2013440 (1986)","journal-title":"J. Algorithms"},{"key":"7_CR8","unstructured":"Robson, J.M.: Finding a maximum independent set in time\u00a0O(2n\/4). Technical Report 1251-01, LaBRI, Universit\u00e9 de Bordeaux\u00a0I (2001)"},{"key":"7_CR9","unstructured":"Van Rooij, J.M.M., Bodlaender, H.L.: Design by measure and conquer a faster algorithm for dominating set. In: STACS 2008, pp. 657\u2013668 (2008)"},{"key":"7_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/3-540-36478-1_17","volume-title":"Combinatorial Optimization - Eureka! You shrink!","author":"G.J. Woeginger","year":"2003","unstructured":"Woeginger, G.J.: Exact algorithms for NP-hard problems: a survey. In: J\u00fcnger, M., Reinelt, G., Rinaldi, G. (eds.) Combinatorial Optimization - Eureka!, You Shrink! LNCS, vol.\u00a02570, pp. 185\u2013207. Springer, Heidelberg (2003)"}],"container-title":["Lecture Notes in Computer Science","Algorithm Theory - SWAT 2010"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13731-0_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T14:53:22Z","timestamp":1558277602000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13731-0_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642137303","9783642137310"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13731-0_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}