- CSB - MetaPress - Google - Bing - Yahoo
 | 1990 | |
|---|---|---|
| j18 |      | David P. Dobkin, Steven J. Friedman, Kenneth J. Supowit: Delaunay Graphs are almost as Good as Complete Graphs. Discrete & Computational Geometry 5: 399-407 (1990) |
| j17 | | Steven J. Friedman, Kenneth J. Supowit: Finding the Optimal Variable Ordering for Binary Decision Diagrams. IEEE Trans. Computers 39(5): 710-713 (1990) |
| c9 | | Kenneth J. Supowit: New Techniques for Some Dynamic Closest-Point and Farthest-Point Problems. SODA 1990: 84-90 |
| 1989 | ||
| j16 | | Csaba P. Gabor, Kenneth J. Supowit, Wen-Lian Hsu: Recognizing circle graphs in polynomial time. J. ACM 36(3): 435-473 (1989) |
| 1988 | ||
| j15 | | Nicholas J. Patterson, Kenneth J. Supowit: Finding the Vertices Nearest to a Point in a Hypercube. Inf. Process. Lett. 27(2): 99-102 (1988) |
| 1987 | ||
| j14 | | Jean R. S. Blair, Sanjiv Kapoor, Errol L. Lloyd, Kenneth J. Supowit: Minimizing Channel Density in Standard Cell Layout. Algorithmica 2: 267-282 (1987) |
| j13 | | Andrew W. Appel, Kenneth J. Supowit: Generalization of the Sethi-Ullman Algorithm for Register Allocation. Softw., Pract. Exper. 17(6): 417-421 (1987) |
| j12 | | Kenneth J. Supowit: Finding a Maximum Planar Subset of a Set of Nets in a Channel. IEEE Trans. on CAD of Integrated Circuits and Systems 6(1): 93-94 (1987) |
| c8 | | Steven J. Friedman, Kenneth J. Supowit: Finding the Optimal Variable Ordering for Binary Decision Diagrams. DAC 1987: 358-356 |
| c7 | | David P. Dobkin, Steven J. Friedman, Kenneth J. Supowit: Delaunay Graphs are Almost as Good as Complete Graphs. FOCS 1987: 20-26 |
| 1986 | ||
| j11 | | J. W. Greene, Kenneth J. Supowit: Simulated Annealing Without Rejected Moves. IEEE Trans. on CAD of Integrated Circuits and Systems 5(1): 221-228 (1986) |
| c6 | | Kenneth J. Supowit, Steven J. Friedman: A new method for verifying sequential circuits. DAC 1986: 200-207 |
| 1985 | ||
| j10 | | Kenneth J. Supowit: Decomposing a Set of Points into Chains, with Applications to Permutation and Circle Graphs. Inf. Process. Lett. 21(5): 249-252 (1985) |
| c5 | | Csaba P. Gabor, Wen-Lian Hsu, Kenneth J. Supowit: Recognizing Circle Graphs in Polynomial Time. FOCS 1985: 106-116 |
| 1984 | ||
| j9 | | Nimrod Megiddo, Kenneth J. Supowit: On the Complexity of Some Common Geometric Location Problems. SIAM J. Comput. 13(1): 182-196 (1984) |
| j8 | | Edward M. Reingold, Kenneth J. Supowit: A Hierarchy-Driven Amalgamation of Standard and Macro Cells. IEEE Trans. on CAD of Integrated Circuits and Systems 3(1): 3-11 (1984) |
| 1983 | ||
| j7 | | Kenneth J. Supowit: The Relative Neighborhood Graph, with an Application to Minimum Spanning Trees. J. ACM 30(3): 428-448 (1983) |
| j6 | | Edward M. Reingold, Kenneth J. Supowit: Probabilistic analysis of divide-and-conquer heuristics for minimum weighted euclidean matching. Networks 13(1): 49-66 (1983) |
| j5 | | Kenneth J. Supowit, Edward M. Reingold: Divide and Conquer Heuristics for Minimum Weighted Euclidean Matching. SIAM J. Comput. 12(1): 118-143 (1983) |
| j4 | | 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): 144-156 (1983) |
| j3 | | Joseph O'Rourke, Kenneth J. Supowit: Some NP-hard polygon decomposition problems. IEEE Transactions on Information Theory 29(2): 181-189 (1983) |
| c4 | | |
| c3 | | |
| 1982 | ||
| j2 | | Kenneth J. Supowit, Edward M. Reingold: The Complexity of Drawing Trees Nicely. Acta Inf. 18: 377-392 (1982) |
| c2 | | |
| 1981 | ||
| j1 | | Franco P. Preparata, Kenneth J. Supowit: Testing a Simple Polygon for Monotonicity. Inf. Process. Lett. 12(4): 161-164 (1981) |
| 1980 | ||
| c1 | | Kenneth J. Supowit, David A. Plaisted, Edward M. Reingold: Heuristics for Weighted Perfect Matching. STOC 1980: 398-419 |
Colors in the list of coauthors
Last update Sat May 25 18:37:28 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page