Hourng-Wern Perng

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

Demo Data from EDBT 2026 / reviewers in the wild / expert

dblp:21/1619 · DBLP profile ↗

← Back

2ranked-venue papers

0as first author

0since 2021 · last 1991

—ORCID · none

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

Systems, architecture and hardware · 2

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 5 heaviest of 5, each with the papers that count most for it

Topic	Papers	Last	Evidence papers
Electronic design automation › physical design › routing › channel routing channel density reduction	2	1991	Channel density reduction by routing over the cells · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1991 Channel Density Reduction by Routing Over The Cells · DAC 1991
Electronic design automation › physical design › routing channel routing	2	1991	Channel density reduction by routing over the cells · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1991 Channel Density Reduction by Routing Over The Cells · DAC 1991
Electronic design automation physical design	2	1991	Channel density reduction by routing over the cells · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1991 Channel Density Reduction by Routing Over The Cells · DAC 1991
Electronic design automation › physical design › routing › channel routing over-the-cell routing	2	1991	Channel density reduction by routing over the cells · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1991 Channel Density Reduction by Routing Over The Cells · DAC 1991
Electronic design automation › physical design routing	1	1991	Channel density reduction by routing over the cells · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1991

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

integer linear programming · 0.0bipartite graph · 0.0constrained covering · 0.0

Year	Publication	Venue	Position
1991	Channel Density Reduction by Routing Over The Cells abstract We propose a new approach for reducing the density of a channel by routing some nets (or subnets) over the cells (i.e.outside the channel).Previous research assumed that the more nets being routed over the cells the greater the reduction in the channel density.We show that only the removal of critical nets contributes to the reduction in the channel density.We divide channel into zones where each zone has a zone density and the removal of any net from a zone will reduce its density by one.In order to reduce the channel density, only certain critical zones need to have their nets routed over the cells.A bipwtite graph is used to represent the relationship between nets and zones.The problem is transformed into a constrained covering problem and formulated as an integer liiear programming problem.In comparison with previous research our approach reduces more channel densities while using fewer tracks over the cells.For Deutsch's difficult channel, previous approach needs 15 &acks over the cells to reduce the channel density by 3 while we need only 5 tracks to achieve the same result. Min-Siang Lin, Hourng-Wern Perng, Chi-Yi Hwang, Youn-Long Lin	DAC	2
1991	Channel density reduction by routing over the cells abstract An approach for reducing the density of a channel by routing some nets (or subnets) over the cells (i.e., outside the channel) is proposed. It is shown that only the removal of critical nets contributes to the reduction in the channel density. The channel is divided into zones, each having a zone density where the removal of any net from a zone will reduce its density by one. To reduce the channel density, only certain critical zones need to have their nets routed over the cells. A bipartite graph is used to represent the relationship between nets and zones. The problem is transformed into a constrained covering problem and formulated as an integer linear programming problem. Compared to previous research, the approach reduces more channel densities while using fewer tracks over the cells. For Deutsch's difficult channel, a previous approach needs 15 tracks over the cells to reduce the channel density by 3, whereas the present needs only 5 tracks to achieve the same result. > Min-Siang Lin, Hourng-Wern Perng, Chi-Yi Hwang, Youn-Long Lin	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	2