scientific article; zbMATH DE number 139786
From MaRDI portal
Publication:4028111
Recommendations
- A framework for solving VLSI graph layout problems
- scientific article; zbMATH DE number 3950392
- scientific article; zbMATH DE number 833244
- Algorithmic aspects of VLSI layout.
- Multilayer grid embeddings for VLSI
- scientific article; zbMATH DE number 1119440
- An Array Layout Methodology for VLSI Circuits
- Optimal three-dimensional VLSI layouts
- Linear placement algorithms and applications to VLSI design
- Theory and practice of VLSI placement
Cited in
(21)- Paths, flows, and VLSI-layout. Proceedings of a meeting held from June 20 to July 1, 1988, at the University of Bonn, Germany
- A better heuristic for orthogonal graph drawings
- Three-dimensional orthogonal graph drawing algorithms
- Drawing graphs on rectangular grids
- Optimal two-sided embeddings of complete binary trees in rectangular grids
- Separator-based graph embedding into multidimensional grids with small edge-congestion
- Complexity dichotomy on degree-constrained VLSI layouts with unit-length edges
- Relating bends and size in orthogonal graph drawings
- scientific article; zbMATH DE number 3938571 (Why is no real title available?)
- An Array Layout Methodology for VLSI Circuits
- Linear placement algorithms and applications to VLSI design
- Bend-optimal orthogonal graph drawing in the general position model
- Universality considerations in VLSI circuits
- Optimal three-dimensional VLSI layouts
- The net adding problem
- scientific article; zbMATH DE number 833244 (Why is no real title available?)
- Maximum area axis-aligned square packings
- Optimal orthogonal drawings of triconnected plane graphs
- How vulnerable is an undirected planar graph with respect to max flow
- A framework for solving VLSI graph layout problems
- Multilayer grid embeddings for VLSI
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4028111)
