default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFu-Hong Liu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c6]Alison Hsiang-Hsuan Liu, Fu-Hong Liu:
Scheduling with Locality by Routing. MFCS 2024: 69:1-69:15- 2023
- [c5]Alison Hsiang-Hsuan Liu
, Fu-Hong Liu, Prudence W. H. Wong, Xiao-Ou Zhang:
The Power of Amortization on Scheduling with Explorable Uncertainty. WAOA 2023: 90-103 - 2021
- [j5]Fu-Hong Liu, Hsiang-Hsuan Liu, Prudence W. H. Wong:
Greedy is Optimal for Online Restricted Assignment and Smart Grid Scheduling for Unit Size Jobs. Theory Comput. Syst. 65(6): 1009-1032 (2021) - 2020
- [j4]Fu-Hong Liu, Hsiang-Hsuan Liu, Prudence W. H. Wong:
Non-preemptive Scheduling in a Smart Grid Model and Its Implications on Machine Minimization. Algorithmica 82(12): 3415-3457 (2020) - [j3]Fu-Hong Liu, Chong-Yu Xu, Xiao-xia Yang, Xu-chun Ye:
Controls of Climate and Land-Use Change on Terrestrial Net Primary Productivity Variation in a Subtropical Humid Basin. Remote. Sens. 12(21): 3525 (2020)
2010 – 2019
- 2019
- [j2]Thomas Erlebach, Fu-Hong Liu, Hsiang-Hsuan Liu, Mordechai Shalom, Prudence W. H. Wong, Shmuel Zaks:
Complexity and online algorithms for minimum skyline coloring of intervals. Theor. Comput. Sci. 788: 66-78 (2019) - [c4]Fu-Hong Liu, Hsiang-Hsuan Liu, Prudence W. H. Wong:
Greedy Is Optimal for Online Restricted Assignment and Smart Grid Scheduling for Unit Size Jobs. WAOA 2019: 217-231 - 2017
- [j1]Wing-Kai Hon, Ton Kloks, Fu-Hong Liu, Hsiang-Hsuan Liu, Tao-Ming Wang:
On the Grundy number of Cameron graphs. Electron. Notes Discret. Math. 63: 503-516 (2017) - [c3]Thomas Erlebach, Fu-Hong Liu, Hsiang-Hsuan Liu, Mordechai Shalom, Prudence W. H. Wong, Shmuel Zaks:
Complexity and Online Algorithms for Minimum Skyline Coloring of Intervals. COCOA (2) 2017: 317-332 - 2016
- [c2]Wing-Kai Hon, Ton Kloks, Fu-Hong Liu, Hsiang-Hsuan Liu:
Convex Independence in Permutation Graphs. COCOA 2016: 710-717 - [c1]Fu-Hong Liu, Hsiang-Hsuan Liu, Prudence W. H. Wong:
Optimal Nonpreemptive Scheduling in a Smart Grid Model. ISAAC 2016: 53:1-53:13 - [i6]Fu-Hong Liu, Hsiang-Hsuan Liu, Prudence W. H. Wong:
Optimal Nonpreemptive Scheduling in a Smart Grid Model. CoRR abs/1602.06659 (2016) - [i5]Wing-Kai Hon, Ton Kloks, Fu-Hong Liu, Hsiang-Hsuan Liu, Tao-Ming Wang:
On the Grundy number of Cameron graphs. CoRR abs/1604.07128 (2016) - [i4]Wing-Kai Hon, Ton Kloks, Fu-Hong Liu, Hsiang-Hsuan Liu, Tao-Ming Wang:
P_3-Games. CoRR abs/1608.05169 (2016) - [i3]Wing-Kai Hon, Ton Kloks, Fu-Hong Liu, Hsiang-Hsuan Liu:
Convex Independence in Permutation Graphs. CoRR abs/1609.02657 (2016) - [i2]Wing-Kai Hon, Ton Kloks, Fu-Hong Liu, Hsiang-Hsuan Liu, Tao-Ming Wang, Yue-Li Wang:
P_3-Games on Chordal Bipartite Graphs. CoRR abs/1610.07018 (2016) - 2015
- [i1]Wing-Kai Hon, Ton Kloks, Fu-Hong Liu, Hsiang-Hsuan Liu, Hung-Lung Wang:
Flood-it on AT-Free Graphs. CoRR abs/1511.01806 (2015)
Coauthor Index
aka: Alison Hsiang-Hsuan Liu
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-08-27 21: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:
