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

H. VerHeyen

dblp:70/1781 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 1987
—ORCID · none

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

Systems, architecture and hardware · 1

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
1 paper
Electronic design automation · 100%

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

TopicWeightPapersLastEvidence papers
Electronic design automation › physical design › routing
channel routing
0.011987
Geometrical Compaction in One Dimension for Channel Routing · DAC 1987
Electronic design automation › physical design
layout compaction
0.011987
Geometrical Compaction in One Dimension for Channel Routing · DAC 1987
Electronic design automation
physical design
0.011987
Geometrical Compaction in One Dimension for Channel Routing · DAC 1987

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

graph-based compaction · 0.0
YearPublicationVenuePosition
1987 Geometrical Compaction in One Dimension for Channel Routing
abstract
A channel router which is to be effective for general-purpose automatic routing must be able to use different sets of routing criteria priorities, in a controllable manner. We present an approach to channel routing with compaction in which channel compaction is adaptable to several routing criteria priorities. We show how overall channel routing performance can be improved by taking advantage of this versatility in channel compaction. We indicate some routing capabilities which cannot be effectively achieved by simply post-processing the output of a traditional gridded channel router. Our solution to this problem is outlined and some results obtained from our router are compared with those of other published channel routers.
J. Royle, Mikael Palczewski, H. VerHeyen, N. Naccache, Jiri Soukup
DAC3