The following pages link to (Q3777426):
Displaying 10 items.
- A parallel algorithm for solving the coloring problem on trapezoid graphs (Q287107) (← links)
- In-place algorithms for computing a largest clique in geometric intersection graphs (Q741534) (← links)
- Trapezoid graphs and their coloring (Q1111577) (← links)
- A note on hypergraph decomposition based on extended minimal sets (Q1124611) (← links)
- A framework for 1-D compaction with forbidden region avoidance (Q1194311) (← links)
- Maximum \(k\)-covering of weighted transitive graphs with applications (Q1207331) (← links)
- Balanced block spacing for VLSI layout (Q1208448) (← links)
- Rectilinear paths among rectilinear obstacles (Q2563920) (← links)
- A branch-and-price algorithm for the Steiner tree packing problem. (Q5952785) (← links)
- Finding a shortest pair of paths on the plane with obstacles and crossing areas (Q6487944) (← links)
