Publications

In a thousand years nothing will be left of all that’s been written this century.
They’ll read loose sentences, traces of lost women, fragments of motionless children,
your slow green eyes simply will not exist.
— Roberto Bolaño

1. Learning Configurations for Data-Driven Multi-Objective Optimization
   Zhiyang Chen, Hailong Yao, Xia Yin.
   In Proceedings of International Conference on Machine Learning (ICML), 2025.

2. PatLabor: Pareto Optimization of Timing-Driven Routing Trees
   Zhiyang Chen, Hailong Yao, Xia Yin.
   In Proceedings of Design Automation Conference (DAC), 2025.

3. Mr.TPL: A Method for Multi-Pin Net Router in Triple Patterning Lithography
   Chengkai Wang, Weiqing Ji, Mingyang Kou, Zhiyang Chen, Fei Li, Hailong Yao.
   In Proceedings of Design Automation Conference (DAC), 2025. (arXiv preprint)

4. Differentiable Rectilinear Steiner Trees for Analytical Placement
   Zhiyang Chen, Hailong Yao, Tsung-Yi Ho, Ulf Schlichtmann, Xia Yin.
   In Proceedings of International Symposium of Electronic Design Automation (ISEDA), 2024.

5. NeuroEscape: Ordered Escape Routing via Monte-Carlo Tree Search and Neural Network
   Zhiyang Chen, Tsung-Yi Ho, Ulf Schlichtmann, Datao Chen, Mingyu Liu, Hailong Yao, Xia Yin.
   In Proceedings of International Conference on Computer-Aided Design (ICCAD), 2023.

6. Learning a Provably Good Wirelength Model for Analytical Placement
   Zhiyang Chen, Hailong Yao, Xia Yin.
   In Proceedings of International Symposium of Electronic Design Automation (ISEDA), 2023.
   Honorable Paper

7. Contamination-Aware Synthesis for Programmable Microfluidic Devices
   Hui-Chieh Yu, Yu-Huei Lin, Zhiyang Chen, Bing Li, Xing Huang, Ulf Schlichtmann, Tsung-Yi Ho, Hailong Yao.
   In IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems (TCAD), 2021.

8. Machine Learning Based Acceleration Method for Ordered Escape Routing
   Zhiyang Chen, Weiqing Ji, Yihao Peng, Datao Chen, Mingyu Liu, Hailong Yao.
   In Proceedings of Great Lakes Symposium on VLSI (GLSVLSI), 2021.
   Best Paper Candidate