Optimal Online Two-way Trading with Bounded Number of Transactions, in Proceedings of 23rd International Computing and Combinatorics Conference (COCOON), LNCS 10392, 212 - 223, 2017. (Invited to a special issue in Algorithmica)
Maximizing Throughput in Energy-Harvesting Sensor Nodes, in Proceedings of 11th International Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS), LNCS 9536, 129 - 141, 2015.
Online Scheduling of Unit Length Jobs with Commitment and Penalties, in Proceedings of 8th IFIP International Conference on Theoretical Computer Science, LNCS 8705, 54 - 65, 2014.
Temperature Aware Online Algorithms for Minimizing Flow Time (with Martin Birks), in Proceedings of 10th Annual Conference on Theory and Applications of Models of Computation (TAMC), LNCS 7876, 20 - 31, 2013.
Online Algorithms for Maximizing Weighted Throughput of Unit Jobs with Temperature Constraints (with Martin Birks, Daniel Cole and Huichao Xue), Proceedings of FAW-AAIM, LNCS 6681, 319-329, 2011.
Temperature Aware Online Algorithms for Scheduling Equal Length Jobs (with Martin Birks), Proceedings of FAW-AAIM, LNCS 6681, 330-342, 2011.
Online Preemptive Scheduling with Immediate Decision or Notification and Penalties, in Proceedings of 16th International Computing and Combinatorics Conference (COCOON), LNCS 6196, 389-398, 2010.
Temperature Aware Online Scheduling with a Low Cooling Factor (with Martin Birks), in Proceedings of 7th Annual Conference on Theory and Applications of Models of Computation (TAMC), LNCS 6108, 105 - 116, 2010.
Online Algorithms for Maximizing Weighted Throughput of Unit Jobs with Temperature Constraints, in Proceedings of 9th Workshop on Models and Algorithms for Planning and Scheduling Problems (MAPSP), 2009.
Improved Randomized Online Scheduling of Unit Length Intervals and Jobs (with Chung Keung Poon and Feifeng Zheng), in Proceedings of 6th Workshop on Approximation and Online Algorithms (WAOA), 2008; Lecture Notes in Computer Science 5426, 53 - 66. [Conference version in LNCS ]
Online Interval Scheduling: Randomized and Multiprocessor Cases (with Chung Keung Poon and Feifeng Zheng), in Proceedings of 13th International Computing and Combinatorics Conference (COCOON), 2007; Lecture Notes in Computer Science 4598, 176 - 186.
Linear-time Haplotype Inference on Pedigree without Recombinations (with Mee Yee Chan, Wun-Tat Chan, Francis Y. L. Chin and Ming-Yang Kao), in Proceedings of 6th International Workshop on Algorithms in Bioinformatics (WABI), 2006; Lecture Notes in Computer Science 4175, 56 - 67. [ conference version in LNCS ]
Improved Online Broadcast Scheduling with Deadlines (with Feifeng Zheng, Wun-Tat Chan, Francis Y. L. Chin, Chung Keung Poon and Prudence W. H. Wong), in Proceedings of 12th International Computing and Combinatorics Conference (COCOON), 2006; Lecture Notes in Computer Science 4112, 320 - 329.
Efficient Algorithms for Finding a Longest Common Increasing Subsequence (with Wun-Tat Chan, Yong Zhang, Deshe Ye and Hong Zhu), in Proceedings of 16th International Symposium on Algorithms and Computation (ISAAC), 2005; Lecture Notes in Computer Science 3827, 665 - 674. [ conference version in LNCS ]
Laxity Helps in Broadcast Scheduling (with Francis Y. L. Chin and Chung Keung Poon), in Proc. 9th Italian Conference on Theoretical Computer Science (ICTCS), 2005; Lecture Notes in Computer Science 3701, 251 - 264. [ conference version in LNCS ]
Online Competitive Algorithms for Maximizing Weighted Throughput of Unit Jobs (with Francis Y. L. Chin, Marek Chrobak, Wojciech Jawor, Jiri Sgall and Tomas Tichy), in Proceedings of 21st International Symposium on Theoretical Aspects of Computer Science (STACS), 2004; Lecture Notes in Computer Science 2996, 187 - 198. [ final conference version in LNCS ]
Improved Competitive Algorithms for Online Scheduling with Partial Job Values (with Francis Y. L. Chin), in Proceedings of 9th International Computing and Combinatorics Conference (COCOON), 2003; Lecture Notes in Computer Science 2697, 425 - 434. [ preprint version ] [ final conference version in LNCS ]
Online Scheduling with Partial Job Values and Bounded Importance Ratio (with Francis Y. L. Chin), in Proceedings of International Computer Symposium (Taiwan), 787 - 794, 2002. [ local copy ]
Approximation of Minimum Triangulation for Polyhedron with Bounded Degrees (with Francis Y. L. Chin), in Proceedings of 12th International Symposium on Algorithms and Computation (ISAAC), 2001; Lecture Notes in Computer Science 2223, 172 - 184. [ preprint version ] [ final version in LNCS ]
Approximation for Minimum Triangulation of Convex Polyhedra (with Francis Y. L. Chin and Cao-An Wang), in Proceedings of 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 128 - 137, 2001. [ preprint version ] [ final version in ACM Portal ]
Online Two-way Trading: Randomization and Advice, submitted.
Optimal Online Two-way Trading with Bounded Number of Transactions, Algorithmica , in press.
Temperature Aware Online Algorithms for Minimizing Flow Time (with Martin Birks), Theoretical Computer Science 661, 18 - 34, 2017.
Improved Randomized Online Scheduling of Intervals and Jobs (with Chung Keung Poon and Feifeng Zheng), Theory of Computing Systems 55(1), 202 - 228, 2014.
Online scheduling with preemption or non-completion penalties , Journal of Scheduling 17(2), 173 - 183, 2014.
Temperature aware online scheduling for throughput maximisation: The effect of the cooling factor (with Martin Birks), Sustainable Computing: Informatics and Systems 4(3), 151 - 159, 2014.
Online algorithms for maximizing weighted throughput of unit jobs with temperature constraints (with Martin Birks, Daniel Cole and Huichao Xue), Journal of Combinatorial Optimization 26(2), 237 - 250, 2013.
Temperature aware online algorithms for scheduling equal length jobs (with Martin Birks), Theoretical Computer Science 508, 54 - 65, 2013.
On-line scheduling of equal-length intervals on parallel machines (with Chung Keung Poon and Duncan K. W. Yung), Information Processing Letters 112(10), 376-379, 2012.
Bounded Delay Packet Scheduling in a Bounded Buffer, Operations Research Letters 38(5), 396 - 398, 2010. Also in CoRR abs/0907.2741, 2009.
Linear-time Haplotype Inference on Pedigrees without Recombinations and Mating Loops (with Mee Yee Chan, Wun-Tat Chan, Francis Y. L. Chin and Ming-Yang Kao), SIAM Journal on Computing 38(6), 2179 - 2197, 2009. [ final version in SIAM ]
Lower Bounds on Online Deadline Scheduling with Preemption Penalties, Information Processing Letters 108(4), 214 - 218, 2008.
Online Interval Scheduling: Randomized and Multiprocessor Cases (with Chung Keung Poon and Feifeng Zheng), Journal of Combinatorial Optimization 16(3), 248 - 262, 2008. [ final version in Springer ]
Improved Online Broadcast Scheduling with Deadlines (with Feifeng Zheng, Wun-Tat Chan, Francis Y. L. Chin, Chung Keung Poon and Prudence W. H. Wong), Journal of Scheduling 11(4), 299 - 308, 2008. [ final version in Springer ]
Efficient Algorithms for Finding a Longest Common Increasing Subsequence (with Wun-Tat Chan, Yong Zhang, Deshe Ye and Hong Zhu), Journal of Combinatorial Optimization 13(3), 277 - 288, 2007. [ final version in Springer ]
A Tight Lower Bound for Job Scheduling with Cancellation (with Feifeng Zheng, Francis Y. L. Chin, Chung Keung Poon and Yinfeng Xu), Information Processing Letters 97(1), 1 - 3, 2006.
Online Competitive Algorithms for Maximizing Weighted Throughput of Unit Jobs (with Francis Y. L. Chin, Marek Chrobak, Wojciech Jawor, Jiri Sgall and Tomas Tichy), Journal of Discrete Algorithms 4(2), 255 - 276, 2006. [ final version in JODA ] [ preprint version ]
Improved Competitive Algorithms for Online Scheduling with Partial Job Values (with Francis Y. L. Chin), Theoretical Computer Science 325(3), 467 - 478, 2004. [ final version in TCS ]
Online Scheduling with Partial Job Values: Does Timesharing or Randomization Help? (with Francis Y. L. Chin), Algorithmica 37(3), 149 - 164, 2003. [ preprint version ] [ final version in Algorithmica ]
Online Scheduling of Unit Jobs with Bounded Importance Ratio (with Francis Y. L. Chin and Hong Shen), International Journal of Foundations of Computer Science 16(3), 581 - 598, 2005.
Approximating the Minimum Triangulation of Convex Polytopes with Bounded Degrees (with Francis Y. L. Chin and Chung Keung Poon), Computational Geometry: Theory and Applications 32(1), 1 - 12, 2005. [ final version in CGTA ]
Approximation for Minimum Triangulations of Simplicial Convex 3-Polytopes (with Francis Y. L. Chin and Cao-An Wang), Discrete and Computational Geometry 26(4), 499 - 511, 2001. [ preprint version ] [ final version in DCG ]
Approximation Algorithms for Some Optimal 2D and 3D Triangulations (with Francis Y. L. Chin and Cao-An Wang), in Handbook of Approximation Algorithms and Metaheuristics, Chapman and Hall/CRC, 2007.
PhD thesis: Online Algorithms for the Provision of Quality of Service in Networks
Master's thesis: Approximation for Minimum Triangulations of Convex Polyhedra
That (infamous?) sorting paper and my additional notes about it