Prudence's Publications

Journals and Conferences

2012 and onward

• Online Speed Scaling Based on Active Job Count to Minimize Flow plus Energy. (with T.W. Lam, L.K. Lee and I.K.K. To)
  Accepted to Algorithmica, to appear. [Download paper (pdf)] [From Springer]
• Optimizing Busy Time on Parallel Machines (with G. Mertzios, M. Shalom, A. Voloshin and S. Zaks)
  Accepted to The 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2012, to appear. [Download paper (pdf)]
• A Note on "An Optimal Online Algorithm for Single Machine Scheduling to Minimize Total General Completion Time". (with S. Yu)
  Information Processing Letters (IPL), 112:(1-2), 55--58, 2012. [Download paper (pdf)] [From ScienceDirect]
• Improved Multi-processor Scheduling for Flow Time and Energy. (with T.W. Lam, L.K. Lee and I.K.K. To)
  Accepted to Journal of Scheduling (JoS), to appear. [Download paper (pdf)] [From Springer]

2011

• Online Regenerator Placement (with G. Mertzios, M. Shalom and S. Zaks)
  Proceedings of the 15th International Conference On Principles Of Distributed Systems (OPODIS), 2011, pp. 4--17. [Download paper (pdf)] [From Springer]
• New Structural and Functional Contexts of the Dx[DN]xDG Linear Motif: Insights into Evolution of Calcium-binding Proteins. (with D.J. Rigden, D.D. Woodhead and M.Y. Galperinc)
  PLoS ONE, 6(6): e21507, 2011. [From PLoS]
• Multiprocessor Speed Scaling for Jobs with Arbitrary Sizes and Deadlines. (with P. Bell)
  Proceedings of the 8th Annual Conference on Theory and Applications of Models of Computation (TAMC), 2011, pp. 27--36. [Download paper (pdf)] [From Springer]
• Online Scheduling of Linear Deteriorating Jobs on Parallel Machines. (with S Yu and Y Xu)
  The 10th Workshop on Models and Algorithms for Planning and Scheduling Problems (MAPSP), 2011.

2010

• Deadline Scheduling and Power Management for Speed Bounded Processors. (with X. Han, T.W. Lam, L.K. Lee and I.K.K. To)
  Theoretical Computer Science (TCS), 411:40-42, pp. 3587--3600, 2010. [Download paper (pdf)] [From ScienceDirect]
• Optimal On-line Colorings for Minimizing the Number of ADMs in Optical Networks. (with M. Shalom and S. Zaks)
  Journal of Discrete Algorithms, 8(2):174--188, 2010. [Download paper (pdf)] [From ScienceDirect]
• High throughput sequencing and Motif Analysis of the A. nidulans transcriptome. (with M. Caddick, C. Sibthorp, H. Wu and N. Hall)
  Poster at the 10th Workshop on Algorithms in Bioinformatics (WABI), 2010.
• High throughput sequencing of the A. nidulans transcriptome. (with M. Caddick, C. Sibthorp, H. Wu and N. Hall)
  Poster at the 10th European Conference on Fungal Genetics (EFG), 2010.

2009

• Optimizing Throughput and Energy in Online Deadline Scheduling. (with H.L. Chan, W.T. Chan, T.W. Lam, L.K. Lee and K.S. Mak)
  Transactions on Algorithms (TALG), 6(1):10, 2009. [Download paper (pdf)] [From ACM]
• Competitive Multi-Dimensional Dynamic Bin Packing via L-Shape Bin Packing. (with F.C.C. Yung)
  Proceedings of the 7th Workshop on Approximation and Online Algorithms (WAOA), 2009, pp. 242--254. [Download paper (pdf)] [From Springer]
• Sleep with Guilt and Work Faster to Minimize Flow plus Energy. (with T.W. Lam, L.K. Lee, H.F. Ting and I.K.K. To)
  Proceedings of the 36th International Colloquium on Automata, Languages and Programming (ICALP), 2009, 665--676. [Download paper (pdf)] [From Springer]
• On-line Maximum Matching in Complete Multipartite Graphs with Implications to the Minimum ADM Problem on a Star Topology. (with M. Shalom and S. Zaks)
  Proceedings of the 16th International Colloquium on Structural Information and Communication Complexity (SIROCCO), 2009, pp. 281--294. [Download paper (pdf)] [From Springer]
• Deadline Scheduling and Power Management for Speed Bounded Processors. (with X. Han, T.W. Lam, L.K. Lee and I.K.K. To)
  The 9th Workshop on Models and Algorithms for Planning and Scheduling Problems (MAPSP), 2009, pp. 82--84. [Download paper (pdf)]
• Multiprocessor Speed Scaling for Jobs with Arbitrary Sizes and Deadlines. (with P. Bell)
  The 9th Workshop on Models and Algorithms for Planning and Scheduling Problems (MAPSP), 2009, pp. 44--46. [Download paper (pdf)]
• On Dynamic Bin Packing: An Improved Lower Bound and Resource Augmentation Analysis. (with W.T. Chan and F.C.C. Yung)
  Invited to Algorithmica, 53(2):172-206, 2009. [Download paper (pdf)] [From Springer]

2008

• Dynamic Bin Packing of Unit Fractions Items. (with W.T. Chan and T.W. Lam)
  Theoretical Computer Science (TCS), 409(3):521-529, 2008. [Download paper (pdf)] [From Springer]
• Non-migratory Multi-processor Scheduling for Response Time and Energy. (with T.W. Lam, L.K. Lee and I.K.K. To)
  IEEE Transactions on Parallel and Distributed Systems (TPDS) Special Issue on Power-Aware Parallel and Distributed Systems, 19(11):1527-1539, 2008. [Download paper (ps)] [From IEEE]
• Improved On-line Broadcast Scheduling with Deadlines. (with S.P.Y. Fung, F. Zheng, W.T. Chan, F.Y.L. Chin and C.K. Poon)
  Journal of Scheduling (JoS), 11(4):299-308, 2008. [From Springer]
• Routing in Geometric Networks. (with L. Gasieniec and C. Su)
  Encyclopedia of Algorithms, 2008, Part 17.
• Speed Scaling Functions for Flow Time Scheduling Based on Active Job Count. (with T.W. Lam, L.K. Lee and I.K.K. To)
  Proceedings of the 16th Annual European Symposium on Algorithms (ESA), 2008, pp. 647--659. [Download paper (pdf)] [From Springer]
• Competitive Non-migratory Scheduling for Flow Time and Energy. (with T.W. Lam, L.K. Lee and I.K.K. To)
  Proceedings of the 20th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2008, pp. 256--264. [Download paper (pdf)] [From ACM]
• Approximating Border Length for DNA Microarray Synthesis. (with C.Y. Li, Q. Xin and F.C.C. Yung)
  Proceedings of the 5th Annual Conference on Theory and Applications of Models of Computation (TAMC), 2008, pp. 410--422. [Download paper (pdf)] [From Springer]
• Non-overlapping Common Substrings Allowing Mutations. (with H.L. Chan, T.W. Lam, W.K. Sung and S.M. Yiu)
  Mathematics in Computer Science (MCS) Special Issue on Combinatorial Algorithms, 1(4):543--555, 2008. [Download paper (ps)] [From Springer]

2007

• Allowing Mismatches in Anchors for Whole Genome Alignment. (with S.M. Yiu, P.Y. Chan, T.W. Lam and and H.F. Ting)
  WSEAS Transactions on Biology and Biomedicine, 1(4), 2007. [From WSEAS]
• Energy Efficient Deadline Scheduling in Two Processor Systems. (with T.W. Lam, L.K. Lee and K.K. To)
  Proceedings of the 18th International Symposium on Algorithms and Computation (ISAAC), 2007, pp. 476--487. [Download paper (pdf)]
• Optimal On-line Colorings for Minimizing the Number of ADMs in Optical Networks. (with M. Shalom and S. Zaks)
  Proceedings of the 21st International Symposium on Distributed Computing (DISC), 2007, pp. 435--449. [Download paper (pdf)] [From Springer]
• Randomized Probe Selection Algorithm for Microarray Design. (with L. Gasieniec and C.Y. Li)
  Journal of Theoretical Biology (JTB), 248(3):512--521, 2007. [Download paper (pdf)] [From Science Direct]
• Bandwidth Minimization Algorithms. (with A.V. Fishkin and R. Sitters)
  The 8th Workshop on Models and Algorithms for Planning and Scheduling Problems (MAPSP), 2007.
• Efficiency of Data Distribution in BitTorrent-like Systems. (with H.L. Chan and T.W. Lam)
  Proceedings of the 3rd International Conference on Algorithmic Aspects in Information and Management (AAIM), 2007, pp. 378--388. [Download paper (pdf)]
• Online Deadline Scheduling with Bounded Energy Efficiency. (with W.T. Chan, T.W. Lam and K.S. Mak)
  Proceedings of the 4th Annual Conference on Theory and Applications of Models of Computation (TAMC), 2007, 416--427. [Download paper (pdf)] [From Springer]
• Energy Efficient Online Deadline Scheduling. (with H.L. Chan, W.T. Chan, T.W. Lam, L.K. Lee and K.S. Mak)
  Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2007, pp. 795--804. [Download paper (ps)]
• Routing of Single-source and Multiple-source Queries in Static Sensor Networks. (with L. Gasieniec, C. Su and Q. Xin)
  Journal of Discrete Algorithms (JDA), 5(1):1-11, 2007. [Download paper (pdf)]

2006

• Efficient Probe Selection in Microarray Design. (with L. Gasieniec, C.Y. Li and P. Sant)
  Proceedings of the IEEE Symposium on Computational Intelligence in Bioinformatics and Computational Biology (CIBCB), 2006, pp. 247--254. [Download paper (pdf)]
• New Resource Augmentation Analysis of the Total Stretch of SRPT and SJF in Multiprocessor Scheduling. (with W.T. Chan, T.W. Lam and K.S. Liu)
  Theoretical Computer Science (TCS), 359(1-3): 430--439, 2006. [Download paper (pdf)]
• A Dynamic Programming Approach of Finding an Optimal Broadcast Schedule in Minimizing Total Flow Time. (with W.T. Chan, F.Y.L. Chin, Y. Zhang, H. Zhu and H. Shen)
  Invited to Journal of Combinatorial Optimization (JCO), 11(2):177--187, 2006. [Download paper (pdf)] [From Springer]
• On Dynamic Bin Packing: An Improved Lower Bound and Resource Augmentation Analysis. (with W.T. Chan and F.C.C. Yung)
  Proceedings of the 11th Annual International Computing and Combinatorics Conference (COCOON), 2006, pp. 309--319. [Download paper (postscript)]
• Improved On-line Broadcast Scheduling with Deadlines. (with F. Zheng, S.P.Y. Fung, W.T. Chan, F.Y.L. Chin and C.K. Poon)
  Proceedings of the 11th Annual International Computing and Combinatorics Conference (COCOON), 2006, pp. 320--329. [Download paper (postscript)]

2005

• New Resource Augmentation Analysis of the Total Stretch of SRPT and SJF in Multiprocessor Scheduling. (with W.T. Chan, T.W. Lam and K.S. Liu)
  Proceedings of the 30th International Symposium on Mathematical Foundations of Computer Science (MFCS), 2005, pp.236--247. [Download paper (pdf)]
• Off-line Algorithms for Minimizing the Total Flow Time in Broadcast Scheduling. (with W.T. Chan, F.Y.L. Chin, Y. Zhang, H. Zhu and H. Shen)
  Proceedings of the 10th Annual International Computing and Combinatorics Conference (COCOON), 2005, pp.318--328. [Download paper (postscript)]
• On-line Stream Merging with Max Span and Min Coverage. (with W.T. Chan, T.W. Lam and H.F. Ting)
  Theory of Computing Systems (TOCS), 38(4):461--479, 2005. [Download paper (postscript)]
• Dynamic Bin Packing of Unit Fractions Items. (with W.T. Chan and T.W. Lam)
  Proceedings of the 32nd International Colloquium on Automata, Languages and Programming (ICALP), 2005, pp. 614--626. [Download paper (pdf)]
• The Mutated Subsequence Problem and Locating Conserved Genes. (with H.L. Chan, T.W. Lam, W.K. Sung, S.M. Yiu and X. Fan)
  Bioinformatics, 21(10):2271--2278, 2005. [From Oxford Journals Online]
• Routing via Single-source and Multiple-source Queries in Static Sensor Networks (with L. Gasieniec, C. Su and Q. Xin)
  Proceedings of the 19th International Parallel and Distributed Processing Symposium (IPDPS) - 5th IEEE International Workshop on Algorithms for Wireless, Mobile, Ad Hoc and Sensor Networks, (WMAN), 2005. [Download paper (postscript)]
• Allowing Mismatches in Anchors for Whole Genome Alignment: Generation and Effectiveness. (with S.M. Yiu, P.Y. Chan, T.W. Lam, W.K. Sung and H.F. Ting)
  Proceedings of the 3rd Asia Pacific Bioinformatics Conference (APBC), 2005, pp. 1--10. [Download paper (postscript)]
• Efficient Constrained Multiple Sequence Alignment with Performance Guarantee. (with Francis Y.L. Chin, N.L. Ho and T.W. Lam)
  Journal of Bioinformatics and Computational Biology (JBCB), 3(1):1--18, 2005. [Download paper (postscript)] [From World Scientific]
• Filtering of Ineffective siRNAs and Improved siRNA Design Tool. (with S.M. Yiu, Y.C. Mui, T.W. Lam, H.F. Kung, M. Lin and Y.T. Cheung)
  Bioinformatics, 21(2):144--151, 2005. [From Oxford Journals Online] (receive The University of Hong Kong Research Output Prize 2006)

2004

• An Efficient Algorithm for Optimizing Whole Genome Alignment with Noise. (with T.W. Lam, N. Lu, H.F. Ting and S.M. Yiu)
  Bioinformatics, 20(16):2676--2684, 2004. [From Oxford Journals Online]
• On-line Windows Scheduling of Temporary Items. (with W.T. Chan)
  Proceedings of the 15th International Symposium of Algorithms and Computation (ISAAC), 2004, pp. 259--270. [Download paper (pdf)]
• New Results on On-demand Broadcasting with Deadline via Job Scheduling with Cancellation. (with W.T. Chan, T.W. Lam and H.F. Ting)
  Proceedings of the 10th Annual International Computing and Combinatorics Conference (COCOON), 2004, pp. 210--218. [From Springer]
• A Mutation-Sensitive Approach for Locating Conserved Gene Pairs between Related Species. (with H.L. Chan, T.W. Lam, W.K. Sung and S.M. Yiu)
  Proceedings of IEEE 4th Symposium on Bioinformatics and Bioengineering (BIBE), 2004, pp. 545--552. [Download paper (postscript)]
• Filtering of Ineffective siRNAs and Improved siRNA Design Tool. (with T.W. Lam, Y.C. Mui, S.M. Yiu, H.F. Kung, M. Lin and Y.T. Cheung)
  Proceedings of the 2nd Asia Pacific Bioinformatics Conference (APBC), 2004, pp. 247--255. [Download paper (postscript)]
• Aggressive Online Deadline Scheduling. (with T.W. Lam, T.W. Johnny Ngan and K.K. To)
  Proceedings of the 10th Computing: The Australasian Theory Symposium (CATS), Electronic Notes in Theoretical Computer Science (91), 2004, pp.148--157. [From ScienceDirect]

2003

• On-line Stream Merging in a General Setting. (with W.T. Chan, T.W. Lam and H.F. Ting)
  Invited to Theoretical Computer Science (TCS), 296(1): 27--46, 2003. [Download paper (postscript)]
• Efficient Algorithms for Optimizing Whole Genome Alignment with Noise. (with T.W. Lam, N. Lu, H.F. Ting and S.M. Yiu)
  Proceedings of the 14th International Symposium of Algorithms and Computation (ISAAC), 2003, pp. 362--374. [From Springer]
• Efficient Constrained Multiple Sequence Alignment with Performance Guarantee. (with Francis Y.L. Chin, N.L. Ho, T.W. Lam and M.Y. Chan)
  Proceedings of the 2nd IEEE Computer Society Computational Systems Bioinformatics Conference (CSB), 2003, pp.337--346. [Download paper (postscript)] [From IEEE]
• On-line Stream Merging, Max Span, and Min Coverage. (with W.T. Chan, T.W. Lam and H.F. Ting)
  Proceedings of the 5th Conference on Algorithms and Complexity (CIAC), 2003, pp.70--82. [From Springer]

2002

• On-line Load Balancing of Temporary Tasks Revisited. (with T.W. Lam, H.F. Ting and K.K. To)
  Theoretical Computer Science (TCS), 270(1-2):325--340, 2002. [Download paper (postscript)]
• Competitive Analysis of On-line Stream Merging Algorithms. (with W.T. Chan, T.W. Lam and H.F. Ting)
  Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science (MFCS), 2002, pp.188--200. [From Springer]
• A Unified Analysis of Hot Video Schedulers. (with W.T. Chan, T.W. Lam and H.F. Ting)
  Proceedings of the 34th ACM Symposium on Theory of Computing (STOC), 2002, pp.179--188. [Download paper (postscript)]

2001 and before

• Improved On-line Stream Merging: from a Restricted to a General Setting. (with W.T. Chan, T.W. Lam and H.F. Ting)
  Proceedings of the 7th Annual International Computing and Combinatorics Conference (COCOON), 2001, pp.432--442. [From Springer]
• A 5-Competitive On-line Scheduler for Merging Video Streams. (with W.T. Chan, T.W. Lam and H.F. Ting)
  Proceedings of the 15th International Parallel and Distributed Processing Symposium (IPDPS) - Workshop on Scheduling and Telecommunications (IWST), 2001, pp.2165--2172. [Download paper (postscript)]
• On-line Load Balancing of Temporary Tasks Revisited. (with K.K. To)
  Proceedings of the 10th International Symposium of Algorithms and Computation (ISAAC), 1999, pp.103--112.
[From Springer]
• An Approximation Algorithm for Bounded Length Tree Linear Broadcast Routing. (with H.F. Ting)
  Proceedings of the 1996 International Conference on Algorithms (ICS), 1996, pp.98--104.
• An Efficient Algorithm for Optimal Linear Broadcast Routing. (with H.F. Ting and M.H. Yau)
  Proceedings of the 5th Italian Conference on Theoretical Computer Science (ICTCS), 1995, pp.235--249.

Presentations

2011

• Energy Efficient Job Scheduling - Speed Scaling & Sleep.
  Departmental Seminar, Durham University, Durham, UK, November, 2011.
• Online Scheduling of Linear Deteriorating Jobs on Parallel Machines.
  The 10th Workshop on Models and Algorithms for Planning and Scheduling Problems (MAPSP), Nymburk, Czech Repbulic, June, 2011.

2010

• Online Coloring in Optical Networks.
  Theory Talk, Max-Planck Institute for Informatics, Saarbrucken, Germany, July, 2010.
• Speed Scaling and Sleep Management to Save Energy.
  DIMAP Seminar, University of Warwick, Coventry, UK, June, 2010.
• Speed Scaling and Sleep Management to Save Energy.
  Bristol Algorithms Days, Bristol, UK, February, 2010.

2009

• On-line Colorings for Minimizing the Number of ADMs in Optical Networks.
  Departmental Seminar, University of Hong Kong, Hong Kong, December, 2009.
• Competitive Multi-Dimensional Dynamic Bin Packing via L-Shape Bin Packing.
  The 7th Workshop on Approximation and Online Algorithms (WAOA), Copenhagen, Denmark, September 2009.
• Multiprocessor Speed Scaling for Jobs with Arbitrary Sizes and Deadlines.
  The 9th Workshop on Models and Algorithms for Planning and Scheduling Problems (MAPSP), Rolduc, Kerkrade, The Netherlands, June 2009.
• On-line Maximum Matching in Complete Multipartite Graphs with Implications to the Minimum ADM Problem on a Star Topology.
  The 16th International Colloquium on Structural Information and Communication Complexity (SIROCCO), Piran, Slovenia, May 2009.

2008

• Energy Efficient Flow Time Scheduling.
  Complexity, Theory and Algorithmics Group (CTAG) Seminar, University of Liverpool, Liverpool, UK, October 2008.
• Speed Scaling Functions for Flow Time Scheduling Based on Active Job Count.
  The 16th Annual European Symposium on Algorithms (ESA), Karlsruhe, Germany, September 2008.
• Competitive Non-migratory Scheduling for Flow Time and Energy.
  The 20th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), Munich, Germany, June 2008.
• Energy Efficient Processor Scheduling using Dynamic Speed Scaling.
  Seminar, SIEMENS AG, Munich, Germany, June 2008.
• Non-migratory Multi-processor Scheduling for Flow Time and Energy.
  Dagstuhl Seminar: Scheduling, Dagstuhl, Germany, February 2008.
• Optimal On-line Colorings for Minimizing the Number of ADMs in Optical Networks.
  Theory Group Seminar, Hong Kong University of Science and Technology, Hong Kong, January 2008.

2007

• Online Computation and Competitive Analysis.
  Invited Lecture, COMP 516, Department of Computer Science, University of Liverpool, Liverpool, UK, October 2007.
• Energy Efficient Online Deadline Scheduling.
  Departmental Seminar, Technion, Haifa, Israel, May 2007.
• Optimal On-line Colorings for Minimizing the Number of ADMs in Optical Networks.
  London Stringology Days, King's College London, London, UK, March 2007.
• Energy Efficient Online Deadline Scheduling.
  Complexity, Theory and Algorithmics Group (CTAG) Seminar, University of Liverpool, Liverpool, UK, March 2007.
• Computational Biology - An Algorithmic Approach.
  Invited Lecture, BIOL 725, School of Biological Sciences, University of Liverpool, Liverpool, UK, February 2007.
• Energy Efficient Online Deadline Scheduling.
  Bristol Algorithm Days, University of Bristol, Bristol, UK, February 2007.
• Computational Biology - An Algorithmic Approach.
  Interdisciplinary Research Seminar, School of Biological Sciences, University of Liverpool, Liverpool, UK, February 2007.
• Energy Efficient Online Deadline Scheduling.
  The 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), New Orleans, USA, January 2007.

2006

• Dynamic Bin Packing with no Repacking.
  Lecture Series at National Tsing Hua University, Hsin Chu, Taiwan, December 2006.
• Atomic Selfish Routing in Parallel Link Network.
  Bertinoro Workshop on Adversarial Modeling and Analysis of Communication Networks, Bertinoro, Italy, November, 2006.
• Energy Efficient Online Deadline Scheduling.
  Algorithm Group Seminar, University of Bergen, Bergen, Norway, November, 2006.
• Dynamic Bin Packing with no Repacking.
  ARC Project Workshop, Kiel, Germany, August, 2006.
• Locating Conserved Genes in Whole Genome Scale.
  3rd Haifa Stringology Workshop, Haifa, Israel, May, 2006.
• New Results on Dynamic Bin Packing.
  Departmental Seminar, University of Leicester, Leicester, UK, March, 2006.

2005

• Dynamic Bin Packing of Unit Fractions Items.
  Theory Group Seminar, The Hong Kong University of Science and Technology, Hong Kong, December, 2005.
• Dynamic Bin Packing of Unit Fractions Items.
  Complexity, Theory and Algorithmics Group (CTAG) Seminar, University of Liverpool, Liverpool, UK, December, 2005.
• Algorithmic Issues on Wireless computing.
  University of Liverpool, Liverpool, UK, October, 2005.
• New Resource Augmentation Analysis of the Total Stretch of SRPT and SJF in Multiprocessor Scheduling.
  12th Workshop on Applied/Advanced Research in Combinatorial Optimization (ARCO), Lund, Sweden, September, 2005.
• Wireless Communications --- Routing in Geometric Sensor Networks.
  Departmental Seminar, University of Hong Kong, Hong Kong, July, 2005.
• Locating Conserved Genes in Whole Genome Scale.
  DIMACS Workshop on Detecting and Processing Regularities in High Throughput Biological Data, Piscataway, New Jersey, USA, June, 2005.
• Introductory talk on "Wireless Networks" .
  Invited Talk, Scientific and Management Committee Meetings, COST Action 295 DYNAMO , Paris, France, May, 2005.

2004

• On-line Windows Scheduling of Temporary Items.
  The 15th International Symposium of Algorithms and Computation (ISAAC), Hong Kong, China, December, 2004.
• Combinatorial Problems in Whole Genome Alignment.
  Departmental Seminar, University of Liverpool, Liverpool, UK, October, 2004.
• On-demand Broadcasting with Deadline via Job Scheduling with Cancellation.
  Liverpool Algorithmic Afternoon, Liverpool, UK, October, 2004.
• A Mutation-Sensitive Approach for Locating Conserved Gene Pairs between Related Species.
  IEEE 4th Symposium on Bioinformatics and Bioengineering (BIBE), TaiChung, Republic of China, May, 2004.
• Filtering of Ineffective siRNAs and Improved siRNA Design Tool.
  The 2nd Asia-Pacific Bioinformatics Conference (APBC), Dunedin, New Zealand, January, 2004.
• Aggressive Online Deadline Scheduling.
  The 10th Computing: The Australian Theory Symposium (CATS), Dunedin, New Zealand, January, 2004.

2003

• Efficient Algorithms for Optimizing Whole Genome Alignment with Noise.
  The 14th International Symposium of Algorithms and Computation (ISAAC), Kyoto, Japan, December, 2003.
• Optimization Problems in VOD Stream Merging and Whole Genome Alignment.
  The University of Liverpool, Liverpool, UK, November, 2003.

2002

• Competitive Analysis of On-line Stream Merging Algorithms.
  The 27th International Symposium on Mathematical Foundations of Computer Science (MFCS), Warsaw, Poland, August, 2002.
• A Unified Analysis of Hot Video Schedulers.
  The 34th ACM Symposium on Theory of Computing (STOC), Montreal, Canada, May, 2002.

2001 and before

• A 5-Competitive On-line Scheduler for Merging Video Streams.
  The 15th International Parallel and Distributed Processing Symposium (IPDPS), Los Angeles, California, USA, April, 2001.
• On-line Load Balancing of Temporary Tasks Revisited.
  The 10th International Symposium of Algorithms and Computation (ISAAC), Chennai, India, December, 1999.
• An Approximation Algorithm for Bounded Length Tree Linear Broadcast Routing.
  The 1996 International Conference on Algorithms (ICS), Kaohsiung, Republic of China, December, 1996.
• An Efficient Algorithm for Optimal Linear Broadcast Routing.
  The 5th Italian Conference on Theoretical Computer Science (ICTCS), Ravello, Italy, November, 1995.