default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDXiaozhou He
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j6]Wanzhe Hu, Xiaozhou He, Li Luo, Panos M. Pardalos
:
A branch-and-price approach for the nurse rostering problem with multiple units. Comput. Ind. Eng. 198: 110629 (2024)- 2022
- [j5]Xiaozhou He, Jie Xiang, Jin Xiao, T. C. E. Cheng, Yuhang Tian:
An online algorithm for the inventory retrieval problem with an uncertain selling duration, uncertain prices, and price-dependent demands. Comput. Oper. Res. 148: 105991 (2022) - 2021
- [j4]Xiaozhou He, Wenfeng Lai, Binhai Zhu, Peng Zou:
Dispersing and grouping points on planar segments. Theor. Comput. Sci. 886: 169-177 (2021) - 2020
- [j3]Sanjib Sadhu, Xiaozhou He, Sasanka Roy, Subhas C. Nandy, Suchismita Roy:
Corrigendum to: "Linear time algorithm to cover and hit a set of line segments optimally by two axis-parallel squares" [Theor. Comput. Sci. 769 (2019) 63-74]. Theor. Comput. Sci. 806: 632-640 (2020) - [c3]Xiaozhou He, Wenfeng Lai, Binhai Zhu, Peng Zou:
Dispersing and Grouping Points on Segments in the Plane. TAMC 2020: 340-351
2010 – 2019
- 2019
- [j2]Xiaozhou He, Zhihui Liu, Bing Su, Yinfeng Xu, Feifeng Zheng, Binhai Zhu:
Efficient algorithms for computing one or two discrete centers hitting a set of line segments. J. Comb. Optim. 37(4): 1408-1423 (2019) - [i2]Sanjib Sadhu, Xiaozhou He, Sasanka Roy, Subhas C. Nandy, Suchismita Roy:
Corrigendum to: "Linear time algorithm to cover and hit a set of line segments optimally by two axis-parallel squares", Theoretical Computer Science 769 (2019) 63-74. CoRR abs/1909.09445 (2019) - 2018
- [j1]Xiaozhou He, Yinfeng Xu:
The longest commonly positioned increasing subsequences problem. J. Comb. Optim. 35(2): 331-340 (2018) - [c2]Letu Qingge, Xiaozhou He, Zhihui Liu, Binhai Zhu:
On the Minimum Copy Number Generation Problem in Cancer Genomics. BCB 2018: 260-269 - [c1]Xiaozhou He, Zhihui Liu, Bing Su, Yinfeng Xu, Feifeng Zheng, Binhai Zhu:
Hitting a Set of Line Segments with One or Two Discrete Centers. CCCG 2018: 85-90 - [i1]Brittany Terese Fasy, Xiaozhou He, Zhihui Liu, Samuel Micka, David L. Millman, Binhai Zhu:
Approximate Nearest Neighbors in the Space of Persistence Diagrams. CoRR abs/1812.11257 (2018)
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-03-04 22:25 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:
