2026 Evangeline F. Y. Young: Computer Science Researcher – H-Index, Publications & Awards

Discipline name	D-Index	World Ranking	Current World Ranking	National Ranking	Current National Ranking	Publications	Citations
Computer Science	34	12287	11930	1515	1507	211	4023

Overview

Evangeline F. Y. Young is affiliated with the Chinese University of Hong Kong in China and has an extensive publication record in the fields of Computer Science and Engineering. Their research activity spans multiple subfields including Electrical and Electronic Engineering, Hardware and Architecture, Computer Networks and Communications, Computer Vision and Pattern Recognition, and Artificial Intelligence.

The scientist's main research topics cover a range of specialized areas such as:

VLSI and FPGA Design Techniques
VLSI and Analog Circuit Testing
Advancements in Photolithography Techniques
Integrated Circuits and Semiconductor Failure Analysis
Interconnection Networks and Systems
Physical Unclonable Functions (PUFs) and Hardware Security
Low-power high-performance VLSI design

Their recent notable papers include:

Neural-ILT 2.0: Migrating ILT to Domain-Specific and Multitask-Enabled Neural Network, 2021, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Xplace, 2022, Proceedings of the 59th ACM/IEEE Design Automation Conference
Adversarial Perturbation Attacks on ML-based CAD, 2020, ACM Transactions on Design Automation of Electronic Systems
Pin-Accessible Legalization for Mixed-Cell-Height Circuits, 2021, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
GAMER: GPU-Accelerated Maze Routing, 2022, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

The publication venues where Evangeline F. Y. Young frequently contributes include:

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
arXiv (Cornell University)
Proceedings of the 59th ACM/IEEE Design Automation Conference
ACM Transactions on Design Automation of Electronic Systems
Science China Information Sciences

Frequent co-authors working alongside the scientist are:

Jinwei Liu
Martin D. F. Wong
Bentian Jiang
Shiju Lin
Tsung-Yi Ho

Best Publications

Layout Hotspot Detection With Feature Tensor Generation and Deep Biased Learning

Haoyu Yang;Jing Su;Yi Zou;Yuzhe Ma

141
Citations
GAN-OPC: Mask Optimization With Lithography-Guided Generative Adversarial Nets

Haoyu Yang;Shuhe Li;Zihao Deng;Yuzhe Ma

141
Citations
Layout Hotspot Detection with Feature Tensor Generation and Deep Biased Learning

Haoyu Yang;Jing Su;Yi Zou;Bei Yu

118
Citations
Twin binary sequences: a nonredundant representation for general nonslicing floorplan

E.F.Y. Young;C.C.N. Chu;Z.C. Shen

116
Citations
An efficient layout decomposition approach for triple patterning lithography

Jian Kuang;Evangeline F. Y. Young

106
Citations
Fast and Accurate Estimation of Quality of Results in High-Level Synthesis with Machine Learning

Steve Dai;Yuan Zhou;Hang Zhang;Ecenur Ustun

104
Citations
Enabling online learning in lithography hotspot detection with information-theoretic feature optimization

Hang Zhang;Bei Yu;Evangeline F. Y. Young

101
Citations
Integrated floorplanning and interconnect planning

Hung-Ming Chen;Hai Zhou;F. Y. YOung;D. F. Wong

99
Citations
Routability-driven floorplanner with buffer block planning

Chiu-Wing Sham;E.F.Y. Young

96
Citations
Simultaneous Handling of Symmetry, Common Centroid, and General Placement Constraints

Qiang Ma;Linfu Xiao;Yiu-Cheong Tam;E F Y Young

95
Citations
Slicing floorplans with boundary constraints

F.Y. Young;D.F. Wong;H.H. Yang

82
Citations
Ripple: an effective routability-driven placer by iterative cell movement

Xu He;Tao Huang;Linfu Xiao;Haitong Tian

77
Citations
CUGR: Detailed-Routability-Driven 3D Global Routing with Probabilistic Resource Model

Jinwei Liu;Chak-Wa Pui;Fangzhou Wang;Evangeline F. Y. Young

72
Citations
GAN-OPC: mask optimization with lithography-guided generative adversarial nets

Haoyu Yang;Shuhe Li;Yuzhe Ma;Bei Yu

71
Citations
Analog placement with symmetry and other placement constraints

Yiu-Cheong Tam;Evangeline F. Y. Young;Chris Chu

71
Citations
Placement constraints in floorplan design

E.F.Y. Young;C.C.N. Chu;M.L. Ho

70
Citations
Slicing floorplans with pre-placed modules

F. Y. Young;D. F. Wong

68
Citations
Slicing floorplans with range constraint

F.Y. Young;D.F. Wong;H.H. Yang

67
Citations
Post-placement voltage island generation

Royce L. S. Ching;Evangeline F. Y. Young;Kevin C. K. Leung;Chris Chu

61
Citations
Analog placement with common centroid constraints

Qiang Ma;Evangeline F. Y. Young;K. P. Pun

61
Citations
Cell density-driven detailed placement with displacement constraint

Wing-Kai Chow;Jian Kuang;Xu He;Wenzan Cai

59
Citations
CrossRouter: a droplet router for cross-referencing digital microfluidic biochips

Zigang Xiao;Evangeline F. Y. Young

58
Citations
Obstacle-avoiding rectilinear Steiner tree construction

Liang Li;Evangeline F. Y. Young

57
Citations
RippleFPGA: a routability-driven placement for large-scale heterogeneous FPGAs

Chak-Wa Pui;Gengjie Chen;Wing-Kai Chow;Ka-Chun Lam

49
Citations

Frequent Co-Authors

Bei Yu Chinese University of Hong Kong

Chris Chu Iowa State University

Chung-Kuan Cheng University of California, San Diego

Ron Graham University of California, San Diego

Ozgur Sinanoglu New York University Abu Dhabi

Ramesh Karri New York University

Cheng-Kok Koh Purdue University West Lafayette

Philip H. W. Leong University of Sydney

Sherief Reda Brown University

Daniel M. Kane University of California, San Diego

External Links

Personal website of Evangeline F. Y. Young

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

Related Online Degrees & Career Pathways

Exploring online education options in Computer Science can open doors for students with diverse backgrounds and needs. Many prospective learners search for the cheapest online colleges to keep their education affordable. This is especially important for those balancing work, family, or other commitments.

Flexibility also extends to admissions requirements. If your academic record isn't perfect, you can still pursue your passion at a college with low gpa admission requirements. These institutions offer accessible pathways for those seeking a second chance or a fresh start.

Online programs often include accelerated computer science degree options. Accelerated tracks help motivated learners finish their degree faster and enter the workforce sooner.

With a strong foundation in computer science, many graduates wonder about potential careers. While computer science offers broad opportunities, you might also be curious about opportunities in other disciplines, such as discovering what can you do with an environmental science major. Exploring related degrees and career pathways can help you find the best fit for your interests and goals.