{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:45:53Z","timestamp":1767339953558,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":5,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,12,7]],"date-time":"2021-12-07T00:00:00Z","timestamp":1638835200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,12,7]]},"DOI":"10.1145\/3488658.3493783","type":"proceedings-article","created":{"date-parts":[[2021,12,4]],"date-time":"2021-12-04T23:29:17Z","timestamp":1638660557000},"page":"19-20","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Quantum scheduling optimization for UAV-enabled IoT networks"],"prefix":"10.1145","author":[{"given":"Francesco","family":"Vista","sequence":"first","affiliation":[{"name":"Politecnico di Bari, Bari, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giovanni","family":"Iacovelli","sequence":"additional","affiliation":[{"name":"Politecnico di Bari, Bari, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luigi Alfredo","family":"Grieco","sequence":"additional","affiliation":[{"name":"Politecnico di Bari, Bari, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2021,12,7]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_3_2_1_1_1","DOI":"10.1016\/j.adhoc.2021.102600"},{"key":"e_1_3_2_1_2_1","volume-title":"A practical heuristic for finding graph minors. arXiv preprint arXiv:1406.2741","author":"Cai Jun","year":"2014","unstructured":"Jun Cai , William G Macready , and Aidan Roy . 2014. A practical heuristic for finding graph minors. arXiv preprint arXiv:1406.2741 ( 2014 ). Jun Cai, William G Macready, and Aidan Roy. 2014. A practical heuristic for finding graph minors. arXiv preprint arXiv:1406.2741 (2014)."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_3_1","DOI":"10.1016\/j.cosrev.2018.11.002"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_4_1","DOI":"10.1088\/1361-6633\/ab85b8"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_5_1","DOI":"10.1145\/3341302.3342072"}],"event":{"sponsor":["SIGCOMM ACM Special Interest Group on Data Communication"],"acronym":"CoNEXT '21","name":"CoNEXT '21: The 17th International Conference on emerging Networking EXperiments and Technologies","location":"Virtual Event Germany"},"container-title":["Proceedings of the CoNEXT Student Workshop"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3488658.3493783","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3488658.3493783","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:31:12Z","timestamp":1750188672000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3488658.3493783"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,12,7]]},"references-count":5,"alternative-id":["10.1145\/3488658.3493783","10.1145\/3488658"],"URL":"https:\/\/doi.org\/10.1145\/3488658.3493783","relation":{},"subject":[],"published":{"date-parts":[[2021,12,7]]},"assertion":[{"value":"2021-12-07","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}