default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRichard W. Kenyon
Person information
- affiliation: Brown University, Providence, RI, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2020
[j15]Richard W. Kenyon, Wai Yeung Lam
:
Holomorphic quadratic differentials on graphs and the chromatic polynomial. J. Comb. Theory A 170 (2020)- [j14]Richard W. Kenyon, Daniel Král', Charles Radin, Peter Winkler:
Permutations with fixed pattern densities. Random Struct. Algorithms 56(1): 220-250 (2020) - 2017
- [j13]Richard W. Kenyon, Mei Yin:
On the asymptotics of constrained exponential random graphs. J. Appl. Probab. 54(1): 165-180 (2017) - [j12]Richard W. Kenyon, David Bruce Wilson:
The Space of Circular Planar Electrical Networks. SIAM J. Discret. Math. 31(1): 1-28 (2017) - 2016
- [j11]Richard W. Kenyon, Robin Pemantle:
Double-dimers, the Ising model and the hexahedron recurrence. J. Comb. Theory A 137: 27-63 (2016) - 2011
- [j10]Richard W. Kenyon, David B. Wilson:
Double-Dimer Pairings and Skew Young Diagrams. Electron. J. Comb. 18(1) (2011) - 2010
- [j9]Richard W. Kenyon, Boris Solomyak:
On the Characterization of Expansion Maps for Self-Affine Tilings. Discret. Comput. Geom. 43(3): 577-593 (2010) - 2009
- [j8]Richard W. Kenyon, David B. Wilson:
Combinatorics of Tripartite Boundary Connections for Trees and Dimers. Electron. J. Comb. 16(1) (2009) - [j7]Richard W. Kenyon, Peter Winkler:
Branched Polymers. Am. Math. Mon. 116(7): 612-628 (2009) - 2004
- [j6]Richard W. Kenyon, Scott Sheffield:
Dimers, tilings and trees. J. Comb. Theory B 92(2): 295-317 (2004) - 2000
- [j5]Richard W. Kenyon, James Gary Propp, David Bruce Wilson:
Trees and Matchings. Electron. J. Comb. 7 (2000) - 1996
- [j4]Richard W. Kenyon:
A Note on Tiling with Integer-Sided Rectangles. J. Comb. Theory A 74(2): 321-332 (1996) - [j3]Richard W. Kenyon:
Tiling a Rectangle with the Fewest Squares. J. Comb. Theory A 76(2): 272-291 (1996) - 1993
- [j2]Richard W. Kenyon:
Tiling a Polygon with Parallelograms. Algorithmica 9(4): 382-397 (1993) - 1992
- [j1]Claire Kenyon, Richard W. Kenyon:
How to Take Short Cuts. Discret. Comput. Geom. 8: 251-264 (1992)
Conference and Workshop Papers
- 1992
- [c2]Claire Kenyon, Richard W. Kenyon:
Tiling a Polygon with Rectangles. FOCS 1992: 610-619 - 1991
- [c1]Claire Kenyon, Richard W. Kenyon:
How to Take Short Cuts. SCG 1991: 250-255
Informal and Other Publications
- 2017
- [i3]Richard W. Kenyon, Charles Radin, Kui Ren, Lorenzo Sadun:
The phases of large networks with edge and triangle constraints. CoRR abs/1701.04444 (2017) - 2015
- [i2]Richard W. Kenyon, Charles Radin, Kui Ren, Lorenzo Sadun:
Bipodal structure in oversaturated random graphs. CoRR abs/1509.05370 (2015) - 2014
- [i1]Richard W. Kenyon, Charles Radin, Kui Ren, Lorenzo Sadun:
Multipodal Structure and Phase Transitions in Large Constrained Graphs. CoRR abs/1405.0599 (2014)
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-06-10 21:23 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:
