{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:12:33Z","timestamp":1750306353796,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,7,18]],"date-time":"2016-07-18T00:00:00Z","timestamp":1468800000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"TUBITAK","award":["114E261"],"award-info":[{"award-number":["114E261"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2016,7,18]]},"DOI":"10.1145\/2949689.2949695","type":"proceedings-article","created":{"date-parts":[[2016,7,8]],"date-time":"2016-07-08T15:03:00Z","timestamp":1467990180000},"page":"1-10","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Graph-based modelling of query sets for differential privacy"],"prefix":"10.1145","author":[{"given":"Ali","family":"Inan","sequence":"first","affiliation":[{"name":"Adana Science and Technology University, Department of Computer Engineering, Adana, Turkey"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mehmet Emre","family":"Gursoy","sequence":"additional","affiliation":[{"name":"University of California at Los Angeles, Computer Science Department, Los Angeles, CA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Emir","family":"Esmerdag","sequence":"additional","affiliation":[{"name":"Istanbul Technical University, Information Security and Cryptographic Engineering, Istanbul, Turkey"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yucel","family":"Saygin","sequence":"additional","affiliation":[{"name":"Sabanci University, Faculty of Engineering and Natural Sciences, Istanbul, Turkey"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2016,7,18]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/76894.76895"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2893582.2893591"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/1953048.2021036"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/11787006_1"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/11761679_29"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/11681878_14"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2480359.2429113"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/09076828X"},{"key":"e_1_3_2_1_9_1","first-page":"2339","volume-title":"Advances in Neural Information Processing Systems","author":"Hardt M.","year":"2012","unstructured":"M. Hardt , K. Ligett , and F. McSherry . A simple and practical algorithm for differentially private data release . In Advances in Neural Information Processing Systems , pages 2339 -- 2347 , 2012 . M. Hardt, K. Ligett, and F. McSherry. A simple and practical algorithm for differentially private data release. In Advances in Neural Information Processing Systems, pages 2339--2347, 2012."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.14778\/2732269.2732271"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807085.1807104"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-015-0398-x"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICTAI.2010.57"},{"key":"e_1_3_2_1_15_1","first-page":"128","volume-title":"AAAI","volume":"10","author":"Li C. M.","year":"2010","unstructured":"C. M. Li and Z. Quan . An efficient branch-and-bound algorithm based on maxsat for the maximum clique problem . In AAAI , volume 10 , pages 128 -- 133 , 2010 . C. M. Li and Z. Quan. An efficient branch-and-bound algorithm based on maxsat for the maximum clique problem. In AAAI, volume 10, pages 128--133, 2010."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1810891.1810916"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2007.41"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213876"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250790.1250803"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.4204\/EPTCS.85.7"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1932681.1863568"},{"key":"e_1_3_2_1_22_1","first-page":"20","volume-title":"Proceedings of the 7th USENIX Conference on Networked Systems Design and Implementation, NSDI'10","author":"Roy I.","year":"2010","unstructured":"I. Roy , S. T. V. Setty , A. Kilzer , V. Shmatikov , and E. Witchel . Airavat: Security and privacy for mapreduce . In Proceedings of the 7th USENIX Conference on Networked Systems Design and Implementation, NSDI'10 , pages 20 -- 20 , Berkeley, CA, USA , 2010 . USENIX Association. I. Roy, S. T. V. Setty, A. Kilzer, V. Shmatikov, and E. Witchel. Airavat: Security and privacy for mapreduce. In Proceedings of the 7th USENIX Conference on Networked Systems Design and Implementation, NSDI'10, pages 20--20, Berkeley, CA, USA, 2010. USENIX Association."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2014.09.064"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.14778\/1453856.1453949"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.14778\/2350229.2350252"}],"event":{"name":"SSDBM '16: Conference on Scientific and Statistical Database Management","acronym":"SSDBM '16","location":"Budapest Hungary"},"container-title":["Proceedings of the 28th International Conference on Scientific and Statistical Database Management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2949689.2949695","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2949689.2949695","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:56:00Z","timestamp":1750222560000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2949689.2949695"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7,18]]},"references-count":25,"alternative-id":["10.1145\/2949689.2949695","10.1145\/2949689"],"URL":"https:\/\/doi.org\/10.1145\/2949689.2949695","relation":{},"subject":[],"published":{"date-parts":[[2016,7,18]]},"assertion":[{"value":"2016-07-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}