{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,9]],"date-time":"2026-03-09T08:01:06Z","timestamp":1773043266579,"version":"3.50.1"},"reference-count":18,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[1998,9,1]],"date-time":"1998-09-01T00:00:00Z","timestamp":904608000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5433,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1998,9]]},"DOI":"10.1016\/s0166-218x(98)00039-0","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T13:19:33Z","timestamp":1049721573000},"page":"125-144","source":"Crossref","is-referenced-by-count":39,"title":["Complexity of minimum biclique cover and minimum biclique decomposition for bipartite domino-free graphs"],"prefix":"10.1016","volume":"86","author":[{"given":"J","family":"Amilhastre","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.C","family":"Vilarem","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P","family":"Janssen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(98)00039-0_BIB1","series-title":"Network Flows, Theory, Algorithms and Applications","author":"Ahuja","year":"1993"},{"key":"10.1016\/S0166-218X(98)00039-0_BIB2","article-title":"Complexity of minimum biclique cover and decomposition for a class of bipartite graphs","author":"Amilhastre","year":"1995"},{"issue":"96","key":"10.1016\/S0166-218X(98)00039-0_BIB3","first-page":"31","article-title":"Calcul pratique du treillis de Galois d'une correspondance","author":"Bordat","year":"1986","journal-title":"Math. Sci. Hum."},{"key":"10.1016\/S0166-218X(98)00039-0_BIB4","article-title":"Special graph classes \u2014a survey","author":"Brandst\u00e4dt","year":"1993"},{"key":"10.1016\/S0166-218X(98)00039-0_BIB5","article-title":"Bipartite dimensions and bipartite degrees of graphs","author":"Fishburn","year":"1993"},{"key":"10.1016\/S0166-218X(98)00039-0_BIB6","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1016\/S0019-9958(84)80012-1","article-title":"An algorithm for covering polygons with rectangles","volume":"63","author":"Franzblau","year":"1984","journal-title":"Inform. Control"},{"key":"10.1016\/S0166-218X(98)00039-0_BIB7","article-title":"Rangs des relations binaires, semigroupes de relations non ambigues","author":"Froidure","year":"1995"},{"key":"10.1016\/S0166-218X(98)00039-0_BIB8","doi-asserted-by":"crossref","unstructured":"M. Habib, L. Nourine, A new lattice-based heuristic for taxonomy encoding, Private communication 1996.","DOI":"10.1016\/0304-3975(95)00232-4"},{"key":"10.1016\/S0166-218X(98)00039-0_BIB9","doi-asserted-by":"crossref","first-page":"1117","DOI":"10.1137\/0222067","article-title":"Minimal NFA Problems are hard","volume":"22","author":"Jiang","year":"1993","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0166-218X(98)00039-0_BIB10","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/0020-0190(95)00027-A","article-title":"Computing a perfect edge without vertex elimination ordering of a chordal bipartite graph","volume":"55","author":"Kloks","year":"1995","journal-title":"Inform. Process. Lett."},{"issue":"2","key":"10.1016\/S0166-218X(98)00039-0_BIB11","doi-asserted-by":"crossref","first-page":"637","DOI":"10.1090\/S0002-9947-1988-0929670-5","article-title":"Eigensharp Graphs: Decomposition into complete bipartite subgraphs","volume":"308","author":"Kratzke","year":"1988","journal-title":"Trans. Amer. Math. Soc."},{"issue":"1","key":"10.1016\/S0166-218X(98)00039-0_BIB12","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1137\/0403010","article-title":"The boolean basis problem and how to cover some polygons by rectangles","volume":"3","author":"Lubiw","year":"1990","journal-title":"SIAM J. Discrete Math."},{"issue":"2","key":"10.1016\/S0166-218X(98)00039-0_BIB13","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/0095-8956(91)90073-S","article-title":"A weighted min-max relation for intervals","volume":"53","author":"Lubiw","year":"1991","journal-title":"J. Combin. Theory"},{"issue":"7","key":"10.1016\/S0166-218X(98)00039-0_BIB14","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1007\/BF00383169","article-title":"Alternating cycle-free matchings","author":"M\u00fcller","year":"1990","journal-title":"Order"},{"issue":"149","key":"10.1016\/S0166-218X(98)00039-0_BIB15","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/0012-365X(94)00350-R","article-title":"On edge perfectness and classes of bipartite graphs","author":"M\u00fcller","year":"1996","journal-title":"Discrete Math."},{"key":"10.1016\/S0166-218X(98)00039-0_BIB16","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/0025-5564(78)90088-3","article-title":"A mathematical analysis of human leukocyte antigen serology","volume":"40","author":"Nau","year":"1978","journal-title":"Math. Biosci."},{"key":"10.1016\/S0166-218X(98)00039-0_BIB17","first-page":"211","article-title":"Containment in Graph Theory: covering graphs with cliques","volume":"39","author":"Orlin","year":"1977","journal-title":"Nederl. Akad. Wetensch. Indag. Math."},{"key":"10.1016\/S0166-218X(98)00039-0_BIB18","first-page":"445","article-title":"Restructuring lattice theory: an approach based on hierarchies of contexts","volume":"vol. 83","author":"Wille","year":"1982"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X98000390?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X98000390?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T14:51:56Z","timestamp":1556117516000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X98000390"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,9]]},"references-count":18,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[1998,9]]}},"alternative-id":["S0166218X98000390"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(98)00039-0","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1998,9]]}}}