Browsing by Author Fung, SPY

Jump to: 0-9 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
Showing results 1 to 17 of 17
TitleAuthor(s)Issue DateViews
 
Approximating the minimum triangulation of convex 3-polytopes with bounded degrees
Journal:Computational Geometry: Theory and Applications
2005
193
 
Approximation Algorithms for Some Optimal 2D and 3D Triangulations
Book:Handbook on Approximation Algorithms and Metaheuristics
2006
126
 
Approximation for minimum triangulation of convex polyhedra
Proceeding/Conference:Proceedings of the Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms
2001
98
 
2001
122
Approximation of minimum triangulation for polyhedron with bounded degrees
Proceeding/Conference:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
2001
124
2004
114
 
Improved competitive algorithms for online scheduling with partial job values
Journal:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
2003
109
Improved on-line broadcast scheduling with deadlines
Proceeding/Conference:Lecture Notes in Computer Science
2006
110
 
2008
145
Laxity helps in broadcast scheduling
Proceeding/Conference:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
2005
115
Linear-time haplotype inference on pedigrees without recombinations
Proceeding/Conference:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
2006
129
 
2009
210
 
Online competitive algorithms for maximizing weighted throughput of unit jobs
Journal:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
2004
122
 
2006
118
 
Online scheduling of unit jobs with bounded importance ratio
Journal:International Journal of Foundations of Computer Science
2005
204
 
2003
130
 
A tight lower bound for job scheduling with cancellation
Journal:Information Processing Letters
2006
216