{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T02:56:18Z","timestamp":1742957778257,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030687656"},{"type":"electronic","value":"9783030687663"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-68766-3_26","type":"book-chapter","created":{"date-parts":[[2021,2,14]],"date-time":"2021-02-14T09:11:53Z","timestamp":1613293913000},"page":"333-340","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Drawing Shortest Paths in Geodetic Graphs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1688-394X","authenticated-orcid":false,"given":"Sabine","family":"Cornelsen","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7203-0669","authenticated-orcid":false,"given":"Maximilian","family":"Pfister","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1441-4189","authenticated-orcid":false,"given":"Henry","family":"F\u00f6rster","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2565-090X","authenticated-orcid":false,"given":"Martin","family":"Gronemann","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5307-7106","authenticated-orcid":false,"given":"Michael","family":"Hoffmann","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0477-2724","authenticated-orcid":false,"given":"Stephen","family":"Kobourov","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4061-8844","authenticated-orcid":false,"given":"Thomas","family":"Schneck","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,2,14]]},"reference":[{"key":"26_CR1","doi-asserted-by":"publisher","unstructured":"Bodwin, G.: On the structure of unique shortest paths in graphs. In: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2019), pp. 2071\u20132089. SIAM (2019). https:\/\/doi.org\/10.1137\/1.9781611975482.125","DOI":"10.1137\/1.9781611975482.125"},{"key":"26_CR2","unstructured":"Frasser, C.E., Vostrov, G.N.: Geodetic graphs homeomorphic to a given geodetic graph. CoRR abs\/1611.01873 (2016). http:\/\/arxiv.org\/abs\/1611.01873"},{"issue":"4","key":"26_CR3","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1147\/rd.45.0497","volume":"5","author":"AJ Hoffman","year":"1960","unstructured":"Hoffman, A.J., Singleton, R.R.: Moore graphs with diameter 2 and 3. IBM J. Res. Dev. 5(4), 497\u2013504 (1960). https:\/\/doi.org\/10.1147\/rd.45.0497","journal-title":"IBM J. Res. Dev."},{"key":"26_CR4","volume-title":"Projective Planes, Graduate Texts in Mathematics","author":"DR Hughes","year":"1973","unstructured":"Hughes, D.R., Piper, F.C.: Projective Planes, Graduate Texts in Mathematics, vol. 6. Springer, New York (1973)"},{"key":"26_CR5","doi-asserted-by":"publisher","first-page":"50","DOI":"10.4064\/cm-3-1-50-57","volume":"3","author":"T K\u0151v\u00e1ri","year":"1954","unstructured":"K\u0151v\u00e1ri, T., S\u00f3s, V.T., Tur\u00e1n, P.: On a problem of K. Zarankiewicz. Colloq. Math. 3, 50\u201357 (1954). https:\/\/doi.org\/10.4064\/cm-3-1-50-57","journal-title":"Zarankiewicz. Colloq. Math."},{"key":"26_CR6","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1002\/net.3230140304","volume":"14","author":"DT Lee","year":"1984","unstructured":"Lee, D.T., Preparata, F.P.: Euclidean shortest paths in the presence of rectilinear barriers. Networks 14, 393\u2013410 (1984). https:\/\/doi.org\/10.1002\/net.3230140304","journal-title":"Networks"},{"key":"26_CR7","doi-asserted-by":"publisher","unstructured":"Ore, \u00d8.: Theory of Graphs, Colloquium Publications, vol. 38. American Mathematical Society, Providence, RI (1962). https:\/\/doi.org\/10.1090\/coll\/038","DOI":"10.1090\/coll\/038"},{"issue":"2","key":"26_CR8","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1006\/jctb.2000.1978","volume":"80","author":"J Pach","year":"2000","unstructured":"Pach, J., T\u00f3th, G.: Which crossing number is it anyway? J. Combin. Theory Ser. B 80(2), 225\u2013246 (2000). https:\/\/doi.org\/10.1006\/jctb.2000.1978","journal-title":"J. Combin. Theory Ser. B"},{"issue":"2","key":"26_CR9","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/0095-8956(82)90063-6","volume":"33","author":"KR Parthasarathy","year":"1982","unstructured":"Parthasarathy, K.R., Srinivasan, N.: Some general constructions of geodetic blocks. J. Combin. Theory Ser. B 33(2), 121\u2013136 (1982). https:\/\/doi.org\/10.1016\/0095-8956(82)90063-6","journal-title":"J. Combin. Theory Ser. B"},{"issue":"1","key":"26_CR10","first-page":"65","volume":"27","author":"J Plesn\u00edk","year":"1977","unstructured":"Plesn\u00edk, J.: Two constructions of geodetic graphs. Math. Slovaca 27(1), 65\u201371 (1977). https:\/\/dml.cz\/handle\/10338.dmlcz\/136134","journal-title":"Math. Slovaca"},{"issue":"3","key":"26_CR11","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1016\/0095-8956(84)90034-0","volume":"36","author":"J Plesn\u00edk","year":"1984","unstructured":"Plesn\u00edk, J.: A construction of geodetic graphs based on pulling subgraphs homeomorphic to complete graphs. J. Combin. Theory Ser. B 36(3), 284\u2013297 (1984). https:\/\/doi.org\/10.1016\/0095-8956(84)90034-0","journal-title":"J. Combin. Theory Ser. B"},{"issue":"2","key":"26_CR12","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1016\/0095-8956(86)90045-6","volume":"41","author":"R Scapellato","year":"1986","unstructured":"Scapellato, R.: Geodetic graphs of diameter two and some related structures. J. Combin. Theory Ser. B 41(2), 218\u2013229 (1986). https:\/\/doi.org\/10.1016\/0095-8956(86)90045-6","journal-title":"J. Combin. Theory Ser. B"},{"issue":"1","key":"26_CR13","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1111\/j.1749-6632.1979.tb32829.x","volume":"319","author":"JG Stemple","year":"1979","unstructured":"Stemple, J.G.: Geodetic graphs homeomorphic to a complete graph. Ann. N. Y. Acad. Sci. 319(1), 512\u2013517 (1979). https:\/\/doi.org\/10.1111\/j.1749-6632.1979.tb32829.x","journal-title":"Ann. N. Y. Acad. Sci."},{"issue":"2","key":"26_CR14","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/S0021-9800(68)80035-3","volume":"4","author":"JG Stemple","year":"1968","unstructured":"Stemple, J.G., Watkins, M.E.: On planar geodetic graphs. J. Comb. Theory Ser. B 4(2), 101\u2013117 (1968). https:\/\/doi.org\/10.1016\/S0021-9800(68)80035-3","journal-title":"J. Comb. Theory Ser. B"},{"issue":"1","key":"26_CR15","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1016\/S0021-9800(67)80118-2","volume":"2","author":"ME Watkins","year":"1967","unstructured":"Watkins, M.E.: A characterization of planar geodetic graphs. J. Comb. Theory 2(1), 102\u2013103 (1967). https:\/\/doi.org\/10.1016\/S0021-9800(67)80118-2","journal-title":"J. Comb. 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-68766-3_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,12]],"date-time":"2025-02-12T23:04:04Z","timestamp":1739401444000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-68766-3_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030687656","9783030687663"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-68766-3_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"14 February 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":"Vancouver, BC","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"gd2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/gd2020.cs.ubc.ca\/","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":"82","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":"29","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":"9","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":"35% - 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":"3","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":"The conference was held virtually due to the COVID-19 pandemic","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}