{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:28:55Z","timestamp":1759638535558},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642249822"},{"type":"electronic","value":"9783642249839"}],"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-24983-9_9","type":"book-chapter","created":{"date-parts":[[2011,11,7]],"date-time":"2011-11-07T05:07:20Z","timestamp":1320642440000},"page":"84-95","source":"Crossref","is-referenced-by-count":1,"title":["Edge Clique Partition of K 4-Free and Planar Graphs"],"prefix":"10.1007","author":[{"given":"Rudolf","family":"Fleischer","sequence":"first","affiliation":[]},{"given":"Xiaotian","family":"Wu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"9_CR1","doi-asserted-by":"publisher","first-page":"808","DOI":"10.1016\/S0022-0000(03)00072-2","volume":"67","author":"J. Alber","year":"2003","unstructured":"Alber, J., Fernau, H., Niedermeier, R.: Graph separators: a parameter view. Journal of Computer and System Sciences\u00a067, 808\u2013832 (2003)","journal-title":"Journal of Computer and System Sciences"},{"issue":"4","key":"9_CR2","doi-asserted-by":"publisher","first-page":"844","DOI":"10.1145\/210332.210337","volume":"42","author":"N. Alon","year":"1995","unstructured":"Alon, N., Yuster, R., Zwick, U.: Color-coding. Journal of the ACM\u00a042(4), 844\u2013856 (1995)","journal-title":"Journal of the ACM"},{"issue":"7-9","key":"9_CR3","doi-asserted-by":"publisher","first-page":"1202","DOI":"10.1016\/j.tcs.2009.12.016","volume":"411","author":"H.L. Bodlaender","year":"2010","unstructured":"Bodlaender, H.L., Fellows, M.R., Heggernes, P., Mancini, F., Papadopoulos, C., Rosamond, F.: Clustering with partial information. Theoretical Computer Science\u00a0411(7-9), 1202\u20131211 (2010)","journal-title":"Theoretical Computer Science"},{"key":"9_CR4","doi-asserted-by":"publisher","first-page":"2270","DOI":"10.1016\/j.dam.2007.10.015","volume":"156","author":"M.R. Cerioli","year":"2008","unstructured":"Cerioli, M.R., Faria, L., Ferreira, T.O., Martinhon, C.A.J., Protti, F., Reed, B.: Partition into cliques for cubic graphs: planar case, complexity and approximation. Discrete Applied Mathematics\u00a0156, 2270\u20132278 (2008)","journal-title":"Discrete Applied Mathematics"},{"issue":"6","key":"9_CR5","doi-asserted-by":"publisher","first-page":"866","DOI":"10.1145\/1101821.1101823","volume":"52","author":"E.D. Demaine","year":"2005","unstructured":"Demaine, E.D., Fomin, F.V., Hajiaghayi, M., Thilikos, D.M.: Subexponential parametrized algorithms on bounded-genus graphs and h-minor-free graphs. Journal of the ACM\u00a052(6), 866\u2013893 (2005)","journal-title":"Journal of the ACM"},{"key":"9_CR6","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/s002360050082","volume":"34","author":"H.N. Djidjev","year":"1997","unstructured":"Djidjev, H.N., Venkatesan, S.M.: Reduced constants for simple cycle graph separation. Acta Informatica\u00a034, 231\u2013243 (1997)","journal-title":"Acta Informatica"},{"key":"9_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized Complexity","author":"R.G. Downey","year":"1999","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1999)"},{"key":"9_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/978-3-540-30140-0_29","volume-title":"Algorithms \u2013 ESA 2004","author":"M.R. Fellows","year":"2004","unstructured":"Fellows, M.R., Knauer, C., Nishimura, N., Ragde, P., Rosamond, F., Stege, U., Thilikos, D.M., Whitesides, S.: Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems. In: Albers, S., Radzik, T. (eds.) ESA 2004. LNCS, vol.\u00a03221, pp. 311\u2013322. Springer, Heidelberg (2004)"},{"key":"9_CR9","doi-asserted-by":"publisher","first-page":"887","DOI":"10.1089\/cmb.2004.11.887","volume":"11","author":"A. Figueroa","year":"2004","unstructured":"Figueroa, A., Bornemann, J., Jiang, T.: Clustering binary fingerprint vectors with missing values for DNA array data analysis. Journal of Computational Biology\u00a011, 887\u2013901 (2004)","journal-title":"Journal of Computational Biology"},{"key":"9_CR10","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/0012-365X(88)90021-0","volume":"69","author":"D. Fisher","year":"1988","unstructured":"Fisher, D.: The number of triangles in a K\n                4-free graph. Discrete Mathematics\u00a069, 203\u2013205 (1988)","journal-title":"Discrete Mathematics"},{"key":"9_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"706","DOI":"10.1007\/978-3-642-04128-0_63","volume-title":"Algorithms - ESA 2009","author":"F.V. Fomin","year":"2009","unstructured":"Fomin, F.V., Golovach, P., Thilikos, D.M.: Contraction Bidimensionality: The Accurate Picture. In: Fiat, A., Sanders, P. (eds.) ESA 2009. LNCS, vol.\u00a05757, pp. 706\u2013717. Springer, Heidelberg (2009)"},{"issue":"4","key":"9_CR12","doi-asserted-by":"publisher","first-page":"713","DOI":"10.1137\/0210054","volume":"10","author":"I. Holyer","year":"1981","unstructured":"Holyer, I.: The NP-completeness of some edge-partition problems. SIAM Journal on Computing\u00a010(4), 713\u2013717 (1981)","journal-title":"SIAM Journal on Computing"},{"key":"9_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/978-3-540-28639-4_12","volume-title":"Parameterized and Exact Computation","author":"L. Mathieson","year":"2004","unstructured":"Mathieson, L., Prieto, E., Shaw, P.: Packing edge disjoint triangles: A\u00a0parameterized view. In: Downey, R.G., Fellows, M.R., Dehne, F. (eds.) IWPEC 2004. LNCS, vol.\u00a03162, pp. 127\u2013137. Springer, Heidelberg (2004)"},{"key":"9_CR14","unstructured":"Mujuni, E., Rosamond, F.: Parameterized complexity of the clique partition problem. In: Proceedings of the 14th Computing: Australian Theory Symposium (CATS 2008), Conferences in Research and Practice in Information Technology, vol.\u00a077, pp. 75\u201378 (2008)"},{"key":"9_CR15","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001","volume-title":"Invitation to fixed parameter algorithms","author":"R. Niedermeier","year":"2006","unstructured":"Niedermeier, R.: Invitation to fixed parameter algorithms. Oxford University Press, U.K (2006)"},{"key":"9_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1007\/3-540-49116-3_53","volume-title":"STACS 99","author":"R. Niedermeier","year":"1999","unstructured":"Niedermeier, R., Rossmanith, P.: Upper Bounds for Vertex Cover Further Improved. In: Meinel, C., Tison, S. (eds.) STACS 1999. LNCS, vol.\u00a01563, pp. 561\u2013570. Springer, Heidelberg (1999)"},{"key":"9_CR17","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1016\/1385-7258(77)90055-5","volume":"39","author":"J. Orlin","year":"1977","unstructured":"Orlin, J.: Contentment in graph theory: covering graphs with cliques. Indagationed Mathematicae\u00a039, 406\u2013424 (1977)","journal-title":"Indagationed Mathematicae"},{"issue":"5","key":"9_CR18","doi-asserted-by":"publisher","first-page":"775","DOI":"10.1137\/0219054","volume":"19","author":"J.P. Schmidt","year":"1990","unstructured":"Schmidt, J.P., Siegel, A.: The spatial complexity of oblivious k-probe hash functions. SIAM Journal on Computing\u00a019(5), 775\u2013786 (1990)","journal-title":"SIAM Journal on Computing"},{"key":"9_CR19","first-page":"56","volume":"67","author":"M. Shaohan","year":"1988","unstructured":"Shaohan, M., Wallis, W.D., Lin, W.J.: The complexity of the clique partition number problem. Congressus Numerantium\u00a067, 56\u201366 (1988); Proceedings of the 19th Southeastern Conference on Combinatorics, Graph Theory and Computing","journal-title":"Congressus Numerantium"},{"issue":"11","key":"9_CR20","first-page":"92","volume":"37","author":"X. Wu","year":"2011","unstructured":"Wu, X., Lin, Y., Fleischer, R.: Research of fixed parameter algorithm for clique partition problem. Computer Engineering\u00a037(11), 92\u201393 (2011)","journal-title":"Computer Engineering"}],"container-title":["Lecture Notes in Computer Science","Computational Geometry, Graphs and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-24983-9_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,15]],"date-time":"2019-04-15T18:28:21Z","timestamp":1555352901000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-24983-9_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642249822","9783642249839"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-24983-9_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}