{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T21:51:30Z","timestamp":1726091490503},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030549206"},{"type":"electronic","value":"9783030549213"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/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":"http:\/\/www.springer.com\/tdm"},{"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-54921-3_18","type":"book-chapter","created":{"date-parts":[[2020,7,29]],"date-time":"2020-07-29T11:04:28Z","timestamp":1596020668000},"page":"310-327","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Distance Labeling Schemes for $$K_4$$-Free Bridged Graphs"],"prefix":"10.1007","author":[{"given":"Victor","family":"Chepoi","sequence":"first","affiliation":[]},{"given":"Arnaud","family":"Labourel","sequence":"additional","affiliation":[]},{"given":"S\u00e9bastien","family":"Ratel","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,7,28]]},"reference":[{"issue":"1\u20133","key":"18_CR1","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/0012-365X(95)00217-K","volume":"160","author":"HJ Bandelt","year":"1996","unstructured":"Bandelt, H.J., Chepoi, V.: A Helly theorem in weakly modular space. Discret. Math. 160(1\u20133), 25\u201339 (1996)","journal-title":"Discret. Math."},{"key":"18_CR2","doi-asserted-by":"publisher","first-page":"676","DOI":"10.1016\/j.ejc.2007.03.003","volume":"29","author":"HJ Bandelt","year":"2008","unstructured":"Bandelt, H.J., Chepoi, V.: The algebra of metric betweenness ii: axiomatics of weakly median graphs. Euro. J. Combin. 29, 676\u2013700 (2008)","journal-title":"Euro. J. Combin."},{"key":"18_CR3","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1090\/conm\/453\/08795","volume":"453","author":"HJ Bandelt","year":"2008","unstructured":"Bandelt, H.J., Chepoi, V.: Metric graph theory and geometry: a survey. Contemp. Math. 453, 49\u201386 (2008)","journal-title":"Contemp. Math."},{"key":"18_CR4","doi-asserted-by":"publisher","first-page":"3465","DOI":"10.1016\/j.disc.2007.12.091","volume":"309","author":"F Bazzaro","year":"2009","unstructured":"Bazzaro, F., Gavoille, C.: Localized and compact data-structure for comparability graphs. Discret. Math. 309, 3465\u20133484 (2009)","journal-title":"Discret. Math."},{"key":"18_CR5","unstructured":"Chalopin, J., Chepoi, V., Hirai, H., Osajda, D.: Weakly modular graphs and nonpositive curvature. Memoirs of AMS (2019)"},{"key":"18_CR6","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1006\/aama.1999.0677","volume":"24","author":"V Chepoi","year":"2000","unstructured":"Chepoi, V.: Graphs of some CAT(0) complexes. Adv. Appl. Math. 24, 125\u2013179 (2000)","journal-title":"Adv. Appl. Math."},{"key":"18_CR7","first-page":"75","volume":"45","author":"V Chepoi","year":"1989","unstructured":"Chepoi, V.: Classification of graphs by means of metric triangles. Metody Diskret. Analiz. 45, 75\u201393 (1989)","journal-title":"Metody Diskret. Analiz."},{"key":"18_CR8","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1016\/j.jalgor.2004.07.011","volume":"61","author":"V Chepoi","year":"2006","unstructured":"Chepoi, V., Dragan, F.F., Vax\u00e8s, Y.: Distance and routing labeling schemes for non-positively curved plane graphs. J. Algorithms 61, 60\u201388 (2006)","journal-title":"J. Algorithms"},{"key":"18_CR9","doi-asserted-by":"crossref","unstructured":"Chepoi, V., Labourel, A., Ratel, S.: Distance labeling schemes for cube-free median graphs. In: MFCS. vol. 138, pp. 15:1\u201315:14 (2019)","DOI":"10.1007\/s00453-020-00756-w"},{"key":"18_CR10","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/S0166-218X(02)00421-3","volume":"131","author":"B Courcelle","year":"2003","unstructured":"Courcelle, B., Vanicat, R.: Query efficient implementation of graphs of bounded clique-width. Discret. Appl. Math. 131, 129\u2013150 (2003)","journal-title":"Discret. Appl. Math."},{"issue":"3","key":"18_CR11","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/0012-365X(87)90099-9","volume":"66","author":"M Farber","year":"1987","unstructured":"Farber, M., Jamison, R.E.: On local convexity in graphs. Discret. Math. 66(3), 231\u2013247 (1987)","journal-title":"Discret. Math."},{"key":"18_CR12","doi-asserted-by":"crossref","unstructured":"Freedman, O., Gawrychowski, P., Nicholson, P.K., Weimann, O.: Optimal distance labeling schemes for trees. In: PODC, pp. 185\u2013194. ACM (2017)","DOI":"10.1145\/3087801.3087804"},{"key":"18_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"476","DOI":"10.1007\/3-540-44676-1_40","volume-title":"Algorithms \u2014 ESA 2001","author":"C Gavoille","year":"2001","unstructured":"Gavoille, C., Katz, M., Katz, N.A., Paul, C., Peleg, D.: Approximate distance labeling schemes. In: auf der Heide, F.M. (ed.) ESA 2001. LNCS, vol. 2161, pp. 476\u2013487. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44676-1_40"},{"key":"18_CR14","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/S0012-365X(03)00232-2","volume":"273","author":"C Gavoille","year":"2003","unstructured":"Gavoille, C., Paul, C.: Distance labeling scheme and split decomposition. Discret. Math. 273, 115\u2013130 (2003)","journal-title":"Discret. Math."},{"key":"18_CR15","doi-asserted-by":"publisher","first-page":"1239","DOI":"10.1137\/050635006","volume":"22","author":"C Gavoille","year":"2008","unstructured":"Gavoille, C., Paul, C.: Optimal distance labeling for interval graphs and related graph families. SIAM J. Discret. Math. 22, 1239\u20131258 (2008)","journal-title":"SIAM J. Discret. Math."},{"key":"18_CR16","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/j.jalgor.2004.05.002","volume":"53","author":"C Gavoille","year":"2004","unstructured":"Gavoille, C., Peleg, D., P\u00e9renn\u00e8s, S., Raz, R.: Distance labeling in graphs. J. Algorithms 53, 85\u2013112 (2004)","journal-title":"J. Algorithms"},{"key":"18_CR17","unstructured":"Gawrychowski, P., Uznanski, P.: A note on distance labeling in planar graphs. CoRR abs\/1611.06529 (2016). http:\/\/arxiv.org\/abs\/1611.06529"},{"key":"18_CR18","doi-asserted-by":"publisher","unstructured":"Januszkiewicz, T., \u015awia\u0327tkowski, J.: Simplicial nonpositive curvature. Publications Math\u00e9matiques de l\u2019Institut des Hautes \u00c9tudes Scientifiques, 104(1), 1\u201385 (2006). https:\/\/doi.org\/10.1007\/s10240-006-0038-5","DOI":"10.1007\/s10240-006-0038-5"},{"key":"18_CR19","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719772","volume-title":"Distributed Computing: A Locality-Sensitive Approach","author":"D Peleg","year":"2000","unstructured":"Peleg, D.: Distributed Computing: A Locality-Sensitive Approach. SIAM, Philadelphia (2000)"},{"key":"18_CR20","unstructured":"Ratel, S.: Densit\u00e9. Aix-Marseille Universit\u00e9, VC-dimension et \u00e9tiquetages de graphes (2019)"},{"issue":"6","key":"18_CR21","doi-asserted-by":"publisher","first-page":"750","DOI":"10.1007\/BF01068561","volume":"19","author":"VP Soltan","year":"1983","unstructured":"Soltan, V.P., Chepoi, V.: Conditions for invariance of set diameters under $$d$$-convexification in a graph. Cybernetics 19(6), 750\u2013756 (1983). https:\/\/doi.org\/10.1007\/BF01068561","journal-title":"Cybernetics"},{"key":"18_CR22","doi-asserted-by":"publisher","first-page":"993","DOI":"10.1145\/1039488.1039493","volume":"51","author":"M Thorup","year":"2004","unstructured":"Thorup, M.: Compact oracles for reachability and approximate distances in planar digraphs. J. ACM 51, 993\u20131024 (2004)","journal-title":"J. ACM"}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-54921-3_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,24]],"date-time":"2021-04-24T02:42:28Z","timestamp":1619232148000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-54921-3_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030549206","9783030549213"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-54921-3_18","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":"28 July 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SIROCCO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Colloquium on Structural Information and Communication Complexity","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Paderborn","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":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 June 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 July 2020","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":"sirocco2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sirocco2020.cs.uni-paderborn.de\/","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":"41","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":"19","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":"0","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":"46% - 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","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":"11","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)"}}]}}