{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,22]],"date-time":"2025-12-22T04:34:39Z","timestamp":1766378079018,"version":"3.48.0"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030929305"},{"type":"electronic","value":"9783030929312"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[[2021]]},"DOI":"10.1007\/978-3-030-92931-2_19","type":"book-chapter","created":{"date-parts":[[2021,12,22]],"date-time":"2021-12-22T11:14:17Z","timestamp":1640171657000},"page":"257-270","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Linear Layouts of\u00a0Complete Graphs"],"prefix":"10.1007","author":[{"given":"Stefan","family":"Felsner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Laura","family":"Merker","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Torsten","family":"Ueckerdt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pavel","family":"Valtr","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,12,23]]},"reference":[{"issue":"3","key":"19_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.C.: The book thickness of a graph. J. Comb. Theory Ser. B 27(3), 320\u2013331 (1979). https:\/\/doi.org\/10.1016\/0095-8956(79)90021-2","journal-title":"J. Comb. Theory Ser. B"},{"issue":"5","key":"19_CR2","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). https:\/\/doi.org\/10.1016\/j.disc.2018.02.003","journal-title":"Discrete Math."},{"issue":"2","key":"19_CR3","doi-asserted-by":"publisher","first-page":"915","DOI":"10.1137\/20M1313684","volume":"35","author":"G Dam\u00e1sdi","year":"2021","unstructured":"Dam\u00e1sdi, G., et al.: On covering numbers, Young diagrams, and the local dimension of posets. SIAM J. Discrete Math. 35(2), 915\u2013927 (2021). https:\/\/doi.org\/10.1137\/20M1313684","journal-title":"SIAM J. Discrete Math."},{"key":"19_CR4","doi-asserted-by":"crossref","unstructured":"Dujmovi\u0107, V., Eppstein, D., Hickingbotham, R., Morin, P., Wood, D.R.: Stack-number is not bounded by queue-number. arXiv:2011.04195 (2020)","DOI":"10.1007\/s00493-021-4585-7"},{"issue":"1","key":"19_CR5","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). https:\/\/doi.org\/10.1006\/jctb.1997.1773","journal-title":"J. Comb. Theory Ser. B"},{"key":"19_CR6","unstructured":"Esperet, L., Lichev, L.: Local boxicity. arXiv:2012.04569 (2020)"},{"key":"19_CR7","doi-asserted-by":"crossref","unstructured":"Felsner, S., Merker, L., Ueckerdt, T., Valtr, P.: Linear layouts of complete graphs. arXiv:2108.05112 (2021)","DOI":"10.1007\/978-3-030-92931-2_19"},{"issue":"3","key":"19_CR8","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1137\/0405031","volume":"5","author":"LS Heath","year":"1992","unstructured":"Heath, L.S., Leighton, F., Rosenberg, A.: Comparing queues and stacks as machines for laying out graphs. SIAM J. Discrete Math. 5(3), 398\u2013412 (1992). https:\/\/doi.org\/10.1137\/0405031","journal-title":"SIAM J. Discrete Math."},{"issue":"5","key":"19_CR9","doi-asserted-by":"publisher","first-page":"927","DOI":"10.1137\/0221055","volume":"21","author":"LS Heath","year":"1992","unstructured":"Heath, L.S., Rosenberg, A.: Laying out graphs using queues. SIAM J. Comput. 21(5), 927\u2013958 (1992). https:\/\/doi.org\/10.1137\/0221055","journal-title":"SIAM J. Comput."},{"key":"19_CR10","doi-asserted-by":"publisher","first-page":"103074","DOI":"10.1016\/j.ejc.2019.103074","volume":"86","author":"J Kim","year":"2020","unstructured":"Kim, J., et al.: On difference graphs and the local dimension of posets. Eur. J. Comb. 86, 103074 (2020). https:\/\/doi.org\/10.1016\/j.ejc.2019.103074","journal-title":"Eur. J. Comb."},{"issue":"2","key":"19_CR11","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). https:\/\/doi.org\/10.1016\/j.disc.2015.10.023","journal-title":"Discrete Math."},{"key":"19_CR12","doi-asserted-by":"crossref","unstructured":"Majumder, A., Mathew, R.: Local boxicity and maximum degree. arXiv:1810.02963 (2021)","DOI":"10.1016\/j.disc.2022.113085"},{"key":"19_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1007\/978-3-030-35802-0_34","volume-title":"Graph Drawing and Network Visualization","author":"L Merker","year":"2019","unstructured":"Merker, L., Ueckerdt, T.: Local and union page numbers. In: Archambault, D., T\u00f3th, C.D. (eds.) GD 2019. LNCS, vol. 11904, pp. 447\u2013459. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-35802-0_34"},{"key":"19_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1007\/978-3-030-68766-3_3","volume-title":"Graph Drawing and Network Visualization","author":"L Merker","year":"2020","unstructured":"Merker, L., Ueckerdt, T.: The local queue number of graphs with bounded treewidth. In: GD 2020. LNCS, vol. 12590, pp. 26\u201339. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-68766-3_3"},{"issue":"4","key":"19_CR15","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1002\/jgt.3190120403","volume":"12","author":"DJ Muder","year":"1988","unstructured":"Muder, D.J., Weaver, M.L., West, D.B.: Pagenumber of complete bipartite graphs. J. Graph Theory 12(4), 469\u2013489 (1988). https:\/\/doi.org\/10.1002\/jgt.3190120403","journal-title":"J. Graph Theory"}],"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-92931-2_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,22]],"date-time":"2025-12-22T01:01:42Z","timestamp":1766365302000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-92931-2_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030929305","9783030929312"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-92931-2_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"23 December 2021","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":"T\u00fcbingen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"gd2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/algo.inf.uni-tuebingen.de\/gd2021\/","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":"74","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":"23","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":"5","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":"31% - 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.02","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":"8.6","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"}]}}