# Wun-Tat Chan

According to our database

Collaborative distances:

^{1}, Wun-Tat Chan authored at least 40 papers between 1997 and 2016.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### Homepage:

#### On csauthors.net:

## Bibliography

2016

Haplotype Inference on Pedigrees Without Recombinations.

Encyclopedia of Algorithms, 2016

Constrained pairwise and center-star sequences alignment problems.

J. Comb. Optim., 2016

2014

On the Complexity of Constrained Sequences Alignment Problems.

Proceedings of the Frontiers in Algorithmics - 8th International Workshop, 2014

2012

Exact and approximate rhythm matching algorithms.

Int. J. on Digital Libraries, 2012

Online call control in cellular networks revisited.

Inf. Process. Lett., 2012

2011

Online tree node assignment with resource augmentation.

J. Comb. Optim., 2011

2010

Absolute and Asymptotic Bounds for Online Frequency Allocation in Cellular Networks.

Algorithmica, 2010

Deterministic Online Call Control in Cellular Networks and Triangle-Free Cellular Networks.

Proceedings of the Frontiers in Algorithmics, 4th International Workshop, 2010

2009

Optimizing throughput and energy in online deadline scheduling.

ACM Trans. Algorithms, 2009

Linear-Time Haplotype Inference on Pedigrees without Recombinations and Mating Loops.

SIAM J. Comput., 2009

On Dynamic Bin Packing: An Improved Lower Bound and Resource Augmentation Analysis.

Algorithmica, 2009

2008

Dynamic bin packing of unit fractions items.

Theor. Comput. Sci., 2008

Improved on-line broadcast scheduling with deadlines.

J. Scheduling, 2008

Foreword.

Mathematics in Computer Science, 2008

On-line scheduling of parallel jobs on two machines.

J. Discrete Algorithms, 2008

Dynamic Offline Conflict-Free Coloring for Unit Disks.

Proceedings of the Approximation and Online Algorithms, 6th International Workshop, 2008

2007

Efficient algorithms for finding a longest common increasing subsequence.

J. Comb. Optim., 2007

Online bin packing of fragile objects with application in cellular networks.

J. Comb. Optim., 2007

Greedy online frequency allocation in cellular networks.

Inf. Process. Lett., 2007

Online Deadline Scheduling with Bounded Energy Efficiency.

Proceedings of the Theory and Applications of Models of Computation, 2007

Online frequency allocation in cellular networks.

Proceedings of the SPAA 2007: Proceedings of the 19th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2007

Energy efficient online deadline scheduling.

Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

2006

New resource augmentation analysis of the total stretch of SRPT and SJF in multiprocessor scheduling.

Theor. Comput. Sci., 2006

A dynamic programming approach of finding an optimal broadcast schedule in minimizing total flow time.

J. Comb. Optim., 2006

Linear-Time Haplotype Inference on Pedigrees Without Recombinations.

Proceedings of the Algorithms in Bioinformatics, 6th International Workshop, 2006

Frequency Allocation Problems for Linear Cellular Networks.

Proceedings of the Algorithms and Computation, 17th International Symposium, 2006

2005

On-line Stream Merging with Max Span and Min Coverage.

Theory Comput. Syst., 2005

Off-Line Algorithms for Minimizing Total Flow Time in Broadcast Scheduling.

Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

2004

On-Line Windows Scheduling of Temporary Items.

Proceedings of the Algorithms and Computation, 15th International Symposium, 2004

New Results on On-Demand Broadcasting with Deadline via Job Scheduling with Cancellation.

Proceedings of the Computing and Combinatorics, 10th Annual International Conference, 2004

2003

On-line stream merging in a general setting.

Theor. Comput. Sci., 2003

Escaping a Grid by Edge-Disjoint Paths.

Algorithmica, 2003

2002

A unified analysis of hot video schedulers.

Proceedings of the Proceedings on 34th Annual ACM Symposium on Theory of Computing, 2002

Competitive Analysis of On-line Stream Merging Algorithms.

Proceedings of the Mathematical Foundations of Computer Science 2002, 2002

2001

An 5-competitive on-line scheduler for merging video streams.

Proceedings of the 15th International Parallel & Distributed Processing Symposium (IPDPS-01), 2001

Improved On-Line Stream Merging: From a Restricted to a General Setting.

Proceedings of the Computing and Combinatorics, 7th Annual International Conference, 2001

2000

Efficient Algorithms for Finding the Maximum Number of Disjoint Paths in Grids.

J. Algorithms, 2000

1999

A Faster Algorithm for Finding Disjoint Paths in Grids.

Proceedings of the Algorithms and Computation, 10th International Symposium, 1999

1997

Efficient Algorithms for Finding Disjoint Paths in Grids (Extended Abstract).

Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997

Algorithms for Finding Optimal Disjoint Paths Around a Rectangle.

Proceedings of the Algorithms and Computation, 8th International Symposium, 1997