The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Qiaosheng Shi: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Boaz Ben-Moshe, Binay K. Bhattacharya, Qiaosheng Shi
    Farthest Neighbor Voronoi Diagram in the Presence of Rectangular Obstacles. [Citation Graph (0, 0)][DBLP]
    CCCG, 2005, pp:243-246 [Conf]
  2. Boaz Ben-Moshe, Binay K. Bhattacharya, Qiaosheng Shi
    Computing the Widest Empty Boomerang. [Citation Graph (0, 0)][DBLP]
    CCCG, 2005, pp:80-83 [Conf]
  3. Boaz Ben-Moshe, Binay K. Bhattacharya, Qiaosheng Shi
    Efficient Algorithms for the Weighted 2-Center Problem in a Cactus Graph. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2005, pp:693-703 [Conf]
  4. Binay K. Bhattacharya, Yuzhuang Hu, Qiaosheng Shi, Arie Tamir
    Optimal Algorithms for the Path/Tree-Shaped Facility Location Problems in Trees. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2006, pp:379-388 [Conf]
  5. Boaz Ben-Moshe, Binay K. Bhattacharya, Qiaosheng Shi
    An Optimal Algorithm for the Continuous/Discrete Weighted 2-Center Problem in Trees. [Citation Graph (0, 0)][DBLP]
    LATIN, 2006, pp:166-177 [Conf]
  6. 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]
  7. Boaz Ben-Moshe, Binay K. Bhattacharya, Sandip Das, Daya Ram Gaur, Qiaosheng Shi
    Computing a planar widest empty alpha-siphon in o(n3) time. [Citation Graph (0, 0)][DBLP]
    CCCG, 2007, pp:33-36 [Conf]
  8. Binay K. Bhattacharya, Qiaosheng Shi
    Optimal Algorithms for the Weighted p -Center Problems on the Real Line for Small p. [Citation Graph (0, 0)][DBLP]
    WADS, 2007, pp:529-540 [Conf]
  9. Boaz Ben-Moshe, Binay K. Bhattacharya, Qiaosheng Shi, Arie Tamir
    Efficient algorithms for center problems in cactus networks. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:378, n:3, pp:237-252 [Journal]

  10. New Upper Bounds on Continuous Tree Edge-Partition Problem. [Citation Graph (, )][DBLP]


  11. Application of computational geometry to network p-center location problems. [Citation Graph (, )][DBLP]


  12. Approximation Algorithms for a Network Design Problem. [Citation Graph (, )][DBLP]


  13. Sensor network connectivity with multiple directional antennae of a given angular sum. [Citation Graph (, )][DBLP]


  14. Single Vehicle Scheduling Problems on Path/Tree/Cycle Networks with Release and Handling Times. [Citation Graph (, )][DBLP]


  15. Optimal Movement of Mobile Sensors for Barrier Coverage of a Planar Region. [Citation Graph (, )][DBLP]


  16. Optimal Algorithms for the Path/Tree-Shaped Facility Location Problems in Trees. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.002secs
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