Wun-Tat Chan

1.1k total citations
16 papers, 168 citations indexed

About

Wun-Tat Chan is a scholar working on Computer Networks and Communications, Industrial and Manufacturing Engineering and Artificial Intelligence. According to data from OpenAlex, Wun-Tat Chan has authored 16 papers receiving a total of 168 indexed citations (citations by other indexed papers that have themselves been cited), including 14 papers in Computer Networks and Communications, 5 papers in Industrial and Manufacturing Engineering and 4 papers in Artificial Intelligence. Recurrent topics in Wun-Tat Chan's work include Optimization and Search Problems (9 papers), Scheduling and Optimization Algorithms (4 papers) and Distributed and Parallel Computing Systems (4 papers). Wun-Tat Chan is often cited by papers focused on Optimization and Search Problems (9 papers), Scheduling and Optimization Algorithms (4 papers) and Distributed and Parallel Computing Systems (4 papers). Wun-Tat Chan collaborates with scholars based in Hong Kong, United Kingdom and China. Wun-Tat Chan's co-authors include Francis Y. L. Chin, Prudence W. H. Wong, Tak‐Wah Lam, Hing‐Fung Ting, Lap–Kei Lee, Ho-Leung Chan, Deshi Ye, Stanley P. Y. Fung, Yong Zhang and Guochuan Zhang and has published in prestigious journals such as SIAM Journal on Computing, Theoretical Computer Science and Journal of Algorithms.

In The Last Decade

Wun-Tat Chan

15 papers receiving 157 citations

Peers

Wun-Tat Chan

CNC

EEE

IME

CTM

Shun Yan Cheung United States

Antonios Antoniadis Germany

Reinhard Lüling Germany

D. Aksoy United States

Claire Hanen France

David P. Bunde United States

Andy Yoo United States

Gerald Sabin United States

Sergiu Carpov France

Vicente Blanco Spain

Shun Yan Cheung United States

Wun-Tat Chan

220 ×1.8

CNC

55 ×1.0

EEE

23 ×0.5

19 ×0.4

IME

20 ×0.8

CTM

Citations per year, relative to Wun-Tat Chan Wun-Tat Chan (= 1×) peers Shun Yan Cheung

Countries citing papers authored by Wun-Tat Chan

Since Specialization

Citations

This map shows the geographic impact of Wun-Tat Chan's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Wun-Tat Chan with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Wun-Tat Chan more than expected).

Fields of papers citing papers by Wun-Tat Chan

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Wun-Tat Chan. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Wun-Tat Chan. The network helps show where Wun-Tat Chan may publish in the future.

Co-authorship network of co-authors of Wun-Tat Chan

This figure shows the co-authorship network connecting the top 25 collaborators of Wun-Tat Chan. A scholar is included among the top collaborators of Wun-Tat Chan based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Wun-Tat Chan. Wun-Tat Chan is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

16 of 16 papers shown

Chan, Wun-Tat, et al.. (2009). Linear-Time Haplotype Inference on Pedigrees without Recombinations and Mating Loops. SIAM Journal on Computing. 38(6). 2179–2197. 1 indexed citations

Chan, Ho-Leung, et al.. (2007). Energy efficient online deadline scheduling. Symposium on Discrete Algorithms. 795–804. 59 indexed citations

Fung, Stanley P. Y., Feifeng Zheng, Wun-Tat Chan, et al.. (2007). Improved on-line broadcast scheduling with deadlines. Journal of Scheduling. 11(4). 299–308. 11 indexed citations

Chan, Wun-Tat, et al.. (2007). Online bin packing of fragile objects with application in cellular networks. Journal of Combinatorial Optimization. 14(4). 427–435. 4 indexed citations

Chan, Wun-Tat, Francis Y. L. Chin, Deshi Ye, Guochuan Zhang, & Yong Zhang. (2006). On-line scheduling of parallel jobs on two machines. Journal of Discrete Algorithms. 6(1). 3–10. 11 indexed citations

Chan, Wun-Tat, et al.. (2006). New resource augmentation analysis of the total stretch of SRPT and SJF in multiprocessor scheduling. Theoretical Computer Science. 359(1-3). 430–439. 8 indexed citations

Chan, Wun-Tat, Yong Zhang, Stanley P. Y. Fung, Deshi Ye, & Hong Zhu. (2006). Efficient algorithms for finding a longest common increasing subsequence. Journal of Combinatorial Optimization. 13(3). 277–288. 13 indexed citations

Chan, Wun-Tat, Tak‐Wah Lam, Hing‐Fung Ting, & Prudence W. H. Wong. (2005). On-line Stream Merging with Max Span and Min Coverage. Theory of Computing Systems. 38(4). 461–479. 1 indexed citations

Chan, Wun-Tat, et al.. (2005). A 5-competitive on-line scheduler for merging video streams. The HKU Scholars Hub (University of Hong Kong). 2165–2172.

10.

Chan, Wun-Tat, Tak‐Wah Lam, Hing‐Fung Ting, & Prudence W. H. Wong. (2003). On-line stream merging in a general setting. Theoretical Computer Science. 296(1). 27–46. 4 indexed citations

11.

Chan, Wun-Tat, Francis Y. L. Chin, & Hing‐Fung Ting. (2003). Escaping a Grid by Edge-Disjoint Paths. Algorithmica. 36(4). 343–359. 9 indexed citations

12.

Chan, Wun-Tat, et al.. (2002). A unified analysis of hot video schedulers. 1 indexed citations

13.

Chan, Wun-Tat, et al.. (2002). A unified analysis of hot video schedulers. PolyU Institutional Research Archive (Hong Kong Polytechnic University). 179–188. 7 indexed citations

14.

Chan, Wun-Tat, Francis Y. L. Chin, & Hing‐Fung Ting. (2000). Escaping a grid by edge-disjoint paths. Symposium on Discrete Algorithms. 726–734. 10 indexed citations

15.

Chan, Wun-Tat & Francis Y. L. Chin. (2000). Efficient Algorithms for Finding the Maximum Number of Disjoint Paths in Grids. Journal of Algorithms. 34(2). 337–369. 22 indexed citations

16.

Chan, Wun-Tat & Francis Y. L. Chin. (1997). Efficient algorithms for finding disjoint paths in grids. Symposium on Discrete Algorithms. 454–463. 7 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact