{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:46:20Z","timestamp":1759063580196,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642383168"},{"type":"electronic","value":"9783642383175"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38317-5_3","type":"book-chapter","created":{"date-parts":[[2013,5,14]],"date-time":"2013-05-14T01:39:51Z","timestamp":1368495591000},"page":"44-59","source":"Crossref","is-referenced-by-count":4,"title":["Dismantlable Lattices in the Mirror"],"prefix":"10.1007","author":[{"given":"Anne","family":"Berry","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alain","family":"Sigayret","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3_CR1","unstructured":"http:\/\/conexp.sourceforge.net\/download.html\n                    , release 1.3 \u00a9 Yevtushenko, S.A., et al. (2000-2006); Yevtushenko, S.A.: System of data analysis \u201cConcept Explorer\u201d. In: Proc. 7th Nat. Conf. on Artif. Intell., KII 2000 (Ru.), pp. 127\u2013134 (2000) (in Russian)"},{"issue":"3","key":"3_CR2","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/s00373-010-0922-0","volume":"26","author":"A.A. Abueida","year":"2010","unstructured":"Abueida, A.A., Busch, A.H., Sritharan, R.: A Min-Max Property of Chordal Bipartite Graphs with Applications. Graphs and Combinatorics\u00a026(3), 301\u2013313 (2010)","journal-title":"Graphs and Combinatorics"},{"issue":"1","key":"3_CR3","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1002\/net.3230020103","volume":"2","author":"K.A. Baker","year":"1972","unstructured":"Baker, K.A., Fishburn, P.C., Roberts, F.S.: Partial orders of dimension 2, Interval Orders, and Interval Graphs. Networks\u00a02(1), 11\u201328 (1972)","journal-title":"Networks"},{"issue":"1-2","key":"3_CR4","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.dam.2004.02.016","volume":"144","author":"A. Berry","year":"2004","unstructured":"Berry, A., Sigayret, A.: Representing a concept lattice by a graph. Discrete Applied Mathematics\u00a0144(1-2), 27\u201342 (2004)","journal-title":"Discrete Applied Mathematics"},{"key":"3_CR5","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/978-3-642-29892-9_10","volume-title":"Formal Concept Analysis","author":"A. Berry","year":"2012","unstructured":"Berry, A., Sigayret, A.: A peep through the looking glass: Articulation points in lattices. In: Domenach, F., Ignatov, D.I., Poelmans, J. (eds.) ICFCA 2012. LNCS (LNAI), vol.\u00a07278, pp. 45\u201360. Springer, Heidelberg (2012)"},{"key":"3_CR6","unstructured":"Birkhoff, G.: Lattice Theory, 3rd edn. American Mathematical Society (1967)"},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"Brandst\u00e4dt, A., Le, V.B., Spinrad, J.P.: Graph Classes: A Survey. SIAM Monographs on Discrete Math. Appl.\u00a03 (1999)","DOI":"10.1137\/1.9780898719796"},{"issue":"3","key":"3_CR8","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/s11083-010-9183-z","volume":"28","author":"F. Brucker","year":"2011","unstructured":"Brucker, F., G\u00e9ly, A.: Crown-free Lattices and Their Related Graphs. Order\u00a028(3), 443\u2013454 (2011)","journal-title":"Order"},{"key":"3_CR9","unstructured":"Caspard, N., Leclerc, B., Monjardet, B.: Ensembles ordonn\u00e9s finis: Concepts, r\u00e9sultats et usages. Math\u00e9mathiques et Applications, vol.\u00a060. Springer (2007)"},{"issue":"1-3","key":"3_CR10","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/S0012-365X(97)00047-2","volume":"181","author":"K. Deiters","year":"1998","unstructured":"Deiters, K., Ern\u00e9, M.: Negations and contrapositions of complete lattices. Discrete Mathematics,\u00a0181(1-3), 91\u2013111 (1998)","journal-title":"Discrete Mathematics,"},{"key":"3_CR11","doi-asserted-by":"publisher","first-page":"600","DOI":"10.2307\/2371374","volume":"63","author":"B. Dushnik","year":"1941","unstructured":"Dushnik, B., Miller, E.W.: Partially ordered sets. Amer. J. Mathematics\u00a063, 600\u2013610 (1941)","journal-title":"Amer. J. Mathematics"},{"key":"3_CR12","unstructured":"Eschen, E.M., Pinet, N., Sigayret, A.: Consecutive-ones: Handling lattice planarity efficiently. In: Proc. CLA 2007 (2007)"},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"Ganter, B., Wille, R.: Formal Concept Analysis. Springer (1999)","DOI":"10.1007\/978-3-642-59830-2"},{"issue":"2","key":"3_CR14","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1002\/jgt.3190020209","volume":"2","author":"M.M. Golumbic","year":"1978","unstructured":"Golumbic, M.M., Goss, M.C.: Perfect Elimination and Chordal Bipartite Graphs. Journal of Graph Theory\u00a02(2), 155\u2013163 (1978)","journal-title":"Journal of Graph Theory"},{"key":"3_CR15","unstructured":"Hammer, P.L., Maffray, F., Preissmann, M.: A characterization of chordal bipartite graphs. RUTCOR Research Report, Rutgers University (New Brunswick, NJ), pp. 16\u201389 (1989)"},{"issue":"1","key":"3_CR16","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/0020-0190(95)00027-A","volume":"55","author":"T. Kloks","year":"1995","unstructured":"Kloks, T., Kratsch, D.: Computing a Perfect Edge Without Vertex Elimination Ordering of a Chordal Bipartite Graph. Information Processing Letters\u00a055(1), 11\u201316 (1995)","journal-title":"Information Processing Letters"},{"key":"3_CR17","unstructured":"Li, L.: Private communication"},{"issue":"5","key":"3_CR18","doi-asserted-by":"publisher","first-page":"854","DOI":"10.1137\/0216057","volume":"16","author":"A. Lubiw","year":"1987","unstructured":"Lubiw, A.: Doubly lexical orderings of matrices. SIAM J. Comput.\u00a016(5), 854\u2013879 (1987)","journal-title":"SIAM J. Comput."},{"issue":"6","key":"3_CR19","doi-asserted-by":"publisher","first-page":"973","DOI":"10.1137\/0216062","volume":"16","author":"R. Paige","year":"1987","unstructured":"Paige, R., Tarjan, R.E.: Three partition refinement algorithms. SIAM J. Comput.\u00a016(6), 973\u2013989 (1987)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"3_CR20","doi-asserted-by":"publisher","first-page":"91","DOI":"10.4153\/CMB-1974-016-3","volume":"17","author":"I. Rival","year":"1974","unstructured":"Rival, I.: Lattices with doubly irreducible elements. Canadian Mathematical Bulletin\u00a017(1), 91\u201395 (1974)","journal-title":"Canadian Mathematical Bulletin"},{"key":"3_CR21","doi-asserted-by":"publisher","first-page":"1257","DOI":"10.4153\/CJM-1974-120-2","volume":"26","author":"D. Kelly","year":"1974","unstructured":"Kelly, D., Rival, I.: Crowns, fences, and dismantlable lattices. Canadian J. Mathematics\u00a026, 1257\u20131271 (1974)","journal-title":"Canadian J. Mathematics"},{"key":"3_CR22","doi-asserted-by":"crossref","unstructured":"Spinrad, J.P.: Efficient Graph Representations. Fields Institute Monographs, vol. 19. AMS (2003)","DOI":"10.1090\/fim\/019"},{"issue":"5","key":"3_CR23","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/0020-0190(93)90209-R","volume":"45","author":"J.P. Spinrad","year":"1993","unstructured":"Spinrad, J.P.: Doubly lexical ordering of dense 0-1 matrices. Information Processing Letters\u00a045(5), 229\u2013235 (1993)","journal-title":"Information Processing Letters"},{"key":"3_CR24","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/0166-218X(93)E0161-Q","volume":"19","author":"J.P. Spinrad","year":"1995","unstructured":"Spinrad, J.P., Sritharan, R.: Algorithms for weakly triangulated graphs. Discrete Applied Mathematics\u00a019, 181\u2013191 (1995)","journal-title":"Discrete Applied Mathematics"}],"container-title":["Lecture Notes in Computer Science","Formal Concept Analysis"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38317-5_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,1]],"date-time":"2023-02-01T01:29:25Z","timestamp":1675214965000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-38317-5_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642383168","9783642383175"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38317-5_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}