Heuristics for Weighted Perfect Matching - Kenneth J. Supowit; David A. Plaisted; Edward M. Reingold (STOC, 1980)

Testing a Simple Polygon for Monotonicity. - Franco P. Preparata; Kenneth J. Supowit (Inf. Process. Lett., 1981)

Topics in Computational Geometry - Kenneth J. Supowit (1981)

A minimum-impact routing algorithm. - Kenneth J. Supowit (DAC, 1982)

The Complexity of Drawing Trees Nicely. - Kenneth J. Supowit; Edward M. Reingold (Acta Informatica, 1982)

Reducing channel density in standard cell layout. - Kenneth J. Supowit (DAC, 1983)

Placement algorithms for custom VLSI. - Kenneth J. Supowit; Eric A. Slutz (DAC, 1983)

Probabilistic analysis of divide-and-conquer heuristics for minimum weighted euclidean matching. - Edward M. Reingold; Kenneth J. Supowit (Networks, 1983)

Divide and Conquer Heuristics for Minimum Weighted Euclidean Matching. - Kenneth J. Supowit; Edward M. Reingold (SIAM J. Comput., 1983)

The Travelling Salesman Problem and Minimum Matching in the Unit Square. - Kenneth J. Supowit; Edward M. Reingold; David A. Plaisted (SIAM J. Comput., 1983)

Some NP-hard polygon decomposition problems. - Joseph O'Rourke; Kenneth J. Supowit (IEEE Trans. Inf. Theory, 1983)

The Relative Neighborhood Graph, with an Application to Minimum Spanning Trees - Kenneth J. Supowit (J. ACM, 1983)

On the Complexity of Some Common Geometric Location Problems. - Nimrod Megiddo; Kenneth J. Supowit (SIAM J. Comput., 1984)

A Hierarchy-Driven Amalgamation of Standard and Macro Cells. - Edward M. Reingold; Kenneth J. Supowit (IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1984)

Decomposing a Set of Points into Chains, with Applications to Permutation and Circle Graphs. - Kenneth J. Supowit (Inf. Process. Lett., 1985)

A new method for verifying sequential circuits. - Kenneth J. Supowit; Steven J. Friedman (DAC, 1986)

Simulated Annealing Without Rejected Moves. - J. W. Greene; Kenneth J. Supowit (IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1986)

Minimizing Channel Density in Standard Cell Layout. - Jean R. S. Blair; Sanjiv Kapoor; Errol L. Lloyd; Kenneth J. Supowit (Algorithmica, 1987)

Generalization of the Sethi-Ullman Algorithm for Register Allocation. - Andrew W. Appel; Kenneth J. Supowit (Softw. Pract. Exp., 1987)

Finding a Maximum Planar Subset of a Set of Nets in a Channel. - Kenneth J. Supowit (IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1987)

Finding the Vertices Nearest to a Point in a Hypercube. - Nicholas J. Patterson; Kenneth J. Supowit (Inf. Process. Lett., 1988)

Recognizing circle graphs in polynomial time. - Csaba P. Gabor; Kenneth J. Supowit; Wen-Lian Hsu (J. ACM, 1989)

New Techniques for Some Dynamic Closest-Point and Farthest-Point Problems. - Kenneth J. Supowit (SODA, 1990)

Delaunay Graphs are almost as Good as Complete Graphs. - David P. Dobkin; Steven J. Friedman; Kenneth J. Supowit (Discret. Comput. Geom., 1990)

Finding the Optimal Variable Ordering for Binary Decision Diagrams. - Steven J. Friedman; Kenneth J. Supowit (IEEE Trans. Computers, 1990)

Newton's Method for Quadratics, and Nested Intervals. - Mordecai J. Golin; Kenneth J. Supowit (Complex Syst., 1994)

Algorithms for Constructing Computably Enumerable Sets - Kenneth J. Supowit (Springer, 2023)