{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,2]],"date-time":"2026-02-02T22:14:21Z","timestamp":1770070461099,"version":"3.49.0"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319125671","type":"print"},{"value":"9783319125688","type":"electronic"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-45803-7_3","type":"book-chapter","created":{"date-parts":[[2014,12,1]],"date-time":"2014-12-01T11:12:53Z","timestamp":1417432373000},"page":"25-39","source":"Crossref","is-referenced-by-count":3,"title":["Drawing Partially Embedded and Simultaneously Planar Graphs"],"prefix":"10.1007","author":[{"given":"Timothy M.","family":"Chan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fabrizio","family":"Frati","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carsten","family":"Gutwenger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anna","family":"Lubiw","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Petra","family":"Mutzel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marcus","family":"Schaefer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"Angelini, P., Di Battista, G., Frati, F., Jel\u00ednek, V., Kratochv\u00edl, J., Patrignani, M., Rutter, I.: Testing planarity of partially embedded graphs. In: Proc. Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2010, pp. 202\u2013221. SIAM (2010)","DOI":"10.1137\/1.9781611973075.19"},{"issue":"2-3","key":"3_CR2","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/j.tcs.2008.08.004","volume":"408","author":"M. Badent","year":"2008","unstructured":"Badent, M., Di Giacomo, E., Liotta, G.: Drawing colored graphs on colored points. Theor. Comput. Sci.\u00a0408(2-3), 129\u2013142 (2008)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"3_CR3","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/0020-0190(92)90022-N","volume":"43","author":"M. Bern","year":"1992","unstructured":"Bern, M., Gilbert, J.R.: Drawing the planar dual. Inform. Process. Lett.\u00a043(1), 7\u201313 (1992)","journal-title":"Inform. Process. Lett."},{"key":"3_CR4","unstructured":"Bl\u00e4sius, T., Kobourov, S.G., Rutter, I.: Simultaneous embeddings of planar graphs. In: Tamassia, R. (ed.) Handbook of Graph Drawing and Visualization. Discrete Mathematics and Its Applications, ch.\u00a011, pp. 349\u2013382. Chapman and Hall\/CRC (2013)"},{"issue":"5","key":"3_CR5","doi-asserted-by":"publisher","first-page":"1803","DOI":"10.1137\/120872310","volume":"42","author":"S. Cabello","year":"2013","unstructured":"Cabello, S., Mohar, B.: Adding one edge to planar graphs makes crossing number and 1-planarity hard. SIAM Journal on Computing\u00a042(5), 1803\u20131829 (2013)","journal-title":"SIAM Journal on Computing"},{"key":"3_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1007\/978-3-319-03841-4_33","volume-title":"Graph Drawing","author":"T.M. Chan","year":"2013","unstructured":"Chan, T.M., Hoffmann, H.-F., Kiazyk, S., Lubiw, A.: Minimum length embedding of planar graphs at fixed vertex locations. In: Wismath, S., Wolff, A. (eds.) GD 2013. LNCS, vol.\u00a08242, pp. 376\u2013387. Springer, Heidelberg (2013)"},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"Chimani, M., J\u00fcnger, M., Schulz, M.: Crossing minimization meets simultaneous drawing. In: PacificVis, pp. 33\u201340. IEEE (2008)","DOI":"10.1109\/PACIFICVIS.2008.4475456"},{"issue":"3","key":"3_CR8","doi-asserted-by":"publisher","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. J. Graph Algorithms and Appl.\u00a09(3), 347\u2013364 (2005)","journal-title":"J. Graph Algorithms and Appl."},{"key":"3_CR9","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)"},{"issue":"8","key":"3_CR10","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1016\/j.comgeo.2011.02.002","volume":"44","author":"J.J. Fowler","year":"2011","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. Comput. Geom.\u00a044(8), 385\u2013398 (2011)","journal-title":"Comput. Geom."},{"key":"3_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":"3_CR12","series-title":"LNCS","first-page":"40","volume-title":"GD 2014","author":"L. Grilli","year":"2014","unstructured":"Grilli, L., Hong, S.-H., Kratochv\u00edl, J., Rutter, I.: Drawing simultaneously embedded graphs with few bends. In: Duncan, C., Symvonis, A. (eds.) GD 2014. LNCS, vol.\u00a08871, pp. 40\u201351. Springer, Heidelberg (2014)"},{"issue":"3","key":"3_CR13","doi-asserted-by":"publisher","first-page":"147","DOI":"10.7155\/jgaa.00289","volume":"17","author":"B. Haeupler","year":"2013","unstructured":"Haeupler, B., Jampani, K.R., Lubiw, A.: Testing simultaneous planarity when the common graph is 2-connected. J. Graph Algorithms and Appl.\u00a017(3), 147\u2013171 (2013)","journal-title":"J. Graph Algorithms and Appl."},{"issue":"4","key":"3_CR14","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1016\/j.jctb.2005.09.009","volume":"96","author":"P. Hlin\u011bn\u00fd","year":"2006","unstructured":"Hlin\u011bn\u00fd, P.: Crossing number is hard for cubic graphs. J. Combin. Theory Ser. B\u00a096(4), 455\u2013471 (2006)","journal-title":"J. Combin. Theory Ser. B"},{"issue":"4","key":"3_CR15","doi-asserted-by":"publisher","first-page":"466","DOI":"10.1016\/j.comgeo.2012.07.005","volume":"46","author":"V. Jel\u00ednek","year":"2013","unstructured":"Jel\u00ednek, V., Kratochv\u00edl, J., Rutter, I.: A Kuratowski-type theorem for planarity of partially embedded graphs. Comput. Geom.\u00a046(4), 466\u2013492 (2013)","journal-title":"Comput. Geom."},{"issue":"2","key":"3_CR16","doi-asserted-by":"publisher","first-page":"205","DOI":"10.7155\/jgaa.00184","volume":"13","author":"M. J\u00fcnger","year":"2009","unstructured":"J\u00fcnger, M., Schulz, M.: Intersection graphs in simultaneous embedding with fixed edges. J. Graph Algorithms Appl.\u00a013(2), 205\u2013218 (2009)","journal-title":"J. Graph Algorithms Appl."},{"issue":"1","key":"3_CR17","doi-asserted-by":"publisher","first-page":"115","DOI":"10.7155\/jgaa.00046","volume":"6","author":"M. Kaufmann","year":"2002","unstructured":"Kaufmann, M., Wiese, R.: Embedding vertices at points: Few bends suffice for planar graphs. J. Graph Algorithms and Appl.\u00a06(1), 115\u2013129 (2002)","journal-title":"J. Graph Algorithms and Appl."},{"issue":"1","key":"3_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0095-8956(91)90050-T","volume":"53","author":"J. Kratochv\u00edl","year":"1991","unstructured":"Kratochv\u00edl, J., Matou\u0161ek, J.: String graphs requiring exponential representations. J. Comb. Theory, Ser. B\u00a053(1), 1\u20134 (1991)","journal-title":"J. Comb. Theory, Ser. B"},{"key":"3_CR19","volume-title":"Art Gallery Theorems and Algorithms","author":"J. O\u2019Rourke","year":"1987","unstructured":"O\u2019Rourke, J.: Art Gallery Theorems and Algorithms. Oxford University Press, NY (1987)"},{"issue":"4","key":"3_CR20","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1007\/PL00007258","volume":"17","author":"J. Pach","year":"2001","unstructured":"Pach, J., Wenger, R.: Embedding planar graphs at fixed vertex locations. Graphs Combin.\u00a017(4), 717\u2013728 (2001)","journal-title":"Graphs Combin."},{"issue":"5","key":"3_CR21","doi-asserted-by":"publisher","first-page":"1061","DOI":"10.1142\/S0129054106004261","volume":"17","author":"M. Patrignani","year":"2006","unstructured":"Patrignani, M.: On extending a partial straight-line drawing. Internat. J. Found. Comput. Sci.\u00a017(5), 1061\u20131069 (2006)","journal-title":"Internat. J. Found. Comput. Sci."},{"key":"3_CR22","first-page":"1","volume":"20","author":"M. Schaefer","year":"2013","unstructured":"Schaefer, M.: The graph crossing number and its variants: A survey. The Electronic Journal of Combinatorics\u00a020, 1\u201390 (2013), Dynamic Survey, #DS21.","journal-title":"The Electronic Journal of Combinatorics"},{"issue":"4","key":"3_CR23","doi-asserted-by":"publisher","first-page":"367","DOI":"10.7155\/jgaa.00298","volume":"17","author":"M. Schaefer","year":"2013","unstructured":"Schaefer, M.: Toward a theory of planarity: Hanani-Tutte and planarity variants. J. of Graph Algorthims and Appl.\u00a017(4), 367\u2013440 (2013)","journal-title":"J. of Graph Algorthims and Appl."}],"container-title":["Lecture Notes in Computer Science","Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-45803-7_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T21:01:11Z","timestamp":1559077271000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-45803-7_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319125671","9783319125688"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-45803-7_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}