{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,16]],"date-time":"2024-04-16T09:06:20Z","timestamp":1713258380525},"reference-count":10,"publisher":"EDP Sciences","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Oper. Res."],"published-print":{"date-parts":[[2011,7]]},"DOI":"10.1051\/ro\/2011112","type":"journal-article","created":{"date-parts":[[2011,10,24]],"date-time":"2011-10-24T07:29:26Z","timestamp":1319441366000},"page":"209-222","source":"Crossref","is-referenced-by-count":1,"title":["Algorithms for recognizing bipartite-Helly and bipartite-conformal hypergraphs,"],"prefix":"10.1051","volume":"45","author":[{"given":"Marina","family":"Groshaus","sequence":"first","affiliation":[]},{"given":"Jayme Luis","family":"Szwarcfiter","sequence":"additional","affiliation":[]}],"member":"250","published-online":{"date-parts":[[2011,10,24]]},"reference":[{"key":"R1","unstructured":"Amilhastre J., Vilarem M.C. and Janssen P., Complexity of minimum biclique cover and minimum biclique decomposition for bipartite domino-free graphs.Discrete Appl. Math.86(1998) 125\u2013144."},{"key":"R2","unstructured":"C. Berge,Hypergraphs.Elsevier Science Publishers (1989)."},{"key":"R3","unstructured":"Dias V.M.F., Figueiredo C.M.H. and Szwarcfiter J.L., Generating bicliques in lexicographic order.Theoret. Comput. Sci.337(2005) 240\u2013248."},{"key":"R4","doi-asserted-by":"crossref","unstructured":"Gavril F., Algorithms on circular-arc graphs.Networks4(1974) 357\u2013369.","DOI":"10.1002\/net.3230040407"},{"key":"R5","unstructured":"Gilmore P.C. and Hoffman A.J., A characterization of comparability graphs and of interval graphs.Canadian J. Math.16(1964) 539\u2013548."},{"key":"R6","doi-asserted-by":"crossref","unstructured":"Groshaus M. and Szwarcfiter J.L., Biclique-Helly graphs.Graphs Combin.23(2007) 633\u2013645.","DOI":"10.1007\/s00373-007-0756-6"},{"key":"R7","unstructured":"Groshaus M. and Szwarcfiter J.L., On hereditary Helly classes of graphs.Discrete Math. Theor. Comput. Sci.10(2008) 71\u201378."},{"key":"R8","doi-asserted-by":"crossref","unstructured":"Groshaus M. and Szwarcfiter J.L., Biclique graphs and biclique matrices.J. Graph Theory63(2010) 1\u201316.","DOI":"10.1002\/jgt.20442"},{"key":"R9","doi-asserted-by":"crossref","unstructured":"Larri\u00f3n F., Neumann-Lara V., Piza\u00f1a M.A. and Porter T.D., A hierarchy of self-clique graphs.Discrete Mathematics282(2004) 193\u2013208.","DOI":"10.1016\/j.disc.2003.11.010"},{"key":"R10","unstructured":"Tuza Zs., Covering of graphs by complete bipartite subgraphs: complexity of {0,1} matrices.Combinatorica4(1984) 111\u2013116."}],"container-title":["RAIRO - Operations Research"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ro.org\/10.1051\/ro\/2011112\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,18]],"date-time":"2019-06-18T09:43:27Z","timestamp":1560851007000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ro.org\/10.1051\/ro\/2011112"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,7]]},"references-count":10,"journal-issue":{"issue":"3"},"alternative-id":["ro110013"],"URL":"https:\/\/doi.org\/10.1051\/ro\/2011112","relation":{},"ISSN":["0399-0559","1290-3868"],"issn-type":[{"value":"0399-0559","type":"print"},{"value":"1290-3868","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,7]]}}}