{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T16:52:13Z","timestamp":1773939133284,"version":"3.50.1"},"reference-count":36,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"5","funder":[{"DOI":"10.13039\/501100002241","name":"Japan Science and Technology Agency","doi-asserted-by":"publisher","award":["JPMJCR1401"],"award-info":[{"award-number":["JPMJCR1401"]}],"id":[{"id":"10.13039\/501100002241","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Italian Ministry for Education and Research","award":["20174LF3T8 AHeAD"],"award-info":[{"award-number":["20174LF3T8 AHeAD"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Comput."],"published-print":{"date-parts":[[2022,10,31]]},"DOI":"10.1137\/20m1375048","type":"journal-article","created":{"date-parts":[[2022,10,28]],"date-time":"2022-10-28T10:47:25Z","timestamp":1666954045000},"page":"1580-1625","source":"Crossref","is-referenced-by-count":10,"title":["Proximity Search for Maximal Subgraph Enumeration"],"prefix":"10.1137","volume":"51","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0770-2235","authenticated-orcid":true,"given":"Alessio","family":"Conte","sequence":"first","affiliation":[{"name":"Department of Computer Science, University of Pisa, Pisa, Italy (, )."}]},{"given":"Roberto","family":"Grossi","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of Pisa, Pisa, Italy (, )."}]},{"given":"Andrea","family":"Marino","sequence":"additional","affiliation":[{"name":"Department of Statistics, Computer Science, and Applications, University of Florence, Florence, Italy ()."}]},{"given":"Takeaki","family":"Uno","sequence":"additional","affiliation":[{"name":"National Institute of Informatics, Tokyo, Japan ()."}]},{"given":"Luca","family":"Versari","sequence":"additional","affiliation":[{"name":"University of Pisa, Pisa, Italy. Current address: Google Research, Zurich, Switzerland ()."}]}],"member":"351","published-online":{"date-parts":[[2022,10,28]]},"reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(95)00026-N"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-8369-7_1"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-015-0054-2"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2020.05.034"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/BF02712873"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44679-6_34"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2008.04.003"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1137\/17M1152206"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-62389-4_13"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-16595-0_7"},{"key":"ref18","volume-title":"Grad. Texts in Math. 173","author":"Diestel R.","year":"2005","edition":"3"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/2543629"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/1435375.1435384"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.2140\/pjm.1965.15.835"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-017-0289-1"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-014-9875-7"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2008.10.010"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.07.020"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(88)90065-8"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1137\/120862612"},{"key":"ref29","volume-title":"The Art of Computer Programming, Vol.3: Sorting and Searching","author":"Knuth D. E.","year":"2011"},{"key":"ref30","volume-title":"The Art of Computer Programming, Vol. 4A: Combinatorial Algorithms, Part 1","author":"Knuth D. E.","year":"2011"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1089\/cmb.1996.3.289"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/2635810"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1137\/0209042"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1970-125-1"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/BF02760024"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TEC.1959.5222697"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1137\/0205021"},{"key":"ref40","first-page":"20","volume-title":"Preliminary Working Draft 11","author":"Ruskey F.","year":"2003"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(00)00339-5"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539794270881"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1145\/321879.321884"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2006.06.015"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1137\/0206036"},{"key":"ref47","volume-title":"NII Technical Report NII-2003-004E","author":"Uno T.","year":"2003"}],"container-title":["SIAM Journal on Computing"],"original-title":[],"language":"en","deposited":{"date-parts":[[2022,11,3]],"date-time":"2022-11-03T12:04:09Z","timestamp":1667477049000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/20M1375048"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10,28]]},"references-count":36,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2022,10,31]]}},"alternative-id":["10.1137\/20M1375048"],"URL":"https:\/\/doi.org\/10.1137\/20m1375048","relation":{},"ISSN":["0097-5397","1095-7111"],"issn-type":[{"value":"0097-5397","type":"print"},{"value":"1095-7111","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,10,28]]}}}