default search action
Kenneth J. Supowit
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [b2]Kenneth J. Supowit:
Algorithms for Constructing Computably Enumerable Sets. Springer 2023, ISBN 978-3-031-26903-5, pp. 1-163
1990 – 1999
- 1994
- [j19]Mordecai J. Golin, Kenneth J. Supowit:
Newton's Method for Quadratics, and Nested Intervals. Complex Syst. 8(3) (1994) - 1990
- [j18]David P. Dobkin, Steven J. Friedman, Kenneth J. Supowit:
Delaunay Graphs are almost as Good as Complete Graphs. Discret. Comput. Geom. 5: 399-407 (1990) - [j17]Steven J. Friedman, Kenneth J. Supowit:
Finding the Optimal Variable Ordering for Binary Decision Diagrams. IEEE Trans. Computers 39(5): 710-713 (1990) - [c9]Kenneth J. Supowit:
New Techniques for Some Dynamic Closest-Point and Farthest-Point Problems. SODA 1990: 84-90
1980 – 1989
- 1989
- [j16]Csaba P. Gabor, Kenneth J. Supowit, Wen-Lian Hsu:
Recognizing circle graphs in polynomial time. J. ACM 36(3): 435-473 (1989) - 1988
- [j15]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
- [j14]Jean R. S. Blair, Sanjiv Kapoor, Errol L. Lloyd, Kenneth J. Supowit:
Minimizing Channel Density in Standard Cell Layout. Algorithmica 2: 267-282 (1987) - [j13]Andrew W. Appel
, Kenneth J. Supowit:
Generalization of the Sethi-Ullman Algorithm for Register Allocation. Softw. Pract. Exp. 17(6): 417-421 (1987) - [j12]Kenneth J. Supowit:
Finding a Maximum Planar Subset of a Set of Nets in a Channel. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 6(1): 93-94 (1987) - [c8]Steven J. Friedman, Kenneth J. Supowit:
Finding the Optimal Variable Ordering for Binary Decision Diagrams. DAC 1987: 358-356 - [c7]David P. Dobkin, Steven J. Friedman, Kenneth J. Supowit:
Delaunay Graphs are Almost as Good as Complete Graphs. FOCS 1987: 20-26 - 1986
- [j11]J. W. Greene, Kenneth J. Supowit:
Simulated Annealing Without Rejected Moves. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 5(1): 221-228 (1986) - [c6]Kenneth J. Supowit, Steven J. Friedman:
A new method for verifying sequential circuits. DAC 1986: 200-207 - 1985
- [j10]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) - [c5]Csaba P. Gabor, Wen-Lian Hsu, Kenneth J. Supowit:
Recognizing Circle Graphs in Polynomial Time. FOCS 1985: 106-116 - 1984
- [j9]Nimrod Megiddo, Kenneth J. Supowit:
On the Complexity of Some Common Geometric Location Problems. SIAM J. Comput. 13(1): 182-196 (1984) - [j8]Edward M. Reingold, Kenneth J. Supowit:
A Hierarchy-Driven Amalgamation of Standard and Macro Cells. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 3(1): 3-11 (1984) - 1983
- [j7]Kenneth J. Supowit:
The Relative Neighborhood Graph, with an Application to Minimum Spanning Trees. J. ACM 30(3): 428-448 (1983) - [j6]Edward M. Reingold, Kenneth J. Supowit:
Probabilistic analysis of divide-and-conquer heuristics for minimum weighted euclidean matching. Networks 13(1): 49-66 (1983) - [j5]Kenneth J. Supowit, Edward M. Reingold:
Divide and Conquer Heuristics for Minimum Weighted Euclidean Matching. SIAM J. Comput. 12(1): 118-143 (1983) - [j4]Kenneth J. Supowit, Edward M. Reingold, David A. Plaisted:
The Travelling Salesman Problem and Minimum Matching in the Unit Square. SIAM J. Comput. 12(1): 144-156 (1983) - [j3]Joseph O'Rourke, Kenneth J. Supowit:
Some NP-hard polygon decomposition problems. IEEE Trans. Inf. Theory 29(2): 181-189 (1983) - [c4]Kenneth J. Supowit, Eric A. Slutz:
Placement algorithms for custom VLSI. DAC 1983: 164-170 - [c3]Kenneth J. Supowit:
Reducing channel density in standard cell layout. DAC 1983: 263-269 - 1982
- [j2]Kenneth J. Supowit, Edward M. Reingold:
The Complexity of Drawing Trees Nicely. Acta Informatica 18: 377-392 (1982) - [c2]Kenneth J. Supowit:
A minimum-impact routing algorithm. DAC 1982: 104-112 - 1981
- [b1]Kenneth J. Supowit:
Topics in Computational Geometry. University of Illinois Urbana-Champaign, USA, 1981 - [j1]Franco P. Preparata, Kenneth J. Supowit:
Testing a Simple Polygon for Monotonicity. Inf. Process. Lett. 12(4): 161-164 (1981) - 1980
- [c1]Kenneth J. Supowit, David A. Plaisted, Edward M. Reingold:
Heuristics for Weighted Perfect Matching. STOC 1980: 398-419
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:47 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: