default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCatherine H. Yan
Person information
- affiliation: Texas A&M University, Department of Mathematics, College Station, TX, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j42]Lauren Snider
, Catherine Yan:
U-parking functions and (p, q)-parking functions. Adv. Appl. Math. 134: 102309 (2022)- 2021
- [j41]Ayomikun Adeniran, Catherine Yan:
Gončarov polynomials in partition lattices and exponential families. Adv. Appl. Math. 126: 102045 (2021) - [j40]Henry Schenck, Sibylle Schroll, Catherine Yan:
Introduction to the Special Issue dedicated to Joseph Kung. Adv. Appl. Math. 126: 102148 (2021) - [j39]Ayomikun Adeniran, Catherine Yan:
On increasing and invariant parking sequences. Australas. J Comb. 79: 167-182 (2021) - 2020
- [j38]Westin King, Catherine H. Yan:
Parking Functions on Directed Graphs and Some Directed Trees. Electron. J. Comb. 27(2): 2 (2020) - [j37]Yue Cai, Catherine H. Yan:
Vector parking functions with periodic boundaries and rational parking functions. J. Comb. Theory A 173: 105239 (2020)
2010 – 2019
- 2019
- [j36]Yue Cai, Catherine Yan:
Counting with Borel's triangle. Discret. Math. 342(2): 529-539 (2019) - [j35]Westin King, Catherine H. Yan:
Prime parking functions on rooted trees. J. Comb. Theory A 168: 1-25 (2019) - 2017
- [j34]Steve Butler, Ron Graham, Catherine H. Yan:
Parking distributions on trees. Eur. J. Comb. 65: 168-185 (2017) - 2016
- [j33]Rudolph Lorentz, Catherine H. Yan:
Bivariate affine Gončarov polynomials. Discret. Math. 339(9): 2371-2383 (2016) - 2015
- [j32]Svetlana Poznanovic, Catherine H. Yan:
Maximal increasing sequences in fillings of almost-moon polyominoes. Adv. Appl. Math. 66: 1-21 (2015) - [j31]William Linz, Catherine Yan:
Derangements on a Ferrers board. Discret. Math. Algorithms Appl. 7(3): 1550036:1-1550036:17 (2015) - 2013
- [j30]Andrew Y. Z. Wang, Catherine H. Yan:
Positive and negative chains in charged moon polyominoes. Adv. Appl. Math. 51(4): 467-482 (2013) - [j29]Mitch Phillipson, Catherine H. Yan, Jean Yeh:
Chains of Length 2 in Fillings of Layer Polyominoes. Electron. J. Comb. 20(3): 51 (2013) - 2012
- [j28]Chunwei Song, Catherine Yan:
Descents of Permutations in a Ferrers Board. Electron. J. Comb. 19(1): 7 (2012) - 2010
- [j27]William Y. C. Chen, Svetlana Poznanovic, Catherine H. Yan, Arthur L. B. Yang:
Major index for 01-fillings of moon polyominoes. J. Comb. Theory A 117(8): 1058-1081 (2010) - [j26]William Y. C. Chen, Andrew Y. Z. Wang, Catherine H. Yan, Alina F. Y. Zhao:
Mixed Statistics on 01-Fillings of Moon Polyominoes. SIAM J. Discret. Math. 24(4): 1272-1290 (2010)
2000 – 2009
- 2009
- [b1]Joseph P. S. Kung, Gian-Carlo Rota, Catherine H. Yan:
Combinatorics - The Rota Way. Cambridge University Press 2009, ISBN 978-0-521-73794-4, pp. I-XII, 1-396 - [j25]Joseph P. S. Kung, Xinyu Sun, Catherine H. Yan:
Corrigendum to "Two-boundary lattice paths and parking functions" [Adv. in Appl. Math. 39 (4) (2007) 515-524]. Adv. Appl. Math. 43(2): 197-198 (2009) - [j24]Svetlana Poznanovic, Catherine H. Yan:
Crossings and Nestings of Two Edges in Set Partitions. SIAM J. Discret. Math. 23(2): 787-804 (2009) - 2008
- [j23]Dimitrije Kostic, Catherine H. Yan:
Multiparking functions, graph searching, and the Tutte polynomial. Adv. Appl. Math. 40(1): 73-97 (2008) - [j22]Robert B. Ellis, Vadim Ponomarenko, Catherine H. Yan:
How to play the one-lie Rényi-Ulam game. Discret. Math. 308(23): 5805-5808 (2008) - [j21]William Y. C. Chen, Susan Y. J. Wu, Catherine H. Yan:
Linked partitions and linked cycles. Eur. J. Comb. 29(6): 1408-1426 (2008) - [j20]William Y. C. Chen, Ira M. Gessel, Catherine H. Yan, Arthur L. B. Yang:
A major index for matchings and set partitions. J. Comb. Theory A 115(6): 1069-1076 (2008) - 2007
- [j19]Joseph P. S. Kung, Xinyu Sun, Catherine H. Yan:
Two-boundary lattice paths and parking functions. Adv. Appl. Math. 39(4): 515-524 (2007) - [j18]Robert B. Ellis, Jeremy L. Martin, Catherine H. Yan:
Random Geometric Graph Diameter in the Unit Ball. Algorithmica 47(4): 421-438 (2007) - [j17]Joseph P. S. Kung, Anna de Mier, Xinyu Sun, Catherine H. Yan:
Lattice paths with periodic boundaries. Electron. Notes Discret. Math. 29: 59-63 (2007) - 2006
- [j16]Ronald L. Graham, Jeffrey C. Lagarias, Colin L. Mallows, Allan R. Wilks, Catherine H. Yan:
Apollonian Circle Packings: Geometry and Group Theory II. Super-Apollonian Group and Integral Packings. Discret. Comput. Geom. 35(1): 1-36 (2006) - [j15]Ronald L. Graham, Jeffrey C. Lagarias, Colin L. Mallows, Allan R. Wilks, Catherine H. Yan:
Apollonian Circle Packings: Geometry and Group Theory III. Higher Dimensions. Discret. Comput. Geom. 35(1): 37-72 (2006) - [j14]Robert B. Ellis, Xingde Jia, Catherine H. Yan:
On random points in the unit disk. Random Struct. Algorithms 29(1): 14-25 (2006) - 2005
- [j13]Ronald L. Graham, Jeffrey C. Lagarias, Colin L. Mallows, Allan R. Wilks, Catherine H. Yan:
Apollonian Circle Packings: Geometry and Group Theory I. The Apollonian Group. Discret. Comput. Geom. 34(4): 547-585 (2005) - [j12]Robert B. Ellis, Vadim Ponomarenko, Catherine H. Yan:
The Rényi-Ulam pathological liar game with a fixed number of lies. J. Comb. Theory A 112(2): 328-336 (2005) - 2004
- [j11]Robert B. Ellis, Catherine H. Yan:
Ulam's pathological liar game with one half-lie. Int. J. Math. Math. Sci. 2004(29): 1523-1532 (2004) - [c1]Robert B. Ellis, Jeremy L. Martin, Catherine H. Yan:
Random Geometric Graph Diameter in the Unit Disk with lp Metric. GD 2004: 167-172 - 2003
- [j10]Ken Dykema, Catherine Yan:
Generating functions for moments of the quasi-nilpotent DT-operator. Adv. Appl. Math. 30(3): 545-561 (2003) - [j9]Joseph P. S. Kung, Catherine H. Yan:
Exact formulas for moments of sums of classical parking functions. Adv. Appl. Math. 31(1): 215-241 (2003) - [j8]Joseph P. S. Kung, Catherine H. Yan:
Goncarov polynomials and parking functions. J. Comb. Theory A 102(1): 16-37 (2003) - [j7]Joel Spencer, Catherine H. Yan:
The halflie problem. J. Comb. Theory A 103(1): 69-89 (2003) - 2001
- [j6]Catherine H. Yan:
Generalized Parking Functions, Tree Inversions, and Multicolored Graphs. Adv. Appl. Math. 27(Issues): 641-670 (2001) - 2000
- [j5]Hua Peng, Catherine Huafei Yan:
On the discrepancy of strongly unimodular matrices. Discret. Math. 219(1-3): 223-233 (2000) - [j4]Matteo Mainetti, Catherine Huafei Yan:
Geometric Identities in Lattice Theory. J. Comb. Theory A 91(1-2): 411-450 (2000)
1990 – 1999
- 1998
- [j3]Catherine Huafei Yan:
Distributive laws for commuting equivalence relations. Discret. Math. 181(1-3): 295-298 (1998) - [j2]Catherine Huafei Yan:
Commuting quasi-order relations. Discret. Math. 183(1-3): 285-292 (1998) - 1997
- [j1]Catherine Huafei Yan:
Generalized Tree Inversions andk-Parking Functions. J. Comb. Theory A 79(2): 268-280 (1997)
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:21 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:
