{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,29]],"date-time":"2025-10-29T03:35:36Z","timestamp":1761708936674},"publisher-location":"Philadelphia, PA","reference-count":0,"publisher":"Society for Industrial and Applied Mathematics","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009,1,4]]},"DOI":"10.1137\/1.9781611973068.65","type":"proceedings-article","created":{"date-parts":[[2013,12,19]],"date-time":"2013-12-19T18:37:10Z","timestamp":1387478230000},"page":"586-595","source":"Crossref","is-referenced-by-count":17,"title":["The extended <i>k<\/i>-tree algorithm"],"prefix":"10.1137","author":[{"given":"Lorenz","family":"Minder","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alistair","family":"Sinclair","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"351","published-online":{"date-parts":[[2013,12,18]]},"event":{"name":"Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms"},"container-title":["Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms"],"original-title":[],"link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/1.9781611973068.65","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,11]],"date-time":"2019-01-11T17:01:19Z","timestamp":1547226079000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/1.9781611973068.65"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,1,4]]},"references-count":0,"alternative-id":["10.1137\/1.9781611973068.65","10.1137\/1.9781611973068"],"URL":"https:\/\/doi.org\/10.1137\/1.9781611973068.65","relation":{},"subject":[],"published":{"date-parts":[[2009,1,4]]}}}