{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T01:40:34Z","timestamp":1742953234180,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031678677"},{"type":"electronic","value":"9783031678684"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-67868-4_11","type":"book-chapter","created":{"date-parts":[[2024,8,1]],"date-time":"2024-08-01T21:03:07Z","timestamp":1722546187000},"page":"149-165","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Realizability of\u00a0Rectangular Euler Diagrams"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0855-4185","authenticated-orcid":false,"given":"Dominik","family":"D\u00fcrrschnabel","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0375-429X","authenticated-orcid":false,"given":"Uta","family":"Priss","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,8,1]]},"reference":[{"key":"11_CR1","doi-asserted-by":"publisher","unstructured":"D\u00fcrrschnabel, D., Hanika, T., Stumme, G.: Drawing order diagrams through two-dimension extension. J. Graph Algorithms Appl. 27(9), 783\u2013802 (2023). https:\/\/doi.org\/10.7155\/JGAA.00645","DOI":"10.7155\/JGAA.00645"},{"key":"11_CR2","doi-asserted-by":"publisher","unstructured":"D\u00fcrrschnabel, D., Stumme, G.: Greedy discovery of ordinal factors. CoRR abs\/2302.11554 (2023). https:\/\/doi.org\/10.48550\/ARXIV.2302.11554","DOI":"10.48550\/ARXIV.2302.11554"},{"key":"11_CR3","doi-asserted-by":"publisher","unstructured":"D\u00fcrrschnabel, D., Stumme, G.: Maximal ordinal two-factorizations. In: Ojeda-Aciego, M., Sauerwald, K., J\u00e4schke, R. (eds.) Graph-Based Representation and Reasoning - 28th International Conference on Conceptual Structures, ICCS 2023, Proceedings. LNCS, vol. 14133, pp. 41\u201355. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-40960-8_5","DOI":"10.1007\/978-3-031-40960-8_5"},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"Dushnik, B., Miller, E.W.: Partially ordered sets. Am. J. Math. 63(3), 600\u2013610 (1941). http:\/\/www.jstor.org\/stable\/2371374","DOI":"10.2307\/2371374"},{"key":"11_CR5","doi-asserted-by":"publisher","unstructured":"Fishburn, P.C., Trotter, W.T.: Geometric containment orders: a survey. Order 15(2), 167\u2013182 (1998). https:\/\/doi.org\/10.1023\/A:1006110326269","DOI":"10.1023\/A:1006110326269"},{"key":"11_CR6","doi-asserted-by":"publisher","unstructured":"Ganter, B., Glodeanu, C.V.: Ordinal factor analysis. In: Domenach, F., Ignatov, D.I., Poelmans, J. (eds.) Formal Concept Analysis - 10th International Conference, ICFCA 2012, Proceedings. LNCS, vol.\u00a07278, pp. 128\u2013139. Springer, Cham (2012). https:\/\/doi.org\/10.1007\/978-3-642-29892-9_15","DOI":"10.1007\/978-3-642-29892-9_15"},{"key":"11_CR7","doi-asserted-by":"publisher","unstructured":"Golumbic, M.C., Scheinerman, E.R.: Containment graphs, posets, and related classes of graphs. Ann. N. Y. Acad. Sci. 555, 192\u2013204 (1989). https:\/\/doi.org\/10.1111\/j.1749-6632.1989.tb22452.x","DOI":"10.1111\/j.1749-6632.1989.tb22452.x"},{"issue":"1","key":"11_CR8","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1109\/TVCG.2021.3114834","volume":"28","author":"R Kehlbeck","year":"2022","unstructured":"Kehlbeck, R., G\u00f6rtler, J., Wang, Y., Deussen, O.: SPEULER: semantics-preserving Euler diagrams. IEEE Trans. Vis. Comput. Graph. 28(1), 433\u2013442 (2022). https:\/\/doi.org\/10.1109\/TVCG.2021.3114834","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"issue":"4","key":"11_CR9","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/BF01350778","volume":"179","author":"V Nov\u00e1k","year":"1969","unstructured":"Nov\u00e1k, V.: \u00dcber eine eigenschaft der dedekind-macneilleschen h\u00fclle. Math. Ann. 179(4), 337\u2013342 (1969). https:\/\/doi.org\/10.1007\/BF01350778","journal-title":"Math. Ann."},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"Paetzold, P., Kehlbeck, R., Strobelt, H., Xue, Y., Storandt, S., Deussen, O.: RectEuler: visualizing intersecting sets using rectangles. Comput. Graph. Forum 42, 87\u201398 (2023)","DOI":"10.1111\/cgf.14814"},{"issue":"4","key":"11_CR11","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/S10849-004-2117-7","volume":"13","author":"W Petersen","year":"2004","unstructured":"Petersen, W.: A mathematical analysis of Panini\u2019s Sivasutras. J. Log. Lang. Inf. 13(4), 471\u2013489 (2004). https:\/\/doi.org\/10.1007\/S10849-004-2117-7","journal-title":"J. Log. Lang. Inf."},{"key":"11_CR12","unstructured":"Petersen, W.: Zur Minimalit\u00e4t von P\u0101ninis \u015aivas\u016btras: eine Untersuchung mit Methoden der formalen Begriffsanalyse. Ph.D. thesis, Heinrich-Heine-Universit\u00e4t D\u00fcsseldorf (2008)"},{"key":"11_CR13","doi-asserted-by":"publisher","unstructured":"Priss, U.: Representing concept lattices with Euler diagrams. In: D\u00fcrrschnabel, D., L\u00f3pez-Rodr\u00edguez, D. (eds.) Formal Concept Analysis - 17th International Conference, ICFCA 2023, Proceedings. LNCS, vol. 13934, pp. 183\u2013197. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-35949-1_13","DOI":"10.1007\/978-3-031-35949-1_13"},{"key":"11_CR14","doi-asserted-by":"crossref","unstructured":"Priss, U., D\u00fcrrschnabel, D.: Rectangular Euler diagrams and order theory. In: Diagrammatic Representation and Inference - 14th International Conference, Diagrams 2024, Proceedings. LNCS. Springer, Cham (2024, in Print)","DOI":"10.1007\/978-3-031-67868-4_11"},{"issue":"6","key":"11_CR15","doi-asserted-by":"publisher","first-page":"1090","DOI":"10.1109\/TVCG.2010.210","volume":"16","author":"NH Riche","year":"2010","unstructured":"Riche, N.H., Dwyer, T.: Untangling Euler diagrams. IEEE Trans. Vis. Comput. Graph. 16(6), 1090\u20131099 (2010). https:\/\/doi.org\/10.1109\/TVCG.2010.210","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"issue":"3","key":"11_CR16","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1016\/J.JVLC.2013.08.006","volume":"25","author":"P Rodgers","year":"2014","unstructured":"Rodgers, P.: A survey of Euler diagrams. J. Vis. Lang. Comput. 25(3), 134\u2013155 (2014). https:\/\/doi.org\/10.1016\/J.JVLC.2013.08.006","journal-title":"J. Vis. Lang. Comput."},{"key":"11_CR17","doi-asserted-by":"publisher","unstructured":"Rodgers, P., Zhang, L., Fish, A.: General Euler diagram generation. In: Stapleton, G., Howse, J., Lee, J. (eds.) Diagrammatic Representation and Inference, 5th International Conference, Diagrams 2008, Proceedings. LNCS, vol.\u00a05223, pp. 13\u201327. Springer, Cham (2008). https:\/\/doi.org\/10.1007\/978-3-540-87730-1_6","DOI":"10.1007\/978-3-540-87730-1_6"},{"key":"11_CR18","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/BF00353652","volume":"5","author":"W Schnyder","year":"1989","unstructured":"Schnyder, W.: Planar graphs and poset dimension. Order 5, 323\u2013343 (1989)","journal-title":"Order"},{"key":"11_CR19","doi-asserted-by":"publisher","unstructured":"Spinrad, J.P.: On comparability and permutation graphs. SIAM J. Comput. 14(3), 658\u2013670 (1985). https:\/\/doi.org\/10.1137\/0214048","DOI":"10.1137\/0214048"},{"issue":"1","key":"11_CR20","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1006\/JAGM.1998.0974","volume":"30","author":"J Y\u00e1\u00f1ez","year":"1999","unstructured":"Y\u00e1\u00f1ez, J., Montero, J.: A poset dimension algorithm. J. Algorithms 30(1), 185\u2013208 (1999). https:\/\/doi.org\/10.1006\/JAGM.1998.0974","journal-title":"J. Algorithms"},{"issue":"3","key":"11_CR21","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1137\/0603036","volume":"3","author":"M Yannakakis","year":"1982","unstructured":"Yannakakis, M.: The complexity of the partial order dimension problem. SIAM J. Discrete Math. 3(3), 351\u2013358 (1982). https:\/\/doi.org\/10.1137\/0603036","journal-title":"SIAM J. Discrete Math."},{"issue":"1","key":"11_CR22","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1109\/TVCG.2015.2467251","volume":"22","author":"V Yoghourdjian","year":"2016","unstructured":"Yoghourdjian, V., Dwyer, T., Gange, G., Kieffer, S., Klein, K., Marriott, K.: High-quality ultra-compact grid layout of grouped networks. IEEE Trans. Vis. Comput. Graph. 22(1), 339\u2013348 (2016). https:\/\/doi.org\/10.1109\/TVCG.2015.2467251","journal-title":"IEEE Trans. Vis. Comput. Graph."}],"container-title":["Lecture Notes in Computer Science","Conceptual Knowledge Structures"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-67868-4_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,11]],"date-time":"2024-08-11T23:03:46Z","timestamp":1723417426000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-67868-4_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031678677","9783031678684"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-67868-4_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"1 August 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CONCEPTS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Joint Conference on Conceptual Knowledge Structures","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"C\u00e1diz","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 September 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 September 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccs-conceptstruct2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/concepts2024.uca.es","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}