Qiaosheng Shi

Robert Benkoczi, Binay K. Bhattacharya, Yuzhuang Hu, Chien-Hsin Lin, Qiaosheng Shi, Biing-Feng Wang: Efficient algorithms for the conditional covering problem. Inf. Comput. 219: 39-57 (2012)

Ei Ando, Binay K. Bhattacharya, Yuzhuang Hu, Tsunehiko Kameda, Qiaosheng Shi: Selecting Good a Priori Sequences for Vehicle Routing Problem with Stochastic Demand. ICTAC 2011: 45-61

Binay K. Bhattacharya, Qiaosheng Shi, Arie Tamir: Optimal Algorithms for the Path/Tree-Shaped Facility Location Problems in Trees. Algorithmica 55(4): 601-618 (2009)

Binay K. Bhattacharya, Mike Burmester, Yuzhuang Hu, Evangelos Kranakis, Qiaosheng Shi, Andreas Wiese: Optimal movement of mobile sensors for barrier coverage of a planar region. Theor. Comput. Sci. 410(52): 5515-5528 (2009)

Binay K. Bhattacharya, Yuzhuang Hu, Qiaosheng Shi: Approximation Algorithms for a Network Design Problem. COCOON 2009: 225-237

Binay K. Bhattacharya, Yuzhuang Hu, Qiaosheng Shi, Evangelos Kranakis, Danny Krizanc: Sensor network connectivity with multiple directional antennae of a given angular sum. IPDPS 2009: 1-11

Robert Benkoczi, Binay K. Bhattacharya, Qiaosheng Shi: New Upper Bounds on Continuous Tree Edge-Partition Problem. AAIM 2008: 38-49

Qiaosheng Shi, Binay K. Bhattacharya: Application of computational geometry to network p-center location problems. CCCG 2008

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

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

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)

Boaz Ben-Moshe, Binay K. Bhattacharya, Sandip Das, Daya Ram Gaur, Qiaosheng Shi: Computing a planar widest empty alpha-siphon in o(n³) time. CCCG 2007: 33-36

Binay K. Bhattacharya, Qiaosheng Shi: Optimal Algorithms for the Weighted p -Center Problems on the Real Line for Small p. WADS 2007: 529-540

Binay K. Bhattacharya, John Z. Zhang, Qiaosheng Shi, Tsunehiko Kameda: An Optimal Solution to Room Search Problem. CCCG 2006

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

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

Boaz Ben-Moshe, Binay K. Bhattacharya, Qiaosheng Shi: Computing the Widest Empty Boomerang. CCCG 2005: 80-83

Boaz Ben-Moshe, Binay K. Bhattacharya, Qiaosheng Shi: Farthest Neighbor Voronoi Diagram in the Presence of Rectangular Obstacles. CCCG 2005: 243-246

Boaz Ben-Moshe, Binay K. Bhattacharya, Qiaosheng Shi: Efficient Algorithms for the Weighted 2-Center Problem in a Cactus Graph. ISAAC 2005: 693-703