{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,23]],"date-time":"2026-03-23T13:17:58Z","timestamp":1774271878675,"version":"3.50.1"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2026,1,31]],"date-time":"2026-01-31T00:00:00Z","timestamp":1769817600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,31]],"date-time":"2026-01-31T00:00:00Z","timestamp":1769817600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"EU\u2019s Horizon 2020 Research and Innovation Programme","award":["MPM ERC 683064"],"award-info":[{"award-number":["MPM ERC 683064"]}]},{"name":"Center for Absorption in Science of the Ministry of Aliyah and Immigration of the State of Israel"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[2026,3]]},"DOI":"10.1007\/s00236-025-00517-8","type":"journal-article","created":{"date-parts":[[2026,1,31]],"date-time":"2026-01-31T07:14:29Z","timestamp":1769843669000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Distance labeling for families of cycles"],"prefix":"10.1007","volume":"63","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":[[2026,1,31]]},"reference":[{"key":"517_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":"517_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":"517_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":"517_CR4","doi-asserted-by":"crossref","unstructured":"Alstrup, S., Gavoille, C., Halvorsen, E.B., Petersen, H.: Simpler, faster and shorter labels for distances in graphs. In: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, pp. 338\u2013350. SIAM (2016)","DOI":"10.1137\/1.9781611974331.ch25"},{"key":"517_CR5","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\u2013113216. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2016)"},{"issue":"11","key":"517_CR6","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":"517_CR7","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1109\/TIT.1966.1053860","volume":"IT\u2014-12","author":"MA Breuer","year":"1966","unstructured":"Breuer, M.A.: Coding the vertexes of a graph. IEEE Trans. on Information Theory IT\u2014-12, 148\u2013153 (1966)","journal-title":"IEEE Trans. on Information Theory"},{"key":"517_CR8","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":"517_CR9","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."},{"key":"517_CR10","unstructured":"Distance Labeling For Small Families Of Cycles, Source Code. Available at https:\/\/tinyurl.com\/tc8nd39s (2023)"},{"issue":"2","key":"517_CR11","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":"517_CR12","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":"517_CR13","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":"517_CR14","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. Distributed Comput. 16(2\u20133), 111\u2013120 (2003)","journal-title":"Distributed Comput."},{"issue":"1","key":"517_CR15","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"},{"key":"517_CR16","unstructured":"Gawrychowski, P., Janczewski, W.: Optimal distance labeling for permutation graphs. CoRR arXiv:2407.12147 (2024). https:\/\/dblp.org\/rec\/conf\/icalp\/GawrychowskiJ25.html?view=bibtex2"},{"issue":"6","key":"517_CR17","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":"517_CR18","doi-asserted-by":"crossref","unstructured":"Graham, R.L., Pollak, H.O.: On embedding graphs in squashed cubes. In: Graph Theory and Applications, 1972. Lecture Notes in Mathematics, vol. 303, pp. 99\u2013110. Springer (1972)","DOI":"10.1007\/BFb0067362"},{"issue":"4","key":"517_CR19","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":"517_CR20","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":"517_CR21","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":"517_CR22","doi-asserted-by":"crossref","unstructured":"Peleg, D.: Proximity-preserving labeling schemes and their applications. In: Graph-Theoretic Concepts in Computer Science, 25th International Workshop, WG \u201999. Lecture Notes in Computer Science, vol. 1665, pp. 30\u201341. Springer (1999)","DOI":"10.1007\/3-540-46784-X_5"},{"key":"517_CR23","doi-asserted-by":"crossref","unstructured":"Shur, A.M., Rubinchik, M.: Distance labeling for families of cycles. In: Fernau, H., Gaspers, S., Klasing, R. (eds.) SOFSEM 2024: Theory and Practice of Computer Science - 49th International Conference, SOFSEM 2024, Proceedings. Lecture Notes in Computer Science, vol. 14519, pp. 471\u2013484. Springer (2024)","DOI":"10.1007\/978-3-031-52113-3_33"},{"key":"517_CR24","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":"517_CR25","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"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-025-00517-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00236-025-00517-8","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-025-00517-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,23]],"date-time":"2026-03-23T12:25:38Z","timestamp":1774268738000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00236-025-00517-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,1,31]]},"references-count":25,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,3]]}},"alternative-id":["517"],"URL":"https:\/\/doi.org\/10.1007\/s00236-025-00517-8","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,1,31]]},"assertion":[{"value":"11 April 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 December 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 January 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"4"}}