Kenneth J. Supowit - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 30 from 30

2023

Algorithms for Constructing Computably Enumerable SetsKenneth J. Supowit. Springer, 2023. [doi]

1994

Newton's Method for Quadratics, and Nested IntervalsMordecai J. Golin, Kenneth J. Supowit. compsys, 8(3), 1994. [doi]

1990

Delaunay Graphs are almost as Good as Complete GraphsDavid P. Dobkin, Steven J. Friedman, Kenneth J. Supowit. dcg, 5:399-407, 1990.

Finding the Optimal Variable Ordering for Binary Decision DiagramsSteven J. Friedman, Kenneth J. Supowit. TC, 39(5):710-713, 1990.

New Techniques for Some Dynamic Closest-Point and Farthest-Point ProblemsKenneth J. Supowit. soda 1990: 84-90

1989

Recognizing circle graphs in polynomial timeCsaba P. Gabor, Kenneth J. Supowit, Wen-Lian Hsu. JACM, 36(3):435-473, 1989. [doi]

1988

Finding the Vertices Nearest to a Point in a HypercubeNicholas J. Patterson, Kenneth J. Supowit. ipl, 27(2):99-102, 1988.

1987

1986

Simulated Annealing Without Rejected MovesJ. W. Greene, Kenneth J. Supowit. tcad, 5(1):221-228, 1986. [doi]

A new method for verifying sequential circuitsKenneth J. Supowit, Steven J. Friedman. dac 1986: 200-207 [doi]

1985

Recognizing Circle Graphs in Polynomial TimeCsaba P. Gabor, Wen-Lian Hsu, Kenneth J. Supowit. focs 1985: 106-116

Decomposing a Set of Points into Chains, with Applications to Permutation and Circle GraphsKenneth J. Supowit. ipl, 21(5):249-252, 1985.

1984

On the Complexity of Some Common Geometric Location ProblemsNimrod Megiddo, Kenneth J. Supowit. SICOMP, 13(1):182-196, 1984.

A Hierarchy-Driven Amalgamation of Standard and Macro CellsEdward M. Reingold, Kenneth J. Supowit. tcad, 3(1):3-11, 1984. [doi]

1983

Probabilistic analysis of divide-and-conquer heuristics for minimum weighted euclidean matchingEdward M. Reingold, Kenneth J. Supowit. networks, 13(1):49-66, 1983. [doi]

Some NP-hard polygon decomposition problemsJoseph O Rourke, Kenneth J. Supowit. TIT, 29(2):181-189, 1983.

Placement algorithms for custom VLSIKenneth J. Supowit, Eric A. Slutz. dac 1983: 164-170 [doi]

Reducing channel density in standard cell layoutKenneth J. Supowit. dac 1983: 263-269 [doi]

The Relative Neighborhood Graph, with an Application to Minimum Spanning TreesKenneth J. Supowit. JACM, 30(3):428-448, July 1983. [doi]

Divide and Conquer Heuristics for Minimum Weighted Euclidean MatchingKenneth J. Supowit, Edward M. Reingold. SICOMP, 12(1):118-143, 1983.

The Traveling Salesman Problem and Minimum Matching in the Unit SquareKenneth J. Supowit, Edward M. Reingold, David A. Plaisted. SICOMP, 12(1):144-156, 1983.

1982

A minimum-impact routing algorithmKenneth J. Supowit. dac 1982: 104-112 [doi]

The Complexity of Drawing Trees NicelyKenneth J. Supowit, Edward M. Reingold. ACTA, 18:377-392, 1982.

1981

Testing a Simple Polygon for MonotonicityFranco P. Preparata, Kenneth J. Supowit. ipl, 12(4):161-164, 1981.

Topics in Computational GeometryKenneth J. Supowit. PhD thesis, University of Illinois Urbana-Champaign, USA, 1981. [doi]

1980

Heuristics for Weighted Perfect MatchingKenneth J. Supowit, David A. Plaisted, Edward M. Reingold. stoc 1980: 398-419

Sign in or sign up to see more results.

runs on WebDSL