 | 2012 |
| 30 |  | Stanley P. Y. Fung,
Chung Keung Poon,
Feifeng Zheng:
Improved Randomized Online Scheduling of Intervals and Jobs
CoRR abs/1204.2933: (2012) |
| 29 |  | Stanley P. Y. Fung,
Chung Keung Poon,
Duncan K. W. Yung:
On-line scheduling of equal-length intervals on parallel machines.
Inf. Process. Lett. 112(10): 376-379 (2012) |
| 2011 |
| 28 |  | Martin Birks,
Daniel Cole,
Stanley P. Y. Fung,
Huichao Xue:
Online Algorithms for Maximizing Weighted Throughput of Unit Jobs with Temperature Constraints.
FAW-AAIM 2011: 319-329 |
| 27 |  | Martin Birks,
Stanley P. Y. Fung:
Temperature Aware Online Algorithms for Scheduling Equal Length Jobs.
FAW-AAIM 2011: 330-342 |
| 2010 |
| 26 |  | Stanley P. Y. Fung:
Online Preemptive Scheduling with Immediate Decision or Notification and Penalties.
COCOON 2010: 389-398 |
| 25 |  | Martin Birks,
Stanley P. Y. Fung:
Temperature Aware Online Scheduling with a Low Cooling Factor.
TAMC 2010: 105-116 |
| 24 |  | Stanley P. Y. Fung:
Bounded delay packet scheduling in a bounded buffer.
Oper. Res. Lett. 38(5): 396-398 (2010) |
| 2009 |
| 23 |  | Stanley P. Y. Fung:
Bounded Delay Packet Scheduling in a Bounded Buffer
CoRR abs/0907.2741: (2009) |
| 22 |  | Mee Yee Chan,
Wun-Tat Chan,
Francis Y. L. Chin,
Stanley P. Y. Fung,
Ming-Yang Kao:
Linear-Time Haplotype Inference on Pedigrees without Recombinations and Mating Loops.
SIAM J. Comput. 38(6): 2179-2197 (2009) |
| 2008 |
| 21 |  | Stanley P. Y. Fung,
Chung Keung Poon,
Feifeng Zheng:
Improved Randomized Online Scheduling of Unit Length Intervals and Jobs.
WAOA 2008: 53-66 |
| 20 |  | Stanley P. Y. Fung:
Lower bounds on online deadline scheduling with preemption penalties.
Inf. Process. Lett. 108(4): 214-218 (2008) |
| 19 |  | Stanley P. Y. Fung,
Chung Keung Poon,
Feifeng Zheng:
Online interval scheduling: randomized and multiprocessor cases.
J. Comb. Optim. 16(3): 248-262 (2008) |
| 18 |  | Stanley P. Y. Fung,
Feifeng Zheng,
Wun-Tat Chan,
Francis Y. L. Chin,
Chung Keung Poon,
Prudence W. H. Wong:
Improved on-line broadcast scheduling with deadlines.
J. Scheduling 11(4): 299-308 (2008) |
| 2007 |
| 17 |  | Stanley P. Y. Fung,
Chung Keung Poon,
Feifeng Zheng:
Online Interval Scheduling: Randomized and Multiprocessor Cases.
COCOON 2007: 176-186 |
| 16 |  | Wun-Tat Chan,
Yong Zhang,
Stanley P. Y. Fung,
Deshi Ye,
Hong Zhu:
Efficient algorithms for finding a longest common increasing subsequence.
J. Comb. Optim. 13(3): 277-288 (2007) |
| 2006 |
| 15 |  | Feifeng Zheng,
Stanley P. Y. Fung,
Wun-Tat Chan,
Francis Y. L. Chin,
Chung Keung Poon,
Prudence W. H. Wong:
Improved On-Line Broadcast Scheduling with Deadlines.
COCOON 2006: 320-329 |
| 14 |  | Bethany Man-Yee Chan,
Joseph Wun-Tat Chan,
Francis Y. L. Chin,
Stanley P. Y. Fung,
Ming-Yang Kao:
Linear-Time Haplotype Inference on Pedigrees Without Recombinations.
WABI 2006: 56-67 |
| 13 |  | Feifeng Zheng,
Francis Y. L. Chin,
Stanley P. Y. Fung,
Chung Keung Poon,
Yinfeng Xu:
A tight lower bound for job scheduling with cancellation.
Inf. Process. Lett. 97(1): 1-3 (2006) |
| 12 |  | Francis Y. L. Chin,
Marek Chrobak,
Stanley P. Y. Fung,
Wojciech Jawor,
Jiri Sgall,
Tomás Tichý:
Online competitive algorithms for maximizing weighted throughput of unit jobs.
J. Discrete Algorithms 4(2): 255-276 (2006) |
| 2005 |
| 11 |  | Stanley P. Y. Fung,
Francis Y. L. Chin,
Chung Keung Poon:
Laxity Helps in Broadcast Scheduling.
ICTCS 2005: 251-264 |
| 10 |  | Wun-Tat Chan,
Yong Zhang,
Stanley P. Y. Fung,
Deshi Ye,
Hong Zhu:
Efficient Algorithms for Finding a Longest Common Increasing Subsequence.
ISAAC 2005: 665-674 |
| 9 |  | Stanley P. Y. Fung,
Francis Y. L. Chin,
Chung Keung Poon:
Approximating the minimum triangulation of convex 3-polytopes with bounded degrees.
Comput. Geom. 32(1): 1-12 (2005) |
| 8 |  | Stanley P. Y. Fung,
Francis Y. L. Chin,
Hong Shen:
Online scheduling of unit jobs with bounded importance ratio.
Int. J. Found. Comput. Sci. 16(3): 581-598 (2005) |
| 2004 |
| 7 |  | Yair Bartal,
Francis Y. L. Chin,
Marek Chrobak,
Stanley P. Y. Fung,
Wojciech Jawor,
Ron Lavi,
Jiri Sgall,
Tomás Tichý:
Online Competitive Algorithms for Maximizing Weighted Throughput of Unit Jobs.
STACS 2004: 187-198 |
| 6 |  | Francis Y. L. Chin,
Stanley P. Y. Fung:
Improved competitive algorithms for online scheduling with partial job values.
Theor. Comput. Sci. 325(3): 467-478 (2004) |
| 2003 |
| 5 |  | Francis Y. L. Chin,
Stanley P. Y. Fung:
Improved Competitive Algorithms for Online Scheduling with Partial Job Values.
COCOON 2003: 425-434 |
| 4 |  | Francis Y. L. Chin,
Stanley P. Y. Fung:
Online Scheduling with Partial Job Values: Does Timesharing or Randomization Help?
Algorithmica 37(3): 149-164 (2003) |
| 2001 |
| 3 |  | Francis Y. L. Chin,
Stanley P. Y. Fung:
Approximation of Minimum Triangulation for Polyhedron with Bounded Degrees.
ISAAC 2001: 172-184 |
| 2 |  | Francis Y. L. Chin,
Stanley P. Y. Fung,
Cao An Wang:
Approximation for minimum triangulation of convex polyhedra.
SODA 2001: 128-137 |
| 1 |  | Francis Y. L. Chin,
Stanley P. Y. Fung,
Cao An Wang:
Approximation for Minimum Triangulations of Simplicial Convex 3-Polytopes.
Discrete & Computational Geometry 26(4): 499-511 (2001) |