{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T02:07:04Z","timestamp":1725502024489},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540775362"},{"type":"electronic","value":"9783540775379"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-77537-9_19","type":"book-chapter","created":{"date-parts":[[2008,1,30]],"date-time":"2008-01-30T09:50:55Z","timestamp":1201686655000},"page":"183-194","source":"Crossref","is-referenced-by-count":5,"title":["Matched Drawings of Planar Graphs"],"prefix":"10.1007","author":[{"given":"Emilio","family":"Di Giacomo","sequence":"first","affiliation":[]},{"given":"Walter","family":"Didimo","sequence":"additional","affiliation":[]},{"given":"Marc","family":"van Kreveld","sequence":"additional","affiliation":[]},{"given":"Giuseppe","family":"Liotta","sequence":"additional","affiliation":[]},{"given":"Bettina","family":"Speckmann","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"19_CR1","series-title":"Lecture Notes in Computer Science","volume-title":"Network Analysis","year":"2005","unstructured":"Brandes, U., Erlebach, T. (eds.): Network Analysis. LNCS, vol.\u00a03418. Springer, Heidelberg (2005)"},{"key":"19_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1007\/978-3-540-73545-8_26","volume-title":"COCOON 2007","author":"U. Brandes","year":"2007","unstructured":"Brandes, U., Erten, C., Fowler, J., Frati, F., Geyer, M., Gutwenger, C., Hong, S.-H., Kaufmann, M., Kobourov, S., Liotta, G., Mutzel, P., Symvonis, A.: Colored simultaneous geometric embeddings. In: Lin, G. (ed.) COCOON 2007. LNCS, vol.\u00a04598, pp. 254\u2013263. Springer, Heidelberg (2007)"},{"issue":"2","key":"19_CR3","doi-asserted-by":"crossref","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. Computational Geometry: Theory and Applications\u00a036(2), 117\u2013130 (2007)","journal-title":"Computational Geometry: Theory and Applications"},{"key":"19_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/978-3-540-70904-6_11","volume-title":"Graph Drawing","author":"J. Cappos","year":"2007","unstructured":"Cappos, J., Estrella-Balderrama, A., Fowler, J.J., Kobourov, S.G.: Simultaneous graph embedding with bends and circular arcs. In: Kaufmann, M., Wagner, D. (eds.) GD 2006. LNCS, vol.\u00a04372, pp. 95\u2013107. Springer, Heidelberg (2007)"},{"key":"19_CR5","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/BF02122694","volume":"10","author":"H. Fraysseix de","year":"1990","unstructured":"de Fraysseix, H., Pach, J., Pollack, R.: How to draw a planar graph on a grid. Combinatorica\u00a010, 41\u201351 (1990)","journal-title":"Combinatorica"},{"key":"19_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/3-540-46648-7_39","volume-title":"Graph Drawing","author":"C. Demetrescu","year":"1999","unstructured":"Demetrescu, C., Di Battista, G., Finocchi, I., Liotta, G., Patrignani, M., Pizzonia, M.: Infinite trees and the future. In: Kratochv\u00edl, J. (ed.) GD 1999. LNCS, vol.\u00a01731, pp. 379\u2013391. Springer, Heidelberg (1999)"},{"issue":"2","key":"19_CR7","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1109\/TVCG.2007.40","volume":"13","author":"E. Giacomo Di","year":"2007","unstructured":"Di Giacomo, E., Didimo, W., Grilli, L., Liotta, G.: Graph visualization techniques for web clustering engines. IEEE Transactions on Visualization and Computer Graphics\u00a013(2), 294\u2013304 (2007)","journal-title":"IEEE Transactions on Visualization and Computer Graphics"},{"issue":"2","key":"19_CR8","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1142\/S0218195907002276","volume":"17","author":"E. Giacomo Di","year":"2007","unstructured":"Di Giacomo, E., Liotta, G.: Simultaneous embedding of outerplanar graphs, paths, and cycles. International Journal of Computational Geometry and Applications\u00a017(2), 139\u2013160 (2007)","journal-title":"International Journal of Computational Geometry and Applications"},{"issue":"3","key":"19_CR9","doi-asserted-by":"crossref","first-page":"347","DOI":"10.7155\/jgaa.00113","volume":"9","author":"C. Erten","year":"2005","unstructured":"Erten, C., Kobourov, S.G.: Simultaneous embedding of planar graphs with few bends. Journal of Graph Algorithms and Applications\u00a09(3), 347\u2013364 (2005)","journal-title":"Journal of Graph Algorithms and Applications"},{"key":"19_CR10","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":"A. Estrella-Balderrama","year":"2007","unstructured":"Estrella-Balderrama, A., 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)"},{"doi-asserted-by":"crossref","unstructured":"Fernau, H., Kaufmann, M., Poths, M.: Comparing trees via crossing minimization. In: Proc. 25th Conf. on Foundations of Software Technology and Theoretical Computer Science, pp. 457\u2013469 (2005)","key":"19_CR11","DOI":"10.1007\/11590156_37"},{"unstructured":"Fowler, J.J., Kouborov, S.G.: Characterization of unlabeled level planar graphs. Technical Report TR06-04, Dep. of Computer Science, University of Arizona (2006)","key":"19_CR12"},{"key":"19_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/978-3-540-70904-6_12","volume-title":"Graph Drawing","author":"F. Frati","year":"2007","unstructured":"Frati, F.: Embedding graphs simultaneously with fixed edges. In: Kaufmann, M., Wagner, D. (eds.) GD 2006. LNCS, vol.\u00a04372, pp. 108\u2013113. Springer, Heidelberg (2007)"},{"issue":"3","key":"19_CR14","doi-asserted-by":"crossref","first-page":"353","DOI":"10.7155\/jgaa.00057","volume":"6","author":"C. Friedrich","year":"2002","unstructured":"Friedrich, C., Eades, P.: Graph drawing in motion. Journal of Graph Algorithms and Applications\u00a06(3), 353\u2013370 (2002)","journal-title":"Journal of Graph Algorithms and Applications"},{"key":"19_CR15","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":"19_CR16","doi-asserted-by":"publisher","first-page":"638","DOI":"10.1016\/S0169-7552(98)00054-3","volume":"30","author":"M.L. Huang","year":"1998","unstructured":"Huang, M.L., Eades, P., Cohen, R.F.: WebOFDAV-navigating and visualising the web online with animated context swapping. Computer Networks and ISDN Systems\u00a030, 638\u2013642 (1998)","journal-title":"Computer Networks and ISDN Systems"},{"issue":"2","key":"19_CR17","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1006\/jvlc.1995.1010","volume":"6","author":"K. Misue","year":"1995","unstructured":"Misue, K., Eades, P., Lai, W., Sugiyama, K.: Layout adjustment and the mental map. Journal of Visual Languages and Computing\u00a06(2), 183\u2013210 (1995)","journal-title":"Journal of Visual Languages and Computing"},{"key":"19_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/BFb0021824","volume-title":"Graph Drawing","author":"S. North","year":"1996","unstructured":"North, S.: Incremental layout in dynadag. In: Brandenburg, F.J. (ed.) GD 1995. LNCS, vol.\u00a01027, pp. 409\u2013418. Springer, Heidelberg (1996)"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-77537-9_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,28]],"date-time":"2019-02-28T21:23:45Z","timestamp":1551389025000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-77537-9_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540775362","9783540775379"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-77537-9_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}