{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T02:05:23Z","timestamp":1725761123121},"publisher-location":"Cham","reference-count":19,"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_3","type":"book-chapter","created":{"date-parts":[[2013,12,2]],"date-time":"2013-12-02T00:28:55Z","timestamp":1385944135000},"page":"25-36","source":"Crossref","is-referenced-by-count":0,"title":["Characterizing Planarity by the Splittable Deque"],"prefix":"10.1007","author":[{"given":"Christopher","family":"Auer","sequence":"first","affiliation":[]},{"given":"Franz J.","family":"Brandenburg","sequence":"additional","affiliation":[]},{"given":"Andreas","family":"Glei\u00dfner","sequence":"additional","affiliation":[]},{"given":"Kathrin","family":"Hanauer","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"3_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1007\/978-3-642-18469-7_7","volume-title":"Graph Drawing","author":"C. Auer","year":"2011","unstructured":"Auer, C., Bachmaier, C., Brandenburg, F.J., Brunner, W., Glei\u00dfner, A.: Plane drawings of queue and deque graphs. In: Brandes, U., Cornelsen, S. (eds.) GD 2010. LNCS, vol.\u00a06502, pp. 68\u201379. Springer, Heidelberg (2011)"},{"key":"3_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/978-3-642-25870-1_5","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"C. Auer","year":"2011","unstructured":"Auer, C., Glei\u00dfner, A.: Characterizations of deque and queue graphs. In: Kolman, P., Kratochv\u00edl, J. (eds.) WG 2011. LNCS, vol.\u00a06986, pp. 35\u201346. Springer, Heidelberg (2011)"},{"key":"3_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1007\/978-3-642-36763-2_51","volume-title":"Graph Drawing","author":"C. Auer","year":"2013","unstructured":"Auer, C., Glei\u00dfner, A., Hanauer, K., Vetter, S.: Testing planarity by switching trains. In: Didimo, W., Patrignani, M. (eds.) GD 2012. LNCS, vol.\u00a07704, pp. 557\u2013558. Springer, Heidelberg (2013)"},{"issue":"3","key":"3_CR4","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1016\/0095-8956(79)90021-2","volume":"27","author":"F. Bernhart","year":"1979","unstructured":"Bernhart, F., Kainen, P.: The book thickness of a graph. J. Combin. Theory, Ser. B\u00a027(3), 320\u2013331 (1979)","journal-title":"J. Combin. Theory, Ser. B"},{"issue":"1","key":"3_CR5","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1137\/0608002","volume":"8","author":"F.R.K. Chung","year":"1987","unstructured":"Chung, F.R.K., Leighton, F.T., Rosenberg, A.L.: Embedding graphs in books: A layout problem with applications to VLSI design. SIAM J. Algebra. Discr. Meth.\u00a08(1), 33\u201358 (1987)","journal-title":"SIAM J. Algebra. Discr. Meth."},{"key":"3_CR6","first-page":"491","volume-title":"Proc. Seventh International Conference on Information Visualization, IV 2003","author":"A. Donafee","year":"2003","unstructured":"Donafee, A., Maple, C.: Planarity testing for graphs represented by a rotation scheme. In: Banissi, E., B\u00f6rner, K., Chen, C., Clapworthy, G., Maple, C., Lobben, A., Moore, C.J., Roberts, J.C., Ursyn, A., Zhang, J. (eds.) Proc. Seventh International Conference on Information Visualization, IV 2003, pp. 491\u2013497. IEEE Computer Society, Washington, DC (2003)"},{"issue":"2","key":"3_CR7","first-page":"339","volume":"6","author":"V. Dujmovi\u0107","year":"2004","unstructured":"Dujmovi\u0107, V., Wood, D.R.: On linear layouts of graphs. Discrete Math. Theor. Comput. Sci.\u00a06(2), 339\u2013358 (2004)","journal-title":"Discrete Math. Theor. Comput. Sci."},{"issue":"1","key":"3_CR8","first-page":"155","volume":"7","author":"V. Dujmovi\u0107","year":"2005","unstructured":"Dujmovi\u0107, V., Wood, D.R.: Stacks, queues and tracks: Layouts of graph subdivisions. Discrete Math. Theor. Comput. Sci.\u00a07(1), 155\u2013202 (2005)","journal-title":"Discrete Math. Theor. Comput. Sci."},{"key":"#cr-split#-3_CR9.1","doi-asserted-by":"crossref","unstructured":"de Fraysseix, H., Rosenstiehl, P.: A depth-first-search characterization of planarity. In: Graph Theory, Cambridge (1981)","DOI":"10.1016\/S0304-0208(08)73550-3"},{"key":"#cr-split#-3_CR9.2","unstructured":"Ann. Discrete Math., vol.\u00a013, pp. 75-80. North-Holland, Amsterdam (1982)"},{"issue":"3","key":"3_CR10","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1137\/0405031","volume":"5","author":"L.S. Heath","year":"1992","unstructured":"Heath, L.S., Leighton, F.T., Rosenberg, A.L.: Comparing queues and stacks as mechanisms for laying out graphs. SIAM J. Discret. Math.\u00a05(3), 398\u2013412 (1992)","journal-title":"SIAM J. Discret. Math."},{"issue":"4","key":"3_CR11","doi-asserted-by":"publisher","first-page":"1510","DOI":"10.1137\/S0097539795280287","volume":"28","author":"L.S. Heath","year":"1999","unstructured":"Heath, L.S., Pemmaraju, S.V., Trenk, A.N.: Stack and queue layouts of directed acyclic graphs: Part I. SIAM J. Comput.\u00a028(4), 1510\u20131539 (1999)","journal-title":"SIAM J. Comput."},{"issue":"5","key":"3_CR12","doi-asserted-by":"publisher","first-page":"927","DOI":"10.1137\/0221055","volume":"21","author":"L.S. Heath","year":"1992","unstructured":"Heath, L.S., Rosenberg, A.L.: Laying out graphs using queues. SIAM J. Comput.\u00a021(5), 927\u2013958 (1992)","journal-title":"SIAM J. Comput."},{"key":"3_CR13","first-page":"346","volume-title":"Proc. 11th Annual ACM Symposium on Theory of Computing, STOC 1979","author":"S.R. Kosaraju","year":"1979","unstructured":"Kosaraju, S.R.: Real-time simulation of concatenable double-ended queues by double-ended queues (preliminary version). In: Proc. 11th Annual ACM Symposium on Theory of Computing, STOC 1979, pp. 346\u2013351. ACM, New York (1979)"},{"key":"3_CR14","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1016\/0196-6774(84)90018-X","volume":"5","author":"P. Rosenstiehl","year":"1984","unstructured":"Rosenstiehl, P., Tarjan, R.E.: Gauss codes, planar hamiltonian graphs, and stack-sortable permutations. J. of Algorithms\u00a05, 375\u2013390 (1984)","journal-title":"J. of Algorithms"},{"issue":"1-2","key":"3_CR15","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. Theor. Comput. Sci.\u00a0223(1-2), 179\u2013191 (1999)","journal-title":"Theor. Comput. Sci."},{"key":"3_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1007\/3-540-36206-1_31","volume-title":"FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science","author":"D.R. Wood","year":"2002","unstructured":"Wood, D.R.: Queue layouts, tree-width, and three-dimensional graph drawing. In: Agrawal, M., Seth, A.K. (eds.) FSTTCS 2002. LNCS, vol.\u00a02556, pp. 348\u2013359. Springer, Heidelberg (2002)"},{"key":"3_CR17","first-page":"104","volume-title":"Proc. of the 18th Annual ACM Symposium on Theory of Computing, STOC 1986","author":"M. Yannakakis","year":"1986","unstructured":"Yannakakis, M.: Four pages are necessary and sufficient for planar graphs. In: Proc. of the 18th Annual ACM Symposium on Theory of Computing, STOC 1986, pp. 104\u2013108. ACM, New York (1986)"},{"issue":"1","key":"3_CR18","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1016\/0022-0000(89)90032-9","volume":"38","author":"M. Yannakakis","year":"1989","unstructured":"Yannakakis, M.: Embedding planar graphs in four pages. J. Comput. Syst. Sci.\u00a038(1), 36\u201367 (1989)","journal-title":"J. Comput. Syst. Sci."}],"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_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T21:30:58Z","timestamp":1558733458000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-03841-4_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783319038407","9783319038414"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-03841-4_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}