{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T08:23:38Z","timestamp":1725524618485},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642002182"},{"type":"electronic","value":"9783642002199"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-00219-9_14","type":"book-chapter","created":{"date-parts":[[2009,2,4]],"date-time":"2009-02-04T08:03:51Z","timestamp":1233734631000},"page":"133-144","source":"Crossref","is-referenced-by-count":4,"title":["Visual Analysis of One-to-Many Matched Graphs"],"prefix":"10.1007","author":[{"given":"Emilio","family":"Di Giacomo","sequence":"first","affiliation":[]},{"given":"Walter","family":"Didimo","sequence":"additional","affiliation":[]},{"given":"Giuseppe","family":"Liotta","sequence":"additional","affiliation":[]},{"given":"Pietro","family":"Palladino","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"14_CR1","unstructured":"GDToolkit: Graph drawing toolkit, http:\/\/www.dia.uniroma3.it\/~gdt\/"},{"key":"14_CR2","unstructured":"IEEE Symposium on Information Visualization (InfoVis 2007), October 28-30. IEEE Computer Society, Sacramento (2007)"},{"key":"14_CR3","series-title":"Lecture Notes in Computer Science","volume-title":"Graph Drawing","year":"2008","unstructured":"Hong, S.-H., Nishizeki, T., Quan, W. (eds.): GD 2007. LNCS, vol.\u00a04875. Springer, Heidelberg (2008)"},{"key":"14_CR4","unstructured":"IEEE VGTC Pacific Visualization Symposium 2008 (PacificVis 2008), Kyoto, Japan, March 4-7. IEEE Computer Society, Los Alamitos (2008)"},{"key":"14_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1007\/978-3-540-30559-0_28","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"M. Baur","year":"2004","unstructured":"Baur, M., Brandes, U.: Crossing reduction in circular layouts. In: Hromkovi\u010d, J., Nagl, M., Westfechtel, B. (eds.) WG 2004. LNCS, vol.\u00a03353, pp. 332\u2013343. Springer, Heidelberg (2004)"},{"key":"14_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/978-3-540-77537-9_26","volume-title":"Graph Drawing","author":"M. Baur","year":"2008","unstructured":"Baur, M., Brandes, U.: Multi-circular layout of micro\/Macro graphs. In: Hong, S.-H., Nishizeki, T., Quan, W. (eds.) GD 2007. LNCS, vol.\u00a04875, pp. 255\u2013267. Springer, Heidelberg (2008)"},{"issue":"2","key":"14_CR7","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/j.comgeo.2006.05.006","volume":"36","author":"P. Bra\u00df","year":"2007","unstructured":"Bra\u00df, P., Cenek, E., Duncan, C.A., Efrat, A., Erten, C., Ismailescu, D., Kobourov, S.G., Lubiw, A., Mitchell, J.S.B.: On simultaneous planar graph embeddings. Comput. Geom. Theory and Appl.\u00a036(2), 117\u2013130 (2007)","journal-title":"Comput. Geom. Theory and Appl."},{"issue":"6","key":"14_CR8","doi-asserted-by":"publisher","first-page":"1192","DOI":"10.1109\/TVCG.2007.70521","volume":"13","author":"C. Collins","year":"2007","unstructured":"Collins, C., Carpendale, M.S.T.: Vislink: Revealing relationships amongst visualizations. IEEE Trans. Vis. Comput. Graph.\u00a013(6), 1192\u20131199 (2007)","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"key":"14_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/3-540-46648-7_31","volume-title":"Graph Drawing","author":"G. Battista Di","year":"1999","unstructured":"Di Battista, G., Didimo, W., Patrignani, M., Pizzonia, M.: Orthogonal and quasi-upward drawings with vertices of prescribed size. In: Kratochv\u00edl, J. (ed.) GD 1999. LNCS, vol.\u00a01731, pp. 297\u2013310. Springer, Heidelberg (1999)"},{"key":"14_CR10","volume-title":"Graph Drawing","author":"G. Di Battista","year":"1999","unstructured":"Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing. Prentice-Hall, Englewood Cliffs (1999)"},{"key":"14_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/978-3-540-77537-9_19","volume-title":"Graph Drawing","author":"E. Giacomo Di","year":"2008","unstructured":"Di Giacomo, E., Didimo, W., van Kreveld, M., Liotta, G., Speckmann, B.: Matched drawings of planar graphs. In: Hong, S.-H., Nishizeki, T., Quan, W. (eds.) GD 2007. LNCS, vol.\u00a04875, pp. 183\u2013194. Springer, Heidelberg (2008)"},{"key":"14_CR12","doi-asserted-by":"crossref","unstructured":"Di Giacomo, E., Didimo, W., Palladino, P., Liotta, G.: Visual analysis of one-to-many matched graphs. Tech. rep, RT-003-08, DIEI - Universit\u00e0 di Perugia, Italy (2008)","DOI":"10.1007\/978-3-642-00219-9_14"},{"issue":"2","key":"14_CR13","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1142\/S0218195907002276","volume":"17","author":"E. Di Giacomo","year":"2007","unstructured":"Di Giacomo, E., Liotta, G.: Simultaneous embedding of outerplanar graphs, paths, and cycles. Intern. Journ. of Comput. Geom. and Appl.\u00a017(2), 139\u2013160 (2007)","journal-title":"Intern. Journ. of Comput. Geom. and Appl."},{"key":"14_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/978-3-540-24595-7_9","volume-title":"Graph Drawing","author":"C. Erten","year":"2004","unstructured":"Erten, C., Harding, P.J., Kobourov, S.G., Wampler, K., Yee, G.V.: Graphael: Graph animations with evolving layouts. In: Liotta, G. (ed.) GD 2003. LNCS, vol.\u00a02912, pp. 98\u2013110. Springer, Heidelberg (2004)"},{"issue":"3","key":"14_CR15","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/s00224-005-1143-4","volume":"38","author":"C. Erten","year":"2005","unstructured":"Erten, C., Kobourov, S.G.: Simultaneous embedding of a planar graph and its dual on the grid. Theory Comput. Syst.\u00a038(3), 313\u2013327 (2005)","journal-title":"Theory Comput. Syst."},{"issue":"1","key":"14_CR16","first-page":"165","volume":"9","author":"C. Erten","year":"2005","unstructured":"Erten, C., Kobourov, S.G., Le, V., Navabi, A.: Simultaneous graph drawing: Layout algorithms and visualization schemes. Journ. Graph Alg. and Appl.\u00a09(1), 165\u2013182 (2005)","journal-title":"Journ. Graph Alg. and Appl."},{"issue":"1","key":"14_CR17","first-page":"73","volume":"12","author":"C. Gutwenger","year":"2008","unstructured":"Gutwenger, C., Klein, K., Mutzel, P.: Planarity testing and optimal edge insertion with embedding constraints. Journ. of Graph Alg. and Appl.\u00a012(1), 73\u201395 (2008)","journal-title":"Journ. of Graph Alg. and Appl."},{"key":"14_CR18","unstructured":"Masuda, S., Kashiwabara, T., Nakajima, K., Fujisawa, T.: On the NP-completeness of a computer network layout problem. In: 20th IEEE Int. Symposium on Circuits and Systems, pp. 292\u2013295 (1987)"},{"issue":"5","key":"14_CR19","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1109\/TVCG.2006.166","volume":"12","author":"B. Shneiderman","year":"2006","unstructured":"Shneiderman, B., Aris, A.: Network visualization by semantic substrates. IEEE Trans. Vis. Comput. Graph.\u00a012(5), 733\u2013740 (2006)","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"issue":"1","key":"14_CR20","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/j.jda.2005.01.009","volume":"4","author":"J.M. Six","year":"2006","unstructured":"Six, J.M., Tollis, I.G.: A framework and algorithms for circular drawings of graphs. Journ. of Discr. Alg.\u00a04(1), 25\u201350 (2006)","journal-title":"Journ. of Discr. Alg."}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-00219-9_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,17]],"date-time":"2019-05-17T16:06:40Z","timestamp":1558109200000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-00219-9_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642002182","9783642002199"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-00219-9_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}