{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:14:03Z","timestamp":1725542043835},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642106309"},{"type":"electronic","value":"9783642106316"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-10631-6_3","type":"book-chapter","created":{"date-parts":[[2009,12,4]],"date-time":"2009-12-04T07:03:43Z","timestamp":1259910223000},"page":"4-13","source":"Crossref","is-referenced-by-count":3,"title":["Exact Algorithms for Dominating Clique Problems"],"prefix":"10.1007","author":[{"given":"N.","family":"Bourgeois","sequence":"first","affiliation":[]},{"given":"F.","family":"Della Croce","sequence":"additional","affiliation":[]},{"given":"B.","family":"Escoffier","sequence":"additional","affiliation":[]},{"given":"V. Th.","family":"Paschos","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"volume-title":"Computers and intractability. A guide to the theory of NP-completeness","year":"1979","author":"M.R. Garey","unstructured":"Garey, M.R., Johnson, D.S.: Computers and intractability. A guide to the theory of NP-completeness. W. H. Freeman, San Francisco (1979)","key":"3_CR1"},{"key":"3_CR2","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/0020-0190(88)90065-8","volume":"27","author":"D.S. Johnson","year":"1988","unstructured":"Johnson, D.S., Yannakakis, M., Papadimitriou, C.H.: On generating all maximal independent sets. Inform. Process. Lett.\u00a027, 119\u2013123 (1988)","journal-title":"Inform. Process. Lett."},{"key":"3_CR3","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/BF02760024","volume":"3","author":"J.W. Moon","year":"1965","unstructured":"Moon, J.W., Moser, L.: On cliques in graphs. Israel J. of Mathematics\u00a03, 23\u201328 (1965)","journal-title":"Israel J. of Mathematics"},{"key":"3_CR4","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1016\/j.tcs.2007.06.014","volume":"385","author":"D. Kratsch","year":"2007","unstructured":"Kratsch, D., Liedloff, M.: An exact algorithm for the minimum dominating clique problem. Theoret. Comput. Sci.\u00a0385, 226\u2013240 (2007)","journal-title":"Theoret. Comput. Sci."},{"key":"3_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/11523468_16","volume-title":"Automata, Languages and Programming","author":"F. Fomin","year":"2005","unstructured":"Fomin, F., Grandoni, F., Kratsch, D.: Measure and conquer: Domination \u2013 A case study. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol.\u00a03580, pp. 191\u2013203. Springer, Heidelberg (2005)"},{"unstructured":"Bourgeois, N., Della Croce, F., Escoffier, B., Paschos, V.T.: Exact algorithms for dominating clique problems. Cahier du LAMSADE 285, LAMSADE, Universit\u00e9 Paris-Dauphine (2009), \n \n http:\/\/www.lamsade.dauphine.fr\/cahiers\/PDF\/cahierLamsade285.pdf","key":"3_CR6"},{"key":"3_CR7","first-page":"47","volume":"87","author":"F. Fomin","year":"2005","unstructured":"Fomin, F., Grandoni, F., Kratsch, D.: Some new techniques in design and analysis of exact (exponential) algorithms. Bulletin of the European Association for Theoretical Computer Science\u00a087, 47\u201377 (2005)","journal-title":"Bulletin of the European Association for Theoretical Computer Science"},{"unstructured":"Robson, J.M.: Finding a maximum independent set in time\u00a0O(2\n n\/4). Technical Report 1251-01, LaBRI, Universit\u00e9 de Bordeaux\u00a0I (2001)","key":"3_CR8"},{"doi-asserted-by":"crossref","unstructured":"Fomin, F., Grandoni, F., Kratsch, D.: Measure and conquer: a simple\u00a0O(20.288n\n ) independent set algorithm. In: Proc. Symposium on Discrete Algorithms, SODA 2006, pp. 18\u201325 (2006)","key":"3_CR9","DOI":"10.1145\/1109557.1109560"},{"key":"3_CR10","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1016\/j.orl.2004.03.002","volume":"32","author":"J. Byskov","year":"2004","unstructured":"Byskov, J.: Enumerating maximal independent sets with applications to graph colouring. Oper. Res. Lett.\u00a032, 547\u2013556 (2004)","journal-title":"Oper. Res. Lett."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-10631-6_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,9]],"date-time":"2020-01-09T05:35:14Z","timestamp":1578548114000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-10631-6_3"}},"subtitle":["(Extended Abstract)"],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642106309","9783642106316"],"references-count":10,"URL":"http:\/\/dx.doi.org\/10.1007\/978-3-642-10631-6_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}
