Kenneth J. Supowit

Available identifiers

zbMath Open supowit.kenneth-jMaRDI QIDQ584278

List of research outcomes

Publication	Date of Publication	Type
Algorithms for Constructing Computably Enumerable Sets	2023-07-11	Paper
Finding the optimal variable ordering for binary decision diagrams	2018-09-14	Paper
https://portal.mardi4nfdi.de/entity/Q4834461	1996-11-10	Paper
https://portal.mardi4nfdi.de/entity/Q3138881	1994-09-18	Paper
Delaunay graphs are almost as good as complete graphs	1990-01-01	Paper
Generalizations of the sethi‐ullman algorithm for register allocation	1987-01-01	Paper
Decomposing a set of points into chains, with applications to permutation and circle graphs	1985-01-01	Paper
On the Complexity of Some Common Geometric Location Problems	1984-01-01	Paper
The complexity of drawing trees nicely	1983-01-01	Paper
The Relative Neighborhood Graph, with an Application to Minimum Spanning Trees	1983-01-01	Paper
Divide and Conquer Heuristics for Minimum Weighted Euclidean Matching	1983-01-01	Paper
The Travelling Salesman Problem and Minimum Matching in the Unit Square	1983-01-01	Paper
Some NP-hard polygon decomposition problems	1983-01-01	Paper
Probabilistic analysis of divide‐and‐conquer heuristics for minimum weighted euclidean matching	1983-01-01	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Kenneth J. Supowit