{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T07:57:24Z","timestamp":1781078244574,"version":"3.54.1"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540483816","type":"print"},{"value":"9783540483823","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11917496_29","type":"book-chapter","created":{"date-parts":[[2006,10,18]],"date-time":"2006-10-18T02:16:13Z","timestamp":1161137773000},"page":"325-335","source":"Crossref","is-referenced-by-count":30,"title":["Simultaneous Graph Embeddings with Fixed Edges"],"prefix":"10.1007","author":[{"given":"Elisabeth","family":"Gassner","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michael","family":"J\u00fcnger","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Merijam","family":"Percan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Marcus","family":"Schaefer","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michael","family":"Schulz","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"29_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/978-3-540-45078-8_22","volume-title":"Algorithms and Data Structures","author":"P. Brass","year":"2003","unstructured":"Brass, 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. In: Dehne, F., Sack, J.-R., Smid, M. (eds.) WADS 2003. LNCS, vol.\u00a02748, pp. 243\u2013255. Springer, Heidelberg (2003)"},{"key":"29_CR2","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":"29_CR3","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 of Computing Systems\u00a038, 313\u2013327 (2005)","journal-title":"Theory of Computing Systems"},{"key":"29_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/978-3-540-24595-7_41","volume-title":"Graph Drawing","author":"C. Erten","year":"2004","unstructured":"Erten, C., Kobourov, S.G., Le, V., Navabi, A.: Simultaneous graph drawing: Layout algorithms and visualization schemes. In: Liotta, G. (ed.) GD 2003. LNCS, vol.\u00a02912, pp. 437\u2013449. Springer, Heidelberg (2004)"},{"key":"29_CR5","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\u2013intersecting when drawn simultaneously. In: Healy, P., Nikolov, N.S. (eds.) GD 2005. LNCS, vol.\u00a03843, pp. 201\u2013210. Springer, Heidelberg (2006)"},{"key":"29_CR6","unstructured":"Di Giacomo, E., Liotta, G.: A note on simultaneous embedding of planar graphs. In: 21st European Workshop on Comp. Geometry, pp. 207\u2013210 (2005)"},{"key":"29_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"492","DOI":"10.1007\/978-3-540-31843-9_51","volume-title":"Graph Drawing","author":"S.G. Kobourov","year":"2005","unstructured":"Kobourov, S.G., Pitta, C.: An interactive multi-user system for simultaneous graph drawing. In: Pach, J. (ed.) GD 2004. LNCS, vol.\u00a03383, pp. 492\u2013501. Springer, Heidelberg (2005)"},{"key":"29_CR8","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/0095-8956(91)90091-W","volume":"52","author":"J. Kratochv\u00edl","year":"1991","unstructured":"Kratochv\u00edl, J.: String graphs II Recognizing string graphs is NP-hard. Journal of Combinatorial Theory B\u00a052, 67\u201378 (1991)","journal-title":"Journal of Combinatorial Theory B"},{"key":"29_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/3-540-37623-2_18","volume-title":"Graph Drawing","author":"J. Kratochv\u00edl","year":"1999","unstructured":"Kratochv\u00edl, J.: Crossing number of abstract topological graphs. In: Whitesides, S.H. (ed.) GD 1998. LNCS, vol.\u00a01547, pp. 238\u2013245. Springer, Heidelberg (1999)"},{"issue":"2","key":"29_CR10","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1137\/0404022","volume":"4","author":"J. Kratochv\u00edl","year":"1991","unstructured":"Kratochv\u00edl, J., Lubiw, A., Ne\u0161et\u0159il, J.: Noncrossing subgraphs in topological layouts. SIAM Journal on Discrete Mathematics\u00a04(2), 223\u2013244 (1991)","journal-title":"SIAM Journal on Discrete Mathematics"},{"issue":"2","key":"29_CR11","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1016\/S0022-0000(03)00045-X","volume":"67","author":"M. Schaefer","year":"2003","unstructured":"Schaefer, M., Sedgwick, E., \u0160tefankovi\u010d, D.: Recognizing string graphs in NP. Journal Comput.\u00a0Syst.\u00a0Sci.\u00a067(2), 365\u2013380 (2003)","journal-title":"Journal Comput.\u00a0Syst.\u00a0Sci."}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11917496_29.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:42:32Z","timestamp":1619494952000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11917496_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540483816","9783540483823"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/11917496_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}