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 VLDB 2026 / reviewers in the wild / expert

Keumog Ahn

dblp:63/6797 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 1993
—ORCID · none

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

Systems, architecture and hardware · 2 · 2 first-author

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%
Theoretical computer science
1 paper
Computational complexity · 100%

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

TopicWeightPapersLastEvidence papers
Electronic design automation
physical design		 0.021993
Constrained via minimization · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1993
NP-Hard Module Rotation Problems · IEEE Trans. Computers 1993
Electronic design automation › physical design › routing › via minimization
constrained via minimization		 0.011993
Constrained via minimization · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1993
Electronic design automation › physical design
placement		 0.011993
NP-Hard Module Rotation Problems · IEEE Trans. Computers 1993
Electronic design automation › physical design
routing		 0.011993
Constrained via minimization · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1993
Electronic design automation › physical design › routing
via minimization		 0.011993
Constrained via minimization · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1993

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

heuristic algorithm · 0.0backtracking algorithm · 0.0
YearPublicationVenuePosition
1993 NP-Hard Module Rotation Problems
abstract
Preplaced circuit modules may be rotated to improve performance and/or routability. It is shown that several simple versions of the module rotation problem are NP-hard.>
Keumog Ahn, Sartaj Sahni
 IEEE Trans. Computers1
1993 Constrained via minimization
abstract
It is shown that the general two-layer constrained via minimization problem and the three-layer constrained via minimization problem for HVH topologies are NP-hard. A backtracking algorithm and a heuristic algorithm for the three-layer HVH constrained via minimization problem are proposed. The backtracking algorithm can also be used for three-layer non-HVH problems. Experimental results indicate that the heuristic generally outperforms that of K. Chang et al. (unpublished).>
Keumog Ahn, Sartaj Sahni
 IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.1