Pages that link to "Item:Q1107990"

The following pages link to The complexity of minimizing wire lengths in VLSI layouts (Q1107990):

Displaying 31 items.

• Complexity dichotomy on partial grid recognition (Q533881) (← links)
• Weak sense of direction labelings and graph embeddings (Q628312) (← links)
• Two models of two-dimensional bandwidth problems (Q656608) (← links)
• Approximation algorithms for the bandwidth minimization problem for a large class of trees (Q675856) (← links)
• Efficient algorithms for network localization using cores of underlying graphs (Q742409) (← links)
• A framework for solving VLSI graph layout problems (Q796306) (← links)
• Lattice bandwidth of random graphs (Q810061) (← links)
• The strength of weak proximity (Q849629) (← links)
• Complexity results for three-dimensional orthogonal graph drawing (Q954967) (← links)
• A minimization version of a directed subgraph homeomorphism problem (Q1014308) (← links)
• Embedding ternary trees in VLSI arrays (Q1099135) (← links)
• Unit-length embedding of binary trees on a square grid (Q1120274) (← links)
• Drawing orders using less ink (Q1205151) (← links)
• The logic engine and the realization problem for nearest neighbor graphs (Q1349880) (← links)
• The techniques of Komolgorov and Bardzin for three-dimensional orthogonal graph drawings (Q1350939) (← links)
• A linear algorithm for 2-bend embeddings of planar graphs in the two-dimensional grid (Q1382254) (← links)
• Expansion of layouts of complete binary trees into grids (Q1414240) (← links)
• Three-dimensional orthogonal graph drawing algorithms (Q1570822) (← links)
• On complexity of multidistance graph recognition in \(\mathbb{R}^1\) (Q1690053) (← links)
• On the edge-length ratio of outerplanar graphs (Q1740698) (← links)
• The realization problem for Euclidean minimum spanning trees is NP-hard (Q1920421) (← links)
• Self-adjusting grid networks to minimize expected path length (Q2345461) (← links)
• Self-adjusting Grid Networks to Minimize Expected Path Length (Q2868630) (← links)
• Complexity dichotomy on degree-constrained VLSI layouts with unit-length edges (Q2883585) (← links)
• On Local Structures of Cubicity 2 Graphs (Q2958318) (← links)
• A decomposition for total-coloring partial-grids and list-total-coloring outerplanar graphs (Q3008921) (← links)
• Optimal grid representations (Q4651928) (← links)
• (Q5111244) (← links)
• On embeddability of unit disk graphs onto straight lines (Q6038709) (← links)
• Combinatorial properties and recognition of unit square visibility graphs (Q6045782) (← links)
• Grid recognition: classical and parameterized computational perspectives (Q6156159) (← links)