{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T01:32:30Z","timestamp":1743125550817,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"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_39","type":"book-chapter","created":{"date-parts":[[2016,12,7]],"date-time":"2016-12-07T15:22:42Z","timestamp":1481124162000},"page":"511-518","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Stack and Queue Layouts via Layered Separators"],"prefix":"10.1007","author":[{"given":"Vida","family":"Dujmovi\u0107","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fabrizio","family":"Frati","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,12,8]]},"reference":[{"key":"39_CR1","unstructured":"Alam, M.J., Brandenburg, F.J., Kobourov, S.G.: On the book thickness of 1-planar graphs (2015). \n                      http:\/\/arxiv.org\/abs\/1510.05891"},{"key":"39_CR2","unstructured":"Bannister, M.J., Devanny, W.E., Dujmovi\u0107, V., Eppstein, D., Wood, D.R.: Track layouts, layered path decompositions, and leveled planarity (2015). \n                      http:\/\/arxiv.org\/abs\/1506.09145"},{"key":"39_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1007\/978-3-662-48350-3_12","volume-title":"Algorithms - ESA 2015","author":"MA Bekos","year":"2015","unstructured":"Bekos, M.A., Bruckdorfer, T., Kaufmann, M., Raftopoulou, C.: 1-planar graphs have constant book thickness. In: Bansal, N., Finocchi, I. (eds.) ESA 2015. LNCS, vol. 9294, pp. 130\u2013141. Springer, Heidelberg (2015). doi:\n                      10.1007\/978-3-662-48350-3_12"},{"key":"39_CR4","unstructured":"Blankenship, R.: Book embeddings of graphs. Ph.D. thesis, Department of Mathematics, Louisiana State University, USA (2003)"},{"key":"39_CR5","unstructured":"Blankenship, R., Oporowski, B.: Book embeddings of graphs and minor-closed classes. In: 32nd Southeastern International Conference on Combinatorics, Graph Theory and Computing. Department of Mathematics, Louisiana State University (2001)"},{"issue":"1","key":"39_CR6","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1006\/jagm.2001.1178","volume":"41","author":"ZZ Chen","year":"2001","unstructured":"Chen, Z.Z.: Approximation algorithms for independent sets in map graphs. J. Algorithms 41(1), 20\u201340 (2001)","journal-title":"J. Algorithms"},{"issue":"4","key":"39_CR7","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1002\/jgt.20237","volume":"55","author":"ZZ Chen","year":"2007","unstructured":"Chen, Z.Z.: New bounds on the edge number of a $$k$$-map graph. J. Graph Theory 55(4), 267\u2013290 (2007)","journal-title":"J. Graph Theory"},{"issue":"2","key":"39_CR8","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1145\/506147.506148","volume":"49","author":"ZZ Chen","year":"2002","unstructured":"Chen, Z.Z., Grigni, M., Papadimitriou, C.H.: Map graphs. J. ACM 49(2), 127\u2013138 (2002)","journal-title":"J. ACM"},{"issue":"1","key":"39_CR9","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1145\/1077464.1077468","volume":"1","author":"ED Demaine","year":"2005","unstructured":"Demaine, E.D., Fomin, F.V., Hajiaghayi, M., Thilikos, D.M.: Fixed-parameter algorithms for $$(k, r)$$-center in planar graphs and map graphs. ACM Trans. Algorithms 1(1), 33\u201347 (2005)","journal-title":"ACM Trans. Algorithms"},{"issue":"6","key":"39_CR10","doi-asserted-by":"publisher","first-page":"2243","DOI":"10.1137\/130908051","volume":"42","author":"G Di Battista","year":"2013","unstructured":"Di Battista, G., Frati, F., Pach, J.: On the queue number of planar graphs. SIAM J. Comput. 42(6), 2243\u20132285 (2013)","journal-title":"SIAM J. Comput."},{"key":"39_CR11","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.jctb.2014.07.005","volume":"110","author":"V Dujmovi\u0107","year":"2015","unstructured":"Dujmovi\u0107, V.: Graph layouts via layered separators. J. Comb. Theory Ser. B 110, 79\u201389 (2015)","journal-title":"J. Comb. Theory Ser. B"},{"key":"39_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/978-3-319-27261-0_8","volume-title":"Graph Drawing and Network Visualization","author":"V Dujmovi\u0107","year":"2015","unstructured":"Dujmovi\u0107, V., Eppstein, D., Wood, D.R.: Genus, treewidth, and local crossing number. In: Di Giacomo, E., Lubiw, A. (eds.) GD 2015. LNCS, vol. 9411, pp. 87\u201398. Springer, Heidelberg (2015). doi:\n                      10.1007\/978-3-319-27261-0_8"},{"issue":"1","key":"39_CR13","doi-asserted-by":"crossref","first-page":"P51","DOI":"10.37236\/3153","volume":"20","author":"V Dujmovi\u0107","year":"2013","unstructured":"Dujmovi\u0107, V., Joret, G., Frati, F., Wood, D.R.: Nonrepetitive colourings of planar graphs with O(log n) colours. Electron. J. Comb. 20(1), P51 (2013)","journal-title":"Electron. J. Comb."},{"issue":"3","key":"39_CR14","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1137\/S0097539702416141","volume":"34","author":"V Dujmovi\u0107","year":"2005","unstructured":"Dujmovi\u0107, V., Morin, P., Wood, D.R.: Layout of graphs with bounded tree-width. SIAM J. Comput. 34(3), 553\u2013579 (2005)","journal-title":"SIAM J. Comput."},{"key":"39_CR15","doi-asserted-by":"crossref","unstructured":"Dujmovi\u0107, V., Morin, P., Wood, D.R.: Layered separators for queue layouts, 3D graph drawing and nonrepetitive coloring. In: 54th Annual IEEE Symposium on Foundations of Computer Science, pp. 280\u2013289. IEEE Computer Society (2013)","DOI":"10.1109\/FOCS.2013.38"},{"key":"39_CR16","unstructured":"Dujmovi\u0107, V., Morin, P., Wood, D.R.: Layered separators in minor-closed families with applications (2014). \n                      http:\/\/arxiv.org\/abs\/1306.1595"},{"issue":"2","key":"39_CR17","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. 6(2), 339\u2013358 (2004)","journal-title":"Discrete Math. Theor. Comput. Sci."},{"key":"39_CR18","doi-asserted-by":"crossref","unstructured":"Fomin, F.V., Lokshtanov, D., Saurabh, S.: Bidimensionality and geometric graphs. In: Rabani, Y. (ed.) 23rd Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1563\u20131575. SIAM (2012)","DOI":"10.1137\/1.9781611973099.124"},{"issue":"2","key":"39_CR19","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1137\/0136016","volume":"36","author":"RJ Lipton","year":"1979","unstructured":"Lipton, R.J., Tarjan, R.E.: A separator theorem for planar graphs. SIAM J. Appl. Math. 36(2), 177\u2013189 (1979)","journal-title":"SIAM J. Appl. Math."},{"issue":"1","key":"39_CR20","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1006\/jagm.1994.1028","volume":"17","author":"SM Malitz","year":"1994","unstructured":"Malitz, S.M.: Genus $$g$$ graphs have pagenumber $${O}(\\sqrt{g})$$. J. Algorithms 17(1), 85\u2013109 (1994)","journal-title":"J. Algorithms"},{"issue":"1","key":"39_CR21","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1006\/jagm.1994.1027","volume":"17","author":"SM Malitz","year":"1994","unstructured":"Malitz, S.M.: Graphs with $${E}$$ edges have pagenumber $${O}(\\sqrt{E})$$. J. Algorithms 17(1), 71\u201384 (1994)","journal-title":"J. Algorithms"},{"key":"39_CR22","unstructured":"Ollmann, L.T.: On the book thicknesses of various graphs. In: Hoffman, F., Levow, R.B., Thomas, R.S.D. (eds.) 4th Southeastern Conference on Combinatorics, Graph Theory, and Computing, vol. VIII, p. 459. Congressus Numerantium (1973)"},{"issue":"3","key":"39_CR23","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/BF01215922","volume":"17","author":"J Pach","year":"1997","unstructured":"Pach, J., T\u00f3th, G.: Graphs drawn with few crossings per edge. Combinatorica 17(3), 427\u2013439 (1997)","journal-title":"Combinatorica"},{"issue":"1","key":"39_CR24","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. Sys. Sci. 38(1), 36\u201367 (1989)","journal-title":"J. Comput. Sys. Sci."}],"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_39","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,19]],"date-time":"2020-09-19T00:43:16Z","timestamp":1600476196000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-50106-2_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319501055","9783319501062"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-50106-2_39","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"}]}}