Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Yunbo Hou

dblp:379/5901 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
2since 2021 · last 2025
0009-0007-0291-8762ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2 · 2 first-author · 2 since 2021Databases, data management, data science and information retrieval · 2 · 2 first-author · 2 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
2 papers
Electronic design automation · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Electronic design automation
physical design
1.622025
TransPlace: Transferable Circuit Global Placement via Graph Neural Network · KDD (1) 2025
RoutePlacer: An End-to-End Routability-Aware Placer with Graph Neural Network · KDD 2024
Electronic design automation › physical design
placement
1.622025
TransPlace: Transferable Circuit Global Placement via Graph Neural Network · KDD (1) 2025
RoutePlacer: An End-to-End Routability-Aware Placer with Graph Neural Network · KDD 2024
Electronic design automation › physical design › placement
global placement
0.912025
TransPlace: Transferable Circuit Global Placement via Graph Neural Network · KDD (1) 2025
Electronic design automation › physical design › placement
routability-driven placement
0.812024
RoutePlacer: An End-to-End Routability-Aware Placer with Graph Neural Network · KDD 2024

Methods — techniques the papers use, named apart from their topics

graph neural network · 1.6coarse-to-fine placement · 0.9SE(2)-invariant representation · 0.9differentiable routability prediction · 0.8
YearPublicationVenuePosition
2025 TransPlace: Transferable Circuit Global Placement via Graph Neural Network
abstract
Global placement, a critical step in designing the physical layout of computer chips, is essential to optimize chip performance. Prior global placement methods optimize each circuit design individually from scratch. Their neglect of transferable knowledge limits solution efficiency and chip performance as circuit complexity drastically increases. This study presents TransPlace, a global placement framework that learns to place millions of mixed-size cells in continuous space. TransPlace introduces i) Netlist Graph to efficiently model netlist topology, ii) Cell-flow and relative position encoding to learn SE(2)-invariant representation, iii) a tailored graph neural network architecture for informed parameterization of placement knowledge, and iv) a two-stage strategy for coarse-to-fine placement. Compared to state-of-the-art placement methods, TransPlace-trained on a few high-quality placements-can place unseen circuits with 1.2x speedup while reducing congestion by 30%, timing by 9%, and wirelength by 5%.
Yunbo Hou, Haoran Ye, Yingxue Zhang 0001, Guojie Song
KDD (1)1
2024 RoutePlacer: An End-to-End Routability-Aware Placer with Graph Neural Network
abstract
Placement is a critical and challenging step of modern chip design, with routability being an essential indicator of placement quality. Current routability-oriented placers typically apply an iterative two-stage approach, wherein the first stage generates a placement solution, and the second stage provides non-differentiable routing results to heuristically improve the solution quality. This method hinders jointly optimizing the routability aspect during placement. To address this problem, this work introduces RoutePlacer, an end-to-end routability-aware placement method. It trains RouteGNN, a customized graph neural network, to efficiently and accurately predict routability by capturing and fusing geometric and topological representations of placements. Well-trained RouteGNN then serves as a differentiable approximation of routability, enabling end-to-end gradient-based routability optimization. In addition, RouteGNN can improve two-stage placers as a plug-and-play alternative to external routers. Our experiments on DREAMPlace, an open-source AI4EDA platform, show that RoutePlacer can reduce Total Overflow by up to 16% while maintaining routed wirelength, compared to the state-of-the-art; integrating RouteGNN within two-stage placers leads to a 44% reduction in Total Overflow without compromising wirelength.
Yunbo Hou, Haoran Ye, Yingxue Zhang 0001, Guojie Song
KDD1