{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:25:27Z","timestamp":1750307127064,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":16,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,9,23]],"date-time":"2011-09-23T00:00:00Z","timestamp":1316736000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2011,9,23]]},"DOI":"10.1145\/2030652.2030657","type":"proceedings-article","created":{"date-parts":[[2011,9,23]],"date-time":"2011-09-23T15:13:10Z","timestamp":1316790790000},"page":"9-14","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["How much off-center are centrality metrics for routing in opportunistic networks"],"prefix":"10.1145","author":[{"given":"Pavlos","family":"Nikolopoulos","sequence":"first","affiliation":[{"name":"National & Kapodistrian University of Athens, Athens, Greece"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Therapon","family":"Papadimitriou","sequence":"additional","affiliation":[{"name":"National & Kapodistrian University of Athens, Athens, Greece"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Panagiotis","family":"Pantazopoulos","sequence":"additional","affiliation":[{"name":"National & Kapodistrian University of Athens, Athens, Greece"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Merkourios","family":"Karaliopoulos","sequence":"additional","affiliation":[{"name":"National & Kapodistrian University of Athens, Athens, Greece"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ioannis","family":"Stavrakakis","sequence":"additional","affiliation":[{"name":"National & Kapodistrian University of Athens, Athens, Greece"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2011,9,23]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/WOWMOM.2007.4351716"},{"key":"e_1_3_2_1_2_1","volume-title":"April","author":"B.","year":"2003","unstructured":"B. Bui-Xuan et al. Computing shortest, fastest, and foremost journeys in dynamic networks. Int'l Jnl of Foundations of Computer Science, 14(2) , April 2003 . B. Bui-Xuan et al. Computing shortest, fastest, and foremost journeys in dynamic networks. Int'l Jnl of Foundations of Computer Science, 14(2), April 2003."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1364654.1364670"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2006.172"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2008.161"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.socnet.2004.11.007"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2002.801403"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/1833515.1833658"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2010.246"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1030194.1015484"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-27767-5_24"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0378-8733(02)00016-3"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/79147.214078"},{"key":"e_1_3_2_1_14_1","volume-title":"Efficient social-aware content placement for opportunistic networks","author":"Pantazopoulos P.","year":"2010","unstructured":"P. Pantazopoulos Efficient social-aware content placement for opportunistic networks . In IFIP\/IEEE WONS, Kranjska Gora , Slovenia , February , 3--5 2010 . P. Pantazopoulos et al. Efficient social-aware content placement for opportunistic networks. In IFIP\/IEEE WONS, Kranjska Gora, Slovenia, February, 3--5 2010."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2007.897964"},{"key":"e_1_3_2_1_16_1","volume-title":"Epidemic routing for partially connected ad hoc networks. Technical report","author":"Vahdat A.","year":"2000","unstructured":"A. Vahdat and D. Becker . Epidemic routing for partially connected ad hoc networks. Technical report , Duke University , April 2000 . A. Vahdat and D. Becker. Epidemic routing for partially connected ad hoc networks. Technical report, Duke University, April 2000."}],"event":{"name":"Mobicom'11: The 17th Annual International Conference on Mobile Computing and Networking","sponsor":["SIGMOBILE ACM Special Interest Group on Mobility of Systems, Users, Data and Computing"],"location":"Las Vegas Nevada USA","acronym":"Mobicom'11"},"container-title":["Proceedings of the 6th ACM workshop on Challenged networks"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2030652.2030657","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2030652.2030657","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:48:32Z","timestamp":1750240112000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2030652.2030657"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,9,23]]},"references-count":16,"alternative-id":["10.1145\/2030652.2030657","10.1145\/2030652"],"URL":"https:\/\/doi.org\/10.1145\/2030652.2030657","relation":{},"subject":[],"published":{"date-parts":[[2011,9,23]]},"assertion":[{"value":"2011-09-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}