Pages that link to "Item:Q3904539"
From MaRDI portal
The following pages link to Universality considerations in VLSI circuits (Q3904539):
Displaying 50 items.
- Euclidean movement minimization (Q306076) (← links)
- Closest pair and the post office problem for stochastic points (Q390124) (← links)
- The complexity of weighted counting for acyclic conjunctive queries (Q395018) (← links)
- Drawing a tree as a minimum spanning tree approximation (Q414909) (← links)
- Orthogonal drawings and crossing numbers of the Kronecker product of two cycles (Q433407) (← links)
- The planar \(k\)-means problem is NP-hard (Q441888) (← links)
- A straight-line order-preserving binary tree drawing algorithm with linear area and arbitrary aspect ratio (Q482353) (← links)
- A PTAS for minimum weighted connected vertex cover \(P_3\) problem in 3-dimensional wireless sensor networks (Q512868) (← links)
- Constrained \(k\)-center and movement to independence (Q534356) (← links)
- New graph decompositions with applications to emulations (Q675853) (← links)
- Bounds on path connectivity (Q761468) (← links)
- On sum coloring and sum multi-coloring for restricted families of graphs (Q764335) (← links)
- A framework for solving VLSI graph layout problems (Q796306) (← links)
- How to draw a planar graph on a grid (Q804582) (← links)
- Multilayer grid embeddings for VLSI (Q916362) (← links)
- A lower bound on the area of permutation layouts (Q922710) (← links)
- Small area drawings of outerplanar graphs (Q1024211) (← links)
- On the two-dimensional orthogonal drawing of series-parallel graphs (Q1026151) (← links)
- How to draw a clustered tree (Q1044037) (← links)
- Finding small simple cycle separators for 2-connected planar graphs (Q1085169) (← links)
- Optimal three-dimensional layouts of complete binary trees (Q1099137) (← links)
- A compact layout for the three-dimensional tree of meshes (Q1105621) (← links)
- The complexity of minimizing wire lengths in VLSI layouts (Q1107990) (← links)
- Unit disk graphs (Q1174134) (← links)
- Constructing compact rectilinear planar layouts using canonical representation of planar graphs (Q1193898) (← links)
- Not all planar digraphs have small cycle separators (Q1201868) (← links)
- Strictly-upward drawings of ordered search trees (Q1274319) (← links)
- Advances in the theory and practice of graph drawing (Q1285778) (← links)
- A special planar satisfiability problem and a consequence of its NP- completeness (Q1331895) (← links)
- The complexity of induced minors and related problems (Q1346772) (← links)
- A linear algorithm for 2-bend embeddings of planar graphs in the two-dimensional grid (Q1382254) (← links)
- Linear area upward drawings of AVL trees (Q1384187) (← links)
- New results on drawing angle graphs (Q1384188) (← links)
- Algorithms for area-efficient orthogonal drawing (Q1384191) (← links)
- Expansion of layouts of complete binary trees into grids (Q1414240) (← links)
- Power consumption in packet radio networks (Q1575645) (← links)
- Orthogonal layout with optimal face complexity (Q1616241) (← links)
- Untangling planar curves (Q1688858) (← links)
- More efficient universal circuit constructions (Q1703934) (← links)
- Orthogonal and smooth orthogonal layouts of 1-planar graphs with low edge complexity (Q1725786) (← links)
- Minimizing the number of max-power users in ad-hoc wireless networks with minimum node degree requirements (Q1751413) (← links)
- Representing graph families with edge grammars (Q1801468) (← links)
- Fixed edge-length graph drawing is NP-hard (Q1813977) (← links)
- A result on k-valent graphs and its application to a graph embedding problem (Q1820789) (← links)
- Optimizing area and aspect ratio in straight-line orthogonal tree drawings (Q1862119) (← links)
- Proximity drawings in polynomial area and volume (Q1882852) (← links)
- Drawing graphs on rectangular grids (Q1902892) (← links)
- The realization problem for Euclidean minimum spanning trees is NP-hard (Q1920421) (← links)
- LR-drawings of ordered rooted binary trees and near-linear area drawings of outerplanar graphs (Q2009630) (← links)
- Grid straight-line embeddings of trees with a minimum number of bends per path (Q2059894) (← links)
