Search the dblp DataBase
Francis Y. L. Chin :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Francis Y. L. Chin Security in Statistical Databases for Queries with Small Counts. [Citation Graph (20, 3)][DBLP ] ACM Trans. Database Syst., 1978, v:3, n:1, pp:92-104 [Journal ] Clement T. Yu , Francis Y. L. Chin A Study on the Protection of Statistical Data Bases. [Citation Graph (19, 11)][DBLP ] SIGMOD Conference, 1977, pp:169-181 [Conf ] Francis Y. L. Chin , Gultekin Özsoyoglu Auditing and Inference Control in Statistical Databases. [Citation Graph (15, 0)][DBLP ] IEEE Trans. Software Eng., 1982, v:8, n:6, pp:574-582 [Journal ] Francis Y. L. Chin , Gultekin Özsoyoglu Statistical Database Design. [Citation Graph (11, 17)][DBLP ] ACM Trans. Database Syst., 1981, v:6, n:1, pp:113-139 [Journal ] Gultekin Özsoyoglu , Francis Y. L. Chin Enhancing the Security of Statistical Databases with a Question-Answering System and a Kernel Design. [Citation Graph (6, 0)][DBLP ] IEEE Trans. Software Eng., 1982, v:8, n:3, pp:223-234 [Journal ] Francis Y. L. Chin , Peter Kossowski , S. C. Loh Efficient Inference Control for Range SUM Queries. [Citation Graph (3, 0)][DBLP ] Theor. Comput. Sci., 1984, v:32, n:, pp:77-86 [Journal ] Francis Y. L. Chin , K. V. S. Ramarao An Information-Based Model for Failure-Handling in Distributed Database Systems. [Citation Graph (3, 0)][DBLP ] IEEE Trans. Software Eng., 1987, v:13, n:4, pp:420-431 [Journal ] Mee Yee Chan , Francis Y. L. Chin Schedulers for Larger Classes of Pinwheel Instances. [Citation Graph (2, 0)][DBLP ] Algorithmica, 1993, v:9, n:5, pp:425-462 [Journal ] Francis Y. L. Chin , K. V. S. Ramarao Optimal Termination Protocols for Network Partitioning. [Citation Graph (2, 0)][DBLP ] SIAM J. Comput., 1986, v:15, n:1, pp:131-144 [Journal ] Francis Y. L. Chin , K. V. S. Ramarao Optimal Termination Prococols for Network Partitioning. [Citation Graph (1, 8)][DBLP ] PODS, 1983, pp:25-35 [Conf ] Mee Yee Chan , Francis Y. L. Chin General Schedulers for the Pinwheel Problem Based on Double-Integer Reduction. [Citation Graph (1, 0)][DBLP ] IEEE Trans. Computers, 1992, v:41, n:6, pp:755-768 [Journal ] Francis Y. L. Chin , Henry C. M. Leung Voting algorithms for discovering long motifs. [Citation Graph (0, 0)][DBLP ] APBC, 2005, pp:261-271 [Conf ] Francis Y. L. Chin , Henry C. M. Leung An Efficient Algorithm for String Motif Discovery. [Citation Graph (0, 0)][DBLP ] APBC, 2006, pp:79-88 [Conf ] Henry C. M. Leung , Francis Y. L. Chin An Efficient Algorithm for the Extended (l, d)-Motif Problem with Unknown Number of Binding Sites. [Citation Graph (0, 0)][DBLP ] BIBE, 2005, pp:11-18 [Conf ] Henry C. M. Leung , Francis Y. L. Chin Discovering DNA Motifs with Nucleotide Dependency. [Citation Graph (0, 0)][DBLP ] BIBE, 2006, pp:70-80 [Conf ] Cao An Wang , Francis Y. L. Chin , Bo-Ting Yang Triangulations without Minimum-Weight Drawing. [Citation Graph (0, 0)][DBLP ] CIAC, 2000, pp:163-173 [Conf ] Ke Wang , Yu He , David Wai-Lok Cheung , Francis Y. L. Chin Mining Confident Rules Without Support Requirement. [Citation Graph (0, 0)][DBLP ] CIKM, 2001, pp:89-96 [Conf ] K. W. Chan , Francis Y. L. Chin Optimal Multiresolution Polygonal Approximation. [Citation Graph (0, 0)][DBLP ] COCOON, 1997, pp:32-41 [Conf ] Wun-Tat Chan , Francis Y. L. Chin , Yong Zhang , Hong Zhu , Hong Shen , Prudence W. H. Wong Off-Line Algorithms for Minimizing Total Flow Time in Broadcast Scheduling. [Citation Graph (0, 0)][DBLP ] COCOON, 2005, pp:318-328 [Conf ] Francis Y. L. Chin , Stanley P. Y. Fung Improved Competitive Algorithms for Online Scheduling with Partial Job Values. [Citation Graph (0, 0)][DBLP ] COCOON, 2003, pp:425-434 [Conf ] Francis Y. L. Chin , Jianbo Qian , Cao An Wang Progress on Maximum Weight Triangulation. [Citation Graph (0, 0)][DBLP ] COCOON, 2004, pp:53-61 [Conf ] Francis Y. L. Chin , Cao An Wang , Fu Lee Wang Maximum Stabbing Line in 2D Plane. [Citation Graph (0, 0)][DBLP ] COCOON, 1999, pp:379-388 [Conf ] Cao An Wang , Francis Y. L. Chin , Bo-Ting Yang Maximum Weight Triangulation and Its Application on Graph Drawing. [Citation Graph (0, 0)][DBLP ] COCOON, 1998, pp:25-34 [Conf ] 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. [Citation Graph (0, 0)][DBLP ] COCOON, 2006, pp:320-329 [Conf ] Francis Y. L. Chin , N. L. Ho , Tak Wah Lam , Prudence W. H. Wong , Mee Yee Chan Efficient Constrained Multiple Sequence Alignment with Performance Guarantee. [Citation Graph (0, 0)][DBLP ] CSB, 2003, pp:337-346 [Conf ] Henry C. M. Leung , Francis Y. L. Chin Finding exact optimal motifs in matrix representation by partitioning. [Citation Graph (0, 0)][DBLP ] ECCB/JBI, 2005, pp:92- [Conf ] Cao An Wang , Francis Y. L. Chin Finding the Constrained Delaunay Triangulation and Constrainted Voronoi Diagram of a Simple Polygon in Linear-Time (Extended Abstract). [Citation Graph (0, 0)][DBLP ] ESA, 1995, pp:280-294 [Conf ] Francis Y. L. Chin , H. F. Ting An Almost Linear Time and O(n log n + e) Messages Distributed Algorithm for Minimum-Weight Spanning Trees [Citation Graph (0, 0)][DBLP ] FOCS, 1985, pp:257-266 [Conf ] Cao An Wang , Francis Y. L. Chin , Bo-Ting Yang Maximum Weight Triangulation and Graph Drawing. [Citation Graph (0, 0)][DBLP ] Graph Drawing, 1998, pp:460-461 [Conf ] Francis Y. L. Chin , Qiangfeng Zhang , Hong Shen k-Recombination Haplotype Inference in Pedigrees. [Citation Graph (0, 0)][DBLP ] International Conference on Computational Science (2), 2005, pp:985-993 [Conf ] Keqiu Li , Hong Shen , Francis Y. L. Chin Cooperative Determination on Cache Replacement Candidates for Transcoding Proxy Caching. [Citation Graph (0, 0)][DBLP ] ICCNMC, 2005, pp:178-187 [Conf ] Francis Y. L. Chin , H. F. Ting A Near-optimal Algorithm for Finding the Median Distributively. [Citation Graph (0, 0)][DBLP ] ICDCS, 1985, pp:459-465 [Conf ] Boris Wai-Sing Yiu , Kwan-Yee Kenneth Wong , Francis Y. L. Chin , Ronald H. Y. Chung Explicit contour model for vehicle tracking with automatic hypothesis validation. [Citation Graph (0, 0)][DBLP ] ICIP (2), 2005, pp:582-589 [Conf ] Wai Wan Tsang , Tak Wah Lam , Francis Y. L. Chin An Optimal EREW Parallel Algorithm for Parenthesis Matching. [Citation Graph (0, 0)][DBLP ] ICPP (3), 1989, pp:185-192 [Conf ] Stanley P. Y. Fung , Francis Y. L. Chin , Chung Keung Poon Laxity Helps in Broadcast Scheduling. [Citation Graph (0, 0)][DBLP ] ICTCS, 2005, pp:251-264 [Conf ] Francis Y. L. Chin , C. K. M. Wong , V. Mak Experiences in Running a Flexible, Web-Based, and Self-Paced Course. [Citation Graph (0, 0)][DBLP ] ICWL, 2002, pp:241-251 [Conf ] Mee Yee Chan , Francis Y. L. Chin , Chung Keung Poon Optimal Specified Root Embedding of Full Binary Trees in Faulty Hypercubes. [Citation Graph (0, 0)][DBLP ] ISA, 1991, pp:241-250 [Conf ] Wun-Tat Chan , Francis Y. L. Chin Algorithms for Finding Optimal Disjoint Paths Around a Rectangle. [Citation Graph (0, 0)][DBLP ] ISAAC, 1997, pp:314-323 [Conf ] Wun-Tat Chan , Francis Y. L. Chin , Hing-Fung Ting A Faster Algorithm for Finding Disjoint Paths in Grids. [Citation Graph (0, 0)][DBLP ] ISAAC, 1999, pp:393-402 [Conf ] Joseph Wun-Tat Chan , Francis Y. L. Chin , Deshi Ye , Yong Zhang , Hong Zhu Frequency Allocation Problems for Linear Cellular Networks. [Citation Graph (0, 0)][DBLP ] ISAAC, 2006, pp:61-70 [Conf ] Francis Y. L. Chin , Stanley P. Y. Fung Approximation of Minimum Triangulation for Polyhedron with Bounded Degrees. [Citation Graph (0, 0)][DBLP ] ISAAC, 2001, pp:172-184 [Conf ] Francis Y. L. Chin , Jack Snoeyink , Cao An Wang Finding the Medial Axis of a Simple Polygon in Linear Time. [Citation Graph (0, 0)][DBLP ] ISAAC, 1995, pp:382-391 [Conf ] Francis Y. L. Chin , Cao An Wang On Greedy Tetrahedralization of Points in 3D. [Citation Graph (0, 0)][DBLP ] ISAAC, 1994, pp:532-540 [Conf ] Boting Yang , Cao An Wang , Francis Y. L. Chin Algorithms and Complexity for Tetrahedralization Detections. [Citation Graph (0, 0)][DBLP ] ISAAC, 2002, pp:296-307 [Conf ] Cao An Wang , Francis Y. L. Chin , Yin-Feng Xu A New Subgraph of Minimum Weight Triangulations. [Citation Graph (0, 0)][DBLP ] ISAAC, 1996, pp:266-274 [Conf ] Keqiu Li , Hong Shen , Francis Y. L. Chin Placement Solutions for Multiple Versions of A Multimedia Object. [Citation Graph (0, 0)][DBLP ] ISORC, 2005, pp:224-231 [Conf ] Sheng Zhong , Francis Y. L. Chin Improved and Optimal Adaptive Hierarchical Vector Quantization for Image Coding and Indexing. [Citation Graph (0, 0)][DBLP ] IW-MMDBMS, 1995, pp:102-109 [Conf ] Hong Shen , Francis Y. L. Chin Selection and Multiselection on Multi-Dimensional Meshes. [Citation Graph (0, 0)][DBLP ] PDPTA, 2000, pp:- [Conf ] Francis Y. L. Chin , Henry C. M. Leung , Siu-Ming Yiu , Tak Wah Lam , Roni Rosenfeld , Wai Wan Tsang , David K. Smith , Y. Jiang Finding motifs for insufficient number of sequences with strong binding to transcription facto. [Citation Graph (0, 0)][DBLP ] RECOMB, 2004, pp:125-132 [Conf ] Angie W. K. So , Kwan-Yee Kenneth Wong , Ronald H. Y. Chung , Francis Y. L. Chin Shadow detection for vehicles by locating the object-shadow boundary. [Citation Graph (0, 0)][DBLP ] SIP, 2005, pp:315-319 [Conf ] Wun-Tat Chan , Francis Y. L. Chin Efficient Algorithms for Finding Disjoint Paths in Grids (Extended Abstract). [Citation Graph (0, 0)][DBLP ] SODA, 1997, pp:454-463 [Conf ] Wun-Tat Chan , Francis Y. L. Chin , Hing-Fung Ting Escaping a grid by edge-disjoint paths. [Citation Graph (0, 0)][DBLP ] SODA, 2000, pp:726-734 [Conf ] Francis Y. L. Chin , Stanley P. Y. Fung , Cao An Wang Approximation for minimum triangulation of convex polyhedra. [Citation Graph (0, 0)][DBLP ] SODA, 2001, pp:128-137 [Conf ] Mee Yee Chan , F. Chin , C. N. Chu , W. K. Mak Dilation-5 Embedding of 3-Dimensional Grids into Hypercubes. [Citation Graph (0, 0)][DBLP ] SPDP, 1993, pp:285-289 [Conf ] Francis Y. L. Chin , Peter Kossowski Efficient Inference Control for Range SUM Queries on Statistical Data Bases. [Citation Graph (0, 7)][DBLP ] SSDBM, 1981, pp:239-248 [Conf ] 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. [Citation Graph (0, 0)][DBLP ] STACS, 2004, pp:187-198 [Conf ] Mee Yee Chan , Danny Z. Chen , Francis Y. L. Chin , Cao An Wang Construction of the Nearest Neighbor Embracing Graph of a Point Set. [Citation Graph (0, 0)][DBLP ] SWAT, 2004, pp:150-160 [Conf ] Henry C. M. Leung , Francis Y. L. Chin Generalized Planted (l , d )-Motif Problem with Negative Set. [Citation Graph (0, 0)][DBLP ] WABI, 2005, pp:264-275 [Conf ] 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. [Citation Graph (0, 0)][DBLP ] WABI, 2006, pp:56-67 [Conf ] Francis Y. L. Chin , Der-Tsai Lee , Cao An Wang A Parallel Algorithm for Finding the Constrained Voronoi Diagram of Line Segments in the Plane. [Citation Graph (0, 0)][DBLP ] WADS, 1999, pp:231-240 [Conf ] Mee Yee Chan , Francis Y. L. Chin Optimal Resilient Ring Election Algorithms. [Citation Graph (0, 0)][DBLP ] WDAG, 1987, pp:345-354 [Conf ] Wun-Tat Chan , Francis Y. L. Chin , Deshi Ye , Guochuan Zhang , Yong Zhang Online Bin Packing of Fragile Objects with Application in Cellular Networks. [Citation Graph (0, 0)][DBLP ] WINE, 2005, pp:564-573 [Conf ] Wun-Tat Chan , Francis Y. L. Chin , Hing-Fung Ting Escaping a Grid by Edge-Disjoint Paths. [Citation Graph (0, 0)][DBLP ] Algorithmica, 2003, v:36, n:4, pp:343-359 [Journal ] Francis Y. L. Chin , Stanley P. Y. Fung Online Scheduling with Partial Job Values: Does Timesharing or Randomization Help? [Citation Graph (0, 0)][DBLP ] Algorithmica, 2003, v:37, n:3, pp:149-164 [Journal ] Francis Y. L. Chin , Chung Keung Poon Performance Analysis of Some Simple Heuristics for Computing Longest Common Subsequences. [Citation Graph (0, 0)][DBLP ] Algorithmica, 1994, v:12, n:4/5, pp:293-311 [Journal ] Francis Y. L. Chin , H. F. Ting An Improved Algorithm for Finding the Median Distributively. [Citation Graph (0, 0)][DBLP ] Algorithmica, 1987, v:2, n:, pp:235-249 [Journal ] Henry C. M. Leung , Francis Y. L. Chin Finding motifs from all sequences with and without binding sites. [Citation Graph (0, 0)][DBLP ] Bioinformatics, 2006, v:22, n:18, pp:2217-2223 [Journal ] Francis Y. L. Chin An O(n) Algorithm for Determining a Near-Optimal Computation Order of Matrix Chain Products. [Citation Graph (0, 0)][DBLP ] Commun. ACM, 1978, v:21, n:7, pp:544-549 [Journal ] Francis Y. L. Chin , John Lam , I-Ngo Chen Efficient Parallel Algorithms for Some Graph Problems. [Citation Graph (0, 0)][DBLP ] Commun. ACM, 1982, v:25, n:9, pp:659-665 [Journal ] Stanley P. Y. Fung , Francis Y. L. Chin , Chung Keung Poon Approximating the minimum triangulation of convex 3-polytopes with bounded degrees. [Citation Graph (0, 0)][DBLP ] Comput. Geom., 2005, v:32, n:1, pp:1-12 [Journal ] Mee Yee Chan , Francis Y. L. Chin Distributed Election in Complete Networks. [Citation Graph (0, 0)][DBLP ] Distributed Computing, 1988, v:3, n:1, pp:19-22 [Journal ] Francis Y. L. Chin , Stanley P. Y. Fung , Cao An Wang Approximation for Minimum Triangulations of Simplicial Convex 3-Polytopes. [Citation Graph (0, 0)][DBLP ] Discrete & Computational Geometry, 2001, v:26, n:4, pp:499-511 [Journal ] Francis Y. L. Chin , Jack Snoeyink , Cao An Wang Finding the Medial Axis of a Simple Polygon in Linear Time. [Citation Graph (0, 0)][DBLP ] Discrete & Computational Geometry, 1999, v:21, n:3, pp:405-420 [Journal ] Stanley P. Y. Fung , Francis Y. L. Chin , Hong Shen Online scheduling of unit jobs with bounded importance ratio. [Citation Graph (0, 0)][DBLP ] Int. J. Found. Comput. Sci., 2005, v:16, n:3, pp:581-598 [Journal ] Francis Y. L. Chin , Kenneth Steiglitz A Fast Error Evaluation Algorithm for Polynomial Approximation. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1977, v:6, n:1, pp:18-21 [Journal ] Francis Y. L. Chin , Alfredo De Santis , Anna Lisa Ferrara , N. L. Ho , S. K. Kim A simple algorithm for the constrained sequence problems. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2004, v:90, n:4, pp:175-179 [Journal ] Francis Y. L. Chin , Hong Shen , Fu Lee Wang Transversal of disjoint convex polygons. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2003, v:85, n:1, pp:55-60 [Journal ] Francis Y. L. Chin , Fu Lee Wang Efficient algorithm for transversal of disjoint convex polygons. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2002, v:83, n:3, pp:141-144 [Journal ] Francis Y. L. Chin , Fu Lee Wang Erratum to: "Efficient algorithm for transversal of disjoint convex polygons". [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2003, v:85, n:1, pp:53- [Journal ] Francis Y. L. Chin , Cao An Wang Minimum Vertex Distance Between Separable Convex Polygons. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1984, v:18, n:1, pp:41-45 [Journal ] Chung Keung Poon , Binhai Zhu , Francis Y. L. Chin A Polynomial Time Solution for Labeling a Rectlinear Map. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1998, v:65, n:4, pp:201-207 [Journal ] Yung H. Tsin , Francis Y. L. Chin A General Program Scheme for Finding Bridges. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1983, v:17, n:5, pp:269-272 [Journal ] Cao An Wang , Francis Y. L. Chin , Boting Yang Triangulations without minimum-weight drawing. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2000, v:74, n:5-6, pp:183-189 [Journal ] Cao An Wang , Francis Y. L. Chin , Bo-Ting Yang Maximum Weight Triangulation and Graph Drawing. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1999, v:70, n:1, pp:17-22 [Journal ] Feifeng Zheng , Francis Y. L. Chin , Stanley P. Y. Fung , Chung Keung Poon , Yinfeng Xu A tight lower bound for job scheduling with cancellation. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2006, v:97, n:1, pp:1-3 [Journal ] Joseph Wun-Tat Chan , Francis Y. L. Chin , Deshi Ye , Yong Zhang , Hong Zhu Greedy online frequency allocation in cellular networks. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2007, v:102, n:2-3, pp:55-61 [Journal ] James O. Achugbue , Francis Y. L. Chin Bounds on Schedules for Independent Tasks with Similar Execution Times. [Citation Graph (0, 0)][DBLP ] J. ACM, 1981, v:28, n:1, pp:81-99 [Journal ] Francis Y. L. Chin Security problems on inference control for SUM, MAX, and MIN queries. [Citation Graph (0, 0)][DBLP ] J. ACM, 1986, v:33, n:3, pp:451-464 [Journal ] Francis Y. L. Chin , Long-Lieh Tsai On J-maximal and J-minimal Flow-Shop Schedules. [Citation Graph (0, 0)][DBLP ] J. ACM, 1981, v:28, n:3, pp:462-476 [Journal ] Wun-Tat Chan , Francis Y. L. Chin Efficient Algorithms for Finding the Maximum Number of Disjoint Paths in Grids. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 2000, v:34, n:2, pp:337-369 [Journal ] Francis Y. L. Chin , N. L. Ho , Tak Wah Lam , Prudence W. H. Wong Efficient Constrained Multiple Sequence Alignment with Performance Guarantee. [Citation Graph (0, 0)][DBLP ] J. Bioinformatics and Computational Biology, 2005, v:3, n:1, pp:1-18 [Journal ] Henry C. M. Leung , Francis Y. L. Chin Algorithms for Challenging Motif Problems. [Citation Graph (0, 0)][DBLP ] J. Bioinformatics and Computational Biology, 2006, v:4, n:1, pp:43-58 [Journal ] Henry C. M. Leung , Francis Y. L. Chin , Siu-Ming Yiu , Ronald Rosenfeld , Wai Wan Tsang Finding Motifs with Insufficient Number of Strong Binding Sites. [Citation Graph (0, 0)][DBLP ] Journal of Computational Biology, 2005, v:12, n:6, pp:686-701 [Journal ] Cao An Wang , Francis Y. L. Chin , Yin-Feng Xu A New Subgraph of Minimum Weight Triangulations. [Citation Graph (0, 0)][DBLP ] J. Comb. Optim., 1997, v:1, n:2, pp:115-127 [Journal ] Wun-Tat Chan , Francis Y. L. Chin , Yong Zhang , Hong Zhu , Hong Shen , Prudence W. H. Wong A dynamic programming approach of finding an optimal broadcast schedule in minimizing total flow time. [Citation Graph (0, 0)][DBLP ] J. Comb. Optim., 2006, v:11, n:2, pp:177-187 [Journal ] M. Y. Chan , Danny Z. Chen , Francis Y. L. Chin , Cao An Wang Construction of the nearest neighbor embracing graph of a point set. [Citation Graph (0, 0)][DBLP ] J. Comb. Optim., 2006, v:11, n:4, pp:435-443 [Journal ] Francis Y. L. Chin , David Houck Algorithms for Updating Minimal Spanning Trees. [Citation Graph (0, 0)][DBLP ] J. Comput. Syst. Sci., 1978, v:16, n:3, pp:333-344 [Journal ] 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. [Citation Graph (0, 0)][DBLP ] J. Discrete Algorithms, 2006, v:4, n:2, pp:255-276 [Journal ] Mee Yee Chan , Francis Y. L. Chin , C. N. Chu , W. K. Mak Dilation-5 Embedding of 3-Dimensional Grids into Hypercubes. [Citation Graph (0, 0)][DBLP ] J. Parallel Distrib. Comput., 1996, v:33, n:1, pp:98-106 [Journal ] Joseph Y.-T. Leung , Tommy W. Tam , C. S. Wong , Gilbert H. Young , Francis Y. L. Chin Packing Squares into a Square. [Citation Graph (0, 0)][DBLP ] J. Parallel Distrib. Comput., 1990, v:10, n:3, pp:271-275 [Journal ] Yue Man Sun , Wenping Wang , Francis Y. L. Chin Interpolating Polyhedral Models Using Intrinsic Shape Parameters. [Citation Graph (0, 0)][DBLP ] Journal of Visualization and Computer Animation, 1997, v:8, n:2, pp:81-96 [Journal ] James O. Achugbue , Francis Y. L. Chin Scheduling the Open Shop to Minimize Mean Flow Time. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1982, v:11, n:4, pp:709-720 [Journal ] Francis Y. L. Chin A Generalized Asymptotic Upper Bound on Fast Polynomial Evaluation and Interpolation. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1976, v:5, n:4, pp:682-690 [Journal ] Francis Y. L. Chin The Partial Fraction Expansion Problem and Its Inverse. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1977, v:6, n:3, pp:554-562 [Journal ] Francis Y. L. Chin , H. F. Ting Improving the Time Complexity of Message-Optimal Distributed Algorithms for Minimum-Weight Spanning Trees. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1990, v:19, n:4, pp:612-626 [Journal ] Francis Y. L. Chin , Cao An Wang Finding the Constrained Delaunay Triangulation and Constrained Voronoi Diagram of a Simple Polygon in Linear Time. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1998, v:28, n:2, pp:471-486 [Journal ] Yung H. Tsin , Francis Y. L. Chin Efficient Parallel Algorithms for a Class of Graph Theoretic Problems. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1984, v:13, n:3, pp:580-599 [Journal ] Mee Yee Chan , Francis Y. L. Chin On Embedding Rectangular Grids in Hypercubes. [Citation Graph (0, 0)][DBLP ] IEEE Trans. Computers, 1988, v:37, n:10, pp:1285-1288 [Journal ] Francis Y. L. Chin , K. Samson Fok Fast Sorting Algorithms on Uniform Ladders (Multiple Shift-Register Loops). [Citation Graph (0, 0)][DBLP ] IEEE Trans. Computers, 1980, v:29, n:7, pp:618-631 [Journal ] Francis Y. L. Chin , Cao An Wang Optimal Algorithms for the Intersection and the Minimum Distance Problems Between Planar Polygons. [Citation Graph (0, 0)][DBLP ] IEEE Trans. Computers, 1983, v:32, n:12, pp:1203-1207 [Journal ] Francis Y. L. Chin , Xiaotie Deng , Qizhi Fang , Shanfeng Zhu Approximate and dynamic rank aggregation. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2004, v:325, n:3, pp:409-424 [Journal ] Francis Y. L. Chin , Stanley P. Y. Fung Improved competitive algorithms for online scheduling with partial job values. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2004, v:325, n:3, pp:467-478 [Journal ] Qiangfeng Zhang , Francis Y. L. Chin , Hong Shen Minimum Parent-Offspring Recombination Haplotype Inference in Pedigrees. [Citation Graph (0, 0)][DBLP ] T. Comp. Sys. Biology, 2005, v:2, n:, pp:100-112 [Journal ] Keqiu Li , Hong Shen , Francis Y. L. Chin , Si-Qing Zheng Optimal methods for coordinated enroute web caching for tree networks. [Citation Graph (0, 0)][DBLP ] ACM Trans. Internet Techn., 2005, v:5, n:3, pp:480-507 [Journal ] Mee Yee Chan , Francis Y. L. Chin Optimal Resilient Distributed Algorithms for Ring Election. [Citation Graph (0, 0)][DBLP ] IEEE Trans. Parallel Distrib. Syst., 1993, v:4, n:4, pp:475-480 [Journal ] Mee Yee Chan , Francis Y. L. Chin A Parallel Algorithm for an Efficient Mapping of Grids in Hypercubes. [Citation Graph (0, 0)][DBLP ] IEEE Trans. Parallel Distrib. Syst., 1993, v:4, n:8, pp:933-946 [Journal ] Bethany Man-Yee Chan , Francis Y. L. Chin , Chung Keung Poon Optimal Simulation of Full Binary Trees on Faulty Hypercubes. [Citation Graph (0, 0)][DBLP ] IEEE Trans. Parallel Distrib. Syst., 1995, v:6, n:3, pp:269-286 [Journal ] Hong Shen , Francis Y. L. Chin , Yi Pan Efficient Fault-Tolerant Routing in Multihop Optical WDM Networks. [Citation Graph (0, 0)][DBLP ] IEEE Trans. Parallel Distrib. Syst., 1999, v:10, n:10, pp:1012-1025 [Journal ] Keqiu Li , Hong Shen , Francis Y. L. Chin , Weishi Zhang Multimedia Object Placement for Transparent Data Replication. [Citation Graph (0, 0)][DBLP ] IEEE Trans. Parallel Distrib. Syst., 2007, v:18, n:2, pp:212-224 [Journal ] Francis Y. L. Chin , Jeffrey Sampson , Cao An Wang A unifying approach for a class of problems in the computational geometry of polygons. [Citation Graph (0, 0)][DBLP ] The Visual Computer, 1985, v:1, n:2, pp:124-132 [Journal ] Francis Y. L. Chin , Yong Zhang , Hong Zhu Online OVSF Code Assignment with Resource Augmentation. [Citation Graph (0, 0)][DBLP ] AAIM, 2007, pp:191-200 [Conf ] Francis Y. L. Chin , Yong Zhang , Hong Zhu A 1-Local 13/9-Competitive Algorithm for Multicoloring Hexagonal Graphs. [Citation Graph (0, 0)][DBLP ] COCOON, 2007, pp:526-536 [Conf ] Francis Y. L. Chin Online Frequency Assignment in Wireless Communication Networks. [Citation Graph (0, 0)][DBLP ] COCOON, 2007, pp:2- [Conf ] Jacky S-C. Yuk , Kwan-Yee Kenneth Wong , Ronald H-Y. Chung , K. P. Chow , Francis Y. L. Chin , Kenneth S-H. Tsang Object-Based Surveillance Video Retrieval System with Real-Time Indexing Methodology. [Citation Graph (0, 0)][DBLP ] ICIAR, 2007, pp:626-637 [Conf ] X. He , N. H. C. Yung , K. P. Chow , Francis Y. L. Chin , Ronald H. Y. Chung , Kwan-Yee Kenneth Wong , K. S. H. Tsang Watershed segmentation with boundary curvature ratio based merging criterion. [Citation Graph (0, 0)][DBLP ] SIP, 2007, pp:7-12 [Conf ] Joseph Wun-Tat Chan , Francis Y. L. Chin , Deshi Ye , Yong Zhang Online frequency allocation in cellular networks. [Citation Graph (0, 0)][DBLP ] SPAA, 2007, pp:241-249 [Conf ] Francis Y. L. Chin , Henry C. M. Leung , W. K. Sung , Siu-Ming Yiu The Point Placement Problem on a Line - Improved Bounds for Pairwise Distance Queries. [Citation Graph (0, 0)][DBLP ] WABI, 2007, pp:372-382 [Conf ] Algorithms for Placing Monitors in a Flow Network. [Citation Graph (, )][DBLP ] Online Uniformly Inserting Points on Grid. [Citation Graph (, )][DBLP ] Optimal Algorithm for Finding DNA Motifs with Nucleotide Adjacent Dependency. [Citation Graph (, )][DBLP ] Unsupervised binning of environmental genomic fragments based on an error robust selection of l-mers. [Citation Graph (, )][DBLP ] Online Tree Node Assignment with Resource Augmentation. [Citation Graph (, )][DBLP ] Approximated Distributed Minimum Vertex Cover Algorithms for Bounded Degree Graphs. [Citation Graph (, )][DBLP ] Minimum Manhattan network is NP-complete. [Citation Graph (, )][DBLP ] A hybrid simulated annealing algorithm for container loading problem. [Citation Graph (, )][DBLP ] A Constant-Competitive Algorithm for Online OVSF Code Assignment. [Citation Graph (, )][DBLP ] 1-Bounded Space Algorithms for 2-Dimensional Bin Packing. [Citation Graph (, )][DBLP ] Discovering Motifs With Transcription Factor Domain Knowledge. [Citation Graph (, )][DBLP ] IDBA - A Practical Iterative de Bruijn Graph De Novo Assembler. [Citation Graph (, )][DBLP ] Dynamic Offline Conflict-Free Coloring for Unit Disks. [Citation Graph (, )][DBLP ] Variable-Size Rectangle Covering. [Citation Graph (, )][DBLP ] Deterministic Online Call Control in Cellular Networks and Triangle-Free Cellular Networks. [Citation Graph (, )][DBLP ] Efficient Block-based Motion Segmentation Method using Motion Vector Consistency. [Citation Graph (, )][DBLP ] A 1-Local Asymptotic 13/9-Competitive Algorithm for Multicoloring Hexagonal Graphs. [Citation Graph (, )][DBLP ] A Constant-Competitive Algorithm for Online OVSF Code Assignment. [Citation Graph (, )][DBLP ] Finding optimal threshold for correction error reads in DNA assembling. [Citation Graph (, )][DBLP ] A New Upper Bound on 2D Online Bin Packing [Citation Graph (, )][DBLP ] Algorithms for Placing Monitors in a Flow Network [Citation Graph (, )][DBLP ] Search in 0.031secs, Finished in 0.041secs