{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T20:59:40Z","timestamp":1774990780645,"version":"3.50.1"},"reference-count":23,"publisher":"IEEE","license":[{"start":{"date-parts":[[2016,7,1]],"date-time":"2016-07-01T00:00:00Z","timestamp":1467331200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2016,7,1]],"date-time":"2016-07-01T00:00:00Z","timestamp":1467331200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016,7]]},"DOI":"10.1109\/isit.2016.7541680","type":"proceedings-article","created":{"date-parts":[[2016,8,15]],"date-time":"2016-08-15T18:52:57Z","timestamp":1471287177000},"page":"2154-2158","source":"Crossref","is-referenced-by-count":4,"title":["Approximate capacity of index coding for some classes of graphs"],"prefix":"10.1109","author":[{"given":"Fatemeh","family":"Arbabjolfaei","sequence":"first","affiliation":[{"name":"Department of Electrical and Computer Engineering, University of California, San Diego, USA"}]},{"given":"Young-Han","family":"Kim","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, University of California, San Diego, USA"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.874540"},{"key":"ref11","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1215\/ijm\/1256049012","article-title":"Every planar map is four colorable-II: Reducibility","volume":"21","author":"appel","year":"1977","journal-title":"Illinois J Math"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511734885.008"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.2307\/2310461"},{"key":"ref14","first-page":"125","article-title":"On the representation of directed graphs as unions of orberings","volume":"9","author":"erd\u00f6s","year":"1964","journal-title":"Publ Math Inst Hungar Acad Sci"},{"key":"ref15","author":"scheinerman","year":"2011","journal-title":"Fractional Graph Theory A Rational Approach to the Theory of Graphs"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2014.03.016"},{"key":"ref17","first-page":"463","article-title":"A combinatorial problem in geometry","volume":"2","author":"erd\u00f6s","year":"1935","journal-title":"Compositio Math"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/BF01581168"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1006\/jctb.1993.1070"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620406"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620369"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/IWCIT.2014.6842484"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6874881"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ITA.2014.6804209"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2338865"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2264472"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2103753"},{"key":"ref9","article-title":"Fractional coloring (orthogonal access) achieves all-unicast capacity (DoF) region of index coding (TIM) if and only if network topology is chordal","author":"yi","year":"2015"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190090208"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6874841"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6874840"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6034247"}],"event":{"name":"2016 IEEE International Symposium on Information Theory (ISIT)","location":"Barcelona, Spain","start":{"date-parts":[[2016,7,10]]},"end":{"date-parts":[[2016,7,15]]}},"container-title":["2016 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7532279\/7541040\/07541680.pdf?arnumber=7541680","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T19:51:35Z","timestamp":1774986695000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/7541680\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7]]},"references-count":23,"URL":"https:\/\/doi.org\/10.1109\/isit.2016.7541680","relation":{},"subject":[],"published":{"date-parts":[[2016,7]]}}}