The following pages link to (Q3206972):
Displaying 12 items.
- Über Separatoren in planaren Graphen (Q599822) (← links)
- Improved results on geometric hitting set problems (Q603882) (← links)
- Complexities of layouts in three-dimensional VLSI circuits (Q753802) (← links)
- Bounds on path connectivity (Q761468) (← links)
- A framework for solving VLSI graph layout problems (Q796306) (← links)
- Separator theorems and Turán-type results for planar intersection graphs (Q947779) (← links)
- Lower bounds on communication overlap of networks (Q1095665) (← links)
- Graph graphics: Theory and practice (Q1103411) (← links)
- Voronoi diagrams from convex hulls (Q1135110) (← links)
- On alternation (Q1141480) (← links)
- Rectilinear short path queries among rectangular obstacles (Q1351630) (← links)
- Ordered colourings (Q1896351) (← links)
