{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T19:59:19Z","timestamp":1742932759644,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":19,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819705658"},{"type":"electronic","value":"9789819705665"}],"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-981-97-0566-5_5","type":"book-chapter","created":{"date-parts":[[2024,2,28]],"date-time":"2024-02-28T12:03:28Z","timestamp":1709121808000},"page":"47-61","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Simultaneous Drawing of\u00a0Layered Trees"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7545-0730","authenticated-orcid":false,"given":"Julia","family":"Katheder","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0477-2724","authenticated-orcid":false,"given":"Stephen G.","family":"Kobourov","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5070-3412","authenticated-orcid":false,"given":"Axel","family":"Kuckuk","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7203-0669","authenticated-orcid":false,"given":"Maximilian","family":"Pfister","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7398-718X","authenticated-orcid":false,"given":"Johannes","family":"Zink","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,2,29]]},"reference":[{"key":"5_CR1","doi-asserted-by":"publisher","unstructured":"Bodenreider, O.: The unified medical language system (UMLS): Integrating biomedical terminology. Nucleic Acids Res. 32(suppl_1), 267\u2013270 (2004). https:\/\/doi.org\/10.1093\/nar\/gkh061","DOI":"10.1093\/nar\/gkh061"},{"issue":"2","key":"5_CR2","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1145\/235968.233366","volume":"25","author":"SS Chawathe","year":"1996","unstructured":"Chawathe, S.S., Rajaraman, A., Garcia-Molina, H., Widom, J.: Change detection in hierarchically structured information. ACM SIGMOD Rec. 25(2), 493\u2013504 (1996). https:\/\/doi.org\/10.1145\/235968.233366","journal-title":"ACM SIGMOD Rec."},{"key":"5_CR3","doi-asserted-by":"publisher","unstructured":"Chung, F.R.K.: On optimal linear arrangements of trees. Comput. Math. Appl. 10(1), 43\u201360 (1984). https:\/\/doi.org\/10.1016\/0898-1221(84)90085-3","DOI":"10.1016\/0898-1221(84)90085-3"},{"issue":"1","key":"5_CR4","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/S00453-004-1093-2","volume":"40","author":"V Dujmovic","year":"2004","unstructured":"Dujmovic, V., Whitesides, S.: An efficient fixed parameter tractable algorithm for 1-sided crossing minimization. Algorithmica 40(1), 15\u201331 (2004). https:\/\/doi.org\/10.1007\/S00453-004-1093-2","journal-title":"Algorithmica"},{"issue":"4","key":"5_CR5","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(4), 379\u2013403 (1994). https:\/\/doi.org\/10.1007\/bf01187020","journal-title":"Algorithmica"},{"issue":"3","key":"5_CR6","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1137\/0604033","volume":"4","author":"MR Garey","year":"1983","unstructured":"Garey, M.R., Johnson, D.S.: Crossing number is NP-complete. SIAM J. Algebraic Discrete Methods 4(3), 312\u2013316 (1983). https:\/\/doi.org\/10.1137\/0604033","journal-title":"SIAM J. Algebraic Discrete Methods"},{"issue":"4","key":"5_CR7","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1057\/ivs.2009.29","volume":"9","author":"M Graham","year":"2010","unstructured":"Graham, M., Kennedy, J.: A survey of multiple tree visualisation. Inf. Vis. 9(4), 235\u2013252 (2010). https:\/\/doi.org\/10.1057\/ivs.2009.29","journal-title":"Inf. Vis."},{"key":"5_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1007\/978-3-642-19094-0_9","volume-title":"WALCOM: Algorithms and Computation","author":"M Harrigan","year":"2011","unstructured":"Harrigan, M., Healy, P.: k-level crossing minimization Is NP-hard for trees. In: Katoh, N., Kumar, A. (eds.) WALCOM 2011. LNCS, vol. 6552, pp. 70\u201376. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-19094-0_9"},{"key":"5_CR9","doi-asserted-by":"publisher","unstructured":"Liu, Z., Zhan, S.H., Munzner, T.: Aggregated dendrograms for visual comparison between many phylogenetic trees. IEEE Trans. Visualization Comput. Graph. 26(9), 2732\u20132747 (2019). https:\/\/doi.org\/10.1109\/tvcg.2019.2898186","DOI":"10.1109\/tvcg.2019.2898186"},{"key":"5_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/3-540-45848-4_10","volume-title":"Graph Drawing","author":"X Mu\u00f1oz","year":"2002","unstructured":"Mu\u00f1oz, X., Unger, W., Vrt\u2019o, I.: One sided crossing minimization is NP-hard for sparse graphs. In: Mutzel, P., J\u00fcnger, M., Leipert, S. (eds.) GD 2001. LNCS, vol. 2265, pp. 115\u2013123. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45848-4_10"},{"issue":"3","key":"5_CR11","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1145\/1201775.882291","volume":"22","author":"T Munzner","year":"2003","unstructured":"Munzner, T., Guimbretiere, F., Tasiran, S., Zhang, L., Zhou, Y.: Treejuxtaposer: scalable tree comparison using Focus+Context with guaranteed visibility. ACM Trans. Graph. 22(3), 453\u2013462 (2003). https:\/\/doi.org\/10.1145\/1201775.882291","journal-title":"ACM Trans. Graph."},{"key":"5_CR12","doi-asserted-by":"publisher","unstructured":"Pavlopoulos, G.A., Soldatos, T..G, Barbosa-Silva, A., Schneider, R.: A reference guide for tree analysis and visualization. BioData Mining 3(1), 1\u201324 (2010). https:\/\/doi.org\/10.1186\/1756-0381-3-1","DOI":"10.1186\/1756-0381-3-1"},{"key":"5_CR13","doi-asserted-by":"publisher","unstructured":"Puigb\u00f2, P., Wolf, Y.I., Koonin, E.V.: Search for a \u2018tree of life\u2019 in the thicket of the phylogenetic forest. J. Biol. 8(6), 1\u201317 (2009). https:\/\/doi.org\/10.1186\/jbiol159","DOI":"10.1186\/jbiol159"},{"issue":"3","key":"5_CR14","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1023\/A:1016344215610","volume":"7","author":"HC Purchase","year":"2002","unstructured":"Purchase, H.C., Carrington, D.A., Allder, J.-A.: Empirical evaluation of aesthetics-based graph layout. Empir. Softw. Eng. 7(3), 233\u2013255 (2002). https:\/\/doi.org\/10.1023\/A:1016344215610","journal-title":"Empir. Softw. Eng."},{"key":"5_CR15","doi-asserted-by":"publisher","unstructured":"Schulz, H.-J.: Treevis.net: a tree visualization reference. IEEE Comput. Graph. Appl. 31(6), 11\u201315 (2011). https:\/\/doi.org\/10.1109\/mcg.2011.103","DOI":"10.1109\/mcg.2011.103"},{"issue":"6","key":"5_CR16","doi-asserted-by":"publisher","first-page":"1773","DOI":"10.1137\/S0097539797331671","volume":"30","author":"F Shahrokhi","year":"2000","unstructured":"Shahrokhi, F., S\u00fdkora, O., Sz\u00e9kely, L.A., Vrto, I.: On bipartite drawings and the linear arrangement problem. SIAM J. Comput. 30(6), 1773\u20131789 (2000). https:\/\/doi.org\/10.1137\/S0097539797331671","journal-title":"SIAM J. Comput."},{"issue":"2","key":"5_CR17","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). https:\/\/doi.org\/10.1109\/TSMC.1981.4308636","journal-title":"IEEE Trans. Syst. Man Cybern."},{"issue":"2","key":"5_CR18","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1057\/palgrave.ivs.9500013","volume":"1","author":"C Ware","year":"2002","unstructured":"Ware, C., Purchase, H.C., Colpoys, L., McGill, M.: Cognitive measurements of graph aesthetics. Inf. Vis. 1(2), 103\u2013110 (2002). https:\/\/doi.org\/10.1057\/palgrave.ivs.9500013","journal-title":"Inf. Vis."},{"issue":"5","key":"5_CR19","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1038\/nrg3186","volume":"13","author":"Z Yang","year":"2012","unstructured":"Yang, Z., Rannala, B.: Molecular phylogenetics: principles and practice. Nat. Rev. Genet. 13(5), 303\u2013314 (2012). https:\/\/doi.org\/10.1038\/nrg3186","journal-title":"Nat. Rev. Genet."}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-97-0566-5_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,5]],"date-time":"2024-03-05T16:08:00Z","timestamp":1709654880000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-97-0566-5_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9789819705658","9789819705665"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-981-97-0566-5_5","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":"29 February 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WALCOM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference and Workshops on Algorithms and Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kanazawa","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","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":"18 March 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 March 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"walcom2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.walcom-conference.org\/","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":"80","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":"28","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":"0","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":"35% - 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":"1","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)"}}]}}