{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T17:26:05Z","timestamp":1725643565122},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642258770"},{"type":"electronic","value":"9783642258787"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"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":[[2012]]},"DOI":"10.1007\/978-3-642-25878-7_37","type":"book-chapter","created":{"date-parts":[[2011,12,14]],"date-time":"2011-12-14T21:23:04Z","timestamp":1323897784000},"page":"391-402","source":"Crossref","is-referenced-by-count":2,"title":["On the Page Number of Upward Planar Directed Acyclic Graphs"],"prefix":"10.1007","author":[{"given":"Fabrizio","family":"Frati","sequence":"first","affiliation":[]},{"given":"Radoslav","family":"Fulek","sequence":"additional","affiliation":[]},{"given":"Andres J.","family":"Ruiz-Vargas","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"37_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/3-540-62495-3_34","volume-title":"Graph Drawing","author":"M. Alzohairi","year":"1997","unstructured":"Alzohairi, M., Rival, I.: Series-Parallel Planar Ordered Sets Have Pagenumber Two. In: North, S.C. (ed.) GD 1996. LNCS, vol.\u00a01190, pp. 11\u201324. Springer, Heidelberg (1997)"},{"key":"37_CR2","doi-asserted-by":"crossref","unstructured":"Buss, J.F., Shor, P.W.: On the pagenumber of planar graphs. In: Symposium on Theory of Computing (STOC 1984), pp. 98\u2013100. ACM (1984)","DOI":"10.1145\/800057.808670"},{"key":"37_CR3","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1016\/j.endm.2007.07.072","volume":"29","author":"J. Cern\u00fd","year":"2007","unstructured":"Cern\u00fd, J.: Coloring circle graphs. Elec. Notes Discr. Math.\u00a029, 457\u2013461 (2007)","journal-title":"Elec. Notes Discr. Math."},{"key":"37_CR4","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. Alg. Discr. Meth.\u00a08, 33\u201358 (1987)","journal-title":"SIAM J. Alg. Discr. Meth."},{"key":"37_CR5","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. Comp. Sci.\u00a061, 175\u2013198 (1988)","journal-title":"Theor. Comp. Sci."},{"issue":"4","key":"37_CR6","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1007\/s00453-005-1185-7","volume":"45","author":"E. Di Giacomo","year":"2006","unstructured":"Di Giacomo, E., Didimo, W., Liotta, G., Wismath, S.K.: Book embeddability of series-parallel digraphs. Algorithmica\u00a045(4), 531\u2013547 (2006)","journal-title":"Algorithmica"},{"issue":"1","key":"37_CR7","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1006\/jctb.1997.1773","volume":"71","author":"H. Enomoto","year":"1997","unstructured":"Enomoto, H., Nakamigawa, T., Ota, K.: On the pagenumber of complete bipartite graphs. J. Comb. Th. Ser. B\u00a071(1), 111\u2013120 (1997)","journal-title":"J. Comb. Th. Ser. B"},{"issue":"3","key":"37_CR8","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/S0166-218X(00)00178-5","volume":"109","author":"J.L. Ganley","year":"2001","unstructured":"Ganley, J.L., Heath, L.S.: The pagenumber of k-trees is O(k). Discr. Appl. Math.\u00a0109(3), 215\u2013221 (2001)","journal-title":"Discr. Appl. Math."},{"key":"37_CR9","doi-asserted-by":"crossref","unstructured":"Heath, L.S.: Embedding planar graphs in seven pages. In: Foundations of Computer Science (FOCS 1984), pp. 74\u201383. IEEE (1984)","DOI":"10.1109\/SFCS.1984.715903"},{"issue":"3","key":"37_CR10","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1145\/146637.146643","volume":"39","author":"L.S. Heath","year":"1992","unstructured":"Heath, L.S., Istrail, S.: The pagenumber of genus g graphs is O(g). J. ACM\u00a039(3), 479\u2013501 (1992)","journal-title":"J. ACM"},{"issue":"3","key":"37_CR11","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. Discr. Math.\u00a05(3), 398\u2013412 (1992)","journal-title":"SIAM J. Discr. Math."},{"issue":"4","key":"37_CR12","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1137\/S0895480193252380","volume":"10","author":"L.S. Heath","year":"1997","unstructured":"Heath, L.S., Pemmaraju, S.V.: Stack and queue layouts of posets. SIAM J. Discr. Math.\u00a010(4), 599\u2013625 (1997)","journal-title":"SIAM J. Discr. Math."},{"issue":"5","key":"37_CR13","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. Computing\u00a028(5), 1588\u20131626 (1999)","journal-title":"SIAM J. Computing"},{"issue":"4","key":"37_CR14","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. Computing\u00a028(4), 1510\u20131539 (1999)","journal-title":"SIAM J. Computing"},{"key":"37_CR15","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/BF02992822","volume":"39","author":"P.C. Kainen","year":"1973","unstructured":"Kainen, P.C.: Thickness and coarseness of graphs. Abh. Math. Sem. Univ. Hamburg\u00a039, 88\u201395 (1973)","journal-title":"Abh. Math. Sem. Univ. Hamburg"},{"issue":"1-3","key":"37_CR16","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1016\/S0012-365X(96)00344-5","volume":"163","author":"A.V. Kostochka","year":"1997","unstructured":"Kostochka, A.V., Kratochv\u00edl, J.: Covering and coloring polygon-circle graphs. Discr. Math.\u00a0163(1-3), 299\u2013305 (1997)","journal-title":"Discr. Math."},{"issue":"1","key":"37_CR17","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1006\/jagm.1994.1028","volume":"17","author":"S.M. Malitz","year":"1994","unstructured":"Malitz, S.M.: Genus g graphs have pagenumber \n                    \n                      \n                    \n                    ${O}(\\sqrt g)$\n                  . J. Algorithms\u00a017(1), 85\u2013109 (1994)","journal-title":"J. Algorithms"},{"issue":"1","key":"37_CR18","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1006\/jagm.1994.1027","volume":"17","author":"S.M. Malitz","year":"1994","unstructured":"Malitz, S.M.: Graphs with e edges have pagenumber \n                    \n                      \n                    \n                    ${O}(\\sqrt e)$\n                  . J. Algorithms\u00a017(1), 71\u201384 (1994)","journal-title":"J. Algorithms"},{"key":"37_CR19","unstructured":"Ollmann, L.T.: On the book thicknesses of various graphs. In: Hoffman, F., Levow, R.B., Thomas, R.S.D. (eds.) Southeastern Conference on Combinatorics, Graph Theory and Computing. Congressus Numerantium, vol.\u00a0VIII, p. 459 (1973)"},{"key":"37_CR20","doi-asserted-by":"publisher","first-page":"902","DOI":"10.1109\/TC.1983.1676134","volume":"C-32","author":"Rosenberg","year":"1983","unstructured":"Rosenberg: The Diogenes approach to testable fault-tolerant arrays of processors. IEEE Trans. Comp.\u00a0C-32, 902\u2013910 (1983)","journal-title":"IEEE Trans. Comp."},{"issue":"2","key":"37_CR21","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1145\/321694.321704","volume":"19","author":"R.E. Tarjan","year":"1972","unstructured":"Tarjan, R.E.: Sorting using networks of queues and stacks. J. ACM\u00a019(2), 341\u2013346 (1972)","journal-title":"J. ACM"},{"issue":"1","key":"37_CR22","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. Comp. Syst. Sci.\u00a038(1), 36\u201367 (1989)","journal-title":"J. Comp. 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-25878-7_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,21]],"date-time":"2019-04-21T21:00:14Z","timestamp":1555880414000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-25878-7_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642258770","9783642258787"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-25878-7_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}