Francis Y. L. Chin

Bing Citeseer DBLP Google Google Scholar Kosmix Wikipedia Yahoo!
Loading Google Thumbnails...
2012
173Online call control in cellular networks revisited. Yong Zhang, Francis Y. L. Chin, Hing-Fung Ting, Joseph Wun-Tat Chan, Xin Han, Ka-Cheong Lam. Inf. Process. Lett. (112): 21-25 (2012). Web SearchBibTeXDownload
2011
172A new upper bound 2.5545 on 2D Online Bin Packing. Xin Han, Francis Y. L. Chin, Hing-Fung Ting, Guochuan Zhang, Yong Zhang. ACM Transactions on Algorithms (7): 50 (2011). Web SearchBibTeXDownload
171DMPFinder - Finding Differentiating Pathways with Gaps from Two Groups of Metabolic Networks. Henry Chi-Ming Leung, Shuen-Yi Leung, Carlos Lu Xiang, Siu-Ming Yiu, Francis Yuk-Lun Chin. BICoB 2011, 80-85. Web SearchBibTeX
170A robust and accurate binning algorithm for metagenomic sequences with arbitrary species abundance ratio. Henry C. M. Leung, Siu-Ming Yiu, Bin Yang, Yu Peng, Yi Wang, Zhihua Liu, Jing-Chi Chen, Junjie Qin, Ruiqiang Li, Francis Y. L. Chin. Bioinformatics (27): 1489-1495 (2011). Web SearchBibTeXDownload
169Meta-IDBA: a de Novo assembler for metagenomic data. Yu Peng, Henry C. M. Leung, Siu-Ming Yiu, Francis Y. L. Chin. Bioinformatics [ISMB/ECCB] (27): 94-101 (2011). Web SearchBibTeXDownload
168Competitive Algorithms for Online Pricing. Yong Zhang, Francis Y. L. Chin, Hing-Fung Ting. COCOON 2011, 391-401. Web SearchBibTeXDownload
167Minimum Manhattan Network is NP-Complete. Francis Y. L. Chin, Zeyu Guo, He Sun. Discrete & Computational Geometry (45): 701-722 (2011). Web SearchBibTeXDownload
166Online Algorithm for 1-Space Bounded Multi-dimensional Bin Packing. Yong Zhang, Francis Y. L. Chin, Hing-Fung Ting, Xin Han, Zhuo Chang. FAW-AAIM 2011, 308-318. Web SearchBibTeXDownload
165Uniformly inserting points on square grid. Yong Zhang, Zhuo Chang, Francis Y. L. Chin, Hing-Fung Ting, Yung H. Tsin. Inf. Process. Lett. (111): 773-779 (2011). Web SearchBibTeXDownload
164Adaptive Phenotype Testing for AND/OR Items. Francis Y. L. Chin, Henry C. M. Leung, S. M. Yiu. ISAAC 2011, 754-763. Web SearchBibTeXDownload
163Online tree node assignment with resource augmentation. Joseph Wun-Tat Chan, Francis Y. L. Chin, Hing-Fung Ting, Yong Zhang. J. Comb. Optim. (22): 359-377 (2011). Web SearchBibTeXDownload
162T-IDBA: A de novo Iterative de Bruijn Graph Assembler for Transcriptome - (Extended Abstract). Yu Peng, Henry C. M. Leung, Siu-Ming Yiu, Francis Y. L. Chin. RECOMB 2011, 337-338. Web SearchBibTeXDownload
161Non-adaptive Complex Group Testing with Multiple Positive Sets. Francis Y. L. Chin, Henry C. M. Leung, Siu-Ming Yiu. TAMC 2011, 172-183. Web SearchBibTeXDownload
2010
160Online Uniformly Inserting Points on Grid. Yong Zhang, Zhuo Chang, Francis Y. L. Chin, Hing-Fung Ting, Yung H. Tsin. AAIM 2010, 281-292. Web SearchBibTeXDownload
159Absolute and Asymptotic Bounds for Online Frequency Allocation in Cellular Networks. Joseph Wun-Tat Chan, Francis Y. L. Chin, Deshi Ye, Yong Zhang. Algorithmica (58): 498-515 (2010). Web SearchBibTeXDownload
158A Constant-Competitive Algorithm for Online OVSF Code Assignment. Francis Y. L. Chin, Hing-Fung Ting, Yong Zhang. Algorithmica (56): 89-104 (2010). Web SearchBibTeXDownload
157MetaCluster: unsupervised binning of environmental genomic fragments and taxonomic annotation. Bin Yang, Yu Peng, Henry C. M. Leung, Siu-Ming Yiu, Junjie Qin, Ruiqiang Li, Francis Y. L. Chin. BCB 2010, 170-179. Web SearchBibTeXDownload
156Unsupervised binning of environmental genomic fragments based on an error robust selection of l-mers. Bin Yang, Yu Peng, Henry Chi-Ming Leung, Siu-Ming Yiu, Jing-Chi Chen, Francis Y. L. Chin. BMC Bioinformatics (11): 5 (2010). Web SearchBibTeXDownload
155Approximated Distributed Minimum Vertex Cover Algorithms for Bounded Degree Graphs. Yong Zhang, Francis Y. L. Chin, Hing-Fung Ting. COCOON 2010, 100-109. Web SearchBibTeXDownload
154Deterministic Online Call Control in Cellular Networks and Triangle-Free Cellular Networks. Joseph Wun-Tat Chan, Francis Y. L. Chin, Xin Han, Ka-Cheong Lam, Hing-Fung Ting, Yong Zhang. FAW 2010, 222-233. Web SearchBibTeXDownload
153One-Space Bounded Algorithms for Two-Dimensional Bin Packing. Francis Y. L. Chin, Hing-Fung Ting, Yong Zhang. Int. J. Found. Comput. Sci. (21): 875-891 (2010). Web SearchBibTeXDownload
152Improved Online Algorithms for 1-Space Bounded 2-Dimensional Bin Packing. Yong Zhang, Jing-Chi Chen, Francis Y. L. Chin, Xin Han, Hing-Fung Ting, Yung H. Tsin. ISAAC (2) 2010, 242-253. Web SearchBibTeXDownload
151IDBA - A Practical Iterative de Bruijn Graph De Novo Assembler. Yu Peng, Henry C. M. Leung, Siu-Ming Yiu, Francis Y. L. Chin. RECOMB 2010, 426-440. Web SearchBibTeXDownload
2009
150Algorithms for Placing Monitors in a Flow Network. Francis Y. L. Chin, Marek Chrobak, Li Yan. AAIM 2009, 114-128. Web SearchBibTeXDownload
149A 1-Local Asymptotic 13/9-Competitive Algorithm for Multicoloring Hexagonal Graphs. Yong Zhang, Francis Y. L. Chin, Hong Zhu. Algorithmica (54): 557-567 (2009). Web SearchBibTeXDownload
148Finding optimal threshold for correction error reads in DNA assembling. Francis Y. L. Chin, Henry C. M. Leung, Wei-Lin Li, Siu-Ming Yiu. BMC Bioinformatics (10) (2009). Web SearchBibTeXDownload
147Variable-Size Rectangle Covering. Francis Y. L. Chin, Hing-Fung Ting, Yong Zhang. COCOA 2009, 145-154. Web SearchBibTeXDownload
146Online Tree Node Assignment with Resource Augmentation. Joseph Wun-Tat Chan, Francis Y. L. Chin, Hing-Fung Ting, Yong Zhang. COCOON 2009, 358-367. Web SearchBibTeXDownload
145A New Upper Bound on 2D Online Bin Packing. Xin Han, Francis Y. L. Chin, Hing-Fung Ting, Guochuan Zhang. CoRR (abs/0906.0409) (2009). Web SearchBibTeXDownload
144Unsupervised binning of environmental genomic fragments based on an error robust selection of l-mers. Bin Yang, Yu Peng, Henry Chi-Ming Leung, Siu-Ming Yiu, Jing-Chi Chen, Francis Y. L. Chin. DTMBIO 2009, 3-10. Web SearchBibTeXDownload
143A hybrid simulated annealing algorithm for container loading problem. Yu Peng, Defu Zhang, Francis Y. L. Chin. GEC Summit 2009, 919-928. Web SearchBibTeXDownload
1421-Bounded Space Algorithms for 2-Dimensional Bin Packing. Francis Y. L. Chin, Hing-Fung Ting, Yong Zhang. ISAAC 2009, 321-330. Web SearchBibTeXDownload
141Clustering-Based Approach for Predicting Motif Pairs from protein Interaction Data. Henry Chi-Ming Leung, Man-Hung Siu, Siu-Ming Yiu, Francis Yuk-Lun Chin, Ken Wing-Kin Sung. J. Bioinformatics and Computational Biology (7): 701-716 (2009). Web SearchBibTeXDownload
140Linear-Time Haplotype Inference on Pedigrees without Recombinations and Mating Loops. Mee Yee Chan, Wun-Tat Chan, Francis Y. L. Chin, Stanley P. Y. Fung, Ming-Yang Kao. SIAM J. Comput. (38): 2179-2197 (2009). Web SearchBibTeXDownload
139Minimum Manhattan network is NP-complete. Francis Y. L. Chin, Zeyu Guo, He Sun. Symposium on Computational Geometry 2009, 393-402. Web SearchBibTeXDownload
2008
138Optimal Algorithm for Finding DNA Motifs with Nucleotide Adjacent Dependency. Francis Y. L. Chin, Henry C. M. Leung, Man-Hung Siu, Siu-Ming Yiu. APBC 2008, 343-352. Web SearchBibTeXDownload
137Efficient Methods for Multiple Sequence Alignment with Guaranteed Error Bounds. Francis Y. L. Chin, Siu-Ming Yiu. Encyclopedia of Algorithms 2008. Web SearchBibTeXDownload
136DNA Motif Representation with Nucleotide Dependency. Francis Y. L. Chin, Henry C. M. Leung. IEEE/ACM Trans. Comput. Biology Bioinform. (5): 110-119 (2008). Web SearchBibTeXDownload
135On-line scheduling of parallel jobs on two machines. Wun-Tat Chan, Francis Y. L. Chin, Deshi Ye, Guochuan Zhang, Yong Zhang. J. Discrete Algorithms (6): 3-10 (2008). Web SearchBibTeXDownload
134Improved on-line broadcast scheduling with deadlines. Stanley P. Y. Fung, Feifeng Zheng, Wun-Tat Chan, Francis Y. L. Chin, Chung Keung Poon, Prudence W. H. Wong. J. Scheduling (11): 299-308 (2008). Web SearchBibTeXDownload
133Dynamic Offline Conflict-Free Coloring for Unit Disks. Joseph Wun-Tat Chan, Francis Y. L. Chin, Xiangyu Hong, Hing-Fung Ting. WAOA 2008, 241-252. Web SearchBibTeXDownload
2007
132Online OVSF Code Assignment with Resource Augmentation. Francis Y. L. Chin, Yong Zhang, Hong Zhu. AAIM 2007, 191-200. Web SearchBibTeXDownload
131Online Frequency Assignment in Wireless Communication Networks. Francis Y. L. Chin. COCOON 2007, 2. Web SearchBibTeXDownload
130A 1-Local 13/9-Competitive Algorithm for Multicoloring Hexagonal Graphs. Francis Y. L. Chin, Yong Zhang, Hong Zhu. COCOON 2007, 526-536. Web SearchBibTeXDownload
129Object-Based Surveillance Video Retrieval System with Real-Time Indexing Methodology. Jacky S-C. Yuk, Kwan-Yee Kenneth Wong, Ronald H. Y. Chung, K. P. Chow, Francis Y. L. Chin, Kenneth S. H. Tsang. ICIAR 2007, 626-637. Web SearchBibTeXDownload
128Multimedia Object Placement for Transparent Data Replication. Keqiu Li, Hong Shen, Francis Y. L. Chin, Weishi Zhang. IEEE Trans. Parallel Distrib. Syst. (18): 212-224 (2007). Web SearchBibTeXDownload
127Greedy online frequency allocation in cellular networks. Joseph Wun-Tat Chan, Francis Y. L. Chin, Deshi Ye, Yong Zhang, Hong Zhu. Inf. Process. Lett. (102): 55-61 (2007). Web SearchBibTeXDownload
126A Constant-Competitive Algorithm for Online OVSF Code Assignment. Francis Y. L. Chin, Hing-Fung Ting, Yong Zhang. ISAAC 2007, 452-463. Web SearchBibTeXDownload
125Online bin packing of fragile objects with application in cellular networks. Wun-Tat Chan, Francis Y. L. Chin, Deshi Ye, Guochuan Zhang, Yong Zhang. J. Comb. Optim. (14): 427-435 (2007). Web SearchBibTeXDownload
124Discovering Motifs With Transcription Factor Domain Knowledge. Henry C. M. Leung, Francis Y. L. Chin, Bethany Man-Yee Chan. Pacific Symposium on Biocomputing 2007, 472-483. Web SearchBibTeXDownload
123Watershed segmentation with boundary curvature ratio based merging criterion. X. He, N. H. C. Yung, K. P. Chow, Francis Y. L. Chin, Ronald H. Y. Chung, Kwan-Yee Kenneth Wong, Kenneth S. H. Tsang. SIP 2007, 7-12. Web SearchBibTeX
122Online frequency allocation in cellular networks. Joseph Wun-Tat Chan, Francis Y. L. Chin, Deshi Ye, Yong Zhang. SPAA 2007, 241-249. Web SearchBibTeXDownload
121The Point Placement Problem on a Line - Improved Bounds for Pairwise Distance Queries. Francis Y. L. Chin, Henry C. M. Leung, Wing-Kin Sung, Siu-Ming Yiu. WABI 2007, 372-382. Web SearchBibTeXDownload
2006
120An Efficient Algorithm for String Motif Discovery. Francis Y. L. Chin, Henry C. M. Leung. APBC 2006, 79-88. Web SearchBibTeXDownload
119Discovering DNA Motifs with Nucleotide Dependency. Henry C. M. Leung, Francis Y. L. Chin. BIBE 2006, 70-80. Web SearchBibTeX
118Finding motifs from all sequences with and without binding sites. Henry C. M. Leung, Francis Y. L. Chin. Bioinformatics (22): 2217-2223 (2006). Web SearchBibTeXDownload
117Improved On-Line Broadcast Scheduling with Deadlines. Feifeng Zheng, Stanley P. Y. Fung, Wun-Tat Chan, Francis Y. L. Chin, Chung Keung Poon, Prudence W. H. Wong. COCOON 2006, 320-329. Web SearchBibTeXDownload
116An efficient motif discovery algorithm with unknown motif length and number of binding sites. Henry C. M. Leung, Francis Y. L. Chin. IJDMB (1): 201-215 (2006). Web SearchBibTeXDownload
115A tight lower bound for job scheduling with cancellation. Feifeng Zheng, Francis Y. L. Chin, Stanley P. Y. Fung, Chung Keung Poon, Yinfeng Xu. Inf. Process. Lett. (97): 1-3 (2006). Web SearchBibTeXDownload
114Frequency Allocation Problems for Linear Cellular Networks. Joseph Wun-Tat Chan, Francis Y. L. Chin, Deshi Ye, Yong Zhang, Hong Zhu. ISAAC 2006, 61-70. Web SearchBibTeXDownload
113Algorithms for Challenging Motif Problems. Henry C. M. Leung, Francis Y. L. Chin. J. Bioinformatics and Computational Biology (4): 43-58 (2006). Web SearchBibTeXDownload
112A dynamic programming approach of finding an optimal broadcast schedule in minimizing total flow time. Wun-Tat Chan, Francis Y. L. Chin, Yong Zhang, Hong Zhu, Hong Shen, Prudence W. H. Wong. J. Comb. Optim. (11): 177-187 (2006). Web SearchBibTeXDownload
111Construction of the nearest neighbor embracing graph of a point set. Mee Yee Chan, Danny Z. Chen, Francis Y. L. Chin, Cao An Wang. J. Comb. Optim. (11): 435-443 (2006). Web SearchBibTeXDownload
110Online competitive algorithms for maximizing weighted throughput of unit jobs. Francis Y. L. Chin, Marek Chrobak, Stanley P. Y. Fung, Wojciech Jawor, Jiri Sgall, Tomás Tichý. J. Discrete Algorithms (4): 255-276 (2006). Web SearchBibTeXDownload
109Linear-Time Haplotype Inference on Pedigrees Without Recombinations. Bethany Man-Yee Chan, Joseph Wun-Tat Chan, Francis Y. L. Chin, Stanley P. Y. Fung, Ming-Yang Kao. WABI 2006, 56-67. Web SearchBibTeXDownload
2005
108Optimal methods for coordinated enroute web caching for tree networks. Keqiu Li, Hong Shen, Francis Y. L. Chin, Si-Qing Zheng. ACM Trans. Internet Techn. (5): 480-507 (2005). Web SearchBibTeXDownload
107Voting algorithms for discovering long motifs. Francis Y. L. Chin, Henry C. M. Leung. APBC 2005, 261-271. Web SearchBibTeXDownload
106An Efficient Algorithm for the Extended (l, d)-Motif Problem with Unknown Number of Binding Sites. Henry C. M. Leung, Francis Y. L. Chin. BIBE 2005, 11-18. Web SearchBibTeXDownload
105Off-Line Algorithms for Minimizing Total Flow Time in Broadcast Scheduling. Wun-Tat Chan, Francis Y. L. Chin, Yong Zhang, Hong Zhu, Hong Shen, Prudence W. H. Wong. COCOON 2005, 318-328. Web SearchBibTeXDownload
104Approximating the minimum triangulation of convex 3-polytopes with bounded degrees. Stanley P. Y. Fung, Francis Y. L. Chin, Chung Keung Poon. Comput. Geom. (32): 1-12 (2005). Web SearchBibTeXDownload
103Finding exact optimal motifs in matrix representation by partitioning. Henry C. M. Leung, Francis Y. L. Chin. ECCB/JBI 2005, 92. Web SearchBibTeXDownload
102Cooperative Determination on Cache Replacement Candidates for Transcoding Proxy Caching. Keqiu Li, Hong Shen, Francis Y. L. Chin. ICCNMC 2005, 178-187. Web SearchBibTeXDownload
101Explicit contour model for vehicle tracking with automatic hypothesis validation. Boris Wai-Sing Yiu, Kwan-Yee Kenneth Wong, Francis Y. L. Chin, Ronald H. Y. Chung. ICIP (2) 2005, 582-589. Web SearchBibTeXDownload
100Laxity Helps in Broadcast Scheduling. Stanley P. Y. Fung, Francis Y. L. Chin, Chung Keung Poon. ICTCS 2005, 251-264. Web SearchBibTeXDownload
99k-Recombination Haplotype Inference in Pedigrees. Francis Y. L. Chin, Qiangfeng Zhang, Hong Shen. International Conference on Computational Science (2) 2005, 985-993. Web SearchBibTeXDownload
98Online scheduling of unit jobs with bounded importance ratio. Stanley P. Y. Fung, Francis Y. L. Chin, Hong Shen. Int. J. Found. Comput. Sci. (16): 581-598 (2005). Web SearchBibTeXDownload
97Placement Solutions for Multiple Versions of A Multimedia Object. Keqiu Li, Hong Shen, Francis Y. L. Chin. ISORC 2005, 224-231. Web SearchBibTeXDownload
96Efficient Constrained Multiple Sequence Alignment with Performance Guarantee. Francis Y. L. Chin, N. L. Ho, Tak Wah Lam, Prudence W. H. Wong, Mee Yee Chan. J. Bioinformatics and Computational Biology (3): 1-18 (2005). Web SearchBibTeXDownload
95Finding Motifs with Insufficient Number of Strong Binding Sites. Henry C. M. Leung, Francis Y. L. Chin, Siu-Ming Yiu, Ronald Rosenfeld, Wai Wan Tsang. Journal of Computational Biology (12): 686-701 (2005). Web SearchBibTeXDownload
94Efficient Block-based Motion Segmentation Method using Motion Vector Consistency. Ronald H. Y. Chung, Francis Y. L. Chin, Kwan-Yee Kenneth Wong, K. P. Chow, T. Luo, Henry S. K. Fung. MVA 2005, 550-553. Web SearchBibTeXDownload
93Shadow detection for vehicles by locating the object-shadow boundary. Angie W. K. So, Kwan-Yee Kenneth Wong, Ronald H. Y. Chung, Francis Y. L. Chin. SIP 2005, 315-319. Web SearchBibTeX
92Minimum Parent-Offspring Recombination Haplotype Inference in Pedigrees. Qiangfeng Zhang, Francis Y. L. Chin, Hong Shen. T. Comp. Sys. Biology (2): 100-112 (2005). Web SearchBibTeXDownload
91Generalized Planted (l, d)-Motif Problem with Negative Set. Henry C. M. Leung, Francis Y. L. Chin. WABI 2005, 264-275. Web SearchBibTeXDownload
90Online Bin Packing of Fragile Objects with Application in Cellular Networks. Wun-Tat Chan, Francis Y. L. Chin, Deshi Ye, Guochuan Zhang, Yong Zhang. WINE 2005, 564-573. Web SearchBibTeXDownload
2004
89Progress on Maximum Weight Triangulation. Francis Y. L. Chin, Jianbo Qian, Cao An Wang. COCOON 2004, 53-61. Web SearchBibTeXDownload
88A simple algorithm for the constrained sequence problems. Francis Y. L. Chin, Alfredo De Santis, Anna Lisa Ferrara, N. L. Ho, S. K. Kim. Inf. Process. Lett. (90): 175-179 (2004). Web SearchBibTeXDownload
87Finding motifs for insufficient number of sequences with strong binding to transcription facto. Francis Y. L. Chin, Henry C. M. Leung, Siu-Ming Yiu, Tak Wah Lam, Roni Rosenfeld, Wai Wan Tsang, David K. Smith, Y. Jiang. RECOMB 2004, 125-132. Web SearchBibTeXDownload
86Online Competitive Algorithms for Maximizing Weighted Throughput of Unit Jobs. Yair Bartal, Francis Y. L. Chin, Marek Chrobak, Stanley P. Y. Fung, Wojciech Jawor, Ron Lavi, Jiri Sgall, Tomás Tichý. STACS 2004, 187-198. Web SearchBibTeXDownload
85Construction of the Nearest Neighbor Embracing Graph of a Point Set. Mee Yee Chan, Danny Z. Chen, Francis Y. L. Chin, Cao An Wang. SWAT 2004, 150-160. Web SearchBibTeXDownload
84Approximate and dynamic rank aggregation. Francis Y. L. Chin, Xiaotie Deng, Qizhi Fang, Shanfeng Zhu. Theor. Comput. Sci. (325): 409-424 (2004). Web SearchBibTeXDownload
83Improved competitive algorithms for online scheduling with partial job values. Francis Y. L. Chin, Stanley P. Y. Fung. Theor. Comput. Sci. (325): 467-478 (2004). Web SearchBibTeXDownload
2003
82Online Scheduling with Partial Job Values: Does Timesharing or Randomization Help?. Francis Y. L. Chin, Stanley P. Y. Fung. Algorithmica (37): 149-164 (2003). Web SearchBibTeXDownload
81Escaping a Grid by Edge-Disjoint Paths. Wun-Tat Chan, Francis Y. L. Chin, Hing-Fung Ting. Algorithmica (36): 343-359 (2003). Web SearchBibTeXDownload
80Improved Competitive Algorithms for Online Scheduling with Partial Job Values. Francis Y. L. Chin, Stanley P. Y. Fung. COCOON 2003, 425-434. Web SearchBibTeXDownload
79Efficient Constrained Multiple Sequence Alignment with Performance Guarantee. Francis Y. L. Chin, N. L. Ho, Tak Wah Lam, Prudence W. H. Wong, Mee Yee Chan. CSB 2003, 337-346. Web SearchBibTeXDownload
78Erratum to: "Efficient algorithm for transversal of disjoint convex polygons". Francis Y. L. Chin, Fu Lee Wang. Inf. Process. Lett. (85): 53 (2003). Web SearchBibTeXDownload
77Transversal of disjoint convex polygons. Francis Y. L. Chin, Hong Shen, Fu Lee Wang. Inf. Process. Lett. (85): 55-60 (2003). Web SearchBibTeXDownload
2002
76Experiences in Running a Flexible, Web-Based, and Self-Paced Course. Francis Y. L. Chin, C. K. M. Wong, V. Mak. ICWL 2002, 241-251. Web SearchBibTeXDownload
75Efficient algorithm for transversal of disjoint convex polygons. Francis Y. L. Chin, Fu Lee Wang. Inf. Process. Lett. (83): 141-144 (2002). Web SearchBibTeXDownload
74Algorithms and Complexity for Tetrahedralization Detections. Boting Yang, Cao An Wang, Francis Y. L. Chin. ISAAC 2002, 296-307. Web SearchBibTeXDownload
2001
73Mining Confident Rules Without Support Requirement. Ke Wang, Yu He, David Wai-Lok Cheung, Francis Y. L. Chin. CIKM 2001, 89-96. Web SearchBibTeX
72Approximation for Minimum Triangulations of Simplicial Convex 3-Polytopes. Francis Y. L. Chin, Stanley P. Y. Fung, Cao An Wang. Discrete & Computational Geometry (26): 499-511 (2001). Web SearchBibTeXDownload
71Approximation of Minimum Triangulation for Polyhedron with Bounded Degrees. Francis Y. L. Chin, Stanley P. Y. Fung. ISAAC 2001, 172-184. Web SearchBibTeXDownload
70Approximation for minimum triangulation of convex polyhedra. Francis Y. L. Chin, Stanley P. Y. Fung, Cao An Wang. SODA 2001, 128-137. Web SearchBibTeXDownload
2000
69Triangulations without Minimum-Weight Drawing. Cao An Wang, Francis Y. L. Chin, Bo-Ting Yang. CIAC 2000, 163-173. Web SearchBibTeXDownload
68Triangulations without minimum-weight drawing. Cao An Wang, Francis Y. L. Chin, Boting Yang. Inf. Process. Lett. (74): 183-189 (2000). Web SearchBibTeXDownload
67Efficient Algorithms for Finding the Maximum Number of Disjoint Paths in Grids. Wun-Tat Chan, Francis Y. L. Chin. J. Algorithms (34): 337-369 (2000). Web SearchBibTeXDownload
66Selection and Multiselection on Multi-Dimensional Meshes. Hong Shen, Francis Y. L. Chin. PDPTA 2000. Web SearchBibTeX
65Escaping a grid by edge-disjoint paths. Wun-Tat Chan, Francis Y. L. Chin, Hing-Fung Ting. SODA 2000, 726-734. Web SearchBibTeXDownload
1999
64Maximum Stabbing Line in 2D Plane. Francis Y. L. Chin, Cao An Wang, Fu Lee Wang. COCOON 1999, 379-388. Web SearchBibTeXDownload
63Finding the Medial Axis of a Simple Polygon in Linear Time. Francis Y. L. Chin, Jack Snoeyink, Cao An Wang. Discrete & Computational Geometry (21): 405-420 (1999). Web SearchBibTeXDownload
62Efficient Fault-Tolerant Routing in Multihop Optical WDM Networks. Hong Shen, Francis Y. L. Chin, Yi Pan. IEEE Trans. Parallel Distrib. Syst. (10): 1012-1025 (1999). Web SearchBibTeXDownload
61Maximum Weight Triangulation and Graph Drawing. Cao An Wang, Francis Y. L. Chin, Bo-Ting Yang. Inf. Process. Lett. (70): 17-22 (1999). Web SearchBibTeXDownload
60A Faster Algorithm for Finding Disjoint Paths in Grids. Wun-Tat Chan, Francis Y. L. Chin, Hing-Fung Ting. ISAAC 1999, 393-402. Web SearchBibTeXDownload
59A Parallel Algorithm for Finding the Constrained Voronoi Diagram of Line Segments in the Plane. Francis Y. L. Chin, Der-Tsai Lee, Cao An Wang. WADS 1999, 231-240. Web SearchBibTeXDownload
1998
58Maximum Weight Triangulation and Its Application on Graph Drawing. Cao An Wang, Francis Y. L. Chin, Bo-Ting Yang. COCOON 1998, 25-34. Web SearchBibTeXDownload
57Maximum Weight Triangulation and Graph Drawing. Cao An Wang, Francis Y. L. Chin, Bo-Ting Yang. Graph Drawing 1998, 460-461. Web SearchBibTeXDownload
56A Polynomial Time Solution for Labeling a Rectlinear Map. Chung Keung Poon, Binhai Zhu, Francis Y. L. Chin. Inf. Process. Lett. (65): 201-207 (1998). Web SearchBibTeXDownload
55Finding the Constrained Delaunay Triangulation and Constrained Voronoi Diagram of a Simple Polygon in Linear Time. Francis Y. L. Chin, Cao An Wang. SIAM J. Comput. (28): 471-486 (1998). Web SearchBibTeXDownload
1997
54Optimal Multiresolution Polygonal Approximation. K. W. Chan, Francis Y. L. Chin. COCOON 1997, 32-41. Web SearchBibTeXDownload
53Algorithms for Finding Optimal Disjoint Paths Around a Rectangle. Wun-Tat Chan, Francis Y. L. Chin. ISAAC 1997, 314-323. Web SearchBibTeXDownload
52A New Subgraph of Minimum Weight Triangulations. Cao An Wang, Francis Y. L. Chin, Yin-Feng Xu. J. Comb. Optim. (1): 115-127 (1997). Web SearchBibTeXDownload
51Interpolating Polyhedral Models Using Intrinsic Shape Parameters. Yue Man Sun, Wenping Wang, Francis Y. L. Chin. Journal of Visualization and Computer Animation (8): 81-96 (1997). Web SearchBibTeX
50Efficient Algorithms for Finding Disjoint Paths in Grids (Extended Abstract). Wun-Tat Chan, Francis Y. L. Chin. SODA 1997, 454-463. Web SearchBibTeXDownload
1996
49A New Subgraph of Minimum Weight Triangulations. Cao An Wang, Francis Y. L. Chin, Yin-Feng Xu. ISAAC 1996, 266-274. Web SearchBibTeXDownload
48Dilation-5 Embedding of 3-Dimensional Grids into Hypercubes. Mee Yee Chan, Francis Y. L. Chin, Chris Chu, W. K. Mak. J. Parallel Distrib. Comput. (33): 98-106 (1996). Web SearchBibTeX
1995
47Finding the Constrained Delaunay Triangulation and Constrainted Voronoi Diagram of a Simple Polygon in Linear-Time (Extended Abstract). Cao An Wang, Francis Y. L. Chin. ESA 1995, 280-294. Web SearchBibTeXDownload
46Optimal Simulation of Full Binary Trees on Faulty Hypercubes. Bethany Man-Yee Chan, Francis Y. L. Chin, Chung Keung Poon. IEEE Trans. Parallel Distrib. Syst. (6): 269-286 (1995). Web SearchBibTeXDownload
45Finding the Medial Axis of a Simple Polygon in Linear Time. Francis Y. L. Chin, Jack Snoeyink, Cao An Wang. ISAAC 1995, 382-391. Web SearchBibTeXDownload
44Improved and Optimal Adaptive Hierarchical Vector Quantization for Image Coding and Indexing. Sheng Zhong, Francis Y. L. Chin. IW-MMDBMS 1995, 102-109. Web SearchBibTeX
1994
43Performance Analysis of Some Simple Heuristics for Computing Longest Common Subsequences. Francis Y. L. Chin, Chung Keung Poon. Algorithmica (12): 293-311 (1994). Web SearchBibTeXDownload
42On Greedy Tetrahedralization of Points in 3D. Francis Y. L. Chin, Cao An Wang. ISAAC 1994, 532-540. Web SearchBibTeXDownload
1993
41Schedulers for Larger Classes of Pinwheel Instances. Mee Yee Chan, Francis Y. L. Chin. Algorithmica (9): 425-462 (1993). Web SearchBibTeXDownload
40A Parallel Algorithm for an Efficient Mapping of Grids in Hypercubes. Mee Yee Chan, Francis Y. L. Chin. IEEE Trans. Parallel Distrib. Syst. (4): 933-946 (1993). Web SearchBibTeXDownload
39Optimal Resilient Distributed Algorithms for Ring Election. Mee Yee Chan, Francis Y. L. Chin. IEEE Trans. Parallel Distrib. Syst. (4): 475-480 (1993). Web SearchBibTeXDownload
38Dilation-5 Embedding of 3-Dimensional Grids into Hypercubes. Mee Yee Chan, Francis Y. L. Chin, Chris Chu, W. K. Mak. SPDP 1993, 285-289. Web SearchBibTeX
1992
37General Schedulers for the Pinwheel Problem Based on Double-Integer Reduction. Mee Yee Chan, Francis Y. L. Chin. IEEE Trans. Computers (41): 755-768 (1992). Web SearchBibTeXDownload
1991
36Optimal Specified Root Embedding of Full Binary Trees in Faulty Hypercubes. Mee Yee Chan, Francis Y. L. Chin, Chung Keung Poon. ISA 1991, 241-250. Web SearchBibTeXDownload
1990
35Packing Squares into a Square. Joseph Y.-T. Leung, Tommy W. Tam, C. S. Wong, Gilbert H. Young, Francis Y. L. Chin. J. Parallel Distrib. Comput. (10): 271-275 (1990). Web SearchBibTeXDownload
34Improving the Time Complexity of Message-Optimal Distributed Algorithms for Minimum-Weight Spanning Trees. Francis Y. L. Chin, H. F. Ting. SIAM J. Comput. (19): 612-626 (1990). Web SearchBibTeXDownload
1989
33An Optimal EREW Parallel Algorithm for Parenthesis Matching. Wai Wan Tsang, Tak Wah Lam, Francis Y. L. Chin. ICPP (3) 1989, 185-192. Web SearchBibTeX
1988
32Distributed Election in Complete Networks. Mee Yee Chan, Francis Y. L. Chin. Distributed Computing (3): 19-22 (1988). Web SearchBibTeXDownload
31On Embedding Rectangular Grids in Hypercubes. Mee Yee Chan, Francis Y. L. Chin. IEEE Trans. Computers (37): 1285-1288 (1988). Web SearchBibTeXDownload
1987
30An Improved Algorithm for Finding the Median Distributively. Francis Y. L. Chin, H. F. Ting. Algorithmica (2): 235-249 (1987). Web SearchBibTeXDownload
29An Information-Based Model for Failure-Handling in Distributed Database Systems. Francis Y. L. Chin, K. V. S. Ramarao. IEEE Trans. Software Eng. (13): 420-431 (1987). Web SearchBibTeXDownload
28Optimal Resilient Ring Election Algorithms. Mee Yee Chan, Francis Y. L. Chin. WDAG 1987, 345-354. Web SearchBibTeXDownload
1986
27Security problems on inference control for SUM, MAX, and MIN queries. Francis Y. L. Chin. J. ACM (33): 451-464 (1986). Web SearchBibTeXDownload
26Optimal Termination Protocols for Network Partitioning. Francis Y. L. Chin, K. V. S. Ramarao. SIAM J. Comput. (15): 131-144 (1986). Web SearchBibTeXDownload
1985
25An Almost Linear Time and O(n log n + e) Messages Distributed Algorithm for Minimum-Weight Spanning Trees. Francis Y. L. Chin, H. F. Ting. FOCS 1985, 257-266. Web SearchBibTeXDownload
24A Near-optimal Algorithm for Finding the Median Distributively. Francis Y. L. Chin, H. F. Ting. ICDCS 1985, 459-465. Web SearchBibTeX
23A unifying approach for a class of problems in the computational geometry of polygons. Francis Y. L. Chin, Jeffrey Sampson, Cao An Wang. The Visual Computer (1): 124-132 (1985). Web SearchBibTeXDownload
1984
22Minimum Vertex Distance Between Separable Convex Polygons. Francis Y. L. Chin, Cao An Wang. Inf. Process. Lett. (18): 41-45 (1984). Web SearchBibTeXDownload
21Efficient Parallel Algorithms for a Class of Graph Theoretic Problems. Yung H. Tsin, Francis Y. L. Chin. SIAM J. Comput. (13): 580-599 (1984). Web SearchBibTeXDownload
20Efficient Inference Control for Range SUM Queries. Francis Y. L. Chin, Peter Kossowski, S. C. Loh. Theor. Comput. Sci. (32): 77-86 (1984). Web SearchBibTeXDownload
1983
19Optimal Algorithms for the Intersection and the Minimum Distance Problems Between Planar Polygons. Francis Y. L. Chin, Cao An Wang. IEEE Trans. Computers (32): 1203-1207 (1983). Web SearchBibTeXDownload
18A General Program Scheme for Finding Bridges. Yung H. Tsin, Francis Y. L. Chin. Inf. Process. Lett. (17): 269-272 (1983). Web SearchBibTeXDownload
17Optimal Termination Prococols for Network Partitioning. Francis Y. L. Chin, K. V. S. Ramarao. PODS 1983, 25-35. Web SearchBibTeX
1982
16Efficient Parallel Algorithms for Some Graph Problems. Francis Y. L. Chin, John Lam, I-Ngo Chen. Commun. ACM (25): 659-665 (1982). Web SearchBibTeXDownload
15Enhancing the Security of Statistical Databases with a Question-Answering System and a Kernel Design. Gultekin Özsoyoglu, Francis Y. L. Chin. IEEE Trans. Software Eng. (8): 223-234 (1982). Cited by 10Web SearchBibTeXDownload
14Auditing and Inference Control in Statistical Databases. Francis Y. L. Chin, Gultekin Özsoyoglu. IEEE Trans. Software Eng. (8): 574-582 (1982). Cited by 142Web SearchBibTeXDownload
13Scheduling the Open Shop to Minimize Mean Flow Time. James O. Achugbue, Francis Y. L. Chin. SIAM J. Comput. (11): 709-720 (1982). Web SearchBibTeXDownload
1981
12Statistical Database Design. Francis Y. L. Chin, Gultekin Özsoyoglu. ACM Trans. Database Syst. (6): 113-139 (1981). Cited by 72Web SearchBibTeXDownload
11On J-maximal and J-minimal Flow-Shop Schedules. Francis Y. L. Chin, Long-Lieh Tsai. J. ACM (28): 462-476 (1981). Web SearchBibTeXDownload
10Bounds on Schedules for Independent Tasks with Similar Execution Times. James O. Achugbue, Francis Y. L. Chin. J. ACM (28): 81-99 (1981). Web SearchBibTeXDownload
9Efficient Inference Control for Range SUM Queries on Statistical Data Bases. Francis Y. L. Chin, Peter Kossowski. SSDBM 1981, 239-248. Web SearchBibTeX
1980
8Fast Sorting Algorithms on Uniform Ladders (Multiple Shift-Register Loops). Francis Y. L. Chin, K. Samson Fok. IEEE Trans. Computers (29): 618-631 (1980). Web SearchBibTeXDownload
1978
7Security in Statistical Databases for Queries with Small Counts. Francis Y. L. Chin. ACM Trans. Database Syst. (3): 92-104 (1978). Web SearchBibTeXDownload
6An O(n) Algorithm for Determining a Near-Optimal Computation Order of Matrix Chain Products. Francis Y. L. Chin. Commun. ACM (21): 544-549 (1978). Web SearchBibTeXDownload
5Algorithms for Updating Minimal Spanning Trees. Francis Y. L. Chin, David Houck. J. Comput. Syst. Sci. (16): 333-344 (1978). Web SearchBibTeXDownload
1977
4A Fast Error Evaluation Algorithm for Polynomial Approximation. Francis Y. L. Chin, Kenneth Steiglitz. Inf. Process. Lett. (6): 18-21 (1977). Web SearchBibTeXDownload
3The Partial Fraction Expansion Problem and Its Inverse. Francis Y. L. Chin. SIAM J. Comput. (6): 554-562 (1977). Web SearchBibTeXDownload
2A Study on the Protection of Statistical Data Bases. Clement T. Yu, Francis Y. L. Chin. SIGMOD Conference 1977, 169-181. Cited by 50Web SearchBibTeX
1976
1A Generalized Asymptotic Upper Bound on Fast Polynomial Evaluation and Interpolation. Francis Y. L. Chin. SIAM J. Comput. (5): 682-690 (1976). Web SearchBibTeXDownload
from DBLP and Google Scholar

Related People

Related Organizations

Developed by the Database Group at the University of Wisconsin and Yahoo! Research