{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T05:05:02Z","timestamp":1769922302741,"version":"3.49.0"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031521126","type":"print"},{"value":"9783031521133","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-52113-3_33","type":"book-chapter","created":{"date-parts":[[2024,2,7]],"date-time":"2024-02-07T00:02:50Z","timestamp":1707264170000},"page":"471-484","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Distance Labeling for\u00a0Families of\u00a0Cycles"],"prefix":"10.1007","author":[{"given":"Arseny M.","family":"Shur","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mikhail","family":"Rubinchik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,2,7]]},"reference":[{"key":"33_CR1","doi-asserted-by":"crossref","unstructured":"Abboud, A., Gawrychowski, P., Mozes, S., Weimann, O.: Near-optimal compression for the planar graph metric. In: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018, pp. 530\u2013549. SIAM (2018)","DOI":"10.1137\/1.9781611975031.35"},{"issue":"6","key":"33_CR2","doi-asserted-by":"publisher","first-page":"1295","DOI":"10.1137\/S0097539703437211","volume":"35","author":"S Abiteboul","year":"2006","unstructured":"Abiteboul, S., Alstrup, S., Kaplan, H., Milo, T., Rauhe, T.: Compact labeling scheme for ancestor queries. SIAM J. Comput. 35(6), 1295\u20131309 (2006)","journal-title":"SIAM J. Comput."},{"key":"33_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.dam.2019.10.030","volume":"282","author":"M Abrahamsen","year":"2020","unstructured":"Abrahamsen, M., Alstrup, S., Holm, J., Knudsen, M.B.T., St\u00f6ckel, M.: Near-optimal induced universal graphs for cycles and paths. Discret. Appl. Math. 282, 1\u201313 (2020)","journal-title":"Discret. Appl. Math."},{"key":"33_CR4","unstructured":"Alstrup, S., G\u00f8rtz, I.L., Halvorsen, E.B., Porat, E.: Distance labeling schemes for trees. In: 43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016. LIPIcs, vol. 55, pp. 132:1\u2013132:16. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2016)"},{"issue":"11","key":"33_CR5","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(11), 3465\u20133484 (2009)","journal-title":"Discret. Math."},{"key":"33_CR6","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1109\/TIT.1966.1053860","volume":"IT\u201312","author":"MA Breuer","year":"1966","unstructured":"Breuer, M.A.: Coding the vertexes of a graph. IEEE Trans. Inf. Theory IT\u201312, 148\u2013153 (1966)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"33_CR7","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1016\/0022-247X(67)90082-0","volume":"20","author":"MA Breuer","year":"1967","unstructured":"Breuer, M.A., Folkman, J.: An unexpected result on coding vertices of a graph. J. Math. Anal. Appl. 20, 583\u2013600 (1967)","journal-title":"J. Math. Anal. Appl."},{"issue":"5","key":"33_CR8","doi-asserted-by":"publisher","first-page":"2048","DOI":"10.1137\/070687633","volume":"39","author":"E Cohen","year":"2010","unstructured":"Cohen, E., Kaplan, H., Milo, T.: Labeling dynamic XML trees. SIAM J. Comput. 39(5), 2048\u20132074 (2010)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"33_CR9","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/S0196-6774(03)00002-6","volume":"46","author":"T Eilam","year":"2003","unstructured":"Eilam, T., Gavoille, C., Peleg, D.: Compact routing schemes with low stretch factor. J. Algorithms 46(2), 97\u2013114 (2003)","journal-title":"J. Algorithms"},{"key":"33_CR10","doi-asserted-by":"crossref","unstructured":"Freedman, O., Gawrychowski, P., Nicholson, P.K., Weimann, O.: Optimal distance labeling schemes for trees. In: Proceedings of the ACM Symposium on Principles of Distributed Computing, PODC 2017, pp. 185\u2013194. ACM (2017)","DOI":"10.1145\/3087801.3087804"},{"issue":"3","key":"33_CR11","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(3), 1239\u20131258 (2008)","journal-title":"SIAM J. Discret. Math."},{"issue":"2\u20133","key":"33_CR12","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/s00446-002-0073-5","volume":"16","author":"C Gavoille","year":"2003","unstructured":"Gavoille, C., Peleg, D.: Compact and localized distributed data structures. Distrib. Comput. 16(2\u20133), 111\u2013120 (2003)","journal-title":"Distrib. Comput."},{"issue":"1","key":"33_CR13","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\u00e9rennes, S., Raz, R.: Distance labeling in graphs. J. Algorithms 53(1), 85\u2013112 (2004)","journal-title":"J. Algorithms"},{"issue":"6","key":"33_CR14","doi-asserted-by":"publisher","first-page":"1805","DOI":"10.1007\/s00453-023-01133-z","volume":"85","author":"P Gawrychowski","year":"2023","unstructured":"Gawrychowski, P., Uznanski, P.: Better distance labeling for unweighted planar graphs. Algorithmica 85(6), 1805\u20131823 (2023)","journal-title":"Algorithmica"},{"key":"33_CR15","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/BFb0067362","volume-title":"Graph Theory and Applications","author":"RL Graham","year":"1972","unstructured":"Graham, R.L., Pollak, H.O.: On embedding graphs in squashed cubes. In: Alavi, Y., Lick, D.R., White, A.T. (eds.) Graph Theory and Applications. Lecture Notes in Mathematics, vol. 303, pp. 99\u2013110. Springer, Heidelberg (1972). https:\/\/doi.org\/10.1007\/BFb0067362"},{"issue":"4","key":"33_CR16","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1137\/0405049","volume":"5","author":"S Kannan","year":"1992","unstructured":"Kannan, S., Naor, M., Rudich, S.: Implicit representation of graphs. SIAM J. Discrete Math. 5(4), 596\u2013603 (1992)","journal-title":"SIAM J. Discrete Math."},{"key":"33_CR17","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1007\/s00453-008-9226-7","volume":"57","author":"A Korman","year":"2010","unstructured":"Korman, A., Peleg, D., Rodeh, Y.: Constructing labeling schemes through universal matrices. Algorithmica 57, 641\u2013652 (2010)","journal-title":"Algorithmica"},{"issue":"1","key":"33_CR18","first-page":"32","volume":"7","author":"JW Moon","year":"1965","unstructured":"Moon, J.W.: On minimal n-universal graphs. Glasgow Math. J. 7(1), 32\u201333 (1965)","journal-title":"Glasgow Math. J."},{"key":"33_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1007\/3-540-46784-X_5","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"D Peleg","year":"1999","unstructured":"Peleg, D.: Proximity-preserving labeling schemes and their applications. In: Widmayer, P., Neyer, G., Eidenbenz, S. (eds.) WG 1999. LNCS, vol. 1665, pp. 30\u201341. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-46784-X_5"},{"key":"33_CR20","doi-asserted-by":"crossref","unstructured":"Thorup, M., Zwick, U.: Compact routing schemes. In: Proceedings of the Thirteenth Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 2001, pp. 1\u201310. ACM (2001)","DOI":"10.1145\/378580.378581"},{"key":"33_CR21","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/BF02579350","volume":"3","author":"PM Winkler","year":"1983","unstructured":"Winkler, P.M.: Proof of the squashed cube conjecture. Combinatorica 3, 135\u2013139 (1983)","journal-title":"Combinatorica"},{"key":"33_CR22","unstructured":"Distance labeling for small families of cycles, source code (2023). https:\/\/tinyurl.com\/tc8nd39s"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2024: Theory and Practice of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-52113-3_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,27]],"date-time":"2024-03-27T20:05:18Z","timestamp":1711569918000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-52113-3_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031521126","9783031521133"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-52113-3_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"7 February 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SOFSEM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Current Trends in Theory and Practice of Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Cochem","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":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 February 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 February 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"49","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sofsem2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.uni-trier.de\/index.php?id=90670&L=2","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":"81","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":"33","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":"41% - 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":"7","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)"}}]}}