Y. Afek, B. Awerbuch, E. Gafni, Y. Mansour, A. Rosén et al., Slide???The Key to Polynomial End-to-End Communication, Journal of Algorithms, vol.22, issue.1, pp.158-186, 1997.
DOI : 10.1006/jagm.1996.0819

W. Aiello, R. Ostrovsky, E. Kushilevitz, and A. Rosén, Dynamic routing on networks with fixed-size buffers, Proceedings of SODA, pp.771-780, 2003.

B. Awerbuch, A. Brinkmann, and C. Scheideler, Anycasting in Adversarial Systems: Routing and Admission Control, Proceedings of ICALP, pp.1153-1168, 2003.
DOI : 10.1007/3-540-45061-0_88

B. Awerbuch, Y. Mansour, and N. Shavit, Polynomial end-to-end communication (extended abstract), Proceedings of FOCS, pp.358-363, 1989.

J. Van-benthem, An Essay on Sabotage and Obstruction, Lecture Notes in Computer Science, vol.2605, pp.268-276, 2005.
DOI : 10.1007/978-3-540-32254-2_16

L. Gao and X. Wang, A game approach for multi-channel allocation in multi-hop wireless networks, Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing , MobiHoc '08, pp.303-312, 2008.
DOI : 10.1145/1374618.1374659

N. Gierasimczuk, L. Kurzen, and F. R. Velázquez-quesada, Learning and Teaching as a Game: A Sabotage Approach, Proceedings of LORI, pp.119-132, 2009.
DOI : 10.1007/978-3-642-04893-7_10

F. Horn, W. Thomas, and N. Wallmeier, Optimal Strategy Synthesis in Request-Response Games, Proceedings of ATVA, pp.361-373, 2008.
DOI : 10.1016/0304-3975(95)00188-3

D. Klein, F. G. Radmacher, and W. Thomas, The Complexity of Reachability in Randomized Sabotage Games, Proceedings of FSEN, pp.162-177, 2009.
DOI : 10.1007/978-3-642-11623-0_9

C. Löding and P. Rohde, Model Checking and Satisfiability for Sabotage Modal Logic, Proceedings of FSTTCS, pp.302-313, 2003.
DOI : 10.1007/978-3-540-24597-1_26

C. Löding and P. Rohde, Solving the Sabotage Game Is PSPACE-Hard, Proceedings of MFCS, pp.531-540, 2003.
DOI : 10.1007/978-3-540-45138-9_47

F. G. Radmacher and W. Thomas, A Game Theoretic Approach to the Analysis of Dynamic Networks, Proceedings of VerAS. Electronic Notes in Theoretical Computer Science, pp.21-37, 2008.
DOI : 10.1016/j.entcs.2008.02.010

P. Rohde, Moving in a Crumbling Network: The Balanced Case, Proceedings of CSL. Lecture Notes in Computer Science, pp.310-324, 2004.
DOI : 10.1007/978-3-540-30124-0_25

P. Rohde, On Games and Logics over Dynamically Changing Structures, 2005.

H. P. Shiang and M. Van-der-schaar, Distributed Resource Management in Multihop Cognitive Radio Networks for Delay-Sensitive Transmission, IEEE Transactions on Vehicular Technology, vol.58, issue.2, pp.941-953, 2009.
DOI : 10.1109/TVT.2008.925308

W. Thomas, On the synthesis of strategies in infinite games, Proceedings of STACS. Lecture Notes in Computer Science, pp.1-13, 1995.
DOI : 10.1007/3-540-59042-0_57

C. Xin, L. Ma, and C. C. Shen, A Path-Centric Channel Assignment Framework for Cognitive Radio Wireless Networks, Mobile Networks and Applications, vol.5, issue.6, pp.463-476, 2008.
DOI : 10.1007/s11036-008-0084-y