Kenneth J. Supowit

30 papers A* 9Journal 19

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