{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T21:21:48Z","timestamp":1725571308979},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642175138"},{"type":"electronic","value":"9783642175145"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-17514-5_35","type":"book-chapter","created":{"date-parts":[[2010,12,3]],"date-time":"2010-12-03T20:09:23Z","timestamp":1291406963000},"page":"410-421","source":"Crossref","is-referenced-by-count":6,"title":["Testing Simultaneous Planarity When the Common Graph Is 2-Connected"],"prefix":"10.1007","author":[{"given":"Bernhard","family":"Haeupler","sequence":"first","affiliation":[]},{"given":"Krishnam Raju","family":"Jampani","sequence":"additional","affiliation":[]},{"given":"Anna","family":"Lubiw","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"35_CR1","doi-asserted-by":"crossref","unstructured":"Angelini, P., Di Battista, G., Frati, F., Patrignani, M., Rutter, I.: Testing the simultaneous embeddability of two graphs whose intersection is a biconnected graph or a tree. In: IWOCA. LNCS (2010)","DOI":"10.1007\/978-3-642-19222-7_22"},{"key":"35_CR2","doi-asserted-by":"crossref","unstructured":"Angelini, P., Geyer, M., Kaufmann, M., Neuwirth, D.: On a tree and a path with no geometric simultaneous embedding. In: CoRR, abs\/1001.0555 (2010)","DOI":"10.1007\/978-3-642-18469-7_4"},{"key":"35_CR3","unstructured":"Booth, K.: PQ Tree Algorithms. PhD thesis, University of California, Berkeley (1975)"},{"key":"35_CR4","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/S0022-0000(76)80045-1","volume":"13","author":"K. Booth","year":"1976","unstructured":"Booth, K., Lueker, G.: 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":"3","key":"35_CR5","doi-asserted-by":"publisher","first-page":"241","DOI":"10.7155\/jgaa.00091","volume":"8","author":"J. Boyer","year":"2004","unstructured":"Boyer, J., Myrvold, W.: On the cutting edge: Simplified O(n) planarity by edge addition. Journal of Graph Algorithms and Applications\u00a08(3), 241\u2013273 (2004)","journal-title":"Journal of Graph Algorithms and Applications"},{"issue":"2","key":"35_CR6","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/j.comgeo.2006.05.006","volume":"36","author":"P. Brass","year":"2007","unstructured":"Brass, P., Cenek, E., Duncan, C., Efrat, A., Erten, C., Ismailescu, D., Kobourov, S.G., Lubiw, A., Mitchell, J.: On simultaneous planar graph embeddings. Computational Geometry: Theory and Applications\u00a036(2), 117\u2013130 (2007)","journal-title":"Computational Geometry: Theory and Applications"},{"key":"35_CR7","doi-asserted-by":"publisher","DOI":"10.1002\/9781118033142","volume-title":"Combinatorial Optimization","author":"W.J. Cook","year":"1997","unstructured":"Cook, W.J., Cunningham, W.H., Pulleyblank, W.R., Schrijver, A.: Combinatorial Optimization. Wiley Interscience, Hoboken (1997)"},{"issue":"2","key":"35_CR8","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1142\/S0218195907002276","volume":"17","author":"G. DiGiacomo","year":"2007","unstructured":"DiGiacomo, G., 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":"35_CR9","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. Journal of Graph Algorithms and Applications\u00a09(3), 347\u2013364 (2005)","journal-title":"Journal of Graph Algorithms and Applications"},{"key":"35_CR10","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., Junger, 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":"3","key":"35_CR11","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1016\/0304-3975(76)90086-4","volume":"2","author":"S. Even","year":"1976","unstructured":"Even, S., Tarjan, R.: Computing an st-Numbering. Theor. Comput. Sci.\u00a02(3), 339\u2013344 (1976)","journal-title":"Theor. Comput. Sci."},{"key":"35_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-00219-9_16","volume-title":"Graph Drawing","author":"J. Fowler","year":"2009","unstructured":"Fowler, J., Gutwenger, C., Junger, M., Mutzel, P., Schulz, M.: An SPQR-tree approach to decide special cases of simultaneous embedding with fixed edges. In: Tollis, I.G., Patrignani, M. (eds.) GD 2008. LNCS, vol.\u00a05417, pp. 1\u201312. Springer, Heidelberg (2009)"},{"key":"35_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/978-3-540-92248-3_14","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"J. Fowler","year":"2008","unstructured":"Fowler, J., J\u00fcnger, M., Kobourov, S.G., Schulz, M.: Characterizations of restricted pairs of planar graphs allowing simultaneous embedding with fixed edges. In: Broersma, H., Erlebach, T., Friedetzky, T., Paulusma, D. (eds.) WG 2008. LNCS, vol.\u00a05344, pp. 146\u2013158. Springer, Heidelberg (2008)"},{"key":"35_CR14","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":"35_CR15","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., Junger, 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":"35_CR16","doi-asserted-by":"crossref","unstructured":"Haeupler, B., Jampani, K.R., Lubiw, A.: Testing simultaneous planarity when the common graph is 2-connected (2010)","DOI":"10.1007\/978-3-642-17514-5_35"},{"key":"35_CR17","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/j.endm.2008.06.029","volume":"31","author":"B. Haeupler","year":"2008","unstructured":"Haeupler, B., Tarjan, R.E.: Planarity algorithms via PQ-trees (extended abstract). Electronic Notes in Discrete Mathematics\u00a031, 143\u2013149 (2008)","journal-title":"Electronic Notes in Discrete Mathematics"},{"key":"35_CR18","series-title":"LNCS","first-page":"387","volume-title":"WADS","author":"K.R. Jampani","year":"2009","unstructured":"Jampani, K.R., Lubiw, A.: The simultaneous representation problem for chordal, comparability and permutation graphs. In: WADS. LNCS, vol.\u00a05664, pp. 387\u2013398. Springer, Heidelberg (2009)"},{"key":"35_CR19","doi-asserted-by":"crossref","unstructured":"Jampani, K.R., Lubiw, A.: Simultaneous interval graphs (2010) (submitted)","DOI":"10.1007\/978-3-642-17517-6_20"},{"issue":"1","key":"35_CR20","doi-asserted-by":"publisher","first-page":"67","DOI":"10.7155\/jgaa.00045","volume":"6","author":"M. J\u00fcnger","year":"2002","unstructured":"J\u00fcnger, M., Leipert, S.: Level planar embedding in linear time. J. Graph Algorithms Appl.\u00a06(1), 67\u2013113 (2002)","journal-title":"J. Graph Algorithms Appl."},{"issue":"2","key":"35_CR21","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":"35_CR22","unstructured":"Lempel, A., Even, S., Cederbaum, I.: An algorithm for planarity testing of graphs. In: Rosenstiehl, P. (ed.) Theory of Graphs: International Symposium, pp. 215\u2013232 (1967)"},{"key":"35_CR23","doi-asserted-by":"crossref","DOI":"10.56021\/9780801866890","volume-title":"Graphs on Surfaces","author":"B. Mohar","year":"2001","unstructured":"Mohar, B., Thomassen, C.: Graphs on Surfaces. Johns Hopkins University Press, Baltimore (2001)"},{"key":"35_CR24","volume-title":"Planar graphs: theory and algorithms","author":"T. Nishizeki","year":"1988","unstructured":"Nishizeki, T., Chiba, N.: Planar graphs: theory and algorithms. Elsevier, Amsterdam (1988)"},{"key":"35_CR25","doi-asserted-by":"publisher","DOI":"10.1142\/5648","volume-title":"Planar graph drawing","author":"T. Nishizeki","year":"2004","unstructured":"Nishizeki, T., Rahman, M.S.: Planar graph drawing. World Scientific, Singapore (2004)"},{"issue":"4","key":"35_CR26","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 and Combinatorics\u00a017(4), 717\u2013728 (2001)","journal-title":"Graphs and Combinatorics"},{"issue":"1-2","key":"35_CR27","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/S0304-3975(98)00120-0","volume":"223","author":"W.K. Shih","year":"1999","unstructured":"Shih, W.K., Hsu, W.-L.: A new planarity test. Theoretical Computer Science\u00a0223(1-2), 179\u2013191 (1999)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-17514-5_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,4]],"date-time":"2023-06-04T10:46:00Z","timestamp":1685875560000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17514-5_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642175138","9783642175145"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17514-5_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}