Kenneth J. Supowit

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Algorithms for Constructing Computably Enumerable Sets Computer Science Foundations and Applied Logic	2023-07-11	Paper
Finding the optimal variable ordering for binary decision diagrams IEEE Transactions on Computers	2018-09-14	Paper
scientific article; zbMATH DE number 759411 (Why is no real title available?)	1996-11-10	Paper
scientific article; zbMATH DE number 432753 (Why is no real title available?)	1994-09-18	Paper
Delaunay graphs are almost as good as complete graphs Discrete & Computational Geometry	1990-01-01	Paper
Generalizations of the sethi‐ullman algorithm for register allocation Software: Practice and Experience	1987-01-01	Paper
Decomposing a set of points into chains, with applications to permutation and circle graphs Information Processing Letters	1985-01-01	Paper
On the Complexity of Some Common Geometric Location Problems SIAM Journal on Computing	1984-01-01	Paper
Some NP-hard polygon decomposition problems IEEE Transactions on Information Theory	1983-01-01	Paper
Divide and Conquer Heuristics for Minimum Weighted Euclidean Matching SIAM Journal on Computing	1983-01-01	Paper
The Relative Neighborhood Graph, with an Application to Minimum Spanning Trees Journal of the ACM	1983-01-01	Paper
The Travelling Salesman Problem and Minimum Matching in the Unit Square SIAM Journal on Computing	1983-01-01	Paper
Probabilistic analysis of divide‐and‐conquer heuristics for minimum weighted euclidean matching Networks	1983-01-01	Paper
The complexity of drawing trees nicely Acta Informatica	1983-01-01	Paper

Research outcomes over time

This page was built for person: Kenneth J. Supowit