{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:08:34Z","timestamp":1750306114393,"version":"3.41.0"},"publisher-location":"Republic and Canton of Geneva, Switzerland","reference-count":38,"publisher":"International World Wide Web Conferences Steering Committee","license":[{"start":{"date-parts":[[2017,4,3]],"date-time":"2017-04-03T00:00:00Z","timestamp":1491177600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,4,3]]},"DOI":"10.1145\/3038912.3052683","type":"proceedings-article","created":{"date-parts":[[2017,4,6]],"date-time":"2017-04-06T13:30:38Z","timestamp":1491485438000},"page":"1461-1470","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Indexing Public-Private Graphs"],"prefix":"10.1145","author":[{"given":"Aaron","family":"Archer","sequence":"first","affiliation":[{"name":"Google, Inc, New York, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Silvio","family":"Lattanzi","sequence":"additional","affiliation":[{"name":"Google, Inc, New York, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Likarish","sequence":"additional","affiliation":[{"name":"Google, Inc, New York, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sergei","family":"Vassilvitskii","sequence":"additional","affiliation":[{"name":"Google, Inc, New York, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2017,4,3]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/67544.66950"},{"key":"e_1_3_2_1_2_1","first-page":"1","volume-title":"IPCO","author":"Archer A.","year":"2001","unstructured":"A. Archer. Two O (log* k)-approximation algorithms for the asymmetric k-center problem. In IPCO, pages 1--14, 2001."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1137\/110826655"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1871437.1871457"},{"key":"e_1_3_2_1_5_1","first-page":"493","volume-title":"VLDB","author":"Chen L.","year":"2005","unstructured":"L. Chen, A. Gupta, and M. E. Kurul. Stack-based algorithms for pattern matching on DAGs. In VLDB, pages 493--504, 2005."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-013-0346-6"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1353343.1353370"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783354"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2020408.2020579"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007363"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539702403098"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(88)90164-0"},{"key":"e_1_3_2_1_14_1","first-page":"59","volume-title":"APPROX","author":"G\u00f8rtz I. L.","year":"2003","unstructured":"I. L. G\u00f8rtz and A. Wirth. Asymmetry in k-center variants. In APPROX, pages 59--70, 2003."},{"key":"e_1_3_2_1_15_1","first-page":"665","volume-title":"SODA","author":"Hesse W.","year":"2003","unstructured":"W. Hesse. Directed graphs requiring large numbers of shortcuts. In SODA, pages 665--669, 2003."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.14778\/2002938.2002941"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213856"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.14778\/2556549.2556578"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1559845.1559930"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376677"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(74)80044-9"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(93)90042-U"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1081870.1081893"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-44777-2_58"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(94)90128-7"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1997.0921"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24741-8_15"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2013.6544893"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(88)90032-1"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1247480.1247573"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1137\/0220006"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989323.1989419"},{"key":"e_1_3_2_1_33_1","first-page":"511","volume-title":"EDBT","author":"Veloso R. R.","year":"2014","unstructured":"R. R. Veloso, L. Cerf, W. M. Jr., and M. J. Zaki. Reachability queries in very large graphs: A fast refined online search approach. In EDBT, pages 511--522, 2014."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2006.53"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.14778\/2732977.2732992"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2012.138"},{"key":"e_1_3_2_1_37_1","volume-title":"DAGGER: A scalable index for reachability queries in large dynamic graphs. CoRR, abs\/1301.0977","author":"Yildirim H.","year":"2013","unstructured":"H. Yildirim, V. Chaoji, and M. J. Zaki. DAGGER: A scalable index for reachability queries in large dynamic graphs. CoRR, abs\/1301.0977, 2013."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDEW.2010.5452724"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2612181"}],"event":{"name":"WWW '17: 26th International World Wide Web Conference","sponsor":["IW3C2 International World Wide Web Conference Committee","SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web"],"location":"Perth Australia","acronym":"WWW '17"},"container-title":["Proceedings of the 26th International Conference on World Wide Web"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3038912.3052683","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3038912.3052683","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:36:29Z","timestamp":1750217789000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3038912.3052683"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,4,3]]},"references-count":38,"alternative-id":["10.1145\/3038912.3052683","10.5555\/3038912"],"URL":"https:\/\/doi.org\/10.1145\/3038912.3052683","relation":{},"subject":[],"published":{"date-parts":[[2017,4,3]]},"assertion":[{"value":"2017-04-03","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}