{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T23:11:15Z","timestamp":1725577875797},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642184680"},{"type":"electronic","value":"9783642184697"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-18469-7_7","type":"book-chapter","created":{"date-parts":[[2011,2,10]],"date-time":"2011-02-10T05:30:40Z","timestamp":1297315840000},"page":"68-79","source":"Crossref","is-referenced-by-count":5,"title":["Plane Drawings of Queue and Deque Graphs"],"prefix":"10.1007","author":[{"given":"Christopher","family":"Auer","sequence":"first","affiliation":[]},{"given":"Christian","family":"Bachmaier","sequence":"additional","affiliation":[]},{"given":"Franz Josef","family":"Brandenburg","sequence":"additional","affiliation":[]},{"given":"Wolfgang","family":"Brunner","sequence":"additional","affiliation":[]},{"given":"Andreas","family":"Glei\u00dfner","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"7_CR1","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":"7_CR2","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."},{"issue":"2","key":"7_CR3","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1016\/j.jda.2006.05.001","volume":"5","author":"S. Cornelsen","year":"2007","unstructured":"Cornelsen, S., Di Stefano, G.: Track assignment. J. Discrete Algorithms\u00a05(2), 250\u2013261 (2007)","journal-title":"J. Discrete Algorithms"},{"issue":"2","key":"7_CR4","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."},{"key":"7_CR5","doi-asserted-by":"crossref","first-page":"155","DOI":"10.46298\/dmtcs.346","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, 155\u2013202 (2005)","journal-title":"Discrete Math. Theor. Comput. Sci."},{"issue":"3","key":"7_CR6","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":"5","key":"7_CR7","doi-asserted-by":"publisher","first-page":"1588","DOI":"10.1137\/S0097539795291550","volume":"28","author":"L.S. Heath","year":"1999","unstructured":"Heath, L.S., Pemmaraju, S.V.: Stack and queue layouts of directed acyclic graphs: Part II. SIAM J. Comput.\u00a028(5), 1588\u20131626 (1999)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"7_CR8","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":"7_CR9","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":"7_CR10","volume-title":"The Art of Computer Programming","author":"D.E. Knuth","year":"1968","unstructured":"Knuth, D.E.: The Art of Computer Programming, 1st edn., vol.\u00a01. Addison-Wesley, Reading (1968)","edition":"1"},{"key":"7_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/3-540-17218-1_57","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"M. Wiegers","year":"1987","unstructured":"Wiegers, M.: Recognizing outerplanar graphs in linear time. In: Tinhofer, G., Schmidt, G. (eds.) WG 1986. LNCS, vol.\u00a0246, pp. 165\u2013176. Springer, Heidelberg (1987)"},{"key":"7_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1007\/3-540-45848-4_25","volume-title":"Graph Drawing","author":"D.R. Wood","year":"2002","unstructured":"Wood, D.R.: Bounded degree book embeddings and three-dimensional orthogonal graph drawing. In: Mutzel, P., J\u00fcnger, M., Leipert, S. (eds.) GD 2001. LNCS, vol.\u00a02265, pp. 312\u2013327. Springer, Heidelberg (2002)"},{"key":"7_CR13","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. (eds.) FSTTCS 2002. LNCS, vol.\u00a02556, pp. 348\u2013359. Springer, Heidelberg (2002)"},{"issue":"1","key":"7_CR14","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1016\/0022-0000(89)90032-9","volume":"38","author":"M. Yannakais","year":"1989","unstructured":"Yannakais, 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-642-18469-7_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,18]],"date-time":"2021-11-18T19:55:29Z","timestamp":1637265329000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-18469-7_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642184680","9783642184697"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-18469-7_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}