{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T02:05:30Z","timestamp":1725761130928},"publisher-location":"Cham","reference-count":25,"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_4","type":"book-chapter","created":{"date-parts":[[2013,12,2]],"date-time":"2013-12-02T05:28:55Z","timestamp":1385962135000},"page":"37-48","source":"Crossref","is-referenced-by-count":8,"title":["Strip Planarity Testing"],"prefix":"10.1007","author":[{"given":"Patrizio","family":"Angelini","sequence":"first","affiliation":[]},{"given":"Giordano","family":"Da Lozzo","sequence":"additional","affiliation":[]},{"given":"Giuseppe","family":"Di Battista","sequence":"additional","affiliation":[]},{"given":"Fabrizio","family":"Frati","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"4_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: Charikar, M. (ed.) SODA 2010, pp. 202\u2013221. ACM (2010)","DOI":"10.1137\/1.9781611973075.19"},{"issue":"1","key":"4_CR2","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/s00454-010-9302-z","volume":"45","author":"P. Angelini","year":"2011","unstructured":"Angelini, P., Frati, F., Kaufmann, M.: Straight-line rectangular drawings of clustered graphs. Discrete & Computational Geometry\u00a045(1), 88\u2013140 (2011)","journal-title":"Discrete & Computational Geometry"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"Angelini, P., Da Lozzo, G., Di Battista, G., Frati, F.: Strip planarity testing of embedded planar graphs. ArXiv e-prints 1309.0683 (September 2013)","DOI":"10.1007\/978-3-319-03841-4_4"},{"issue":"1","key":"4_CR4","doi-asserted-by":"publisher","first-page":"53","DOI":"10.7155\/jgaa.00100","volume":"9","author":"C. Bachmaier","year":"2005","unstructured":"Bachmaier, C., Brandenburg, F.J., Forster, M.: Radial level planarity testing and embedding in linear time. JGAA\u00a09(1), 53\u201397 (2005)","journal-title":"JGAA"},{"issue":"6","key":"4_CR5","doi-asserted-by":"publisher","first-page":"476","DOI":"10.1007\/BF01188716","volume":"12","author":"P. Bertolazzi","year":"1994","unstructured":"Bertolazzi, P., Di Battista, G., Liotta, G., Mannino, C.: Upward drawings of triconnected digraphs. Algorithmica\u00a012(6), 476\u2013497 (1994)","journal-title":"Algorithmica"},{"key":"4_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1007\/10692760_11","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"T.C. Biedl","year":"1998","unstructured":"Biedl, T.C., Kaufmann, M., Mutzel, P.: Drawing planar partitions II: HH-drawings. In: Hromkovi\u010d, J., S\u00fdkora, O. (eds.) WG 1998. LNCS, vol.\u00a01517, pp. 124\u2013136. Springer, Heidelberg (1998)"},{"issue":"3","key":"4_CR7","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. J. Comput. Syst. Sci.\u00a013(3), 335\u2013379 (1976)","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"4_CR8","doi-asserted-by":"publisher","first-page":"391","DOI":"10.7155\/jgaa.00115","volume":"9","author":"P.F. Cortese","year":"2005","unstructured":"Cortese, P.F., Di Battista, G., Patrignani, M., Pizzonia, M.: Clustering cycles into cycles of clusters. JGAA\u00a09(3), 391\u2013413 (2005)","journal-title":"JGAA"},{"issue":"7","key":"4_CR9","doi-asserted-by":"publisher","first-page":"1856","DOI":"10.1016\/j.disc.2007.12.090","volume":"309","author":"P.F. Cortese","year":"2009","unstructured":"Cortese, P.F., Di Battista, G., Patrignani, M., Pizzonia, M.: On embedding a cycle in a plane graph. Discrete Mathematics\u00a0309(7), 1856\u20131869 (2009)","journal-title":"Discrete Mathematics"},{"issue":"3","key":"4_CR10","doi-asserted-by":"publisher","first-page":"349","DOI":"10.7155\/jgaa.00191","volume":"13","author":"G. Di Battista","year":"2009","unstructured":"Di Battista, G., Frati, F.: Efficient c-planarity testing for embedded flat clustered graphs with small faces. JGAA\u00a013(3), 349\u2013378 (2009)","journal-title":"JGAA"},{"key":"4_CR11","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/0304-3975(88)90123-5","volume":"61","author":"G. Di Battista","year":"1988","unstructured":"Di Battista, G., Tamassia, R.: Algorithms for plane representations of acyclic digraphs. Theor. Comput. Sci.\u00a061, 175\u2013198 (1988)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"4_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00453-004-1144-8","volume":"44","author":"P. Eades","year":"2006","unstructured":"Eades, P., Feng, Q., Lin, X., Nagamochi, H.: Straight-line drawing algorithms for hierarchical graphs and clustered graphs. Algorithmica\u00a044(1), 1\u201332 (2006)","journal-title":"Algorithmica"},{"key":"4_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/978-3-642-11805-0_9","volume-title":"Graph Drawing","author":"A. Estrella-Balderrama","year":"2010","unstructured":"Estrella-Balderrama, A., Fowler, J.J., Kobourov, S.G.: On the characterization of level planar trees by minimal patterns. In: Eppstein, D., Gansner, E.R. (eds.) GD 2009. LNCS, vol.\u00a05849, pp. 69\u201380. Springer, Heidelberg (2010)"},{"key":"4_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/978-3-540-24618-3_18","volume-title":"SOFSEM 2004: Theory and Practice of Computer Science","author":"M. Forster","year":"2004","unstructured":"Forster, M., Bachmaier, C.: Clustered level planarity. In: Van Emde Boas, P., Pokorn\u00fd, J., Bielikov\u00e1, M., \u0160tuller, J. (eds.) SOFSEM 2004. LNCS, vol.\u00a02932, pp. 218\u2013228. Springer, Heidelberg (2004)"},{"key":"4_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/978-3-540-77537-9_10","volume-title":"Graph Drawing","author":"J.J. Fowler","year":"2008","unstructured":"Fowler, J.J., Kobourov, S.G.: Minimum level nonplanar patterns for trees. In: Hong, S.-H., Nishizeki, T., Quan, W. (eds.) GD 2007. LNCS, vol.\u00a04875, pp. 69\u201375. Springer, Heidelberg (2008)"},{"issue":"2","key":"4_CR16","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1137\/S0097539794277123","volume":"31","author":"A. Garg","year":"2001","unstructured":"Garg, A., Tamassia, R.: On the computational complexity of upward and rectilinear planarity testing. SIAM J. Comput.\u00a031(2), 601\u2013625 (2001)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"4_CR17","doi-asserted-by":"publisher","first-page":"73","DOI":"10.7155\/jgaa.00160","volume":"12","author":"C. Gutwenger","year":"2008","unstructured":"Gutwenger, C., Klein, K., Mutzel, P.: Planarity testing and optimal edge insertion with embedding constraints. JGAA\u00a012(1), 73\u201395 (2008)","journal-title":"JGAA"},{"issue":"1-3","key":"4_CR18","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.disc.2003.02.001","volume":"280","author":"P. Healy","year":"2004","unstructured":"Healy, P., Kuusik, A., Leipert, S.: A characterization of level planar graphs. Discrete Mathematics\u00a0280(1-3), 51\u201363 (2004)","journal-title":"Discrete Mathematics"},{"key":"4_CR19","unstructured":"Hong, S.H., Nagamochi, H.: Two-page book embedding and clustered graph planarity. Tech. Report 2009-004, Dept. of Applied Mathematics & Physics, Kyoto University (2009)"},{"issue":"4","key":"4_CR20","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1145\/321850.321852","volume":"21","author":"J.E. Hopcroft","year":"1974","unstructured":"Hopcroft, J.E., Tarjan, R.E.: Efficient planarity testing. J. ACM\u00a021(4), 549\u2013568 (1974)","journal-title":"J. ACM"},{"issue":"2","key":"4_CR21","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1137\/S0097539792235906","volume":"25","author":"M.D. Hutton","year":"1996","unstructured":"Hutton, M.D., Lubiw, A.: Upward planarity testing of single-source acyclic digraphs. SIAM J. Comput.\u00a025(2), 291\u2013311 (1996)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"4_CR22","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. Theory Appl.\u00a046(4), 466\u2013492 (2013)","journal-title":"Comput. Geom. Theory Appl."},{"issue":"3","key":"4_CR23","doi-asserted-by":"publisher","first-page":"379","DOI":"10.7155\/jgaa.00192","volume":"13","author":"E. Jel\u00ednkov\u00e1","year":"2009","unstructured":"Jel\u00ednkov\u00e1, E., K\u00e1ra, J., Kratochv\u00edl, J., Pergel, M., Such\u00fd, O., Vyskocil, T.: Clustered planarity: Small clusters in cycles and Eulerian graphs. JGAA\u00a013(3), 379\u2013422 (2009)","journal-title":"JGAA"},{"key":"4_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/3-540-37623-2_17","volume-title":"Graph Drawing","author":"M. J\u00fcnger","year":"1999","unstructured":"J\u00fcnger, M., Leipert, S., Mutzel, P.: Level planarity testing in linear time. In: Whitesides, S.H. (ed.) GD 1998. LNCS, vol.\u00a01547, pp. 224\u2013237. Springer, Heidelberg (1999)"},{"key":"4_CR25","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)"}],"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_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,25]],"date-time":"2019-05-25T01:49:47Z","timestamp":1558748987000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-03841-4_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783319038407","9783319038414"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-03841-4_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}