{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T13:31:08Z","timestamp":1778851868082,"version":"3.51.4"},"reference-count":25,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":["IEEE Trans. Wireless Commun."],"published-print":{"date-parts":[[2021,1]]},"DOI":"10.1109\/twc.2020.3025448","type":"journal-article","created":{"date-parts":[[2020,9,29]],"date-time":"2020-09-29T23:44:24Z","timestamp":1601423064000},"page":"468-480","source":"Crossref","is-referenced-by-count":10,"title":["A Novel Method for Scheduling of Wireless Ad Hoc Networks in Polynomial Time"],"prefix":"10.1109","volume":"20","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1537-1205","authenticated-orcid":false,"given":"Alper","family":"Kose","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5113-0118","authenticated-orcid":false,"given":"Hakan","family":"Gokcesu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Noyan","family":"Evirgen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7333-419X","authenticated-orcid":false,"given":"Kaan","family":"Gokcesu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4059-407X","authenticated-orcid":false,"given":"Muriel","family":"Medard","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.21236\/ADA461671"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/18.825799"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/18.850663"},{"key":"ref13","first-page":"11","article-title":"On randomized network coding","volume":"41","author":"ho","year":"2003","journal-title":"Proc Annu Allerton Conf Commun Control Comput"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.881746"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/PIMRC.2017.8292404"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/9.182479"},{"key":"ref17","first-page":"1","article-title":"A systematic approach to network coding problems using conflict graphs","author":"sundararajan","year":"2006","journal-title":"UCSD Inf Theory and Appl Workshop"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2007.137"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(80)90074-X"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/18.21215"},{"key":"ref3","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1145\/1161089.1161116","article-title":"On the complexity of scheduling in wireless networks","author":"sharma","year":"2006","journal-title":"Proc 12th Annu Int Conf Mobile Comput Netw"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2010.2089534"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2011.2180736"},{"key":"ref8","doi-asserted-by":"crossref","first-page":"1804","DOI":"10.1109\/INFCOM.2005.1498460","article-title":"The impact of imperfect scheduling on cross-layer rate control in wireless networks","volume":"3","author":"lin","year":"2005","journal-title":"Proc IEEE 24th Annu Joint Conf IEEE Comput Commun Soc"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.913537"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/26.52656"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2119630"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1984.1056928"},{"key":"ref20","first-page":"194","article-title":"A revision of minty’s algorithm for finding a maximum weight stable set of a claw-free graph","volume":"44","author":"nakamura","year":"2001","journal-title":"J Oper Res Soc Jpn"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/2629600"},{"key":"ref21","author":"schrijver","year":"2003","journal-title":"Combinatorial Optimization Polyhedra and Efficiency"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973402.43"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.jda.2008.04.001"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511734885.008"}],"container-title":["IEEE Transactions on Wireless Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7693\/9319597\/09207870.pdf?arnumber=9207870","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,8]],"date-time":"2023-10-08T17:30:09Z","timestamp":1696786209000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9207870\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1]]},"references-count":25,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/twc.2020.3025448","relation":{},"ISSN":["1536-1276","1558-2248"],"issn-type":[{"value":"1536-1276","type":"print"},{"value":"1558-2248","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,1]]}}}