{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T02:38:28Z","timestamp":1743129508624,"version":"3.40.3"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319501055"},{"type":"electronic","value":"9783319501062"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-50106-2_41","type":"book-chapter","created":{"date-parts":[[2016,12,7]],"date-time":"2016-12-07T15:22:42Z","timestamp":1481124162000},"page":"532-545","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Simultaneous Orthogonal Planarity"],"prefix":"10.1007","author":[{"given":"Patrizio","family":"Angelini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Steven","family":"Chaplick","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sabine","family":"Cornelsen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giordano","family":"Da Lozzo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giuseppe","family":"Di Battista","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Eades","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Philipp","family":"Kindermann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jan","family":"Kratochv\u00edl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fabian","family":"Lipp","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ignaz","family":"Rutter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,12,8]]},"reference":[{"key":"41_CR1","first-page":"532","volume-title":"Lecture Notes in Computer Science","author":"Patrizio Angelini","year":"2016","unstructured":"Angelini, P., Chaplick, S., Cornelsen, S., Da Lozzo, G., Di Battista, G., Eades, P., Kindermann, P., Kratochv\u00edl, J., Lipp, F.: Simultaneous Orthogonal Planarity. ArXiv e-prints, abs\/1608.08427 (2016)"},{"key":"41_CR2","first-page":"482","volume-title":"GD 2016","author":"P Angelini","year":"2016","unstructured":"Angelini, P., Da Lozzo, G., Di Battista, G., Frati, F., Patrignani, M., Rutter, I.: Beyond level planarity. In: Hu, Y., N\u00f6llenburg, M. (eds.) GD 2016. LNCS, vol. 9801, pp. 482\u2013495. Springer, Heidelberg (2016)"},{"key":"41_CR3","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/j.tcs.2014.11.016","volume":"575","author":"P Angelini","year":"2015","unstructured":"Angelini, P., Da Lozzo, G., Neuwirth, D.: Advancements on SEFE and partitioned book embedding problems. Theoret. Comput. Sci. 575, 71\u201389 (2015)","journal-title":"Theoret. Comput. Sci."},{"key":"41_CR4","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. J. Discrete Algorithms 14, 150\u2013172 (2012)","journal-title":"J. Discrete Algorithms"},{"issue":"1","key":"41_CR5","doi-asserted-by":"publisher","first-page":"11","DOI":"10.7155\/jgaa.00282","volume":"17","author":"EN Argyriou","year":"2013","unstructured":"Argyriou, E.N., Bekos, M.A., Kaufmann, M., Symvonis, A.: Geometric RAC simultaneous drawings of graphs. J. Graph Algorithms Appl. 17(1), 11\u201334 (2013)","journal-title":"J. Graph Algorithms Appl."},{"issue":"3","key":"41_CR6","first-page":"517","volume":"10","author":"L Auslander","year":"1961","unstructured":"Auslander, L., Parter, S.V.: On embedding graphs in the sphere. J. Math. Mech. 10(3), 517\u2013523 (1961)","journal-title":"J. Math. Mech."},{"issue":"1","key":"41_CR7","doi-asserted-by":"publisher","first-page":"133","DOI":"10.7155\/jgaa.00388","volume":"20","author":"MA Bekos","year":"2016","unstructured":"Bekos, M.A., van Dijk, T.C., Kindermann, P., Wolff, A.: Simultaneous drawing of planar graphs with right-angle crossings and few bends. J. Graph Algorithms Appl. 20(1), 133\u2013158 (2016)","journal-title":"J. Graph Algorithms Appl."},{"issue":"3","key":"41_CR8","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/S0925-7721(97)00026-6","volume":"9","author":"T Biedl","year":"1998","unstructured":"Biedl, T., Kant, G.: A better heuristic for orthogonal graph drawings. Comput. Geom. 9(3), 159\u2013180 (1998)","journal-title":"Comput. Geom."},{"key":"41_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1007\/978-3-319-03841-4_20","volume-title":"Graph Drawing","author":"T Bl\u00e4sius","year":"2013","unstructured":"Bl\u00e4sius, T., Karrer, A., Rutter, I.: Simultaneous embedding: edge orderings, relative positions, cutvertices. In: Wismath, S., Wolff, A. (eds.) GD 2013. LNCS, vol. 8242, pp. 220\u2013231. Springer, Heidelberg (2013). doi:\n                      10.1007\/978-3-319-03841-4_20"},{"key":"41_CR10","unstructured":"Bl\u00e4sius, T., Karrer, A., Rutter, I.: Simultaneous embedding: Edge orderings, relative positions, cutvertices. ArXiv e-prints, abs\/1506.05715 (2015)"},{"key":"41_CR11","unstructured":"Bl\u00e4sius, T., Kobourov, S.G., Rutter, I.: Simultaneous embedding of planar graphs. In: Tamassia, R., (ed.) Handbook of Graph Drawing and Visualization. CRC Press (2013)"},{"issue":"6","key":"41_CR12","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1016\/j.comgeo.2015.02.002","volume":"48","author":"T Bl\u00e4sius","year":"2015","unstructured":"Bl\u00e4sius, T., Rutter, I.: Disconnectivity and relative positions in simultaneous embeddings. Comput. Geom. 48(6), 459\u2013478 (2015)","journal-title":"Comput. Geom."},{"issue":"2","key":"41_CR13","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1145\/2738054","volume":"12","author":"T Bl\u00e4sius","year":"2016","unstructured":"Bl\u00e4sius, T., Rutter, I.: Simultaneous PQ-ordering with applications to constrained embedding problems. ACM Trans. Algorithms 12(2), 16 (2016)","journal-title":"ACM Trans. Algorithms"},{"key":"41_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/3-540-45749-6_25","volume-title":"Algorithms \u2014 ESA 2002","author":"U Brandes","year":"2002","unstructured":"Brandes, U.: Eager st-ordering. In: M\u00f6hring, R., Raman, R. (eds.) ESA 2002. LNCS, vol. 2461, pp. 247\u2013256. Springer, Heidelberg (2002). doi:\n                      10.1007\/3-540-45749-6_25"},{"issue":"4","key":"41_CR15","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1007\/s004539900017","volume":"15","author":"G Di Battista","year":"1996","unstructured":"Di Battista, G., Tamassia, R.: On-line maintenance of triconnected components with SPQR-trees. Algorithmica 15(4), 302\u2013318 (1996)","journal-title":"Algorithmica"},{"issue":"5","key":"41_CR16","doi-asserted-by":"publisher","first-page":"956","DOI":"10.1137\/S0097539794280736","volume":"25","author":"G Di Battista","year":"1996","unstructured":"Di Battista, G., Tamassia, R.: On-line planarity testing. SIAM J. Comput. 25(5), 956\u2013997 (1996)","journal-title":"SIAM J. Comput."},{"key":"41_CR17","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. 4875, pp. 280\u2013290. Springer, Heidelberg (2008). doi:\n                      10.1007\/978-3-540-77537-9_28"},{"issue":"3","key":"41_CR18","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 Appl. 17(3), 147\u2013171 (2013)","journal-title":"J. Graph Algorithms Appl."},{"key":"41_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1007\/978-3-642-17517-6_20","volume-title":"Algorithms and Computation","author":"KR Jampani","year":"2010","unstructured":"Jampani, K.R., Lubiw, A.: Simultaneous interval graphs. In: Cheong, O., Chwa, K.-Y., Park, K. (eds.) ISAAC 2010. LNCS, vol. 6506, pp. 206\u2013217. Springer, Heidelberg (2010). doi:\n                      10.1007\/978-3-642-17517-6_20"},{"issue":"2","key":"41_CR20","doi-asserted-by":"publisher","first-page":"283","DOI":"10.7155\/jgaa.00259","volume":"16","author":"KR Jampani","year":"2012","unstructured":"Jampani, K.R., Lubiw, A.: The simultaneous representation problem for chordal, comparability and permutation graphs. J. Graph Algorithms Appl. 16(2), 283\u2013315 (2012)","journal-title":"J. Graph Algorithms Appl."},{"issue":"2","key":"41_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. J. Graph Algorithms Appl. 13(2), 205\u2013218 (2009)","journal-title":"J. Graph Algorithms Appl."},{"issue":"2","key":"41_CR22","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1145\/49097.49099","volume":"19","author":"BME Moret","year":"1988","unstructured":"Moret, B.M.E.: Planar NAE3SAT is in P. ACM SIGACT News 19(2), 51\u201354 (1988)","journal-title":"ACM SIGACT News"},{"key":"41_CR23","volume-title":"Theory of Computation","author":"BME Moret","year":"1998","unstructured":"Moret, B.M.E.: Theory of Computation. Addison-Wesley-Longman, Reading (1998)"},{"key":"41_CR24","volume-title":"Computational Complexity","author":"CH Papadimitriou","year":"2007","unstructured":"Papadimitriou, C.H.: Computational Complexity. Academic Internet Publ., London (2007)"},{"issue":"4","key":"41_CR25","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. Graph Algorithms Appl. 17(4), 367\u2013440 (2013)","journal-title":"J. Graph Algorithms Appl."},{"key":"41_CR26","doi-asserted-by":"crossref","unstructured":"Schaefer, T.J.: The complexity of satisfiability problems. In: Lipton, R.J., Burkhard, W.A., Savitch, W.J., Friedman, E.P., Aho, A.V. (eds.), STOC 1978, pp. 216\u2013226. ACM (1978)","DOI":"10.1145\/800133.804350"},{"issue":"5","key":"41_CR27","doi-asserted-by":"publisher","first-page":"694","DOI":"10.1109\/12.53581","volume":"39","author":"W Shih","year":"1990","unstructured":"Shih, W., Wu, S., Kuo, Y.: Unifying maximum cut and minimum cut of a planar graph. IEEE Trans. Comput. 39(5), 694\u2013697 (1990)","journal-title":"IEEE Trans. Comput."},{"issue":"3","key":"41_CR28","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1137\/0216030","volume":"16","author":"R Tamassia","year":"1987","unstructured":"Tamassia, R.: On embedding a graph in the grid with the minimum number of bends. SIAM J. Comput. 16(3), 421\u2013444 (1987)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Graph Drawing and Network Visualization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-50106-2_41","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,19]],"date-time":"2020-09-19T00:44:32Z","timestamp":1600476272000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-50106-2_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319501055","9783319501062"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-50106-2_41","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"8 December 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"GD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Graph Drawing and Network Visualization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Athens","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2016","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 September 2016","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 September 2016","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"gd2016","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}