default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHsiao-Fei Liu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2011
[j8]Cheng-Wei Luo, Hsiao-Fei Liu, Peng-An Chen, Kun-Mao Chao
:
Minkowski Sum Selection and Finding. Int. J. Comput. Geom. Appl. 21(3): 283-311 (2011)- [j7]Cheng-Wei Luo, Ming-Chiang Chen, Yi-Ching Chen, Roger W. L. Yang, Hsiao-Fei Liu, Kun-Mao Chao:
Linear-Time Algorithms for the Multiple Gene Duplication Problems. IEEE ACM Trans. Comput. Biol. Bioinform. 8(1): 260-265 (2011) - 2009
- [j6]Hsiao-Fei Liu, Kun-Mao Chao:
On Locating Disjoint Segments with Maximum Sum of Densities. Algorithmica 54(1): 107-117 (2009) - [j5]Chih-Huai Cheng, Hsiao-Fei Liu, Kun-Mao Chao:
Optimal algorithms for the average-constrained maximum-sum segment problem. Inf. Process. Lett. 109(3): 171-174 (2009) - 2008
- [j4]Peng-An Chen, Hsiao-Fei Liu, Kun-Mao Chao:
CNVDetector: locating copy number variations using array CGH data. Bioinform. 24(23): 2773-2775 (2008) - [j3]Hsiao-Fei Liu, Kun-Mao Chao:
Algorithms for finding the weight-constrained k longest paths in a tree and the length-constrained k maximum-sum segments of a sequence. Theor. Comput. Sci. 407(1-3): 349-358 (2008) - 2007
- [j2]Hsiao-Fei Liu, Kun-Mao Chao:
A tight analysis of the Katriel-Bodlaender algorithm for online topological ordering. Theor. Comput. Sci. 389(1-2): 182-189 (2007) - 2004
- [j1]Hsiao-Fei Liu, Ya-Hui Chang, Kun-Mao Chao:
An Optimal Algorithm for Querying Tree Structures and its Applications in Bioinformatics. SIGMOD Rec. 33(2): 21-26 (2004)
Conference and Workshop Papers
- 2013
- [c4]Hsiao-Fei Liu, Chung-Tsai Su, An-Chiang Chu:
Fast Quasi-biclique Mining with Giraph. BigData Congress 2013: 347-354 - 2008
- [c3]Cheng-Wei Luo, Hsiao-Fei Liu, Peng-An Chen, Kun-Mao Chao:
Minkowski Sum Selection and Finding. ISAAC 2008: 460-471 - 2007
- [c2]Hsiao-Fei Liu, Peng-An Chen, Kun-Mao Chao:
Algorithms for Computing the Length-Constrained Max-Score Segments with Applications to DNA Copy Number Data Analysis. ISAAC 2007: 834-845 - 2006
- [c1]Hsiao-Fei Liu, Kun-Mao Chao:
On Locating Disjoint Segments with Maximum Sum of Densities. ISAAC 2006: 300-307
Informal and Other Publications
- 2008
- [i3]Hsiao-Fei Liu, Kun-Mao Chao:
An Õ(n2.5)-Time Algorithm for Online Topological Ordering. CoRR abs/0804.3860 (2008) - [i2]Cheng-Wei Luo, Hsiao-Fei Liu, Peng-An Chen, Kun-Mao Chao:
Minkowski Sum Selection and Finding. CoRR abs/0809.1171 (2008) - [i1]Hsiao-Fei Liu, Peng-An Chen, Kun-Mao Chao:
Algorithms for Locating Constrained Optimal Intervals. CoRR abs/0809.2097 (2008)
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 2024-04-24 22:58 CEST 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:
