Kenneth J. Supowit

2.5k total citations
33 papers, 1.6k citations indexed

About

Kenneth J. Supowit is a scholar working on Computational Theory and Mathematics, Electrical and Electronic Engineering and Computer Graphics and Computer-Aided Design. According to data from OpenAlex, Kenneth J. Supowit has authored 33 papers receiving a total of 1.6k indexed citations (citations by other indexed papers that have themselves been cited), including 14 papers in Computational Theory and Mathematics, 13 papers in Electrical and Electronic Engineering and 10 papers in Computer Graphics and Computer-Aided Design. Recurrent topics in Kenneth J. Supowit's work include Computational Geometry and Mesh Generation (10 papers), VLSI and FPGA Design Techniques (9 papers) and Advanced Graph Theory Research (9 papers). Kenneth J. Supowit is often cited by papers focused on Computational Geometry and Mesh Generation (10 papers), VLSI and FPGA Design Techniques (9 papers) and Advanced Graph Theory Research (9 papers). Kenneth J. Supowit collaborates with scholars based in United States. Kenneth J. Supowit's co-authors include Nimrod Megiddo, Edward M. Reingold, Joseph O’Rourke, Jonathan Greene, David Dobkin, Franco P. Preparata, David A. Plaisted, Wen−Lian Hsu, Andrew W. Appel and Jean R. S. Blair and has published in prestigious journals such as IEEE Transactions on Information Theory, Journal of the ACM and IEEE Transactions on Computers.

In The Last Decade

Kenneth J. Supowit

32 papers receiving 1.5k citations

Peers

Countries citing papers authored by Kenneth J. Supowit

Since Specialization

Citations

This map shows the geographic impact of Kenneth J. Supowit's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Kenneth J. Supowit with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Kenneth J. Supowit more than expected).

Fields of papers citing papers by Kenneth J. Supowit

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Kenneth J. Supowit. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Kenneth J. Supowit. The network helps show where Kenneth J. Supowit may publish in the future.

Co-authorship network of co-authors of Kenneth J. Supowit

This figure shows the co-authorship network connecting the top 25 collaborators of Kenneth J. Supowit. A scholar is included among the top collaborators of Kenneth J. Supowit based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Kenneth J. Supowit. Kenneth J. Supowit is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

#	Work	Indexed citations
1	New techniques for some dynamic closest-point and farthest-point problems 1990 ·Symposium on Discrete Algorithms ·Kenneth J. Supowit	21
2	Recognizing circle graphs in polynomial time 1989 ·Journal of the ACM ·(unknown), Kenneth J. Supowit, Wen−Lian Hsu	45
3	Minimizing channel density in standard cell layout 1987 ·Algorithmica ·Jean R. S. Blair, Sanjiv Kapoor, Errol L. Lloyd, Kenneth J. Supowit	4
4	Delaunay graphs are almost as good as complete graphs 1987 ·David Dobkin, (unknown), Kenneth J. Supowit	29
5	A New Method for Verifying Sequential Circuits 1986 ·Design Automation Conference ·Kenneth J. Supowit, (unknown)	20
6	A new method for verifying sequential circuits 1986 ·Kenneth J. Supowit, (unknown)	10
7	Simulated Annealing Without Rejected Moves 1986 ·IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems ·Jonathan Greene, Kenneth J. Supowit	105
8	Recognizing circle graphs in polynomial time 1985 ·(unknown), Wen−Lian Hsu, Kenneth J. Supowit	12
9	Decomposing a set of points into chains, with applications to permutation and circle graphs 1985 ·Information Processing Letters ·Kenneth J. Supowit	15
10	Placement algorithms for custom VLSI 1984 ·Computer-Aided Design ·Kenneth J. Supowit, (unknown)	7
11	Placement Algorithms for Custom VLSI 1983 ·Design Automation Conference ·Kenneth J. Supowit, (unknown)	10
12	Reducing Channel Density in Standard Cell Layout 1983 ·Design Automation Conference ·Kenneth J. Supowit	7
13	Some NP-hard polygon decomposition problems 1983 ·IEEE Transactions on Information Theory ·Joseph O’Rourke, Kenneth J. Supowit	111
14	The Travelling Salesman Problem and Minimum Matching in the Unit Square 1983 ·SIAM Journal on Computing ·Kenneth J. Supowit, Edward M. Reingold, David A. Plaisted	41
15	Probabilistic analysis of divide‐and‐conquer heuristics for minimum weighted euclidean matching 1983 ·Networks ·Edward M. Reingold, Kenneth J. Supowit	10
16	A Minimum-Impact Routing Algorithm 1982 ·Design Automation Conference ·Kenneth J. Supowit	7
17	A minimum-impact routing algorithm 1982 ·Kenneth J. Supowit	3
18	A Minimum-Impact Routing Algorithm 1982 ·Kenneth J. Supowit	1
19	Testing a simple polygon for monotonicity 1981 ·Information Processing Letters ·Franco P. Preparata, Kenneth J. Supowit	44
20	Heuristics for weighted perfect matching 1980 ·Kenneth J. Supowit, David A. Plaisted, Edward M. Reingold	23

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact