default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDQiaosheng Shi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
[j7]Li Zhu, Li Li, Yue Zhang, Qiaosheng Shi:
Strategic IT investment in B2B e-commerce platform on user loyalty: considering variable investment cost. Int. J. Netw. Virtual Organisations 17(2/3): 290-313 (2017)- 2014
- [j6]Binay K. Bhattacharya, Qiaosheng Shi:
Improved algorithms to network p-center location problems. Comput. Geom. 47(2): 307-315 (2014) - [j5]Li Li
, Jie He, Qiaosheng Shi:
Dual-channel pricing strategies for small and medium-sized enterprises. Int. J. Serv. Technol. Manag. 20(1/2/3): 47-70 (2014) - 2012
- [j4]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) - 2011
- [c15]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
2000 – 2009
- 2009
- [j3]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) - [j2]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) - [c14]Binay K. Bhattacharya, Yuzhuang Hu, Qiaosheng Shi:
Approximation Algorithms for a Network Design Problem. COCOON 2009: 225-237 - [c13]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 - 2008
- [c12]Robert Benkoczi, Binay K. Bhattacharya, Qiaosheng Shi:
New Upper Bounds on Continuous Tree Edge-Partition Problem. AAIM 2008: 38-49 - [c11]Qiaosheng Shi, Binay K. Bhattacharya:
Application of computational geometry to network p-center location problems. CCCG 2008 - [c10]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. COCOA 2008: 103-115 - [c9]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
- [j1]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) - [c8]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 - [c7]Binay K. Bhattacharya, Qiaosheng Shi:
Optimal Algorithms for the Weighted p -Center Problems on the Real Line for Small p. WADS 2007: 529-540 - 2006
- [c6]Binay K. Bhattacharya, John Z. Zhang, Qiaosheng Shi, Tsunehiko Kameda:
An Optimal Solution to Room Search Problem. CCCG 2006 - [c5]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 - [c4]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
- [c3]Boaz Ben-Moshe, Binay K. Bhattacharya, Qiaosheng Shi:
Computing the Widest Empty Boomerang. CCCG 2005: 80-83 - [c2]Boaz Ben-Moshe, Binay K. Bhattacharya, Qiaosheng Shi:
Farthest Neighbor Voronoi Diagram in the Presence of Rectangular Obstacles. CCCG 2005: 243-246 - [c1]Boaz Ben-Moshe, Binay K. Bhattacharya, Qiaosheng Shi:
Efficient Algorithms for the Weighted 2-Center Problem in a Cactus Graph. ISAAC 2005: 693-703
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 13:12 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
