2008 |
13 | EE | Robert Benkoczi,
Binay K. Bhattacharya,
Qiaosheng Shi:
New Upper Bounds on Continuous Tree Edge-Partition Problem.
AAIM 2008: 38-49 |
12 | | Qiaosheng Shi,
Binay K. Bhattacharya:
Application of computational geometry to network p-center location problems.
CCCG 2008 |
11 | EE | Binay K. Bhattacharya,
B. Burmester,
Yuzhuang Hu,
Evangelos Kranakis,
Qiaosheng Shi,
Andreas Wiese:
Optimal Movement of Mobile Sensors for Barrier Coverage of a Planar Region.
COCOA 2008: 103-115 |
10 | EE | Binay K. Bhattacharya,
Paz Carmi,
Yuzhuang Hu,
Qiaosheng Shi:
Single Vehicle Scheduling Problems on Path/Tree/Cycle Networks with Release and Handling Times.
ISAAC 2008: 800-811 |
2007 |
9 | | Boaz Ben-Moshe,
Binay K. Bhattacharya,
Sandip Das,
Daya Ram Gaur,
Qiaosheng Shi:
Computing a planar widest empty alpha-siphon in o(n3) time.
CCCG 2007: 33-36 |
8 | EE | Binay K. Bhattacharya,
Qiaosheng Shi:
Optimal Algorithms for the Weighted p -Center Problems on the Real Line for Small p.
WADS 2007: 529-540 |
7 | EE | Boaz Ben-Moshe,
Binay K. Bhattacharya,
Qiaosheng Shi,
Arie Tamir:
Efficient algorithms for center problems in cactus networks.
Theor. Comput. Sci. 378(3): 237-252 (2007) |
2006 |
6 | EE | Binay K. Bhattacharya,
John Z. Zhang,
Qiaosheng Shi,
Tsunehiko Kameda:
An Optimal Solution to Room Search Problem.
CCCG 2006 |
5 | EE | Binay K. Bhattacharya,
Yuzhuang Hu,
Qiaosheng Shi,
Arie Tamir:
Optimal Algorithms for the Path/Tree-Shaped Facility Location Problems in Trees.
ISAAC 2006: 379-388 |
4 | EE | Boaz Ben-Moshe,
Binay K. Bhattacharya,
Qiaosheng Shi:
An Optimal Algorithm for the Continuous/Discrete Weighted 2-Center Problem in Trees.
LATIN 2006: 166-177 |
2005 |
3 | EE | Boaz Ben-Moshe,
Binay K. Bhattacharya,
Qiaosheng Shi:
Farthest Neighbor Voronoi Diagram in the Presence of Rectangular Obstacles.
CCCG 2005: 243-246 |
2 | EE | Boaz Ben-Moshe,
Binay K. Bhattacharya,
Qiaosheng Shi:
Computing the Widest Empty Boomerang.
CCCG 2005: 80-83 |
1 | EE | Boaz Ben-Moshe,
Binay K. Bhattacharya,
Qiaosheng Shi:
Efficient Algorithms for the Weighted 2-Center Problem in a Cactus Graph.
ISAAC 2005: 693-703 |