{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T09:35:01Z","timestamp":1763458501478,"version":"3.45.0"},"publisher-location":"Republic and Canton of Geneva, Switzerland","reference-count":36,"publisher":"International World Wide Web Conferences Steering Committee","license":[{"start":{"date-parts":[[2016,4,11]],"date-time":"2016-04-11T00:00:00Z","timestamp":1460332800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"NSF","award":["NSF-DMS-1418265","NSF-EAR-1520870"],"award-info":[{"award-number":["NSF-DMS-1418265","NSF-EAR-1520870"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2016,4,11]]},"DOI":"10.1145\/2872427.2883007","type":"proceedings-article","created":{"date-parts":[[2017,1,23]],"date-time":"2017-01-23T15:35:52Z","timestamp":1485185752000},"page":"879-889","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["What Links Alice and Bob?"],"prefix":"10.1145","author":[{"given":"Jiongqian","family":"Liang","sequence":"first","affiliation":[{"name":"The Ohio State University, Columbus, OH, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Deepak","family":"Ajwani","sequence":"additional","affiliation":[{"name":"Bell Labs Ireland, Dublin, Ireland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Patrick K.","family":"Nicholson","sequence":"additional","affiliation":[{"name":"Bell Labs Ireland, Dublin, Ireland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alessandra","family":"Sala","sequence":"additional","affiliation":[{"name":"Bell Labs Ireland, Dublin, Ireland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Srinivasan","family":"Parthasarathy","sequence":"additional","affiliation":[{"name":"The Ohio State University, Columbus, OH, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2016,4,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2465315"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/11427995_77"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/210332.210337"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/BDCloud.2014.101"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2002.994756"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/944919.944937"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/971617.971643"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/1618595.1618605"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1014052.1014068"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.14778\/2078331.2078339"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.2172\/895418"},{"key":"e_1_3_2_1_12_1","volume-title":"Computers and intractability","author":"Garey M. R.","year":"2002","unstructured":"M. R. Garey and D. S. Johnson. Computers and intractability, volume 29. wh freeman, 2002."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICPR.2002.1048250"},{"key":"e_1_3_2_1_14_1","volume-title":"An efficient implementation of an algorithm for finding k shortest simple paths. Networks, (34.2):88--101","author":"Hadjiconstantinou E.","year":"1999","unstructured":"E. Hadjiconstantinou and N. Christofides. An efficient implementation of an algorithm for finding k shortest simple paths. Networks, (34.2):88--101, 1999."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1290672.1290682"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/1083592.1083652"},{"key":"e_1_3_2_1_17_1","volume-title":"An efficient algorithm for k shortest simple paths. Networks, (12.4):411--427","author":"Katoh N.","year":"1982","unstructured":"N. Katoh, I. Toshihide, and M. Hisashi. An efficient algorithm for k shortest simple paths. Networks, (12.4):411--427, 1982."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989323.1989418"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.14778\/2535569.2448952"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-010-5205-8"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1201\/9781420085877.ch21"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741123"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.5555\/525"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1089\/cmb.2006.13.133"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/543613.543620"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2013.2297920"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/bts212"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2481244.2481248"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2124295.2124373"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.14778\/3402707.3402736"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150448"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/321921.321925"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/HiBi.2009.21"},{"key":"e_1_3_2_1_34_1","first-page":"143","volume-title":"IAAI","volume":"3","author":"Wolverton M.","year":"2003","unstructured":"M. Wolverton, P. Berry, I. W. Harrison, J. D. Lowrance, D. N. Morley, A. C. Rodriguez, E. H. Ruspini, and J. Thomere. Law: A workbench for approximate pattern matching in relational data. In IAAI, volume 3, pages 143--150, 2003."},{"key":"e_1_3_2_1_35_1","volume-title":"Finding the k shortest loopless paths in a network. Management Science, (17.11):712--716","author":"Yen J. Y.","year":"1971","unstructured":"J. Y. Yen. Finding the k shortest loopless paths in a network. Management Science, (17.11):712--716, 1971."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/1540276.1540279"}],"event":{"name":"WWW '16: 25th International World Wide Web Conference","sponsor":["IW3C2 International World Wide Web Conference Committee","SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web"],"location":"Montr\u00e9al Qu\u00e9bec Canada","acronym":"WWW '16"},"container-title":["Proceedings of the 25th International Conference on World Wide Web"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2872427.2883007","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2872427.2883007","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2872427.2883007","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T09:30:27Z","timestamp":1763458227000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2872427.2883007"}},"subtitle":["Matching and Ranking Semantic Patterns in Heterogeneous Networks"],"short-title":[],"issued":{"date-parts":[[2016,4,11]]},"references-count":36,"alternative-id":["10.1145\/2872427.2883007","10.5555\/2872427"],"URL":"https:\/\/doi.org\/10.1145\/2872427.2883007","relation":{},"subject":[],"published":{"date-parts":[[2016,4,11]]},"assertion":[{"value":"2016-04-11","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}