| 2008 |
|---|
| 18 | EE | John Z. Zhang,
Tsunehiko Kameda:
A Linear-Time Algorithm for Finding All Door Locations That Make a Room Searchable.
TAMC 2008: 502-513 |
| 2006 |
|---|
| 17 | EE | Binay K. Bhattacharya,
John Z. Zhang,
Qiaosheng Shi,
Tsunehiko Kameda:
An Optimal Solution to Room Search Problem.
CCCG 2006 |
| 16 | EE | Tsunehiko Kameda,
John Z. Zhang,
Masafumi Yamashita:
Characterization of Polygons Searchable by a Boundary 1-Searcher.
CCCG 2006 |
| 15 | EE | John Z. Zhang,
Tsunehiko Kameda:
Where to Build a Door.
IROS 2006: 4084-4090 |
| 14 | EE | Mingjun Edward Yan,
Tsunehiko Kameda:
Generalized Fibonacci broadcasting: An efficient VOD scheme with user bandwidth limit.
Discrete Applied Mathematics 154(16): 2418-2429 (2006) |
| 2005 |
|---|
| 13 | EE | Tsunehiko Kameda,
Yi Sun,
Luis A. Goddyn:
An Optimization Problem Related to VoD Broadcasting.
ISAAC 2005: 116-125 |
| 12 | EE | Yi Sun,
Tsunehiko Kameda:
Harmonic Block Windows Scheduling Through Harmonic Windows Scheduling.
Multimedia Information Systems 2005: 190-206 |
| 2001 |
|---|
| 11 | EE | Masafumi Yamashita,
Hideki Umemoto,
Ichiro Suzuki,
Tsunehiko Kameda:
Searching for Mobile Intruders in a Polygonal Region by a Group of Mobile Searchers.
Algorithmica 31(2): 208-236 (2001) |
| 1999 |
|---|
| 10 | EE | Masafumi Yamashita,
Tsunehiko Kameda:
Leader Election Problem on Networks in which Processor Identity Numbers Are Not Distinct.
IEEE Trans. Parallel Distrib. Syst. 10(9): 878-887 (1999) |
| 9 | EE | Masafumi Yamashita,
Tsunehiko Kameda:
Modeling K-coteries by well-covered graphs.
Networks 34(3): 221-228 (1999) |
| 1998 |
|---|
| 8 | EE | Ichiro Suzuki,
Masafumi Yamashita,
Hideki Umemoto,
Tsunehiko Kameda:
Bushiness and a Tight Worst-Case Upper Bound on the Search Number of a Simple Polygon.
Inf. Process. Lett. 66(1): 49-52 (1998) |
| 1997 |
|---|
| 7 | EE | Masafumi Yamashita,
Hideki Umemoto,
Ichiro Suzuki,
Tsunehiko Kameda:
Searching for Mobile Intruders in a Polygonal Region by a Group of Mobile Searchers (Extended Abstract).
Symposium on Computational Geometry 1997: 448-450 |
| 1996 |
|---|
| 6 | EE | Masafumi Yamashita,
Tsunehiko Kameda:
Computing on Anonymous Networks: Part I-Characterizing the Solvable Cases.
IEEE Trans. Parallel Distrib. Syst. 7(1): 69-89 (1996) |
| 5 | EE | Masafumi Yamashita,
Tsunehiko Kameda:
Computing on Anonymous Networks: Part II-Decision and Membership Problems.
IEEE Trans. Parallel Distrib. Syst. 7(1): 90-96 (1996) |
| 1995 |
|---|
| 4 | | Toshihide Ibaraki,
Hiroshi Nagamochi,
Tsunehiko Kameda:
Optimal Coteries for Rings and Related Networks.
Distributed Computing 8(4): 191-201 (1995) |
| 1994 |
|---|
| 3 | | Tsunehiko Kameda,
J. Ting,
D. Fracchia:
A guaranteed-rate channel allocation scheme and its application to delivery-on-demand of continuous media data.
Protocols for High-Speed Networks 1994: 260-275 |
| 1982 |
|---|
| 2 | | Toshihide Ibaraki,
Tsunehiko Kameda:
Deadlock-Free Systems for a Bounded Number of Processes.
IEEE Trans. Computers 31(3): 188-193 (1982) |
| 1981 |
|---|
| 1 | | Toshihide Ibaraki,
Tsunehiko Kameda,
Shunichi Toida:
On Minimal Test Sets for Locating Single Link Failures in Networks.
IEEE Trans. Computers 30(3): 182-190 (1981) |
