{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T05:43:15Z","timestamp":1742967795497,"version":"3.40.3"},"publisher-location":"Cham","reference-count":37,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030214616"},{"type":"electronic","value":"9783030214623"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-21462-3_15","type":"book-chapter","created":{"date-parts":[[2019,6,13]],"date-time":"2019-06-13T23:05:15Z","timestamp":1560467115000},"page":"223-240","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Simultaneous, Polynomial-Time Layout of Context Bigraph and Lattice Digraph"],"prefix":"10.1007","author":[{"given":"Tim","family":"Pattison","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aaron","family":"Ceglar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,5,23]]},"reference":[{"issue":"1","key":"15_CR1","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/s10472-014-9418-6","volume":"72","author":"A Berry","year":"2014","unstructured":"Berry, A., Gutierrez, A., Huchard, M., Napoli, A., Sigayret, A.: Hermes: a simple and efficient algorithm for building the AOC-poset of a binary relation. Ann. Math. Artif. Intell. 72(1), 45\u201371 (2014). https:\/\/doi.org\/10.1007\/s10472-014-9418-6","journal-title":"Ann. Math. Artif. Intell."},{"key":"15_CR2","volume-title":"Readings in Information Visualization: Using Vision to Think","author":"S Card","year":"1999","unstructured":"Card, S., Mackinlay, J., Shneiderman, B.: Readings in Information Visualization: Using Vision to Think. Morgan Kaufmann, San Francisco (1999)"},{"issue":"3","key":"15_CR3","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1145\/264645.264657","volume":"4","author":"JD Cohen","year":"1997","unstructured":"Cohen, J.D.: Drawing graphs to convey proximity: an incremental arrangement method. ACM Trans. Comput.-Hum. Interact. 4(3), 197\u2013229 (1997). https:\/\/doi.org\/10.1145\/264645.264657","journal-title":"ACM Trans. Comput.-Hum. Interact."},{"key":"15_CR4","volume-title":"Multidimensional Scaling","author":"T Cox","year":"1994","unstructured":"Cox, T., Cox, M.: Multidimensional Scaling. Chapman Hall, London (1994)"},{"issue":"99","key":"15_CR5","doi-asserted-by":"publisher","first-page":"1810","DOI":"10.1109\/JSYST.2015.2427994","volume":"11","author":"P Cuffe","year":"2017","unstructured":"Cuffe, P., Keane, A.: Visualizing the electrical structure of power systems. IEEE Syst. J. 11(99), 1810\u20131821 (2017)","journal-title":"IEEE Syst. J."},{"key":"15_CR6","volume-title":"Graph Drawing: Algorithms for the Visualization of Graphs","author":"G Di Battista","year":"1999","unstructured":"Di Battista, G., Eades, P., Tamassia, R., Tollis, I.: Graph Drawing: Algorithms for the Visualization of Graphs. Prentice Hall, New Jersey (1999)"},{"key":"15_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-36763-2","volume-title":"Graph Drawing","year":"2013","unstructured":"Didimo, W., Patrignani, M. (eds.): GD 2012. LNCS, vol. 7704. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36763-2"},{"key":"15_CR8","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/978-3-642-29892-9_12","volume-title":"Formal Concept Analysis","author":"S Doerfel","year":"2012","unstructured":"Doerfel, S., J\u00e4schke, R., Stumme, G.: Publication analysis of the formal concept analysis community. In: Domenach, F., Ignatov, D.I., Poelmans, J. (eds.) ICFCA 2012. LNCS (LNAI), vol. 7278, pp. 77\u201395. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29892-9_12"},{"key":"15_CR9","doi-asserted-by":"crossref","unstructured":"Doyle, P., Snell, J.: Random Walks and Electric Networks. The Mathematical Association of America (1984)","DOI":"10.5948\/UPO9781614440222"},{"key":"15_CR10","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/BF01187020","volume":"11","author":"P Eades","year":"1994","unstructured":"Eades, P., Wormald, N.C.: Edge crossings in drawings of bipartite graphs. Algorithmica 11, 379\u2013403 (1994)","journal-title":"Algorithmica"},{"key":"15_CR11","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/978-1-84996-396-1_2","volume-title":"Network Science: Complexity in Nature and Technology","author":"E Estrada","year":"2010","unstructured":"Estrada, E., Hatano, N.: Resistance distance, information centrality, node vulnerability and vibrations in complex networks. In: Estrada, E., Fox, M., Higham, D.J., Oppo, G.L. (eds.) Network Science: Complexity in Nature and Technology, pp. 13\u201329. Springer, London (2010). https:\/\/doi.org\/10.1007\/978-1-84996-396-1_2"},{"key":"15_CR12","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1007\/978-3-540-24651-0_12","volume-title":"Concept Lattices","author":"R Freese","year":"2004","unstructured":"Freese, R.: Automated lattice drawing. In: Eklund, P. (ed.) ICFCA 2004. LNCS (LNAI), vol. 2961, pp. 112\u2013127. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24651-0_12"},{"key":"15_CR13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-59830-2","volume-title":"Formal Concept Analysis","author":"B Ganter","year":"1999","unstructured":"Ganter, B., Wille, R.: Formal Concept Analysis. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/978-3-642-59830-2"},{"issue":"8","key":"15_CR14","first-page":"955","volume":"10","author":"B Ganter","year":"2004","unstructured":"Ganter, B.: Conflict avoidance in additive order diagrams. J. Univers. Comput. Sci. 10(8), 955\u2013966 (2004)","journal-title":"J. Univers. Comput. Sci."},{"key":"15_CR15","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/j.dam.2015.09.017","volume":"203","author":"Severino V. Gervacio","year":"2016","unstructured":"Gervacio, S.V.: Resistance distance in complete n-partite graphs. Discrete Appl. Math. 203 (2016).https:\/\/doi.org\/10.1016\/j.dam.2015.09.017","journal-title":"Discrete Applied Mathematics"},{"issue":"3\u20134","key":"15_CR16","first-page":"324","volume":"12","author":"H Gibson","year":"2012","unstructured":"Gibson, H., Faith, J., Vickers, P.: A survey of two-dimensional graph layout techniques for information visualisation. Inf. Vis. 12(3\u20134), 324\u2013357 (2012)","journal-title":"Inf. Vis."},{"key":"15_CR17","volume-title":"Discrete Mathematics and its Applications. Handbook of Graph Theory","year":"2013","unstructured":"Gross, J.L., Yellen, J., Zhang, P. (eds.): Discrete Mathematics and its Applications. Handbook of Graph Theory, 2nd edn. Chapman and Hall\/CRC Press, New York (2013)","edition":"2"},{"issue":"29","key":"15_CR18","doi-asserted-by":"publisher","first-page":"15","DOI":"10.2298\/BMAT0429015G","volume":"129","author":"I Gutman","year":"2004","unstructured":"Gutman, I., Xiao, W.: Generalized inverse of the Laplacian matrix and some applications. Bulletin: Classe des sciences math\u00e9matiques et naturelles 129(29), 15\u201323 (2004). https:\/\/doi.org\/10.2298\/BMAT0429015G","journal-title":"Bulletin: Classe des sciences math\u00e9matiques et naturelles"},{"key":"15_CR19","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1007\/11671404_18","volume-title":"Formal Concept Analysis","author":"T Hannan","year":"2006","unstructured":"Hannan, T., Pogel, A.: Spring-based lattice drawing highlighting conceptual similarity. In: Missaoui, R., Schmidt, J. (eds.) ICFCA 2006. LNCS (LNAI), vol. 3874, pp. 264\u2013279. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11671404_18"},{"key":"15_CR20","doi-asserted-by":"publisher","first-page":"917","DOI":"10.1016\/j.aml.2004.07.034","volume":"18","author":"ND Ho","year":"2005","unstructured":"Ho, N.D., van Dooren, P.: On the pseudo-inverse of the Laplacian of a bipartite graph. Appl. Math. Lett. 18, 917\u2013922 (2005)","journal-title":"Appl. Math. Lett."},{"key":"15_CR21","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/BF01164627","volume":"12","author":"D Klein","year":"1993","unstructured":"Klein, D., Randi\u0107, M.: Resistance distance. J. Math. Chem. 12, 81\u201385 (1993)","journal-title":"J. Math. Chem."},{"key":"15_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/978-3-642-36763-2_6","volume-title":"Graph Drawing","author":"M Klimenta","year":"2013","unstructured":"Klimenta, M., Brandes, U.: Graph drawing by classical multidimensional scaling: new perspectives. In: Didimo, W., Patrignani, M. (eds.) GD 2012. LNCS, vol. 7704, pp. 55\u201366. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36763-2_6"},{"issue":"3","key":"15_CR23","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1080\/15427951.2014.958250","volume":"11","author":"J Kunegis","year":"2015","unstructured":"Kunegis, J.: Exploiting the structure of bipartite graphs for algebraic and spectral graph theory applications. Internet Math. 11(3), 201\u2013321 (2015). https:\/\/doi.org\/10.1080\/15427951.2014.958250","journal-title":"Internet Math."},{"key":"15_CR24","unstructured":"Kunegis, J., Schmidt, S., Albayrak, \u015e., Bauckhage, C., Mehlitz, M.: Modeling collaborative similarity with the signed resistance distance kernel. In: Ghallab, M. (ed.) European Conference on Artificial Intelligence. IOS Press (2008)"},{"issue":"3","key":"15_CR25","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1002\/widm.1088","volume":"3","author":"SO Kuznetsov","year":"2013","unstructured":"Kuznetsov, S.O., Poelmans, J.: Knowledge representation and processing with Formal Concept Analysis. Wiley Interdisc. Rev. Data Min. Know. Disc. 3(3), 200\u2013215 (2013). https:\/\/doi.org\/10.1002\/widm.1088","journal-title":"Wiley Interdisc. Rev. Data Min. Know. Disc."},{"key":"15_CR26","unstructured":"von Luxburg, U., Radl, A., Hein, M.: Getting lost in space: large sample analysis of the resistance distance. In: Advances in Neural Information Processing Systems 23: 24th Annual Conference on Neural Information Processing Systems 2010. pp. 2622\u20132630. Curran, New York (2010)"},{"key":"15_CR27","unstructured":"Pattison, T., Ceglar, A.: Interaction challenges for the dynamic construction of partially-ordered sets. In: Bertet, K., Rudolph, S. (eds.) Proceedings of 11th International Conference on Concept Lattices and their Applications, pp. 23\u201334. CEUR Workshop Proceedings, Ko\u0161ice, Slovakia (2014). http:\/\/ceur-ws.org\/Vol-1252\/"},{"key":"15_CR28","unstructured":"Pattison, T., Ceglar, A., Weber, D.: Efficient Formal Concept Analysis through recursive context partitioning. In: Ignatov, D.I., Nourine, L. (eds.) Proceedings of 14th International Conference on Concept Lattices & Their Applications, vol. 2123. CEUR Workshop Proceedings. Czech Republic (2018). http:\/\/ceur-ws.org\/Vol-2123\/"},{"key":"15_CR29","doi-asserted-by":"publisher","unstructured":"Pattison, T., Weber, D., Ceglar, A.: Enhancing layout and interaction in Formal Concept Analysis. In: Proceedings of 2014 IEEE Pacific Visualization Symposium (PacificVis), pp. 248\u2013252 (2014). https:\/\/doi.org\/10.1109\/PacificVis.2014.21","DOI":"10.1109\/PacificVis.2014.21"},{"issue":"1","key":"15_CR30","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1109\/TVCG.2007.70412","volume":"14","author":"C Plaisant","year":"2008","unstructured":"Plaisant, C., Fekete, J.D., Grinstein, G.: Promoting insight-based evaluation of visualizations: from contest to benchmark repository. IEEE Trans. Vis. Comput. Graph. 14(1), 120\u2013134 (2008). https:\/\/doi.org\/10.1109\/TVCG.2007.70412","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"key":"15_CR31","unstructured":"Pohlmann, J.: Configurable Graph Drawing Algorithms for the TikZ Graphics Description Language. Master\u2019s thesis, Univerisit\u00e4t zu L\u00fcbeck (2011). http:\/\/www.tcs.uni-luebeck.de\/downloads\/papers\/2011\/"},{"key":"15_CR32","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/978-94-017-0697-1_9","volume-title":"Algebras and Orders","author":"I Rival","year":"1993","unstructured":"Rival, I.: Reading, drawing, and order. In: Rosenberg, I.G., Sabidussi, G. (eds.) Algebras and Orders, vol. 389, pp. 359\u2013404. Springer, Dordrecht (1993). https:\/\/doi.org\/10.1007\/978-94-017-0697-1_9"},{"key":"15_CR33","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0378-8733(89)90016-6","volume":"11","author":"K Stephenson","year":"1989","unstructured":"Stephenson, K., Zelen, M.: Rethinking centrality: methods and applications. Soc. Netw. 11, 1\u201337 (1989)","journal-title":"Soc. Netw."},{"issue":"2","key":"15_CR34","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1109\/TSMC.1981.4308636","volume":"11","author":"K Sugiyama","year":"1981","unstructured":"Sugiyama, K., Tagawa, S., Toda, M.: Methods for visual understanding of hierarchical system structures. IEEE Trans. Syst. Man Cybern. 11(2), 109\u2013125 (1981)","journal-title":"IEEE Trans. Syst. Man Cybern."},{"key":"15_CR35","doi-asserted-by":"publisher","unstructured":"Tantau, T.: Graph drawing in TikZ. In: Didimo and Patrignani [7], pp. 517\u2013528. https:\/\/doi.org\/10.1007\/978-3-642-36763_246","DOI":"10.1007\/978-3-642-36763_246"},{"key":"15_CR36","volume-title":"The Algebraic Eigenvalue Problem","author":"J Wilkinson","year":"1965","unstructured":"Wilkinson, J.: The Algebraic Eigenvalue Problem. Oxford University Press, Oxford (1965)"},{"key":"15_CR37","unstructured":"Zschalig, C.: An FDP-algorithm for drawing lattices. In: Diatta, J., Eklund, P., Liquire, M. (eds.) Proceedings of CLA 2007, vol. 331, pp. 58\u201371. CEUR-WS.org (2007). http:\/\/ceur-ws.org\/Vol-331\/Zschalig.pdf"}],"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-030-21462-3_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T12:58:19Z","timestamp":1710248299000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-21462-3_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030214616","9783030214623"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-21462-3_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"23 May 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICFCA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Formal Concept Analysis","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Frankfurt","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 June 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 June 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icfca2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.informatik.fb2.frankfurt-university.de\/~icfca2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"36","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"15","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"42% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"plus 4 invited papers","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}