{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T07:03:41Z","timestamp":1725433421485},"reference-count":13,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014,6]]},"DOI":"10.1109\/isit.2014.6874839","type":"proceedings-article","created":{"date-parts":[[2014,8,19]],"date-time":"2014-08-19T17:50:30Z","timestamp":1408470630000},"page":"281-285","source":"Crossref","is-referenced-by-count":3,"title":["Critical graphs in index coding"],"prefix":"10.1109","author":[{"given":"Mehrdad","family":"Tahmasbi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amirbehshad","family":"Shahrasbi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amin","family":"Gohari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"journal-title":"Critical Graphs in Index Coding","year":"2013","author":"tahmasbi","key":"13"},{"journal-title":"Introduction to Graph Theory","year":"2001","author":"west","key":"11"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139030687"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620369"},{"journal-title":"Secure Index Coding with Side Information","year":"2010","author":"dau","key":"2"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.1998.662940"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2011.6120342"},{"key":"7","first-page":"2236","article-title":"Index coding: An interference alignment perspective, in information theory proceedings (ISIT)","author":"maleki","year":"2012","journal-title":"2012 IEEE International Symposium on IEEE"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2008.4595303"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620407"},{"journal-title":"Index Coding Capacity How Far Can One Go with only Shannon Inequalities?","year":"2013","author":"sun","key":"4"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.42"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2007.48"}],"event":{"name":"2014 IEEE International Symposium on Information Theory (ISIT)","start":{"date-parts":[[2014,6,29]]},"location":"Honolulu, HI, USA","end":{"date-parts":[[2014,7,4]]}},"container-title":["2014 IEEE International Symposium on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6867217\/6874773\/06874839.pdf?arnumber=6874839","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,14]],"date-time":"2020-10-14T11:23:15Z","timestamp":1602674595000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/6874839"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,6]]},"references-count":13,"URL":"https:\/\/doi.org\/10.1109\/isit.2014.6874839","relation":{},"subject":[],"published":{"date-parts":[[2014,6]]}}}