Kenneth J. Supowit

Publication Activity (10 Years)

Years Active: 1980-1994
Publications (10 Years): 0

Publications

Mordecai J. Golin, Kenneth J. Supowit
Newton's Method for Quadratics, and Nested Intervals. Complex Syst. 8 (3) (1994)
Steven J. Friedman, Kenneth J. Supowit
Finding the Optimal Variable Ordering for Binary Decision Diagrams. IEEE Trans. Computers 39 (5) (1990)
Kenneth J. Supowit
New Techniques for Some Dynamic Closest-Point and Farthest-Point Problems. SODA (1990)
David P. Dobkin, Steven J. Friedman, Kenneth J. Supowit
Delaunay Graphs are almost as Good as Complete Graphs. Discret. Comput. Geom. 5 (1990)
Csaba P. Gabor, Kenneth J. Supowit, Wen-Lian Hsu
Recognizing circle graphs in polynomial time. J. ACM 36 (3) (1989)
Nicholas J. Patterson, Kenneth J. Supowit
Finding the Vertices Nearest to a Point in a Hypercube. Inf. Process. Lett. 27 (2) (1988)
Andrew W. Appel, Kenneth J. Supowit
Generalization of the Sethi-Ullman Algorithm for Register Allocation. Softw. Pract. Exp. 17 (6) (1987)
Steven J. Friedman, Kenneth J. Supowit
Finding the Optimal Variable Ordering for Binary Decision Diagrams. DAC (1987)
David P. Dobkin, Steven J. Friedman, Kenneth J. Supowit
Delaunay Graphs are Almost as Good as Complete Graphs FOCS (1987)
Kenneth J. Supowit
Finding a Maximum Planar Subset of a Set of Nets in a Channel. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 6 (1) (1987)
Jean R. S. Blair, Sanjiv Kapoor, Errol L. Lloyd, Kenneth J. Supowit
Minimizing Channel Density in Standard Cell Layout. Algorithmica 2 (1987)
J. W. Greene, Kenneth J. Supowit
Simulated Annealing Without Rejected Moves. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 5 (1) (1986)
Kenneth J. Supowit, Steven J. Friedman
A new method for verifying sequential circuits. DAC (1986)
Csaba P. Gabor, Wen-Lian Hsu, Kenneth J. Supowit
Recognizing Circle Graphs in Polynomial Time FOCS (1985)
Kenneth J. Supowit
Decomposing a Set of Points into Chains, with Applications to Permutation and Circle Graphs. Inf. Process. Lett. 21 (5) (1985)
Nimrod Megiddo, Kenneth J. Supowit
On the Complexity of Some Common Geometric Location Problems. SIAM J. Comput. 13 (1) (1984)
Edward M. Reingold, Kenneth J. Supowit
A Hierarchy-Driven Amalgamation of Standard and Macro Cells. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 3 (1) (1984)
Kenneth J. Supowit
The Relative Neighborhood Graph, with an Application to Minimum Spanning Trees J. ACM 30 (3) (1983)
Kenneth J. Supowit
Reducing channel density in standard cell layout. DAC (1983)
Kenneth J. Supowit, Edward M. Reingold
Divide and Conquer Heuristics for Minimum Weighted Euclidean Matching. SIAM J. Comput. 12 (1) (1983)
Kenneth J. Supowit, Eric A. Slutz
Placement algorithms for custom VLSI. DAC (1983)
Edward M. Reingold, Kenneth J. Supowit
Probabilistic analysis of divide-and-conquer heuristics for minimum weighted euclidean matching. Networks 13 (1) (1983)
Joseph O'Rourke, Kenneth J. Supowit
Some NP-hard polygon decomposition problems. IEEE Trans. Inf. Theory 29 (2) (1983)
Kenneth J. Supowit, Edward M. Reingold, David A. Plaisted
The Travelling Salesman Problem and Minimum Matching in the Unit Square. SIAM J. Comput. 12 (1) (1983)
Kenneth J. Supowit
A minimum-impact routing algorithm. DAC (1982)
Kenneth J. Supowit, Edward M. Reingold
The Complexity of Drawing Trees Nicely. Acta Informatica 18 (1982)
Franco P. Preparata, Kenneth J. Supowit
Testing a Simple Polygon for Monotonicity. Inf. Process. Lett. 12 (4) (1981)
Kenneth J. Supowit, David A. Plaisted, Edward M. Reingold
Heuristics for Weighted Perfect Matching STOC (1980)