{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T02:38:45Z","timestamp":1729651125274,"version":"3.28.0"},"reference-count":16,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/ipdps.2004.1303249","type":"proceedings-article","created":{"date-parts":[[2004,6,10]],"date-time":"2004-06-10T10:19:45Z","timestamp":1086862785000},"page":"216-223","source":"Crossref","is-referenced-by-count":1,"title":["Addressing, distances and routing in triangular systems with applications in cellular and sensor networks"],"prefix":"10.1109","author":[{"given":"V.","family":"Chepoi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"F.","family":"Dragan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Y.","family":"Vaxes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"15","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719772"},{"key":"16","first-page":"1","article-title":"Compact routing schemes","author":"thorup","year":"2001","journal-title":"Proc 13th Ann ACM Symp on Par Alg and Arch (SPAA 2001)"},{"key":"13","article-title":"Informative labeling schemes for graphs","author":"peleg","year":"2000","journal-title":"Proceedings of the 25th International Symposium \"Mathematical Foundations of Computer Science\" (MFCS 2000)"},{"journal-title":"Lecture Notes in Computer Science 1893","first-page":"579","year":"2000","key":"14"},{"key":"11","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-46784-X_5","article-title":"Proximity-preserving labeling schemes and their applications","author":"peleg","year":"1999","journal-title":"Proceedings of the 25th International Workshop \"Graph-Theoretic Concepts in Computer Science\" (WG '99)"},{"key":"12","first-page":"3041","volume":"1665","year":"1999","journal-title":"Lecture Notes in Computer Science"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1021\/ci9600869"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01202540"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/90.532871"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2002.1036069"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/90.851978"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1137\/0213024"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.5.2.212"},{"key":"4","first-page":"210","article-title":"Distance labeling in graphs","author":"gavoille","year":"2001","journal-title":"Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2001)"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1023\/A:1012723626016"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.1999.749249"}],"event":{"name":"18th International Parallel and Distributed Processing Symposium, 2004.","location":"Santa Fe, NM, USA"},"container-title":["18th International Parallel and Distributed Processing Symposium, 2004. Proceedings."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/9132\/28950\/01303249.pdf?arnumber=1303249","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,5,30]],"date-time":"2018-05-30T11:12:39Z","timestamp":1527678759000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1303249\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":16,"URL":"https:\/\/doi.org\/10.1109\/ipdps.2004.1303249","relation":{},"subject":[]}}