Ho-Leung Chan

1.1k total citations
35 papers, 399 citations indexed

About

Ho-Leung Chan is a scholar working on Computer Networks and Communications, Industrial and Manufacturing Engineering and Management Science and Operations Research. According to data from OpenAlex, Ho-Leung Chan has authored 35 papers receiving a total of 399 indexed citations (citations by other indexed papers that have themselves been cited), including 28 papers in Computer Networks and Communications, 14 papers in Industrial and Manufacturing Engineering and 12 papers in Management Science and Operations Research. Recurrent topics in Ho-Leung Chan's work include Optimization and Search Problems (25 papers), Scheduling and Optimization Algorithms (14 papers) and Advanced Bandit Algorithms Research (11 papers). Ho-Leung Chan is often cited by papers focused on Optimization and Search Problems (25 papers), Scheduling and Optimization Algorithms (14 papers) and Advanced Bandit Algorithms Research (11 papers). Ho-Leung Chan collaborates with scholars based in Hong Kong, United States and Germany. Ho-Leung Chan's co-authors include Tak‐Wah Lam, Kirk Pruhs, Nikhil Bansal, Lap–Kei Lee, Prudence W. H. Wong, Wing-Kai Hon, Kunihiko Sadakane, Jeff Edmonds, Wun-Tat Chan and Hing‐Fung Ting and has published in prestigious journals such as SIAM Journal on Computing, Theoretical Computer Science and Algorithmica.

In The Last Decade

Ho-Leung Chan

33 papers receiving 381 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Ho-Leung Chan Hong Kong 12 294 115 109 93 68 35 399
V. Nageshwara Rao United States 8 278 0.9× 160 1.4× 214 2.0× 40 0.4× 11 0.2× 12 441
Klaus Schild Germany 10 117 0.4× 47 0.4× 335 3.1× 139 1.5× 23 0.3× 13 552
Vasco Manquinho Portugal 10 140 0.5× 42 0.4× 128 1.2× 25 0.3× 14 0.2× 54 316
Franck Cassez France 13 171 0.6× 109 0.9× 162 1.5× 68 0.7× 9 0.1× 51 596
Yuan-Chieh Chow United States 9 724 2.5× 438 3.8× 70 0.6× 174 1.9× 27 0.4× 21 802
Hideya Iwasaki Japan 11 176 0.6× 179 1.6× 195 1.8× 24 0.3× 35 0.5× 40 397
Robert Schrag United States 7 197 0.7× 40 0.3× 343 3.1× 20 0.2× 20 0.3× 14 475
Philippe Darondeau France 14 267 0.9× 50 0.4× 250 2.3× 47 0.5× 14 0.2× 41 638
Russell W. Quong United States 8 144 0.5× 123 1.1× 208 1.9× 15 0.2× 14 0.2× 15 441
Fred Chow United States 11 298 1.0× 550 4.8× 278 2.6× 33 0.4× 46 0.7× 27 665

Countries citing papers authored by Ho-Leung Chan

Since Specialization
Citations

This map shows the geographic impact of Ho-Leung 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 Ho-Leung Chan with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Ho-Leung Chan more than expected).

Fields of papers citing papers by Ho-Leung Chan

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Ho-Leung 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 Ho-Leung Chan. The network helps show where Ho-Leung Chan may publish in the future.

Co-authorship network of co-authors of Ho-Leung Chan

This figure shows the co-authorship network connecting the top 25 collaborators of Ho-Leung Chan. A scholar is included among the top collaborators of Ho-Leung 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 Ho-Leung Chan. Ho-Leung Chan is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Chan, Ho-Leung, et al.. (2013). Competitive online algorithms for multiple-machine power management and weighted flow time. 11–20.
2.
Bansal, Nikhil, et al.. (2012). . Theory of Computing. 8(1). 209–229. 6 indexed citations
3.
Chan, Ho-Leung, Nicole Megow, René Sitters, & Rob van Stee. (2012). A note on sorting buffers offline. Theoretical Computer Science. 423. 11–18. 8 indexed citations
4.
Chan, Ho-Leung, et al.. (2011). A linear size index for approximate pattern matching. Journal of Discrete Algorithms. 9(4). 358–364. 7 indexed citations
5.
Chan, Ho-Leung, Jeff Edmonds, & Kirk Pruhs. (2011). Speed Scaling of Processes with Arbitrary Speedup Curves on a Multiprocessor. Theory of Computing Systems. 49(4). 817–833. 17 indexed citations
6.
Ting, Hing‐Fung, Lap–Kei Lee, Ho-Leung Chan, & Tak‐Wah Lam. (2011). Approximating Frequent Items in Asynchronous Data Stream over a Sliding Window. Algorithms. 4(3). 200–222. 4 indexed citations
7.
Mamoulis, Nikos, et al.. (2010). A data-mining approach for multiple structural alignment of proteins. Bioinformation. 4(8). 366–370. 3 indexed citations
8.
Chan, Ho-Leung, Tak‐Wah Lam, Lap–Kei Lee, & Hing‐Fung Ting. (2010). Continuous Monitoring of Distributed Data Streams over a Time-based Sliding Window. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 5. 179–190. 1 indexed citations
9.
Chan, Ho-Leung, Jeff Edmonds, Tak‐Wah Lam, et al.. (2010). Nonclairvoyant Speed Scaling for Flow and Energy. Algorithmica. 61(3). 507–517. 13 indexed citations
10.
Bansal, Nikhil, Ho-Leung Chan, & Kirk Pruhs. (2009). Speed scaling with a solar cell. Theoretical Computer Science. 410(45). 4580–4587. 2 indexed citations
11.
Bansal, Nikhil & Ho-Leung Chan. (2009). Weighted flow time does not admit O(1)-competitive algorithms. TU/e Research Portal. 1238–1244. 11 indexed citations
12.
Chan, Ho-Leung, Jeff Edmonds, Tak‐Wah Lam, et al.. (2009). Nonclairvoyant Speed Scaling for Flow and Energy. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 15 indexed citations
13.
Bansal, Nikhil, David P. Bunde, Ho-Leung Chan, & Kirk Pruhs. (2009). Average Rate Speed Scaling. Algorithmica. 60(4). 877–889. 13 indexed citations
14.
Chan, Ho-Leung, et al.. (2008). Extra Unit-Speed Machines Are Almost as Powerful as Speedy Machines for Flow Time Scheduling. SIAM Journal on Computing. 37(5). 1595–1612. 1 indexed citations
15.
Chan, Ho-Leung, et al.. (2007). Energy efficient online deadline scheduling. Symposium on Discrete Algorithms. 795–804. 59 indexed citations
16.
Bansal, Nikhil, Ho-Leung Chan, Rohit Khandekar, et al.. (2007). Non-Preemptive Min-Sum Scheduling with Resource Augmentation. TU/e Research Portal. 32. 614–624. 14 indexed citations
17.
Chan, Ho-Leung, et al.. (2006). Extra unit-speed machines are almost as powerful as speedy machines for competitive flow time scheduling. Symposium on Discrete Algorithms. 334–343. 1 indexed citations
18.
Chan, Ho-Leung, et al.. (2006). A Linear Size Index for Approximate String Matching.
19.
Chan, Ho-Leung, Wing-Kai Hon, Tak‐Wah Lam, & Kunihiko Sadakane. (2005). Dynamic dictionary matching and compressed suffix trees. Symposium on Discrete Algorithms. 13–22. 5 indexed citations
20.
Chan, Ho-Leung, et al.. (2004). Non-migratory online deadline scheduling on multiprocessors. Symposium on Discrete Algorithms. 970–979. 10 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

Rankless by CCL
2026