Showing results 1 to 17 of 17
| Title | Author(s) | Issue Date | |
|---|---|---|---|
Approximating the minimum triangulation of convex 3-polytopes with bounded degrees Journal:Computational Geometry: Theory and Applications | 2005 | ||
Approximation Algorithms for Some Optimal 2D and 3D Triangulations Book:Handbook on Approximation Algorithms and Metaheuristics | 2006 | ||
Approximation for minimum triangulation of convex polyhedra Proceeding/Conference:Proceedings of the Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms | 2001 | ||
Approximation for minimum triangulations of simplicial convex 3-polytopes Journal:Discrete and Computanional Geometry | 2001 | ||
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 | ||
Improved competitive algorithms for online scheduling with partial job values Proceeding/Conference:Theoretical Computer Science | 2004 | ||
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 | ||
Improved on-line broadcast scheduling with deadlines Proceeding/Conference:Lecture Notes in Computer Science | 2006 | ||
Improved on-line broadcast scheduling with deadlines Journal:Journal of Scheduling | 2008 | ||
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 | ||
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 | ||
Linear-time haplotype inference on pedigrees without recombinations and mating loops Journal:SIAM Journal on Computing | 2009 | ||
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 | ||
Online competitive algorithms for maximizing weighted throughput of unit jobs Journal:Journal of Discrete Algorithms | 2006 | ||
Online scheduling of unit jobs with bounded importance ratio Journal:International Journal of Foundations of Computer Science | 2005 | ||
Online scheduling with partial job values: Does timesharing or randomization help? Journal:Algorithmica (New York) | 2003 | ||
A tight lower bound for job scheduling with cancellation Journal:Information Processing Letters | 2006 |