default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWun-Tat Chan
Person information
- affiliation: King's College London, UK
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 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)- [r1]Mee Yee Chan, Wun-Tat Chan, Francis Y. L. Chin, Stanley P. Y. Fung, Ming-Yang Kao:
Haplotype Inference on Pedigrees Without Recombinations. Encyclopedia of Algorithms 2016: 894-897 - 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) - [j19]Joseph Wun-Tat Chan, Costas S. Iliopoulos, Spiros Michalakopoulos, M. Sohel Rahman
:
Exact and approximate rhythm matching algorithms. Int. J. Digit. Libr. 12(2-3): 149-158 (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)
2000 – 2009
- 2009
- [j16]Joseph Wun-Tat Chan, Prudence W. H. Wong, Fencol C. C. Yung:
On Dynamic Bin Packing: An Improved Lower Bound and Resource Augmentation Analysis. Algorithmica 53(2): 172-206 (2009) - [j15]Mee Yee Chan, Wun-Tat Chan, Francis Y. L. Chin, Stanley P. Y. Fung, Ming-Yang Kao:
Linear-Time Haplotype Inference on Pedigrees without Recombinations and Mating Loops. SIAM J. Comput. 38(6): 2179-2197 (2009) - [j14]Ho-Leung Chan, Joseph Wun-Tat Chan, Tak Wah Lam, Lap-Kei Lee, Kin-Sum Mak, Prudence W. H. Wong:
Optimizing throughput and energy in online deadline scheduling. ACM Trans. Algorithms 6(1): 10:1-10:22 (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) - [j12]Joseph Wun-Tat Chan, Maxime Crochemore:
Foreword. Math. Comput. Sci. 1(4): 541-542 (2008) - [j11]Stanley P. Y. Fung, Feifeng Zheng, Wun-Tat Chan, Francis Y. L. Chin, Chung Keung Poon, Prudence W. H. Wong:
Improved on-line broadcast scheduling with deadlines. J. Sched. 11(4): 299-308 (2008) - [j10]Joseph Wun-Tat Chan, Tak Wah Lam, Prudence W. H. Wong:
Dynamic bin packing of unit fractions items. Theor. Comput. Sci. 409(3): 521-529 (2008) - [c24]Joseph Wun-Tat Chan, Francis Y. L. Chin, Xiangyu Hong, Hing-Fung Ting:
Dynamic Offline Conflict-Free Coloring for Unit Disks. WAOA 2008: 241-252 - 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) - [c23]Ho-Leung Chan, Wun-Tat Chan, Tak Wah Lam, Lap-Kei Lee, Kin-Sum Mak, Prudence W. H. Wong:
Energy efficient online deadline scheduling. SODA 2007: 795-804 - [c22]Joseph Wun-Tat Chan, Francis Y. L. Chin, Deshi Ye, Yong Zhang:
Online frequency allocation in cellular networks. SPAA 2007: 241-249 - [c21]Joseph Wun-Tat Chan, Tak Wah Lam, Kin-Sum Mak, Prudence W. H. Wong:
Online Deadline Scheduling with Bounded Energy Efficiency. TAMC 2007: 416-427 - 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) - [j5]Wun-Tat Chan, Tak Wah Lam, Kin-Shing Liu, Prudence W. H. Wong:
New resource augmentation analysis of the total stretch of SRPT and SJF in multiprocessor scheduling. Theor. Comput. Sci. 359(1-3): 430-439 (2006) - [c20]Wun-Tat Chan, Prudence W. H. Wong, Fencol C. C. Yung:
On Dynamic Bin Packing: An Improved Lower Bound and Resource Augmentation Analysis. COCOON 2006: 309-319 - [c19]Feifeng Zheng, Stanley P. Y. Fung, Wun-Tat Chan, Francis Y. L. Chin, Chung Keung Poon, Prudence W. H. Wong:
Improved On-Line Broadcast Scheduling with Deadlines. COCOON 2006: 320-329 - [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 - [c17]Bethany Man-Yee Chan, Joseph Wun-Tat Chan, Francis Y. L. Chin, Stanley P. Y. Fung, Ming-Yang Kao:
Linear-Time Haplotype Inference on Pedigrees Without Recombinations. WABI 2006: 56-67 - 2005
- [j4]Wun-Tat Chan, Tak Wah Lam, Hing-Fung Ting, Prudence W. H. Wong:
On-line Stream Merging with Max Span and Min Coverage. Theory Comput. Syst. 38(4): 461-479 (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 - [c15]Wun-Tat Chan, Tak Wah Lam, Prudence W. H. Wong:
Dynamic Bin Packing of Unit Fractions Items. ICALP 2005: 614-626 - [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 - [c13]Wun-Tat Chan, Tak Wah Lam, Kin-Shing Liu, Prudence W. H. Wong:
New Resource Augmentation Analysis of the Total Stretch of SRPT and SJF in Multiprocessor Scheduling. MFCS 2005: 236-247 - [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 - 2004
- [c11]Wun-Tat Chan, Tak Wah Lam, Hing-Fung Ting, Prudence W. H. Wong:
New Results on On-Demand Broadcasting with Deadline via Job Scheduling with Cancellation. COCOON 2004: 210-218 - [c10]Wun-Tat Chan, Prudence W. H. Wong:
On-Line Windows Scheduling of Temporary Items. ISAAC 2004: 259-270 - 2003
- [j3]Wun-Tat Chan, Francis Y. L. Chin, Hing-Fung Ting:
Escaping a Grid by Edge-Disjoint Paths. Algorithmica 36(4): 343-359 (2003) - [j2]Wun-Tat Chan, Tak Wah Lam, Hing-Fung Ting, Prudence W. H. Wong:
On-line stream merging in a general setting. Theor. Comput. Sci. 296(1): 27-46 (2003) - [c9]Wun-Tat Chan, Tak Wah Lam, Hing-Fung Ting, Prudence W. H. Wong:
On-Line Stream Merging, Max Span, and Min Coverage. CIAC 2003: 70-82 - 2002
- [c8]Wun-Tat Chan, Tak Wah Lam, Hing-Fung Ting, Prudence W. H. Wong:
Competitive Analysis of On-line Stream Merging Algorithms. MFCS 2002: 188-200 - [c7]Wun-Tat Chan, Tak Wah Lam, Hing-Fung Ting, Prudence W. H. Wong:
A unified analysis of hot video schedulers. STOC 2002: 179-188 - 2001
- [c6]Wun-Tat Chan, Tak Wah Lam, Hing-Fung Ting, Prudence W. H. Wong:
Improved On-Line Stream Merging: From a Restricted to a General Setting. COCOON 2001: 432-442 - [c5]Wun-Tat Chan, Tak Wah Lam, Hing-Fung Ting, Prudence W. H. Wong:
An 5-competitive on-line scheduler for merging video streams. IPDPS 2001: 201 - 2000
- [j1]Wun-Tat Chan, Francis Y. L. Chin:
Efficient Algorithms for Finding the Maximum Number of Disjoint Paths in Grids. J. Algorithms 34(2): 337-369 (2000) - [c4]Wun-Tat Chan, Francis Y. L. Chin, Hing-Fung Ting:
Escaping a grid by edge-disjoint paths. SODA 2000: 726-734
1990 – 1999
- 1999
- [b1]Wun-Tat Chan:
Efficient algorithms for disjoint paths problems in grids. University of Hong Kong, 1999 - [c3]Wun-Tat Chan, Francis Y. L. Chin, Hing-Fung Ting:
A Faster Algorithm for Finding Disjoint Paths in Grids. ISAAC 1999: 393-402 - 1997
- [c2]Wun-Tat Chan, Francis Y. L. Chin:
Algorithms for Finding Optimal Disjoint Paths Around a Rectangle. ISAAC 1997: 314-323 - [c1]Wun-Tat Chan, Francis Y. L. Chin:
Efficient Algorithms for Finding Disjoint Paths in Grids (Extended Abstract). SODA 1997: 454-463
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-11-21 21:24 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:
