Computing the Widest Empty Boomerang. - Boaz Ben-Moshe; Binay K. Bhattacharya; Qiaosheng Shi (CCCG, 2005)

Farthest Neighbor Voronoi Diagram in the Presence of Rectangular Obstacles. - Boaz Ben-Moshe; Binay K. Bhattacharya; Qiaosheng Shi (CCCG, 2005)

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

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

Optimal Algorithms for the Path/Tree-Shaped Facility Location Problems in Trees. - Binay K. Bhattacharya; Yuzhuang Hu; Qiaosheng Shi; Arie Tamir (ISAAC, 2006)

An Optimal Algorithm for the Continuous/Discrete Weighted 2-Center Problem in Trees. - Boaz Ben-Moshe; Binay K. Bhattacharya; Qiaosheng Shi (LATIN, 2006)

Computing a planar widest empty alpha-siphon in o(n3) time. - Boaz Ben-Moshe; Binay K. Bhattacharya; Sandip Das 001; Daya Ram Gaur; Qiaosheng Shi (CCCG, 2007)

Optimal Algorithms for the Weighted p -Center Problems on the Real Line for Small p. - Binay K. Bhattacharya; Qiaosheng Shi (WADS, 2007)

Efficient algorithms for center problems in cactus networks. - Boaz Ben-Moshe; Binay K. Bhattacharya; Qiaosheng Shi; Arie Tamir (Theor. Comput. Sci., 2007)

New Upper Bounds on Continuous Tree Edge-Partition Problem. - Robert Benkoczi; Binay K. Bhattacharya; Qiaosheng Shi (AAIM, 2008)

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

Single Vehicle Scheduling Problems on Path/Tree/Cycle Networks with Release and Handling Times. - Binay K. Bhattacharya; Paz Carmi; Yuzhuang Hu; Qiaosheng Shi (ISAAC, 2008)

Approximation Algorithms for a Network Design Problem. - Binay K. Bhattacharya; Yuzhuang Hu; Qiaosheng Shi (COCOON, 2009)

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

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

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

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

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

Improved algorithms to network p-center location problems. - Binay K. Bhattacharya; Qiaosheng Shi (Comput. Geom., 2014)

Dual-channel pricing strategies for small and medium-sized enterprises. - Li Li 090; Jie He; Qiaosheng Shi (Int. J. Serv. Technol. Manag., 2014)

Strategic IT investment in B2B e-commerce platform on user loyalty: considering variable investment cost. - Li Zhu; Li Li 090; Yue Zhang; Qiaosheng Shi (Int. J. Netw. Virtual Organisations, 2017)