{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T16:05:52Z","timestamp":1725552352059},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642131929"},{"type":"electronic","value":"9783642131936"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13193-6_40","type":"book-chapter","created":{"date-parts":[[2010,4,27]],"date-time":"2010-04-27T11:54:59Z","timestamp":1272369299000},"page":"474-485","source":"Crossref","is-referenced-by-count":0,"title":["Fault Recovery in Wireless Networks: The Geometric Recolouring Approach"],"prefix":"10.1007","author":[{"given":"Henk","family":"Meijer","sequence":"first","affiliation":[]},{"given":"Yurai","family":"N\u00fa\u00f1ez-Rodr\u00edguez","sequence":"additional","affiliation":[]},{"given":"David","family":"Rappaport","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"40_CR1","doi-asserted-by":"crossref","unstructured":"Adler, M., Demaine, E.D., Harvey, N.J.A., P\u01cetra\u015fcu, M.: Lower bounds for asymmetric communication channels and distributed source coding. In: Proc. 17th Annual ACM-SIAM Symp. on Disc. Alg. (SODA 2006), pp. 251\u2013260 (2006)","DOI":"10.1145\/1109557.1109586"},{"issue":"2","key":"40_CR2","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/S0166-218X(03)00261-0","volume":"137","author":"P. Flocchini","year":"2004","unstructured":"Flocchini, P., Lodi, E., Luccio, F., Pagli, L., Santoro, N.: Dynamic monopolies in tori. Disc. Applied Math.\u00a0137(2), 197\u2013212 (2004)","journal-title":"Disc. Applied Math."},{"key":"40_CR3","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/0012-365X(80)90121-1","volume":"30","author":"E. Goles","year":"1980","unstructured":"Goles, E., Olivos, J.: Periodic behaviour of generalized threshold functions. Disc. Math.\u00a030, 187\u2013189 (1980)","journal-title":"Disc. Math."},{"issue":"3","key":"40_CR4","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1109\/TC.2004.1261832","volume":"53","author":"B. Krishnamachari","year":"2004","unstructured":"Krishnamachari, B., Iyengar, S.: Distributed bayesian algorithms for fault-tolerant event region detection in wireless sensor networks. IEEE Trans. on Comp.\u00a053(3), 241\u2013250 (2004)","journal-title":"IEEE Trans. on Comp."},{"key":"40_CR5","unstructured":"Luccio, F., Pagli, L., Sanossian, H.: Irreversible dynamos in butterflies. In: Proc. 6th Intl. Colloq. on Structural Inf. and Comm. Complex, pp. 204\u2013218 (1999)"},{"issue":"6-7","key":"40_CR6","doi-asserted-by":"crossref","first-page":"690","DOI":"10.1016\/j.comgeo.2009.01.004","volume":"42","author":"H. Meijer","year":"2009","unstructured":"Meijer, H., N\u00fa\u00f1ez-Rodr\u00edguez, Y., Rappaport, D.: Bounds for point recolouring in geometric graphs. Comp. Geom.: Theory and Apps.\u00a042(6-7), 690\u2013703 (2009)","journal-title":"Comp. Geom.: Theory and Apps."},{"key":"40_CR7","unstructured":"N\u00fa\u00f1ez-Rodr\u00edguez, Y.: Problems on Geometric Graphs with Applications to Wireless Networks. PhD Thesis, School of Computing, Queen\u2019s University (2009), http:\/\/qspace.library.queensu.ca\/handle\/1974\/5335"},{"key":"40_CR8","unstructured":"Peleg, D.: Local majority voting, small coalitions and controlling monopolies in graphs: A review. Technical Report CS96-12, Department of Mathematics & Computer Science, Weizmann Institute of Science (1996)"},{"key":"40_CR9","doi-asserted-by":"crossref","unstructured":"Peleg, D.: Distributed Computing: A Locality-Sensitive Approach. SIAM Monographs on Disc. Math. and Apps. (2000)","DOI":"10.1137\/1.9780898719772"},{"issue":"3","key":"40_CR10","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1007\/s00453-007-9042-5","volume":"50","author":"I. Reinbacher","year":"2008","unstructured":"Reinbacher, I., Benkert, M., van Kreveld, M., Mitchell, J.S.B., Snoeyink, J., Wolff, A.: Delineating boundaries for imprecise regions. Algorithmica\u00a050(3), 386\u2013414 (2008)","journal-title":"Algorithmica"},{"issue":"4","key":"40_CR11","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1109\/TIT.1973.1055037","volume":"19","author":"D. Slepian","year":"1973","unstructured":"Slepian, D., Wolf, J.K.: Noiseless encodings of correlated information sources. IEEE Trans. on Inf. Theory\u00a019(4), 471\u2013480 (1973)","journal-title":"IEEE Trans. on Inf. Theory"},{"key":"40_CR12","doi-asserted-by":"crossref","unstructured":"Wan, P.J., Yi, C.W.: Asymptotic critical transmission radius and critical neighbour number for k-connectivity in wireless ad hoc networks. In: Proc. of the 5th ACM Intl. Symp. on Mobile Ad Hoc Networking and Comp., pp. 1\u20138 (2004)","DOI":"10.1145\/989459.989461"}],"container-title":["Lecture Notes in Computer Science","Experimental Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13193-6_40.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T03:02:40Z","timestamp":1606186960000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13193-6_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642131929","9783642131936"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13193-6_40","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}