The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Kenneth J. Supowit: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

Search in 0.081secs, Finished in 0.082secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002