The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Tsunehiko Kameda: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  17. Surveillance of a polygonal area by a mobile searcher from the boundary: Searchability testing. [Citation Graph (, )][DBLP]


  18. Finding the Minimum-Distance Schedule for a Boundary Searcher with a Flashlight. [Citation Graph (, )][DBLP]


  19. A Linear-Time Algorithm for Finding All Door Locations That Make a Room Searchable. [Citation Graph (, )][DBLP]


  20. Where to Build a Door. [Citation Graph (, )][DBLP]


  21. Generating asymptotically optimal broadcasting schedules to minimize average waiting time. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.004secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002