World's Best Scientists 2026 revealed!
Francis Y. L. Chin

Francis Y. L. Chin

D-Index & Metrics

Computer Science

D-Index
47
Citations
12628
World Ranking
6353
National Ranking
844

Research.com Recognitions

  • 1996 - IEEE Fellow For contributions to developments in parallel and distributed computing and to computer science education.

Overview

Francis Y. L. Chin is affiliated with the University of Hong Kong in China. Their research specializes in the fields of Computer Science, with a particular focus on Computational Theory and Mathematics.

Their work spans several main topics including:

  • Advanced Graph Theory Research
  • Complexity and Algorithms in Graphs
  • Graph Labeling and Dimension Problems

Chin has contributed to the academic community through publications primarily in the journal Discrete Applied Mathematics. A recent paper titled A linear-time certifying algorithm for recognizing generalized series-parallel graphs was published in 2022 in this journal.

Frequent collaborators of Chin include:

  • Hing-Fung Ting
  • Yung H. Tsin
  • Yong Zhang

Throughout their career, Chin has been recognized with awards such as the IEEE Fellow in 1996, acknowledging contributions to parallel and distributed computing as well as computer science education.

Best Publications

  • IDBA-UD

    Yu Peng;Henry C. M. Leung;S. M. Yiu;Francis Y. L. Chin

  • Improved On-Line Broadcast Scheduling with Deadlines

    Feifeng Zheng;Stanley P. Y. Fung;Wun-Tat Chan;Francis Y. L. Chin

  • Meta-IDBA

    Yu Peng;Henry C. M. Leung;S. M. Yiu;Francis Y. L. Chin

  • IDBA: a practical iterative de bruijn graph de novo assembler

    Yu Peng;Henry C. M. Leung;S. M. Yiu;Francis Y. L. Chin

  • Finding the Medial Axis of a Simple Polygon in Linear Time

    Francis Y. L. Chin;Jack Snoeyink;Cao An Wang

  • Cellular adhesiveness and cellulolytic capacity in Anaerolineae revealed by omics-based genome interpretation.

    Yu Xia;Yubo Wang;Yi Wang;Francis Y. L. Chin;Francis Y. L. Chin

  • Efficient parallel algorithms for some graph problems

    Francis Y. Chin;John Lam;I-Ngo Chen

  • Auditing and Inference Control in Statistical Databases

    F.Y. Chin;G. Ozsoyoglu

  • Predicting protein complexes from PPI data: a core-attachment approach.

    Henry C. M. Leung;Qian Xiang;Siu-Ming Yiu;Francis Y. L. Chin

  • IDBA-tran: a more robust de novo de Bruijn graph assembler for transcriptomes with uneven expression levels.

    Yu Peng;Henry C. M. Leung;Siu-Ming Yiu;Ming-Ju Lv

  • Packing squares into a square

    Joseph Y.-T. Leung;Tommy W. Tam;C. S. Wong;Gilbert H. Young

  • APPROXIMATION OF POLYGONAL CURVES WITH MINIMUM NUMBER OF LINE SEGMENTS OR MINIMUM ERROR

    W.S. Chan;F. Chin

  • MetaCluster 5.0

    Yi Wang;Henry C.M. Leung;S.M. Yiu;Francis Y.L. Chin

  • Algorithms for updating minimal spanning trees

    Francis Y. L. Chin;David Houck

  • General schedulers for the pinwheel problem based on double-integer reduction

    M.Y. Chan;F.Y.L. Chin

  • Schedulers for larger classes of pinwheel instances

    Mee Yee Chan;Francis Y. L. Chin

  • A simple algorithm for the constrained sequence problems

    Francis Y. L. Chin;Alfredo De Santis;Anna Lisa Ferrara;N. L. Ho

  • Voting algorithms for discovering long motifs.

    Francis Y. L. Chin;Henry C. M. Leung

  • Statistical database design

    Francis Y. Chin;Gultekin Ozsoyoglu

  • Scheduling the Open Shop to Minimize Mean Flow Time

    James O. Achugbue;Francis Y. L. Chin

Frequent Co-Authors

Siu-Ming Yiu
Siu-Ming Yiu University of Hong Kong
Hong Shen
Hong Shen Sun Yat-sen University
Keqiu Li
Keqiu Li Tianjin University
Marek Chrobak
Marek Chrobak University of California, Riverside
Ming-Yang Kao
Ming-Yang Kao Northwestern University
Tak-Wah Lam
Tak-Wah Lam University of Hong Kong
Jack Snoeyink
Jack Snoeyink University of North Carolina at Chapel Hill
Danny Z. Chen
Danny Z. Chen University of Notre Dame
Chris Chu
Chris Chu Iowa State University
Tong Zhang
Tong Zhang University of Hong Kong

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Exploring computer science in the USA opens doors to a variety of related online degrees and flexible career pathways. For those seeking advanced leadership roles, pursuing the cheapest MBA programs online is a cost-effective route. These programs help candidates gain valuable business and management skills on top of technical expertise.

Many students are interested in quick advancement. One year graduate programs offer a fast track to higher qualifications, combining speed with comprehensive subject coverage. This is ideal for busy professionals aiming to upskill while balancing other commitments.

If immediate employment is your goal, consider short careers that pay well. These options allow you to enter the workforce quickly and start earning a solid salary without years of study. They cover in-demand tech roles, certificates, and associate degrees.

Technology continues to evolve, and AI specialists are in high demand. If you’re interested in artificial intelligence, consider enrolling in one of the most affordable online artificial intelligence degree programs. These programs combine technical computer science foundations with cutting-edge machine learning and data science skills—completely online.

Best Scientists Citing Francis Y. L. Chin

Trending Scientists

Recently Published Articles