The following pages link to Multilayer grid embeddings for VLSI (Q916362):
Displayed 17 items.
- On graph thickness, geometric thickness, and separator theorems (Q621923) (← links)
- A note on Halton's conjecture (Q707336) (← links)
- On \(k\)-planar crossing numbers (Q885282) (← links)
- Three ways to cover a graph (Q898135) (← links)
- A lower bound on the area of permutation layouts (Q922710) (← links)
- Asymptotic component densities in programmable gate arrays realizing all circuits of a given size (Q1206434) (← links)
- A linear algorithm for 2-bend embeddings of planar graphs in the two-dimensional grid (Q1382254) (← links)
- Geometric thickness in a grid (Q1417581) (← links)
- Optimal three-dimensional orthogonal graph drawing in the general position model. (Q1874390) (← links)
- Drawings of graphs on surfaces with few crossings (Q1920424) (← links)
- Thickness of the subgroup intersection graph of a finite group (Q2146630) (← links)
- The thickness of amalgamations and Cartesian product of graphs (Q2364079) (← links)
- Geometric Thickness in a Grid of Linear Area (Q3438999) (← links)
- The 6-girth-thickness of the complete graph (Q4956180) (← links)
- The 4-girth-thickness of the complete multipartite graph (Q5009944) (← links)
- The Local Queue Number of Graphs with Bounded Treewidth (Q5014102) (← links)
- Straight-line drawings of 1-planar graphs (Q6049552) (← links)