The following pages link to Kenneth J. Supowit (Q584278):
Displaying 13 items.
- Delaunay graphs are almost as good as complete graphs (Q584279) (← links)
- Decomposing a set of points into chains, with applications to permutation and circle graphs (Q1071505) (← links)
- The complexity of drawing trees nicely (Q1168727) (← links)
- The Relative Neighborhood Graph, with an Application to Minimum Spanning Trees (Q3028354) (← links)
- (Q3138881) (← links)
- On the Complexity of Some Common Geometric Location Problems (Q3318110) (← links)
- Divide and Conquer Heuristics for Minimum Weighted Euclidean Matching (Q3967061) (← links)
- The Travelling Salesman Problem and Minimum Matching in the Unit Square (Q3967062) (← links)
- Some NP-hard polygon decomposition problems (Q3967065) (← links)
- Probabilistic analysis of divide‐and‐conquer heuristics for minimum weighted euclidean matching (Q3969884) (← links)
- Generalizations of the sethi‐ullman algorithm for register allocation (Q4727417) (← links)
- (Q4834461) (← links)
- Finding the optimal variable ordering for binary decision diagrams (Q5375442) (← links)
