Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Richard W. Kenyon

dblp:40/10716 · DBLP profile ↗
← Back
6ranked-venue papers
3as first author
0since 2021 · last 2017
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 4 · 2 first-authorGraphics, computer vision, multimedia, augmented reality and games · 2 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
2 papers
Computational geometry · 32% Algorithms and data structures · 32% Graph algorithms and graph theory · 28%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Algorithms and data structures › polynomial-time algorithms
linear-time algorithms
0.011992
Tiling a Polygon with Rectangles · FOCS 1992
Computational geometry › polygon decomposition
rectangle tiling
0.011992
Tiling a Polygon with Rectangles · FOCS 1992
Graph algorithms and graph theory
shortest path
0.011991
How to Take Short Cuts · SCG 1991
Computational complexity › decidability
tiling problems
0.011992
Tiling a Polygon with Rectangles · FOCS 1992

Methods — techniques the papers use, named apart from their topics

quadratic algorithm · 0.0linear-time algorithm · 0.0
YearPublicationVenuePosition
2017 The Space of Circular Planar Electrical Networks
abstract
We discuss several parametrizations of the space of circular planar electrical networks. With any circular planar network we associate a canonical minimal network with the same response matrix, called a “standard” network. The conductances of edges in a standard network can be computed as a biratio of Pfaffians constructed from the response matrix. The conductances serve as coordinates that are compatible with the cell structure of circular planar networks in the sense that one conductance degenerates to $0$ or $\infty$ when moving from a cell to a boundary cell. We also show how to test if a network with $n$ nodes is well-connected by checking that $\binom{n}{2}$ minors of the $n\times n$ response matrix are positive; Colin de Verdière had previously shown that it was sufficient to check the positivity of exponentially many minors. For standard networks with $m$ edges, positivity of the conductances can be tested by checking the positivity of $m+1$ Pfaffians.
Richard W. Kenyon, David Bruce Wilson
SIAM J. Discret. Math.1
2010 On the Characterization of Expansion Maps for Self-Affine Tilings
Richard W. Kenyon, Boris Solomyak
Discret. Comput. Geom.1
1993 Tiling a Polygon with Parallelograms
Richard W. Kenyon
Algorithmica1
1992 Tiling a Polygon with Rectangles
abstract
The authors study the problem of tiling a simple polygon of surface n with rectangles of given types (tiles). They present a linear time algorithm for deciding if a polygon can be tiled with 1 * m and k * 1 tiles (and giving a tiling when it exists), and a quadratic algorithm for the same problem when the tile types are m * k and k * m.>
Claire Mathieu, Richard W. Kenyon
FOCS2
1992 How to Take Short Cuts
Claire Mathieu, Richard W. Kenyon
Discret. Comput. Geom.2
1991 How to Take Short Cuts
abstract
Article Free Access Share on How to take short cuts Authors: Claire Kenyon IHES, 35 route de Chartres, 91440 Bures-sur-Yvette, France IHES, 35 route de Chartres, 91440 Bures-sur-Yvette, FranceView Profile , Richard Kenyon View Profile Authors Info & Claims SCG '91: Proceedings of the seventh annual symposium on Computational geometryJune 1991 Pages 250–255https://doi.org/10.1145/109648.109676Online:01 June 1991Publication History 0citation181DownloadsMetricsTotal Citations0Total Downloads181Last 12 Months0Last 6 weeks0 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF
Claire Mathieu, Richard W. Kenyon
SCG2