default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKen C. K. Fong
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j5]Kin-Hon Ho
, Yun Hou, Michael Georgiades, Ken C. K. Fong:
Exploring Key Properties and Predicting Price Movements of Cryptocurrency Market Using Social Network Analysis. IEEE Access 12: 65058-65077 (2024)- 2021
- [j4]Vincent Chau, Chi Kit Ken Fong, Shengxin Liu, Elaine Yinling Wang, Yong Zhang:
Minimizing energy on homogeneous processors with shared memory. Theor. Comput. Sci. 866: 160-170 (2021) - 2020
- [j3]Vincent Chau, Xin Chen, Ken C. K. Fong, Minming Li, Kai Wang:
Flow shop for dual CPUs in dynamic voltage scaling. Theor. Comput. Sci. 819: 24-34 (2020) - [j2]Zhihuai Chen, Ken C. K. Fong, Minming Li, Kai Wang, Hongning Yuan, Yong Zhang:
Facility location games with optional preference. Theor. Comput. Sci. 847: 185-197 (2020) - 2016
- [j1]Ken C. K. Fong, Minming Li, Hongyu Liang, Linji Yang, Hao Yuan:
Average-case complexity of the min-sum matrix product problem. Theor. Comput. Sci. 609: 76-86 (2016)
Conference and Workshop Papers
- 2024
- [c9]Chi Kit Ken Fong, Xingchen Sha, Hau Chan, Vincent Chau, Wai-Lun Lo:
Randomized Strategyproof Mechanisms for Multi-Stage Facility Location Problem with Capacity Constraints. IJTCS-FAW 2024: 211-224 - 2023
- [c8]Xuezhen Wang, Vincent Chau, Hau Chan, Ken C. K. Fong, Minming Li:
Multi-Stage Facility Location Problems with Transient Agents. AAAI 2023: 5850-5857 - 2022
- [c7]Lu Han, Vincent Chau, Chi Kit Ken Fong:
Approximation Algorithms for Prize-Collecting Capacitated Network Design Problems. FAW 2022: 219-232 - 2020
- [c6]Vincent Chau, Chi Kit Ken Fong, Shengxin Liu, Elaine Yinling Wang, Yong Zhang:
Minimizing Energy on Homogeneous Processors with Shared Memory. FAW 2020: 83-95 - 2018
- [c5]Chi Kit Ken Fong, Minming Li, Pinyan Lu, Taiki Todo, Makoto Yokoo:
Facility Location Games With Fractional Preferences. AAAI 2018: 1039-1046 - 2017
- [c4]Ken C. K. Fong, Minming Li, Yungao Li, Sheung-Hung Poon, Weiwei Wu, Yingchao Zhao:
Scheduling Tasks to Minimize Active Time on a Processor with Unlimited Capacity. TAMC 2017: 247-259 - 2016
- [c3]Vincent Chau, Ken C. K. Fong, Minming Li, Kai Wang:
Flow Shop for Dual CPUs in Dynamic Voltage Scaling. COCOON 2016: 520-531 - [c2]Hongning Yuan, Kai Wang, Ken C. K. Fong, Yong Zhang, Minming Li:
Facility Location Games with Optional Preference. ECAI 2016: 1520-1527 - 2014
- [c1]Ken C. K. Fong, Minming Li, Hongyu Liang, Linji Yang, Hao Yuan:
Average-Case Complexity of the Min-Sum Matrix Product Problem. ISAAC 2014: 41-52
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-16 23:08 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:
