dblp.uni-trier.dewww.uni-trier.de

Kenneth J. Supowit Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

*1990
23 Kenneth J. Supowit: New Techniques for Some Dynamic Closest-Point and Farthest-Point Problems. SODA 1990: 84-90
22 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)
21 Steven J. Friedman, Kenneth J. Supowit: Finding the Optimal Variable Ordering for Binary Decision Diagrams. IEEE Trans. Computers 39(5): 710-713 (1990)
1989
20EECsaba P. Gabor, Kenneth J. Supowit, Wen-Lian Hsu: Recognizing circle graphs in polynomial time. J. ACM 36(3): 435-473 (1989)
1988
19 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
18EESteven J. Friedman, Kenneth J. Supowit: Finding the Optimal Variable Ordering for Binary Decision Diagrams. DAC 1987: 358-356
17 David P. Dobkin, Steven J. Friedman, Kenneth J. Supowit: Delaunay Graphs are Almost as Good as Complete Graphs FOCS 1987: 20-26
16 Jean R. S. Blair, Sanjiv Kapoor, Errol L. Lloyd, Kenneth J. Supowit: Minimizing Channel Density in Standard Cell Layout. Algorithmica 2: 267-282 (1987)
15EEKenneth 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)
14 Andrew W. Appel, Kenneth J. Supowit: Generalization of the Sethi-Ullman Algorithm for Register Allocation. Softw., Pract. Exper. 17(6): 417-421 (1987)
1986
13EEKenneth J. Supowit, Steven J. Friedman: A new method for verifying sequential circuits. DAC 1986: 200-207
12EEJ. W. Greene, Kenneth J. Supowit: Simulated Annealing Without Rejected Moves. IEEE Trans. on CAD of Integrated Circuits and Systems 5(1): 221-228 (1986)
1985
11 Csaba P. Gabor, Wen-Lian Hsu, Kenneth J. Supowit: Recognizing Circle Graphs in Polynomial Time FOCS 1985: 106-116
10 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)
1984
9EEEdward 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)
8 Nimrod Megiddo, Kenneth J. Supowit: On the Complexity of Some Common Geometric Location Problems. SIAM J. Comput. 13(1): 182-196 (1984)
1983
7 Joseph O'Rourke, Kenneth J. Supowit: Some NP-hard polygon decomposition problems. IEEE Transactions on Information Theory 29(2): 181-189 (1983)
6EEKenneth J. Supowit: The Relative Neighborhood Graph, with an Application to Minimum Spanning Trees J. ACM 30(3): 428-448 (1983)
5 Kenneth J. Supowit, Edward M. Reingold: Divide and Conquer Heuristics for Minimum Weighted Euclidean Matching. SIAM J. Comput. 12(1): 118-143 (1983)
4 Kenneth J. Supowit, Edward M. Reingold, David A. Plaisted: The Traveling Salesman Problem and Minimum Matching in the Unit Square. SIAM J. Comput. 12(1): 144-156 (1983)
1982
3 Kenneth J. Supowit, Edward M. Reingold: The Complexity of Drawing Trees Nicely. Acta Inf. 18: 377-392 (1982)
1981
2 Franco P. Preparata, Kenneth J. Supowit: Testing a Simple Polygon for Monotonicity. Inf. Process. Lett. 12(4): 161-164 (1981)
1980
1 Kenneth J. Supowit, David A. Plaisted, Edward M. Reingold: Heuristics for Weighted Perfect Matching STOC 1980: 398-419

Coauthor Index

1Andrew W. Appel [14]
2Jean R. S. Blair [16]
3David P. Dobkin [17] [22]
4Steven J. Friedman [13] [17] [18] [21] [22]
5Csaba P. Gabor [11] [20]
6J. W. Greene [12]
7Wen-Lian Hsu [11] [20]
8Sanjiv Kapoor [16]
9Errol L. Lloyd [16]
10Nimrod Megiddo [8]
11Joseph O'Rourke [7]
12Nicholas J. Patterson [19]
13David A. Plaisted [1] [4]
14Franco P. Preparata [2]
15Edward M. Reingold [1] [3] [4] [5] [9]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)