{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T02:05:38Z","timestamp":1725761138726},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319038407"},{"type":"electronic","value":"9783319038414"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-319-03841-4_20","type":"book-chapter","created":{"date-parts":[[2013,12,2]],"date-time":"2013-12-02T05:28:55Z","timestamp":1385962135000},"page":"220-231","source":"Crossref","is-referenced-by-count":5,"title":["Simultaneous Embedding: Edge Orderings, Relative Positions, Cutvertices"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Bl\u00e4sius","sequence":"first","affiliation":[]},{"given":"Annette","family":"Karrer","sequence":"additional","affiliation":[]},{"given":"Ignaz","family":"Rutter","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"20_CR1","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1016\/j.jda.2011.12.015","volume":"14","author":"P. Angelini","year":"2012","unstructured":"Angelini, P., Di Battista, G., Frati, F., Patrignani, M., Rutter, I.: Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph. Journal of Discrete Algorithms\u00a014, 150\u2013172 (2012)","journal-title":"Journal of Discrete Algorithms"},{"unstructured":"Bl\u00e4sius, T., Kobourov, S.G., Rutter, I.: Simultaneous Embedding of Planar Graphs. In: Handbook of Graph Drawing and Visualization, pp. 349\u2013381. Chapman and Hall\/CRC (2013)","key":"20_CR2"},{"key":"20_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/978-3-642-36763-2_4","volume-title":"Graph Drawing","author":"T. Bl\u00e4sius","year":"2013","unstructured":"Bl\u00e4sius, T., Rutter, I.: Disconnectivity and relative positions in simultaneous embeddings. In: Didimo, W., Patrignani, M. (eds.) GD 2012. LNCS, vol.\u00a07704, pp. 31\u201342. Springer, Heidelberg (2013)"},{"doi-asserted-by":"crossref","unstructured":"Bl\u00e4sius, T., Rutter, I.: Simultaneous PQ-ordering with applications to constrained embedding problems. In: Proc. 24th ACM-SIAM Sympos. Discrete Algorithm, SODA 2013, pp. 1030\u20131043. ACM (2013)","key":"20_CR4","DOI":"10.1137\/1.9781611973105.74"},{"key":"20_CR5","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/S0022-0000(76)80045-1","volume":"13","author":"K.S. Booth","year":"1976","unstructured":"Booth, K.S., Lueker, G.S.: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms. Journal of Computer and System Sciences\u00a013, 335\u2013379 (1976)","journal-title":"Journal of Computer and System Sciences"},{"issue":"4","key":"20_CR6","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1007\/BF01961541","volume":"15","author":"G. Di Battista","year":"1996","unstructured":"Di Battista, G., Tamassia, R.: On-line maintenance of triconnected components with SPQR-trees. Algorithmica\u00a015(4), 302\u2013318 (1996)","journal-title":"Algorithmica"},{"key":"20_CR7","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":"20_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/3-540-44541-2_8","volume-title":"Graph Drawing","author":"C. Gutwenger","year":"2001","unstructured":"Gutwenger, C., Mutzel, P.: A linear time implementation of SPQR-trees. In: Marks, J. (ed.) GD 2000. LNCS, vol.\u00a01984, pp. 77\u201390. Springer, Heidelberg (2001)"},{"issue":"3","key":"20_CR9","doi-asserted-by":"publisher","first-page":"147","DOI":"10.7155\/jgaa.00289","volume":"17","author":"B. Haeupler","year":"2013","unstructured":"Haeupler, B., Jampani, K., Lubiw, A.: Testing simultaneous planarity when the common graph is 2-connected. J. Graph Algorithms Appl.\u00a017(3), 147\u2013171 (2013)","journal-title":"J. Graph Algorithms Appl."},{"issue":"2","key":"20_CR10","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. Journal of Graph Algorithms and Applications\u00a013(2), 205\u2013218 (2009)","journal-title":"Journal of Graph Algorithms and Applications"},{"key":"20_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/978-3-642-36763-2_15","volume-title":"Graph Drawing","author":"M. Schaefer","year":"2013","unstructured":"Schaefer, M.: Toward a theory of planarity: Hanani-tutte and planarity variants. In: Didimo, W., Patrignani, M. (eds.) GD 2012. LNCS, vol.\u00a07704, pp. 162\u2013173. Springer, Heidelberg (2013)"},{"issue":"1","key":"20_CR12","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1109\/TIT.1986.1057137","volume":"32","author":"D. Wiedemann","year":"1986","unstructured":"Wiedemann, D.: Solving sparse linear equations over finite fields. IEEE Transactions on Information Theory\u00a032(1), 54\u201362 (1986)","journal-title":"IEEE Transactions on Information Theory"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-03841-4_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,25]],"date-time":"2019-05-25T01:59:30Z","timestamp":1558749570000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-03841-4_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783319038407","9783319038414"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-03841-4_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}