Kameda, Tsunehiko; Suzuki, Ichiro; Yamashita, Masafumi An alternative proof for the equivalence of searcher and 2-searcher. (English) Zbl 1339.68270 Theor. Comput. Sci. 634, 108-119 (2016). MSC: 68U05 PDFBibTeX XMLCite \textit{T. Kameda} et al., Theor. Comput. Sci. 634, 108--119 (2016; Zbl 1339.68270) Full Text: DOI
Yamashita, M.; Umemoto, H.; Suzuki, I.; Kameda, T. Searching for mobile intruders in a polygonal region by a group of mobile searchers. (English) Zbl 0980.68033 Algorithmica 31, No. 2, 208-236 (2001). MSC: 68P10 68W05 PDFBibTeX XMLCite \textit{M. Yamashita} et al., Algorithmica 31, No. 2, 208--236 (2001; Zbl 0980.68033) Full Text: DOI
Yamashita, Masafumi; Kameda, Tsunehiko Modeling \(k\)-coteries by well-covered graphs. (English) Zbl 0984.05047 Networks 34, No. 3, 221-228 (1999). MSC: 05C35 05C69 90C35 PDFBibTeX XMLCite \textit{M. Yamashita} and \textit{T. Kameda}, Networks 34, No. 3, 221--228 (1999; Zbl 0984.05047) Full Text: DOI
Suzuki, Ichiro; Yamashita, Masafumi; Umemoto, Hideki; Kameda, Tsunehiko Bushiness and a tight worst-case upper bound on the search number of a simple polygon. (English) Zbl 1077.68918 Inf. Process. Lett. 66, No. 1, 49-52 (1998). MSC: 68U05 PDFBibTeX XMLCite \textit{I. Suzuki} et al., Inf. Process. Lett. 66, No. 1, 49--52 (1998; Zbl 1077.68918) Full Text: DOI
Yamashita, M.; Kameda, T. Computing functions on asynchronous anonymous networks. (English) Zbl 0848.68007 Math. Syst. Theory 29, No. 4, 331-356 (1996); erratum ibid 31, 109 (1998). MSC: 68M10 PDFBibTeX XMLCite \textit{M. Yamashita} and \textit{T. Kameda}, Math. Syst. Theory 29, No. 4, 331--356 (1996; Zbl 0848.68007) Full Text: DOI
de Werra, Dominique; Hell, P.; Kameda, T.; Katoh, N.; Solot, Ph.; Yamashita, M. Graph endpoint coloring and distributed processing. (English) Zbl 0772.68008 Networks 23, No. 2, 93-98 (1993). MSC: 68M10 68R10 68W15 PDFBibTeX XMLCite \textit{D. de Werra} et al., Networks 23, No. 2, 93--98 (1993; Zbl 0772.68008) Full Text: DOI