Author:
Yakami Takahiro,Yamauchi Yukiko,Kijima Shuji,Yamashita Masafumi
Publisher
Springer International Publishing
Reference19 articles.
1. Aleliunas, R., Karp, R.M., Lipton, R.J., Lovasz, L., Rackoff, C.: Random walks, universal traversal sequences, and the complexity of maze problems. In: Proceedings of the IEEE Symposium on Foundations of Computer Science (FOCS), pp. 218–223 (1979)
2. Barrière, L., Flocchini, P., Fraigniaud, P., Santoro, N.: Capture of an intruder by mobile agents. In: Proceedings of the Symposium on Parallel Algorithms and Architectures (SPAA), pp. 200–209 (2002)
3. Lecture Notes in Computer Science;L Blin,2006
4. Dieudonné, Y., Pelc, A., Villain, V.: How to meet asynchronously at polynomial cost. SIAM J. Comput. 44(3), 844–867 (2015)
5. Efrat, A., Guibas, L.J., Har-Peled, S., Lin, D., Mitchell, J., Murali, T.: Sweeping simple polygon with a chain of guards. In: Proceedings of the Symposium on Discrete Algorithms (SODA), pp. 927–936 (2000)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献