{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T06:18:43Z","timestamp":1725862723988},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319445427"},{"type":"electronic","value":"9783319445434"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-44543-4_11","type":"book-chapter","created":{"date-parts":[[2016,8,8]],"date-time":"2016-08-08T07:49:58Z","timestamp":1470642598000},"page":"137-150","source":"Crossref","is-referenced-by-count":0,"title":["On Maximal Chain Subgraphs and Covers of Bipartite Graphs"],"prefix":"10.1007","author":[{"given":"Tiziana","family":"Calamoneri","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mattia","family":"Gastaldello","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arnaud","family":"Mary","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marie-France","family":"Sagot","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Blerina","family":"Sinaimeri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,8,9]]},"reference":[{"issue":"2","key":"11_CR1","doi-asserted-by":"crossref","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 J. Comput. 39(2), 546\u2013563 (2009)","journal-title":"SIAM J. Comput."},{"key":"11_CR2","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0619-4","volume-title":"Modern graph theory","author":"B Bollob\u00e1s","year":"1998","unstructured":"Bollob\u00e1s, B.: Modern graph theory. Graduate Texts in Mathematics. Springer-Verlag, Heidelberg (1998)"},{"issue":"1","key":"11_CR3","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1016\/j.tcs.2007.04.006","volume":"381","author":"A Brandst\u00e4dt","year":"2007","unstructured":"Brandst\u00e4dt, A., Eschen, E.M., Sritharan, R.: The induced matching and chain subgraph cover problems for convex bipartite graphs. Theor. Comput. Sci. 381(1), 260\u2013265 (2007)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"11_CR4","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/S0304-3975(97)00036-4","volume":"205","author":"Y Chang-Wu","year":"1998","unstructured":"Chang-Wu, Y., Gen-Huey, C., Tze-Heng, M.: On the complexity of the k-chain subgraph cover problem. Theor. Comput. Sci. 205(1), 85\u201398 (1998)","journal-title":"Theor. Comput. Sci."},{"issue":"1\u20133","key":"11_CR5","doi-asserted-by":"crossref","first-page":"240","DOI":"10.1016\/j.tcs.2005.01.014","volume":"337","author":"VMF Dias","year":"2005","unstructured":"Dias, V.M.F., de Figueiredo, C.M.H., Szwarcfiter, J.L.: Generating bicliques of a graph in lexicographic order. Theor. Comput. Sci. 337(1\u20133), 240\u2013248 (2005)","journal-title":"Theor. Comput. Sci."},{"issue":"14","key":"11_CR6","doi-asserted-by":"crossref","first-page":"1826","DOI":"10.1016\/j.dam.2007.03.017","volume":"155","author":"VMH Dias","year":"2007","unstructured":"Dias, V.M.H., de Figueiredo, C.M.H., Szwarcfiter, J.L.: On the generation of bicliques of a graph. Discrete Appl. Math. 155(14), 1826\u20131832 (2007)","journal-title":"Discrete Appl. Math."},{"issue":"6","key":"11_CR7","doi-asserted-by":"crossref","first-page":"1278","DOI":"10.1137\/S0097539793250299","volume":"24","author":"T Eiter","year":"1995","unstructured":"Eiter, T., Gottlob, G.: Identifying the minimal transversals of a hypergraph and related problems. SIAM J. Comput. 24(6), 1278\u20131304 (1995)","journal-title":"SIAM J. Comput."},{"key":"11_CR8","series-title":"Exact Exponential Algorithms","volume-title":"Fomin and Dieter Kratsch","author":"V Fedor","year":"2010","unstructured":"Fedor, V.: Fomin and Dieter Kratsch. Exact Exponential Algorithms. Springer-Verlag New York Inc, New York, NY, USA (2010)"},{"issue":"3","key":"11_CR9","doi-asserted-by":"crossref","first-page":"618","DOI":"10.1006\/jagm.1996.0062","volume":"21","author":"ML Fredman","year":"1996","unstructured":"Fredman, M.L., Khachiyan, L.: On the complexity of dualization of monotone disjunctive normal forms. J. Algorithms 21(3), 618\u2013628 (1996)","journal-title":"J. Algorithms"},{"issue":"3","key":"11_CR10","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/0020-0190(88)90065-8","volume":"27","author":"DS Johnson","year":"1988","unstructured":"Johnson, D.S., Yannakakis, M., Papadimitriou, C.H.: On generating all maximal independent sets. Inf. Process. Lett. 27(3), 119\u2013123 (1988)","journal-title":"Inf. Process. Lett."},{"key":"11_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1007\/978-3-540-27810-8_23","volume-title":"Algorithm Theory - SWAT 2004","author":"K Makino","year":"2004","unstructured":"Makino, K., Uno, T.: New algorithms for enumerating all maximal cliques. In: Hagerup, T., Katajainen, J. (eds.) SWAT 2004. LNCS, vol. 3111, pp. 260\u2013272. Springer, Heidelberg (2004)"},{"issue":"1","key":"11_CR12","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/BF02760024","volume":"3","author":"JW Moon","year":"1965","unstructured":"Moon, J.W., Moser, L.: On cliques in graphs. Isr. J. Math. 3(1), 23\u201328 (1965)","journal-title":"Isr. J. Math."},{"issue":"1","key":"11_CR13","doi-asserted-by":"crossref","first-page":"E15","DOI":"10.1086\/670612","volume":"182","author":"I Nor","year":"2013","unstructured":"Nor, I., Engelst\u00e4dter, J., Duron, O., Reuter, M., Sagot, M.-F., Charlat, S.: On the genetic architecture of cytoplasmic incompatibility: inference from phenotypic data. Am. Nat. 182(1), E15\u2013E24 (2013)","journal-title":"Am. Nat."},{"issue":"3","key":"11_CR14","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1137\/0603036","volume":"3","author":"M Yannakakis","year":"1982","unstructured":"Yannakakis, M.: The complexity of the partial order dimension problem. SIAM J. Algebraic Discrete Methods 3(3), 351\u2013358 (1982)","journal-title":"SIAM J. Algebraic Discrete Methods"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-44543-4_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T16:11:13Z","timestamp":1498320673000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-44543-4_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319445427","9783319445434"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-44543-4_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}