{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,25]],"date-time":"2025-09-25T18:15:19Z","timestamp":1758824119058},"reference-count":0,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.15439\/2019f62","type":"proceedings-article","created":{"date-parts":[[2019,9,20]],"date-time":"2019-09-20T15:11:17Z","timestamp":1568992277000},"page":"135-141","source":"Crossref","is-referenced-by-count":4,"title":["An Efficient Exhaustive Search for the Discretizable Distance Geometry Problem with Interval Data"],"prefix":"10.15439","volume":"18","author":[{"given":"Antonio","family":"Mucherino","sequence":"first","affiliation":[]},{"given":"Jung-Hsin","family":"Lin","sequence":"additional","affiliation":[]}],"member":"6175","published-online":{"date-parts":[[2019,9,26]]},"event":{"acronym":"FedCSIS 2019","name":"2019 Federated Conference on Computer Science and Information Systems","start":{"date-parts":[[2019,9,1]]},"end":{"date-parts":[[2019,9,4]]}},"container-title":["Annals of Computer Science and Information Systems","Proceedings of the 2019 Federated Conference on Computer Science and Information Systems"],"original-title":[],"deposited":{"date-parts":[[2024,8,30]],"date-time":"2024-08-30T07:05:34Z","timestamp":1725001534000},"score":1,"resource":{"primary":{"URL":"https:\/\/annals-csis.org\/Volume_18\/drp\/62.html"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,9,26]]},"references-count":0,"URL":"https:\/\/doi.org\/10.15439\/2019f62","relation":{},"ISSN":["2300-5963"],"issn-type":[{"type":"print","value":"2300-5963"}],"subject":[],"published":{"date-parts":[[2019,9,26]]}}}