| |
 |      |
                                            |
Note: Links lead to the DBLP on the Web. Francis Y. L. Chin 25 Francis Y. L. Chin, C. K. M. Wong , V. Mak : Experiences in Running a Flexible, Web-Based, and Self-Paced Course. ICWL 2002 : 241-251 24 Ke Wang , Yu He , David Wai-Lok Cheung , Francis Y. L. Chin: Mining Confident Rules Without Support Requirement. CIKM 2001 : 89-96 23 Francis Y. L. Chin, Stanley P. Y. Fung : Approximation of Minimum Triangulation for Polyhedron with Bounded Degrees. ISAAC 2001 : 172-184 22 Francis Y. L. Chin, Stanley P. Y. Fung , Cao An Wang : Approximation for minimum triangulation of convex polyhedra. SODA 2001 : 128-137 21 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) 20 Cao An Wang , Francis Y. L. Chin, Bo-Ting Yang : Triangulations without Minimum-Weight Drawing. CIAC 2000 : 163-173 19 Wun-Tat Chan , Francis Y. L. Chin, Hing-Fung Ting : Escaping a grid by edge-disjoint paths. SODA 2000 : 726-734 18 Cao An Wang , Francis Y. L. Chin, Boting Yang : Triangulations without minimum-weight drawing. Information Processing Letters 74 (5-6): 183-189 (2000) 17 Wun-Tat Chan , Francis Y. L. Chin: Efficient Algorithms for Finding the Maximum Number of Disjoint Paths in Grids. J. Algorithms 34 (2): 337-369 (2000) 16 Wun-Tat Chan , Francis Y. L. Chin, Hing-Fung Ting : A Faster Algorithm for Finding Disjoint Paths in Grids. ISAAC 1999 : 393-402 15 Hong Shen , Francis Y. L. Chin, Yi Pan : Efficient Fault-Tolerant Routing in Multihop Optical WDM Networks. IEEE Transactions on Parallel and Distributed Systems 10 (10): 1012-1025 (1999) 14 Cao An Wang , Francis Y. L. Chin, Bo-Ting Yang : Maximum Weight Triangulation and Graph Drawing. Information Processing Letters 70 (1): 17-22 (1999) 13 Chung Keung Poon , Binhai Zhu , Francis Y. L. Chin: A Polynomial Time Solution for Labeling a Rectlinear Map. Information Processing Letters 65 (4): 201-207 (1998) 12 Francis Y. L. Chin, Cao An Wang : Finding the Constrained Delaunay Triangulation and Constrained Voronoi Diagram of a Simple Polygon in Linear Time. SIAM J. Comput. 28 (2): 471-486 (1998) 11 Yue Man Sun , Wenping Wang , Francis Y. L. Chin: Interpolating Polyhedral Models Using Intrinsic Shape Parameters. Journal of Visualization and Computer Animation 8 (2): 81-96 (1997) 10 Bethany M. Y. Chan , Francis Y. L. Chin, Chung Keung Poon : Optimal Simulation of Full Binary Trees on Faulty Hypercubes. IEEE Transactions on Parallel and Distributed Systems 6 (3): 269-286 (1995) 9 Francis Y. L. Chin, Chung Keung Poon : Performance Analysis of Some Simple Heuristics for Computing Longest Common Subsequences. Algorithmica 12 (4/5): 293-311 (1994) 8 Kam-Wing Ng , Prabhakar Raghavan , N. V. Balasubramanian , Francis Y. L. Chin: Algorithms and Computation, 4th International Symposium, ISAAC '93, Hong Kong, December 15-17, 1993, Proceedings. Springer 1993 7 Mee Yee Chan , Francis Y. L. Chin: Optimal Resilient Distributed Algorithms for Ring Election. IEEE Transactions on Parallel and Distributed Systems 4 (4): 475-480 (1993) 6 Mee Yee Chan , Francis Y. L. Chin: A Parallel Algorithm for an Efficient Mapping of Grids in Hypercubes. IEEE Transactions on Parallel and Distributed Systems 4 (8): 933-946 (1993) 5 Mee Yee Chan , Francis Y. L. Chin: On Embedding Rectangular Grids in Hypercubes. IEEE Transactions on Computers 37 (10): 1285-1288 (1988) 4 Mee Yee Chan , Francis Y. L. Chin: Optimal Resilient Ring Election Algorithms. WDAG 1987 : 345-354 3 Francis Y. L. Chin, Cao An Wang : Minimum Vertex Distance Between Separable Convex Polygons. Information Processing Letters 18 (1): 41-45 (1984) 2 Francis Y. L. Chin: The Partial Fraction Expansion Problem and Its Inverse. SIAM J. Comput. 6 (3): 554-562 (1977) 1 Francis Y. L. Chin: A Generalized Asymptotic Upper Bound on Fast Polynomial Evaluation and Interpolation. SIAM J. Comput. 5 (4): 682-690 (1976)  DiSC'02 © 2003 Association for Computing Machinery |
