{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T08:23:43Z","timestamp":1725524623588},"publisher-location":"Berlin, Heidelberg","reference-count":14,"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_16","type":"book-chapter","created":{"date-parts":[[2009,2,4]],"date-time":"2009-02-04T08:03:51Z","timestamp":1233734631000},"page":"157-168","source":"Crossref","is-referenced-by-count":5,"title":["An\u00a0SPQR-Tree Approach\u00a0to\u00a0Decide\u00a0Special\u00a0Cases of Simultaneous Embedding with Fixed Edges"],"prefix":"10.1007","author":[{"given":"J. Joseph","family":"Fowler","sequence":"first","affiliation":[]},{"given":"Carsten","family":"Gutwenger","sequence":"additional","affiliation":[]},{"given":"Michael","family":"J\u00fcnger","sequence":"additional","affiliation":[]},{"given":"Petra","family":"Mutzel","sequence":"additional","affiliation":[]},{"given":"Michael","family":"Schulz","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"16_CR1","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(1), 41\u201351 (1990)","journal-title":"Combinatorica"},{"issue":"11","key":"16_CR2","first-page":"1065","volume":"32","author":"G. Di Battista","year":"2002","unstructured":"Di Battista, G., Didimo, W., Patrignani, M., Pizzonia, M.: Drawing database schemas. Software: Practice and Experience\u00a032(11), 1065\u20131098 (2002)","journal-title":"Software: Practice and Experience"},{"issue":"5","key":"16_CR3","doi-asserted-by":"publisher","first-page":"956","DOI":"10.1137\/S0097539794280736","volume":"25","author":"G. Battista Di","year":"1996","unstructured":"Di Battista, G., Tamassia, R.: On-line planarity testing. SIAM Journal on Computing\u00a025(5), 956\u2013997 (1996)","journal-title":"SIAM Journal on Computing"},{"key":"16_CR4","unstructured":"Di Giacomo, E., Liotta, G.: A note on simultaneous embedding of planar graphs. In: EWCG 2005, pp. 207\u2013210 (2005)"},{"issue":"1","key":"16_CR5","doi-asserted-by":"publisher","first-page":"27","DOI":"10.7155\/jgaa.00044","volume":"6","author":"C. Dornheim","year":"2002","unstructured":"Dornheim, C.: Planar graphs with topological constraints. Journal on Graph Algorithms and Applications\u00a06(1), 27\u201366 (2002)","journal-title":"Journal on Graph Algorithms and Applications"},{"key":"16_CR6","unstructured":"Eiglsperger, M., F\u00f6\u00dfmeier, U., Kaufmann, M.: Orthogonal graph drawing with constraints. In: Proc. SODA 2000, pp. 3\u201311 (2000)"},{"key":"16_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/978-3-540-31843-9_21","volume-title":"Graph Drawing","author":"C. Erten","year":"2005","unstructured":"Erten, C., Kobourov, S.G.: Simultaneous embedding of planar graphs with few bends. In: Pach, J. (ed.) GD 2004. LNCS, vol.\u00a03383, pp. 195\u2013205. Springer, Heidelberg (2005)"},{"key":"16_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/978-3-540-77537-9_28","volume-title":"Graph Drawing","author":"A. Estrella-Balderrama","year":"2008","unstructured":"Estrella-Balderrama, A., Gassner, E., J\u00fcnger, M., Percan, M., Schaefer, M., Schulz, M.: Simultaneous geometric graph embeddings. In: Hong, S.-H., Nishizeki, T., Quan, W. (eds.) GD 2007. LNCS, vol.\u00a04875, pp. 280\u2013290. Springer, Heidelberg (2008)"},{"key":"16_CR9","doi-asserted-by":"crossref","unstructured":"Fowler, J.J., J\u00fcnger, M., Kobourov, S.G., Schulz, M.: Characterizations of restricted pairs of planar graphs allowing simultaneous embedding with fixed edges. In: WG 2008 (to appear)","DOI":"10.1007\/978-3-540-92248-3_14"},{"key":"16_CR10","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)"},{"key":"16_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/11917496_29","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"E. Gassner","year":"2006","unstructured":"Gassner, E., J\u00fcnger, M., Percan, M., Schaefer, M., Schulz, M.: Simultaneous graph embeddings with fixed edges. In: Fomin, F.V. (ed.) WG 2006. LNCS, vol.\u00a04271, pp. 325\u2013335. Springer, Heidelberg (2006)"},{"key":"16_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/978-3-540-70904-6_14","volume-title":"Graph Drawing","author":"C. Gutwenger","year":"2007","unstructured":"Gutwenger, C., Klein, K., Mutzel, P.: Planarity testing and optimal edge insertion with embedding constraints. In: Kaufmann, M., Wagner, D. (eds.) GD 2006. LNCS, vol.\u00a04372, pp. 126\u2013137. Springer, Heidelberg (2007)"},{"issue":"6","key":"16_CR13","doi-asserted-by":"publisher","first-page":"2215","DOI":"10.1137\/S0097539795289604","volume":"28","author":"J. Hershberger","year":"1999","unstructured":"Hershberger, J., Suri, S.: An optimal algorithm for Euclidean shortest paths in the plane. SIAM Journal on Computing\u00a028(6), 2215\u20132256 (1999)","journal-title":"SIAM Journal on Computing"},{"key":"16_CR14","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1090\/S0002-9947-1905-1500697-4","volume":"6","author":"O. Veblen","year":"1905","unstructured":"Veblen, O.: Theory on plane curves in non-metrical analysis situs. Transactions of the American Mathematical Society\u00a06, 83\u201398 (1905)","journal-title":"Transactions of the American Mathematical Society"}],"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_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,17]],"date-time":"2019-05-17T16:06:39Z","timestamp":1558109199000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-00219-9_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642002182","9783642002199"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-00219-9_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}