{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,22]],"date-time":"2025-12-22T04:40:07Z","timestamp":1766378407313,"version":"3.40.3"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030358013"},{"type":"electronic","value":"9783030358020"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-35802-0_34","type":"book-chapter","created":{"date-parts":[[2019,11,27]],"date-time":"2019-11-27T23:02:50Z","timestamp":1574895770000},"page":"447-459","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Local and Union Page Numbers"],"prefix":"10.1007","author":[{"given":"Laura","family":"Merker","sequence":"first","affiliation":[]},{"given":"Torsten","family":"Ueckerdt","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,11,28]]},"reference":[{"issue":"4","key":"34_CR1","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/BF01305230","volume":"12","author":"N Alon","year":"1992","unstructured":"Alon, N., McDiarmid, C., Reed, B.: Star arboricity. Combinatorica 12(4), 375\u2013380 (1992)","journal-title":"Combinatorica"},{"key":"34_CR2","unstructured":"Barrera-Cruz, F., Prag, T., Smith, H., Taylor, L., Trotter, W.T.. Comparing Dushnik-Miller dimension, Boolean dimension and local dimension. CoRR (2017)"},{"issue":"3","key":"34_CR3","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.C.: The book thickness of a graph. J. Comb. Theory Ser. B 27(3), 320\u2013331 (1979)","journal-title":"J. Comb. Theory Ser. B"},{"key":"34_CR4","unstructured":"Binucci, C., Da Lozzo, G., Di Giacomo, E., Didimo, W., Mchedlidze, T., Patrignani, M.: Upward book embeddings of st-graphs. CoRR, abs\/1903.07966 (2019)"},{"key":"34_CR5","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1016\/j.ejc.2017.07.009","volume":"68","author":"C Binucci","year":"2018","unstructured":"Binucci, C., Di Giacomo, E., Hossain, M.I., Liotta, G.: 1-page and 2-page drawings with bounded number of crossings per edge. Eur. J. Comb. 68, 24\u201337 (2018)","journal-title":"Eur. J. Comb."},{"issue":"5","key":"34_CR6","doi-asserted-by":"publisher","first-page":"1307","DOI":"10.1016\/j.disc.2018.02.003","volume":"341","author":"T Bl\u00e4sius","year":"2018","unstructured":"Bl\u00e4sius, T., Stumpf, P., Ueckerdt, T.: Local and union boxicity. Discrete Math. 341(5), 1307\u20131315 (2018)","journal-title":"Discrete Math."},{"key":"34_CR7","unstructured":"Bosek, B., Grytczuk, J., Trotter, W.T.: Local dimension is unbounded for planar posets. CoRR (2017)"},{"issue":"1","key":"34_CR8","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1137\/0608002","volume":"8","author":"FR Chung","year":"1987","unstructured":"Chung, F.R., Leighton, F.T., Rosenberg, A.L.: Embedding graphs in books: a layout problem with applications to VLSI design. SIAM J. Algebr. Discrete Methods 8(1), 33\u201358 (1987)","journal-title":"SIAM J. Algebr. Discrete Methods"},{"key":"34_CR9","doi-asserted-by":"crossref","unstructured":"Dujmovic, V., Wood, D.R.: On linear layouts of graphs. Discrete Math. Theor. Comput. Sci. 6(2) (2004)","DOI":"10.46298\/dmtcs.317"},{"issue":"4","key":"34_CR10","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1007\/s00454-007-1318-7","volume":"37","author":"V Dujmovi\u0107","year":"2007","unstructured":"Dujmovi\u0107, V., Wood, D.R.: Graph treewidth and geometric thickness parameters. Discrete Comput. Geom.d 37(4), 641\u2013670 (2007)","journal-title":"Discrete Comput. Geom.d"},{"issue":"1","key":"34_CR11","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. Theory Ser. B 71(1), 111\u2013120 (1997)","journal-title":"J. Comb. Theory Ser. B"},{"key":"34_CR12","unstructured":"Felsner, S., Ueckerdt, T.: A note on covering Young diagrams with applications to local dimension of posets. CoRR (2019). to appear at EUROCOMB 2019"},{"issue":"3","key":"34_CR13","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/S0166-218X(00)00178-5","volume":"109","author":"JL Ganley","year":"2001","unstructured":"Ganley, J.L., Heath, L.S.: The pagenumber of $$k$$-trees is $$O(k)$$. Discrete Appl. Math. 109(3), 215\u2013221 (2001)","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"34_CR14","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1137\/0601025","volume":"1","author":"MR Garey","year":"1980","unstructured":"Garey, M.R., Johnson, D.S., Miller, G.L., Papadimitriou, C.H.: The complexity of coloring circular arcs and chords. SIAM J. Algebr. Discrete Methods 1(2), 216\u2013227 (1980)","journal-title":"SIAM J. Algebr. Discrete Methods"},{"issue":"1","key":"34_CR15","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/0012-365X(94)00313-8","volume":"149","author":"SL Hakimi","year":"1996","unstructured":"Hakimi, S.L., Mitchem, J., Schmeichel, E.: Star arboricity of graphs. Discrete Math. 149(1), 93\u201398 (1996)","journal-title":"Discrete Math."},{"issue":"3","key":"34_CR16","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1145\/146637.146643","volume":"39","author":"LS Heath","year":"1992","unstructured":"Heath, L.S., Istrail, S.: The pagenumber of genus $$g$$ graphs is $$o(g)$$. J. ACM 39(3), 479\u2013501 (1992)","journal-title":"J. ACM"},{"key":"34_CR17","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1007\/BFb0066436","volume-title":"Graphs and Combinatorics","author":"PC Kainen","year":"1974","unstructured":"Kainen, P.C.: Some recent results in topological graph theory. In: Bari, R.A., Harary, F. (eds.) Graphs and Combinatorics, pp. 76\u2013108. Springer, Heidelberg (1974). https:\/\/doi.org\/10.1007\/BFb0066436"},{"key":"34_CR18","unstructured":"Kim, J., Martin, R.R., Masa\u0159\u00edk, T., Shull, W., Smith, H.C., Uzzell, A., Wang, Z.: On difference graphs and the local dimension of posets. CoRR abs\/1812.00832 (2018)"},{"issue":"2","key":"34_CR19","doi-asserted-by":"publisher","first-page":"745","DOI":"10.1016\/j.disc.2015.10.023","volume":"339","author":"K Knauer","year":"2016","unstructured":"Knauer, K., Ueckerdt, T.: Three ways to cover a graph. Discrete Math. 339(2), 745\u2013758 (2016)","journal-title":"Discrete Math."},{"key":"34_CR20","unstructured":"Majumder, A., Mathew, R.: Local boxicity, local dimension, and maximum degree. CoRR (2018)"},{"issue":"1","key":"34_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":"34_CR22","unstructured":"Merker, L.: Local page numbers. Bachelor\u2018s thesis, Karlsruhe Institute of Technology, Germany (2018)"},{"issue":"1","key":"34_CR23","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1112\/jlms\/s1-39.1.12","volume":"39","author":"CSJA Nash-Williams","year":"1964","unstructured":"Nash-Williams, C.S.J.A.: Decomposition of finite graphs into forests. J. Lond. Math. Soc. 39(1), 12 (1964)","journal-title":"J. Lond. Math. Soc."},{"key":"34_CR24","unstructured":"Ollmann, L.T.: On the book thicknesses of various graphs. In: Proceeedings 4th Southeastern Conference on Combinatorics, Graph Theory and Computing, vol. 8, p. 459 (1973)"},{"key":"34_CR25","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/BFb0030834","volume-title":"Computing and Combinatorics","author":"S Rengarajan","year":"1995","unstructured":"Rengarajan, S., Veni Madhavan, C.E.: Stack and queue number of 2-trees. In: Du, D.Z., Li, M. (eds.) Computing and Combinatorics, pp. 203\u2013212. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/BFb0030834"},{"key":"34_CR26","doi-asserted-by":"crossref","unstructured":"Rosenberg, A.L.: The Diogenes approach to testable fault-tolerant arrays of processors. IEEE Trans. Comput. C-32(10), 902\u2013910 (1983)","DOI":"10.1109\/TC.1983.1676134"},{"issue":"1","key":"34_CR27","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1016\/S0012-365X(02)00542-3","volume":"259","author":"M Togasaki","year":"2002","unstructured":"Togasaki, M., Yamazaki, K.: Pagenumber of pathwidth-k graphs and strong pathwidth-k graphs. Discrete Math. 259(1), 361\u2013368 (2002)","journal-title":"Discrete Math."},{"key":"34_CR28","doi-asserted-by":"publisher","first-page":"1047","DOI":"10.1016\/j.endm.2017.07.071","volume":"61","author":"WT Trotter","year":"2017","unstructured":"Trotter, W.T., Walczak, B.: Boolean dimension and local dimension. Electron. Notes Discrete Math. 61, 1047\u20131053 (2017). The European Conference on Combinatorics, Graph Theory and Applications (EUROCOMB\u201917)","journal-title":"Electron. Notes Discrete Math."},{"key":"34_CR29","unstructured":"Ueckerdt, T.: Order & geometry workshop (2016). Gu\u0142towy"},{"issue":"3","key":"34_CR30","doi-asserted-by":"publisher","first-page":"1455","DOI":"10.1137\/080714208","volume":"23","author":"J Vandenbussche","year":"2009","unstructured":"Vandenbussche, J., West, D.B., Gexin, Y.: On the pagenumber of $$k$$-trees. SIAM J. Discrete Math. 23(3), 1455\u20131464 (2009)","journal-title":"SIAM J. Discrete Math."},{"key":"34_CR31","unstructured":"Wigderson, A.: The complexity of the Hamiltonian circuit problem for maximal planar graphs. Technical report, Technical Report EECS 198, Princeton University, USA (1982)"},{"key":"34_CR32","doi-asserted-by":"crossref","unstructured":"Yannakakis, M.: Four pages are necessary and sufficient for planar graphs. In: Proceedings of the Eighteenth Annual ACM Symposium on Theory of Computing, STOC 1986, pp. 104\u2013108. ACM, New York (1986)","DOI":"10.1145\/12130.12141"},{"issue":"1","key":"34_CR33","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. 38(1), 36\u201367 (1989)","journal-title":"J. Comput. Syst. Sci."}],"container-title":["Lecture Notes in Computer Science","Graph Drawing and Network Visualization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-35802-0_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,28]],"date-time":"2023-11-28T01:05:20Z","timestamp":1701133520000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-35802-0_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030358013","9783030358020"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-35802-0_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"28 November 2019","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":"Prague","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Czech Republic","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 September 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"gd2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/kam.mff.cuni.cz\/gd2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"113","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"34","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"8","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"30% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.11","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"12.55","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}