{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,22]],"date-time":"2025-04-22T15:28:40Z","timestamp":1745335720447},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642183805"},{"type":"electronic","value":"9783642183812"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-18381-2_46","type":"book-chapter","created":{"date-parts":[[2011,1,4]],"date-time":"2011-01-04T16:01:51Z","timestamp":1294156911000},"page":"558-569","source":"Crossref","is-referenced-by-count":2,"title":["Partition into Triangles on Bounded Degree Graphs"],"prefix":"10.1007","author":[{"given":"Johan M. M.","family":"van Rooij","sequence":"first","affiliation":[]},{"given":"Marcel E.","family":"van Kooten Niekerk","sequence":"additional","affiliation":[]},{"given":"Hans L.","family":"Bodlaender","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"46_CR1","unstructured":"Bj\u00f6rklund, A.: Exact covers via determinants. In: Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science, STACS 2010 (2010) (to appear)"},{"issue":"2","key":"46_CR2","doi-asserted-by":"publisher","first-page":"546","DOI":"10.1137\/070683933","volume":"39","author":"A. Bj\u00f6rklund","year":"2009","unstructured":"Bj\u00f6rklund, A., Husfeldt, T., Koivisto, M.: Set partitioning via inclusion-exclusion. SIAM Journal of Computing\u00a039(2), 546\u2013563 (2009)","journal-title":"SIAM Journal of Computing"},{"issue":"1-3","key":"46_CR3","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1016\/j.tcs.2004.12.023","volume":"332","author":"J.M. Byskov","year":"2005","unstructured":"Byskov, J.M., Madsen, B.A., Skjernaa, B.: New algorithms for exact satisfiability. Theoretical Computer Science\u00a0332(1-3), 515\u2013541 (2005)","journal-title":"Theoretical Computer Science"},{"key":"46_CR4","volume-title":"Computers and Intractability, A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability, A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, New York (1979)"},{"issue":"4","key":"46_CR5","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1006\/jcss.2001.1774","volume":"63","author":"R. Impagliazzo","year":"2001","unstructured":"Impagliazzo, R., Paturi, R., Zane, F.: Which problems have strongly exponential complexity? Journal of Computer and System Sciences\u00a063(4), 512\u2013530 (2001)","journal-title":"Journal of Computer and System Sciences"},{"issue":"1","key":"46_CR6","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/0020-0190(91)90246-E","volume":"37","author":"V. Kann","year":"1991","unstructured":"Kann, V.: Maximum bounded 3-dimensional matching is MAX SNP-complete. Information Processing Letters\u00a037(1), 27\u201335 (1991)","journal-title":"Information Processing Letters"},{"key":"46_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1007\/978-3-642-11269-0_21","volume-title":"Parameterized and Exact Computation","author":"M. Koivisto","year":"2009","unstructured":"Koivisto, M.: Partitioning into sets of bounded cardinality. In: Chen, J., Fomin, F.V. (eds.) IWPEC 2009. LNCS, vol.\u00a05917, pp. 258\u2013263. Springer, Heidelberg (2009)"},{"key":"46_CR8","unstructured":"Lipton, R.J.: G\u00f6del\u2019s lost letter and P=NP, fast exponential algorithms. Weblog, \n                  \n                    http:\/\/rjlipton.wordpress.com\/2009\/02\/13\/polynomial-vs-exponential-time\/"},{"key":"46_CR9","doi-asserted-by":"crossref","unstructured":"Schaefer, T.J.: The complexity of satisfiability problems. In: Proceedings of the 10th Annual ACM Symposium on Theory of Computing, STOC 1978, pp. 216\u2013226 (1978)","DOI":"10.1145\/800133.804350"},{"key":"46_CR10","unstructured":"van Rooij, J.M.M., van Kooten Niekerk, M.E., Bodlaender, H.L.: Partitioning sparse graphs into triangles: Relations to exact satisfiability and very fast exponential time algorithms. Technical Report UU-CS-2010-005, Department of Information and Computing Sciences, Utrecht University (2010)"},{"key":"46_CR11","unstructured":"Wahlstr\u00f6m, M.: Algorithms, measures, and upper bounds for satisfiability and related problems. PhD thesis, Link\u00f6ping University (2007)"},{"key":"46_CR12","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","SOFSEM 2011: Theory and Practice of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-18381-2_46","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,23]],"date-time":"2019-03-23T10:56:33Z","timestamp":1553338593000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-18381-2_46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642183805","9783642183812"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-18381-2_46","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}