Demo Data from VLDB 2026 / reviewers in the wild / expert
Jürgen M. Kleinhans
dblp:85/5452
· DBLP profile ↗
3ranked-venue papers
2as 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 · 3 · 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 |
Mathematical optimization · 100% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Electronic design automation
physical design |
0.0 | 2 | 1991 | GORDIAN: VLSI placement by quadratic programming and slicing optimization · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1991 On the relative placement and the transportation problem for standard-cell layout · DAC 1986 |
Electronic design automation › physical design
placement |
0.0 | 2 | 1991 | GORDIAN: VLSI placement by quadratic programming and slicing optimization · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1991 On the relative placement and the transportation problem for standard-cell layout · DAC 1986 |
Mathematical optimization
discrete optimization |
0.0 | 1 | 1986 | On the relative placement and the transportation problem for standard-cell layout · DAC 1986 |
Mathematical optimization › combinatorial optimization › network optimization
transportation problem |
0.0 | 1 | 1986 | On the relative placement and the transportation problem for standard-cell layout · DAC 1986 |
Methods — techniques the papers use, named apart from their topics
transportation problem formulation · 0.0slicing optimization · 0.0quadratic programming · 0.0partitioning · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1991 | GORDIAN: VLSI placement by quadratic programming and slicing optimizationabstractThe authors present a placement method for cell-based layout styles. It is composed of alternating and interacting global optimization and partitioning steps that are followed by an optimization of the area utilization. Methods using the divide-and-conquer paradigm usually lose the global view by generating smaller and smaller subproblems. In contrast, GORDIAN maintains the simultaneous treatment of all cells over all global optimization steps, thereby considering constraints that reflect the current dissection of the circuit. The global optimizations are performed by solving quadratic programming problems that possess unique global minima. Improved partitioning schemes for the stepwise refinement of the placement are introduced. The area utilization is optimized by an exhaustive slicing procedure. The placement method is applied to real-world problems, and excellent results in terms of placement quality and computation time are obtained.> Jürgen M. Kleinhans, Georg Sigl, Frank M. Johannes, Kurt Antreich |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. | 1 |
| 1988 | GORDIAN: a new global optimization/rectangle dissection method for cell placementabstractA placement method for cell-based layout styles composed of alternating and interacting global optimization and partitioning phases is presented. In contrast to other methods using the divide-and-conquer paradigm, it maintains the simultaneous treatment of all cells during optimization over all levels of partitioning. In the global optimization phases, constrained quadratic optimization problems with unique global minima are solved. Their solutions induce the assignment of cells to regions during the partitioning phases. For general-cell circuits, a highly efficient exhaustive slicing procedure is applied to small subsets of cells. The designer may choose a configuration from a menu to meet his requirements on chip area, chip aspect ratio and wire length. Placements with high area utilization are obtained within short computation times. The method has been applied to general-cell and standard-cell circuits with up to 3000 cells and nets.> Jürgen M. Kleinhans, Georg Sigl, Frank M. Johannes |
ICCAD | 1 |
| 1986 | On the relative placement and the transportation problem for standard-cell layout
Knut M. Just, Jürgen M. Kleinhans, Frank M. Johannes |
DAC | 2 |