{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:26:58Z","timestamp":1725496018362},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540770497"},{"type":"electronic","value":"9783540770503"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"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":[[2007]]},"DOI":"10.1007\/978-3-540-77050-3_28","type":"book-chapter","created":{"date-parts":[[2007,11,26]],"date-time":"2007-11-26T03:39:22Z","timestamp":1196048362000},"page":"340-351","source":"Crossref","is-referenced-by-count":2,"title":["Covering Graphs with Few Complete Bipartite Subgraphs"],"prefix":"10.1007","author":[{"given":"Herbert","family":"Fleischner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Egbert","family":"Mujuni","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Paulusma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Szeider","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2-3","key":"28_CR1","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/S0166-218X(98)00039-0","volume":"86","author":"J. Amilhastre","year":"1998","unstructured":"Amilhastre, J., Vilarem, M.C., Janssen, P.: Complexity of minimum biclique cover and minimum biclique decomposition for bipartite domino-free graphs. Discr. Appl. Math.\u00a086(2-3), 125\u2013144 (1998)","journal-title":"Discr. Appl. Math."},{"key":"28_CR2","volume-title":"Graphs & digraphs","author":"G. Chartrand","year":"2005","unstructured":"Chartrand, G., Lesniak, L.: Graphs & digraphs, 4th edn. Chapman & Hall\/CRC, Boca Raton, FL (2005)","edition":"4"},{"issue":"5","key":"28_CR3","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1016\/j.disc.2006.01.010","volume":"306","author":"D. Cornaz","year":"2006","unstructured":"Cornaz, D., Fonlupt, J.: Chromatic characterization of biclique covers. Discrete Math.\u00a0306(5), 495\u2013507 (2006)","journal-title":"Discrete Math."},{"issue":"1","key":"28_CR4","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1051\/ita:2005008","volume":"39","author":"S. Dantas","year":"2005","unstructured":"Dantas, S., de Figueiredo, C.M., Gravier, S., Klein, S.: Finding H-partitions efficiently. RAIRO - Theoretical Informatics and Applications\u00a039(1), 133\u2013144 (2005)","journal-title":"RAIRO - Theoretical Informatics and Applications"},{"key":"28_CR5","series-title":"Graduate Texts in Mathematics","volume-title":"Graph Theory","author":"R. Diestel","year":"2000","unstructured":"Diestel, R.: Graph Theory, 2nd edn. Graduate Texts in Mathematics, vol.\u00a0173. Springer, New York (2000)","edition":"2"},{"key":"28_CR6","volume-title":"Monographs in Computer Science","author":"R.G. Downey","year":"1999","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. In: Monographs in Computer Science, Springer, Heidelberg (1999)"},{"key":"28_CR7","volume-title":"Texts in Theoretical Computer Science. An EATCS Series","author":"J. Flum","year":"2006","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. In: Texts in Theoretical Computer Science. An EATCS Series, vol.\u00a0XIV, Springer, Heidelberg (2006)"},{"key":"28_CR8","doi-asserted-by":"crossref","unstructured":"Gramm, J., Guo, J., H\u00fcffner, F., Niedermeier, R.: Data reduction, exact, and heuristic algorithms for clique cover. In: Proc. ALENEX 2006, SIAM, pp. 86\u201394 (2006)","DOI":"10.1137\/1.9781611972863.9"},{"issue":"1-3","key":"28_CR9","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/S0166-218X(01)00179-2","volume":"117","author":"S. Gravier","year":"2002","unstructured":"Gravier, S., Kobler, D., Kubiak, W.: Complexity of list coloring problems with a fixed total number of colors. Discr. Appl. Math.\u00a0117(1-3), 65\u201379 (2002)","journal-title":"Discr. Appl. Math."},{"issue":"2","key":"28_CR10","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/1233481.1233493","volume":"38","author":"J. Guo","year":"2007","unstructured":"Guo, J., Niedermeier, R.: Invitation to data reduction and problem kernelization. ACM SIGACT News\u00a038(2), 31\u201345 (2007)","journal-title":"ACM SIGACT News"},{"key":"28_CR11","unstructured":"Heydari, M.H., Morales, L., Shields Jr., C.O., Sudborough, I.H.: Computing cross associations for attack graphs and other applications. In: HICSS-40 2007. 40th Hawaii International International Conference on Systems Science, Waikoloa, Big Island, HI, USA, January 3-6, 2007, p. 270 (2007)"},{"key":"28_CR12","doi-asserted-by":"crossref","unstructured":"H\u00fcffner, F., Niedermeier, R., Wernicke, S.: Techniques for practical fixed-parameter algorithms. The Computer Journal (in press, 2007) doi:10.1093\/comjnl\/bxm040","DOI":"10.1093\/comjnl\/bxm040"},{"issue":"1-3","key":"28_CR13","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/0012-365X(94)00350-R","volume":"149","author":"H. M\u00fcller","year":"1996","unstructured":"M\u00fcller, H.: On edge perfectness and classes of bipartite graphs. Discrete Math.\u00a0149(1-3), 159\u2013187 (1996)","journal-title":"Discrete Math."},{"key":"28_CR14","volume-title":"Oxford Lecture Series in Mathematics and its Applications","author":"R. Niedermeier","year":"2006","unstructured":"Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford Lecture Series in Mathematics and its Applications, Oxford University Press, Oxford (2006)"},{"issue":"5","key":"28_CR15","doi-asserted-by":"crossref","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. Nederl. Akad. Wetensch. Proc. Ser. A 80, Indag. Math.\u00a039(5), 406\u2013424 (1977)","journal-title":"Nederl. Akad. Wetensch. Proc. Ser. A 80, Indag. Math."},{"issue":"1","key":"28_CR16","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1137\/S0097539701383522","volume":"32","author":"N. Vikas","year":"2002","unstructured":"Vikas, N.: Computational complexity of compaction to reflexive cycles. SIAM J. Comput.\u00a032(1), 253\u2013280 (2002\/03)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-77050-3_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T11:10:48Z","timestamp":1558264248000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-77050-3_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540770497","9783540770503"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-77050-3_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}