{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T02:31:55Z","timestamp":1725503515963},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540781363"},{"type":"electronic","value":"9783540781370"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-78137-0_8","type":"book-chapter","created":{"date-parts":[[2008,2,14]],"date-time":"2008-02-14T04:34:46Z","timestamp":1202963686000},"page":"106-123","source":"Crossref","is-referenced-by-count":0,"title":["The Number of Plane Diagrams of a Lattice"],"prefix":"10.1007","author":[{"given":"Christian","family":"Zschalig","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"8_CR1","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1137\/S0097539794279626","volume":"27","author":"P. Bertolazzi","year":"1998","unstructured":"Bertolazzi, P., et al.: Optimal upward planarity testing of single-source digraphs. SIAM J. COmput.\u00a027, 132\u2013169 (1998)","journal-title":"SIAM J. COmput."},{"key":"8_CR2","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1002\/net.3230020103","volume":"2","author":"K.A. Baker","year":"1971","unstructured":"Baker, K.A., Fishburn, P.C., Roberts, F.S.: Partial orders of dimension 2. Networks\u00a02, 11\u201328 (1971)","journal-title":"Networks"},{"key":"8_CR3","unstructured":"Birkhoff, G.: Lattice theory, third ed., Amer. Math. Soc (1967)"},{"key":"8_CR4","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0012-365X(82)90167-4","volume":"38","author":"O. Cogis","year":"1982","unstructured":"Cogis, O.: On the ferrers-dimension of a digraph. Discrete Math.\u00a038, 47\u201352 (1982)","journal-title":"Discrete Math."},{"key":"8_CR5","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/0022-2496(84)90020-8","volume":"28","author":"J.P. Doignon","year":"1984","unstructured":"Doignon, J.P., Ducamp, A., Falmagne, J.C.: On realizable biorders and the biorder dimension of a relation. J. of. Math. Psychology\u00a028, 73\u2013109 (1984)","journal-title":"J. of. Math. Psychology"},{"key":"8_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-07551-7","volume-title":"Graphentheorie","author":"R. Diestel","year":"1996","unstructured":"Diestel, R.: Graphentheorie. Springer, Heidelberg (1996)"},{"key":"8_CR7","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. Math\u00a063, 600\u2013610 (1941)","journal-title":"Amer. J. Math"},{"issue":"8","key":"8_CR8","first-page":"955","volume":"10","author":"B. Ganter","year":"2004","unstructured":"Ganter, B.: Conflict avoidance in order diagrams. J. of Univ. Comp. Sc.\u00a010(8), 955\u2013966 (2004)","journal-title":"J. of Univ. Comp. Sc."},{"key":"8_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-59830-2","volume-title":"Formal concept analysis - mathematical foundations","author":"B. Ganter","year":"1999","unstructured":"Ganter, B., Wille, R.: Formal concept analysis - mathematical foundations. Springer, Heidelberg (1999)"},{"key":"8_CR10","unstructured":"Jungnickel, D.: Graphen, Netzwerke und Algorithmen, third ed., BI-Wiss.-Verl (1994)"},{"issue":"3","key":"8_CR11","doi-asserted-by":"crossref","first-page":"636","DOI":"10.4153\/CJM-1975-074-0","volume":"27","author":"D. Kelly","year":"1975","unstructured":"Kelly, D., Rival, I.: Planar lattices. Can. J. Math.\u00a027(3), 636\u2013665 (1975)","journal-title":"Can. J. Math."},{"key":"8_CR12","doi-asserted-by":"crossref","unstructured":"Platt, C.R.: Planar lattices and planar graphs. J. Combinatorial Theory Ser. B, 30\u201339 (1976)","DOI":"10.1016\/0095-8956(76)90024-1"},{"key":"8_CR13","doi-asserted-by":"crossref","unstructured":"Reuter, K.: Removing critical pairs, Tech. Report 1241, TU Darmstadt (1989)","DOI":"10.1007\/BF02034329"},{"key":"8_CR14","unstructured":"Schmidt, B.: Ein Algorithmus zum Zeichnen von Liniendiagrammen, Master\u2019s thesis, TU Dresden (2002)"},{"key":"8_CR15","unstructured":"Spinrad, J.: Two dimensional partial orders, Ph.D. thesis, Princeton Univ (1982)"},{"key":"8_CR16","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1007\/978-3-540-32262-7_27","volume-title":"Formal Concept Analysis","author":"C. Zschalig","year":"2005","unstructured":"Zschalig, C.: Planarity of lattices - an approach based on attribute additivity. In: Ganter, B., Godin, R. (eds.) ICFCA 2005. LNCS (LNAI), vol.\u00a03403, pp. 391\u2013402. Springer, Heidelberg (2005)"},{"key":"8_CR17","unstructured":"Bipartite ferrers-graphs and planar concept lattices. In: Kuznetsov, S.O., Schmidt, S. (eds.) ICFCA 2007. LNCS (LNAI), vol.\u00a04390, pp. 313\u2013327. Springer, Heidelberg (2007)"},{"key":"8_CR18","unstructured":"Left-relations, A.: unified approach to characterize planar lattices, Ph.D. thesis, TU Dresden (to appear, 2008)"}],"container-title":["Lecture Notes in Computer Science","Formal Concept Analysis"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-78137-0_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,16]],"date-time":"2023-05-16T13:43:10Z","timestamp":1684244590000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-78137-0_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540781363","9783540781370"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-78137-0_8","relation":{},"subject":[]}}