{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T08:35:29Z","timestamp":1725525329282},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642002014"},{"type":"electronic","value":"9783642002021"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-00202-1_28","type":"book-chapter","created":{"date-parts":[[2009,2,10]],"date-time":"2009-02-10T02:34:01Z","timestamp":1234233241000},"page":"322-333","source":"Crossref","is-referenced-by-count":1,"title":["Matched Drawability of Graph Pairs and of Graph Triples"],"prefix":"10.1007","author":[{"given":"Luca","family":"Grilli","sequence":"first","affiliation":[]},{"given":"Seok-Hee","family":"Hong","sequence":"additional","affiliation":[]},{"given":"Giuseppe","family":"Liotta","sequence":"additional","affiliation":[]},{"given":"Henk","family":"Meijer","sequence":"additional","affiliation":[]},{"given":"Stephen K.","family":"Wismath","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"28_CR1","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/j.comgeo.2006.05.006","volume":"36","author":"P. Brass","year":"2007","unstructured":"Brass, P., Cenek, E., Duncan, C.A., Efrat, A., Erten, C., Ismailescu, D.P., Kobourov, S.G., Lubiw, A., Mitchell, J.S.B.: On simultaneous planar graph embeddings. Comput. Geom. Theory Appl.\u00a036(2), 117\u2013130 (2007)","journal-title":"Comput. Geom. Theory Appl."},{"issue":"6","key":"28_CR2","doi-asserted-by":"publisher","first-page":"1192","DOI":"10.1109\/TVCG.2007.70521","volume":"13","author":"C. Collins","year":"2007","unstructured":"Collins, C., Carpendale, S.: Vislink: Revealing relationships amongst visualizations. IEEE Trans. on Visualization and Comput. Graph.\u00a013(6), 1192\u20131199 (2007)","journal-title":"IEEE Trans. on Visualization and Comput. Graph."},{"key":"28_CR3","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, Upper Saddle River (1999)"},{"key":"28_CR4","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":"28_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/978-3-540-70904-6_35","volume-title":"Graph Drawing","author":"J.J. Fowler","year":"2007","unstructured":"Fowler, J.J., Kobourov, S.G.: Characterization of unlabeled level planar trees. In: Kaufmann, M., Wagner, D. (eds.) GD 2006. LNCS, vol.\u00a04372, pp. 367\u2013379. Springer, Heidelberg (2007)"},{"key":"28_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/978-3-540-77537-9_7","volume-title":"Graph Drawing","author":"J.J. Fowler","year":"2008","unstructured":"Fowler, J.J., Kobourov, S.G.: Characterization of unlabeled level planar graphs. In: Hong, S.-H., Nishizeki, T., Quan, W. (eds.) GD 2007. LNCS, vol.\u00a04875, pp. 37\u201349. Springer, Heidelberg (2008)"},{"key":"28_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1007\/978-3-540-77537-9_27","volume-title":"Graph Drawing","author":"F. Frati","year":"2008","unstructured":"Frati, F., Kaufmann, M., Kobourov, S.G.: Constrained simultaneous and near-simultaneous embeddings. In: Hong, S.-H., Nishizeki, T., Quan, W. (eds.) GD 2007. LNCS, vol.\u00a04875, pp. 268\u2013279. Springer, Heidelberg (2008)"},{"key":"28_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/11618058_19","volume-title":"Graph Drawing","author":"M. Geyer","year":"2006","unstructured":"Geyer, M., Kaufmann, M., Vrt\u2019o, I.: Two trees which are self-intersecting when drawn simultaneously. In: Healy, P., Nikolov, N.S. (eds.) GD 2005. LNCS, vol.\u00a03843, pp. 201\u2013210. Springer, Heidelberg (2006)"},{"key":"28_CR9","doi-asserted-by":"crossref","unstructured":"Grilli, L., Hong, S.H., Liotta, G., Meijer, H., Wismath, S.K.: Matched drawability of graph pairs and of graph triples. Tech. Rep. RT-004-08, Dip. Ing. Elettr. e dell\u2019Informaz., Univ. Perugia (2008)","DOI":"10.1007\/978-3-642-00202-1_28"},{"volume-title":"Drawing graphs: methods and models","year":"2001","key":"28_CR10","unstructured":"Kaufmann, M., Wagner, D. (eds.): Drawing graphs: methods and models. Springer, Heidelberg (2001)"},{"key":"28_CR11","doi-asserted-by":"publisher","DOI":"10.1142\/5648","volume-title":"Planar Graph Drawing","author":"T. Nishizeki","year":"2004","unstructured":"Nishizeki, T., Rahman, M.S.: Planar Graph Drawing. World Scientific, Singapore (2004)"},{"key":"28_CR12","doi-asserted-by":"publisher","DOI":"10.1142\/4902","volume-title":"Graph Drawing and Applications for Software and Knowledge Engineers","author":"K. Sugiyama","year":"2002","unstructured":"Sugiyama, K.: Graph Drawing and Applications for Software and Knowledge Engineers. World Scientific, Singapore (2002)"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-00202-1_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,17]],"date-time":"2019-05-17T19:07:31Z","timestamp":1558120051000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-00202-1_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642002014","9783642002021"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-00202-1_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}