{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,31]],"date-time":"2025-05-31T16:41:36Z","timestamp":1748709696635},"publisher-location":"New York, NY, USA","reference-count":26,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2006,9,29]]},"DOI":"10.1145\/1161089.1161119","type":"proceedings-article","created":{"date-parts":[[2006,10,18]],"date-time":"2006-10-18T22:04:00Z","timestamp":1161209040000},"page":"262-273","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":135,"title":["Efficient interference-aware TDMA link scheduling for static wireless networks"],"prefix":"10.1145","author":[{"given":"Weizhao","family":"Wang","sequence":"first","affiliation":[{"name":"Illinois Institute of Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yu","family":"Wang","sequence":"additional","affiliation":[{"name":"University of North Carolina at Charlotte"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiang-Yang","family":"Li","sequence":"additional","affiliation":[{"name":"Illinois Institute of Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wen-Zhan","family":"Song","sequence":"additional","affiliation":[{"name":"Washington State University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ophir","family":"Frieder","sequence":"additional","affiliation":[{"name":"Illinois Institute of Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2006,9,29]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1080829.1080836"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1984.1056928"},{"key":"e_1_3_2_1_3_1","unstructured":"A. Behzad and I. Rubin. On the performance of graph-based scheduling algorithms for packet radio networks. In GlobeCom'03.  A. Behzad and I. Rubin. On the performance of graph-based scheduling algorithms for packet radio networks. In GlobeCom'03."},{"key":"e_1_3_2_1_4_1","volume-title":"North-Holland","author":"Berge C.","year":"1973","unstructured":"C. Berge . Graphs and Hyper Graphs . North-Holland , 1973 . C. Berge. Graphs and Hyper Graphs. North-Holland, 1973."},{"key":"e_1_3_2_1_5_1","unstructured":"L. Chen S.H. Low J.C. Doyle. Joint congestion control and media access control design for wireless ad hoc networks. In InfoCom'05.  L. Chen S.H. Low J.C. Doyle. Joint congestion control and media access control design for wireless ad hoc networks. In InfoCom'05."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2006.142"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/26.52656"},{"key":"e_1_3_2_1_8_1","first-page":"14","article-title":"On the NP completeness of certain network testing problems","author":"Even S.","year":"1984","unstructured":"S. Even , O. Goldreich , S. Moran , and P. Tong . On the NP completeness of certain network testing problems . Networks , 14 , 1984 . S. Even, O. Goldreich, S. Moran, and P. Tong. On the NP completeness of certain network testing problems. Networks, 14, 1984.","journal-title":"Networks"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1998.1587"},{"key":"e_1_3_2_1_10_1","unstructured":"S. Gandham M. Dawande and R. Prakash. Link scheduling in sensor networks: Distributed edge coloring revisited. In InfoCom'05.  S. Gandham M. Dawande and R. Prakash. Link scheduling in sensor networks: Distributed edge coloring revisited. In InfoCom'05."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/28395.28429"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/501449.501453"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.825799"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(83)90080-X"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/938985.938993"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2004.1365507"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/938985.938991"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1080829.1080837"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1012311216333"},{"volume-title":"ACM SODA'04","author":"Kumar A.","key":"e_1_3_2_1_20_1","unstructured":"A. Kumar , M. Marathe , S. Parthasarathy , A. Srinivasan . End-to-end packet-scheduling in wireless ad-hoc networks . In ACM SODA'04 . A. Kumar, M. Marathe, S. Parthasarathy, A. Srinivasan. End-to-end packet-scheduling in wireless ad-hoc networks. In ACM SODA'04."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1071690.1064228"},{"key":"e_1_3_2_1_22_1","volume-title":"ACM SODA","author":"Marco G. D.","year":"2001","unstructured":"G. D. Marco and A. Pelc . Fast distributed graph coloring with o \u00c4) colors . In ACM SODA , 2001 . G. D. Marco and A. Pelc. Fast distributed graph coloring with o \u00c4) colors. In ACM SODA, 2001."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1073970.1073977"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/PL00008932"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/129712.129769"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1019126406181"}],"event":{"name":"MobiCom06: 12th Annual International Conference on Mobile Computing and Networking","sponsor":["SIGMOBILE ACM Special Interest Group on Mobility of Systems, Users, Data and Computing","ACM Association for Computing Machinery"],"location":"Los Angeles CA USA","acronym":"MobiCom06"},"container-title":["Proceedings of the 12th annual international conference on Mobile computing and networking"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1161089.1161119","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,6]],"date-time":"2023-01-06T12:25:45Z","timestamp":1673007945000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1161089.1161119"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,9,29]]},"references-count":26,"alternative-id":["10.1145\/1161089.1161119","10.1145\/1161089"],"URL":"https:\/\/doi.org\/10.1145\/1161089.1161119","relation":{},"subject":[],"published":{"date-parts":[[2006,9,29]]},"assertion":[{"value":"2006-09-29","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}