default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWun-Tat Chan
- > Home > Persons > Wun-Tat Chan
Publications
- 2016
[j21]Yong Zhang, Joseph Wun-Tat Chan, Francis Y. L. Chin, Hing-Fung Ting, Deshi Ye, Feng Zhang, Jianyu Shi:
Constrained pairwise and center-star sequences alignment problems. J. Comb. Optim. 32(1): 79-94 (2016)- 2014
- [c27]Yong Zhang, Joseph Wun-Tat Chan, Francis Y. L. Chin, Hing-Fung Ting, Deshi Ye, Feng Zhang, Jianyu Shi:
On the Complexity of Constrained Sequences Alignment Problems. FAW 2014: 309-319 - 2012
- [j20]Yong Zhang, Francis Y. L. Chin, Hing-Fung Ting, Joseph Wun-Tat Chan, Xin Han, Ka-Cheong Lam:
Online call control in cellular networks revisited. Inf. Process. Lett. 112(1-2): 21-25 (2012) - 2011
- [j18]Joseph Wun-Tat Chan, Francis Y. L. Chin, Hing-Fung Ting, Yong Zhang:
Online tree node assignment with resource augmentation. J. Comb. Optim. 22(3): 359-377 (2011) - 2010
- [j17]Joseph Wun-Tat Chan, Francis Y. L. Chin, Deshi Ye, Yong Zhang:
Absolute and Asymptotic Bounds for Online Frequency Allocation in Cellular Networks. Algorithmica 58(2): 498-515 (2010) - [c26]Joseph Wun-Tat Chan, Francis Y. L. Chin, Xin Han, Ka-Cheong Lam, Hing-Fung Ting, Yong Zhang:
Deterministic Online Call Control in Cellular Networks and Triangle-Free Cellular Networks. FAW 2010: 222-233 - [i1]Joseph Wun-Tat Chan, Francis Y. L. Chin, Xin Han, Ka-Cheong Lam, Hing-Fung Ting, Yong Zhang:
Deterministic Online Call Control in Cellular Networks and Triangle-Free Cellular Networks. CoRR abs/1009.2322 (2010) - 2009
- [c25]Joseph Wun-Tat Chan, Francis Y. L. Chin, Hing-Fung Ting, Yong Zhang:
Online Tree Node Assignment with Resource Augmentation. COCOON 2009: 358-367 - 2008
- [j13]Wun-Tat Chan, Francis Y. L. Chin, Deshi Ye, Guochuan Zhang
, Yong Zhang:
On-line scheduling of parallel jobs on two machines. J. Discrete Algorithms 6(1): 3-10 (2008) - 2007
- [j9]Joseph Wun-Tat Chan, Francis Y. L. Chin, Deshi Ye, Yong Zhang, Hong Zhu:
Greedy online frequency allocation in cellular networks. Inf. Process. Lett. 102(2-3): 55-61 (2007) - [j8]Wun-Tat Chan, Yong Zhang, Stanley P. Y. Fung, Deshi Ye, Hong Zhu:
Efficient algorithms for finding a longest common increasing subsequence. J. Comb. Optim. 13(3): 277-288 (2007) - [j7]Wun-Tat Chan, Francis Y. L. Chin, Deshi Ye, Guochuan Zhang, Yong Zhang:
Online bin packing of fragile objects with application in cellular networks. J. Comb. Optim. 14(4): 427-435 (2007) - [c22]Joseph Wun-Tat Chan, Francis Y. L. Chin, Deshi Ye, Yong Zhang:
Online frequency allocation in cellular networks. SPAA 2007: 241-249 - 2006
- [j6]Wun-Tat Chan, Francis Y. L. Chin, Yong Zhang, Hong Zhu, Hong Shen, Prudence W. H. Wong:
A dynamic programming approach of finding an optimal broadcast schedule in minimizing total flow time. J. Comb. Optim. 11(2): 177-187 (2006) - [c18]Joseph Wun-Tat Chan, Francis Y. L. Chin, Deshi Ye, Yong Zhang, Hong Zhu:
Frequency Allocation Problems for Linear Cellular Networks. ISAAC 2006: 61-70 - 2005
- [c16]Wun-Tat Chan, Francis Y. L. Chin, Yong Zhang, Hong Zhu, Hong Shen, Prudence W. H. Wong:
Off-Line Algorithms for Minimizing Total Flow Time in Broadcast Scheduling. COCOON 2005: 318-328 - [c14]Wun-Tat Chan, Yong Zhang, Stanley P. Y. Fung, Deshi Ye, Hong Zhu:
Efficient Algorithms for Finding a Longest Common Increasing Subsequence. ISAAC 2005: 665-674 - [c12]Wun-Tat Chan, Francis Y. L. Chin, Deshi Ye, Guochuan Zhang, Yong Zhang:
Online Bin Packing of Fragile Objects with Application in Cellular Networks. WINE 2005: 564-573
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 23:17 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:
