{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,4]],"date-time":"2024-07-04T00:09:17Z","timestamp":1720051757442},"reference-count":23,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2015,8,1]],"date-time":"2015-08-01T00:00:00Z","timestamp":1438387200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2019,8,20]],"date-time":"2019-08-20T00:00:00Z","timestamp":1566259200000},"content-version":"vor","delay-in-days":1480,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100003407","name":"Ministero dell\u2019Istruzione, dell\u2019Universit\u00e0 e della Ricerca","doi-asserted-by":"publisher","award":["1PRIN 2012C4E3KT"],"id":[{"id":"10.13039\/501100003407","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2015,8]]},"DOI":"10.1016\/j.dam.2015.03.014","type":"journal-article","created":{"date-parts":[[2015,4,21]],"date-time":"2015-04-21T18:41:23Z","timestamp":1429641683000},"page":"13-23","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":5,"special_numbering":"C","title":["On the Galois lattice of bipartite distance hereditary graphs"],"prefix":"10.1016","volume":"190-191","author":[{"given":"Nicola","family":"Apollonio","sequence":"first","affiliation":[]},{"given":"Massimiliano","family":"Caramia","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0002-5464-4069","authenticated-orcid":false,"given":"Paolo Giulio","family":"Franciosa","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.dam.2015.03.014_br000005","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1016\/j.dam.2013.01.014","article-title":"A convexity upper bound for the number of maximal bicliques of a bipartite graph","volume":"165","author":"Albano","year":"2014","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2015.03.014_br000010","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/S0166-218X(98)00039-0","article-title":"Complexity of minimum biclique cover and minimum biclique decomposition for bipartite domino-free graphs","volume":"86","author":"Amilhastre","year":"1998","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2015.03.014_br000015","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1016\/0095-8956(86)90043-2","article-title":"Distance-hereditary graphs","volume":"41","author":"Bandelt","year":"1986","journal-title":"J. Comb. Theory B"},{"key":"10.1016\/j.dam.2015.03.014_br000020","series-title":"Proceedings of the 4th Int. Conf. on Modeling Decisions for Artificial Intelligence, MDAI 2007","first-page":"174","article-title":"Trees in concept lattices","volume":"vol. 4617","author":"Belohl\u00e1vek","year":"2007"},{"key":"10.1016\/j.dam.2015.03.014_br000025","series-title":"Graphs and Hypergraphs","author":"Berge","year":"1973"},{"key":"10.1016\/j.dam.2015.03.014_br000030","series-title":"ICFCA 2012","first-page":"45","article-title":"A Peep through the looking glass: articulation points in lattices","volume":"vol. 7278","author":"Berry","year":"2012"},{"key":"10.1016\/j.dam.2015.03.014_br000035","series-title":"ICFCA 2013","first-page":"44","article-title":"Dismantlable lattices in the mirror","volume":"vol. 7880","author":"Berry","year":"2013"},{"key":"10.1016\/j.dam.2015.03.014_br000040","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898719796","article-title":"Graph classes: a survey","author":"Brandst\u00e4dt","year":"1999"},{"issue":"3","key":"10.1016\/j.dam.2015.03.014_br000045","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1007\/s11083-010-9183-z","article-title":"Crown-free lattices and their related graphs","volume":"28","author":"Brucker","year":"2011","journal-title":"Order"},{"key":"10.1016\/j.dam.2015.03.014_br000050","doi-asserted-by":"crossref","first-page":"1711","DOI":"10.1016\/j.dam.2008.12.013","article-title":"Treelike comparability graphs","volume":"157","author":"Cornelsen","year":"2009","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2015.03.014_br000055","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1016\/0020-0190(88)90121-4","article-title":"On hypergraph acyclicity and graph chordality","volume":"29","author":"D\u2019Atri","year":"1988","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/j.dam.2015.03.014_br000060","doi-asserted-by":"crossref","unstructured":"J. Edmonds, R. Giles, A min-max relation for submodular functions on graphs, in: Studies in Integer Programming, Proceedings of Workshop on Programming, Bonn, 1975 Ann. Discrete Math. 1 (1977) 185\u2013204.","DOI":"10.1016\/S0167-5060(08)70734-9"},{"issue":"3","key":"10.1016\/j.dam.2015.03.014_br000065","doi-asserted-by":"crossref","first-page":"514","DOI":"10.1145\/2402.322390","article-title":"Degrees of acyclicity for hypergraphs and relational database schemes","volume":"30","author":"Fagin","year":"1983","journal-title":"J. ACM"},{"key":"10.1016\/j.dam.2015.03.014_br000070","series-title":"Formal Concept Analysis \u2014 Mathematical Foundations","author":"Ganter","year":"1999"},{"issue":"26","key":"10.1016\/j.dam.2015.03.014_br000075","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1093\/qmath\/28.4.417","article-title":"A characterization of distance-hereditary graphs","volume":"2","author":"Howorka","year":"1977","journal-title":"Quart. J. Math. Oxford Ser."},{"key":"10.1016\/j.dam.2015.03.014_br000080","unstructured":"E. Howorka, A characterization of Ptolemaic graphs, survey of results, in: Proceedings of the 8th SE Conf. Combinatorics, Graph Theory and Computing, 1977, pp. 355\u2013361."},{"key":"10.1016\/j.dam.2015.03.014_br000085","first-page":"239","article-title":"Helly hypergraphs and abstract interval structures","volume":"16","author":"Lehel","year":"1983","journal-title":"Ars Combin."},{"issue":"2","key":"10.1016\/j.dam.2015.03.014_br000090","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1002\/(SICI)1097-0118(199902)30:2<121::AID-JGT6>3.0.CO;2-1","article-title":"Restricted unimodular chordal graphs","volume":"30","author":"Peled","year":"1999","journal-title":"J. Graph Theory"},{"issue":"1","key":"10.1016\/j.dam.2015.03.014_br000095","doi-asserted-by":"crossref","first-page":"91","DOI":"10.4153\/CMB-1974-016-3","article-title":"Lattices with doubly irreducible elements","volume":"17","author":"Rival","year":"1974","journal-title":"Canad. Math. Bull."},{"key":"10.1016\/j.dam.2015.03.014_br000100","series-title":"Combinatorics and Partially Ordered Sets: Dimension Theory","author":"Trotter","year":"1992"},{"issue":"7","key":"10.1016\/j.dam.2015.03.014_br000105","doi-asserted-by":"crossref","first-page":"1533","DOI":"10.1016\/j.dam.2008.09.006","article-title":"Laminar structure of Ptolemaic graphs with applications","volume":"157","author":"Uehara","year":"2009","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2015.03.014_br000110","series-title":"ICFCA 2007","first-page":"303","article-title":"The basic theorem on labelled line diagrams of finite concept lattices","volume":"vol. 4390","author":"Wille","year":"2007"},{"key":"10.1016\/j.dam.2015.03.014_br000115","series-title":"Proc. 7th Int. Conf. on Very Large Databases, Cannes, France, Mar. 29\u201331, 1982","first-page":"82","article-title":"Algorithms for acyclic database schemes","author":"Yannakakis","year":"1982"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X15001638?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X15001638?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2022,6,26]],"date-time":"2022-06-26T05:42:07Z","timestamp":1656222127000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X15001638"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,8]]},"references-count":23,"alternative-id":["S0166218X15001638"],"URL":"https:\/\/doi.org\/10.1016\/j.dam.2015.03.014","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2015,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"On the Galois lattice of bipartite distance hereditary graphs","name":"articletitle","label":"Article Title"},{"value":"Discrete Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.dam.2015.03.014","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2015 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}