Concepedia

Kenneth J. Supowit

KJ

Statistics

Publications

25

Citations

2.5K

H-Index

19

Active since

1980

Affiliations

Princeton University(Current)

Hewlett-Packard (United States)

University of Illinois Urbana-Champaign

Northwestern University

Kenneth J. Supowit is an author at Princeton University specializing in combinatorial optimization, engineering, and discrete mathematics.

Top concepts

EngineeringComputer ScienceCombinatorial OptimizationDiscrete MathematicsComputational ComplexityGraph TheoryComputational GeometryComputer EngineeringMathematical ProgrammingNetwork Analysis

Publications per year

1980–1990

25

Publications

25

On the Complexity of Some Common Geometric Location Problems

Nimrod Megiddo, Kenneth J. Supowit · SIAM Journal on Computing · 1984 · 666 citations

Mathematical Programming, Engineering, Geometric Algorithm +15

Delaunay graphs are almost as good as complete graphs

David Dobkin, Steven J. Friedman, Kenneth J. Supowit · Discrete & Computational Geometry · 1990 · 228 citations · Full text

Geometric Graph Theory, Graph Theory, Structural Graph Theory +8

Finding the optimal variable ordering for binary decision diagrams

Steven J. Friedman, Kenneth J. Supowit · IEEE Transactions on Computers · 1990 · 209 citations

Mathematical Programming, Circuit Complexity, Engineering +20

Some NP-hard polygon decomposition problems

Joseph O’Rourke, Kenneth J. Supowit · IEEE Transactions on Information Theory · 1983 · 201 citations

Mathematical Programming, Geometric Modeling, Polygon Decomposition Problems +15

The Relative Neighborhood Graph, with an Application to Minimum Spanning Trees

Kenneth J. Supowit · Journal of the ACM · 1983 · 160 citations · Full text

1–5 of 25