![](https://dblp.uni-trier.de./img/logo.320x120.png)
![search dblp search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
default search action
Kassie Archer
Person information
Refine list
![note](https://dblp.uni-trier.de./img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j14]Kassie Archer, Alexander Diaz-Lopez, Darren B. Glass, Joel Louwsma
:
Critical Groups of Arithmetical Structures on Star Graphs and Complete Graphs. Electron. J. Comb. 31(1) (2024) - [j13]Kassie Archer
, Aaron Geary
:
Powers of permutations that avoid chains of patterns. Discret. Math. 347(9): 114040 (2024) - 2023
- [j12]Kassie Archer
, Christina Graves:
A new statistic on Dyck paths for counting 3-dimensional Catalan words. Discret. Math. 346(3): 113247 (2023) - 2022
- [j11]Kassie Archer
, Christina Graves
:
Pattern-restricted permutations composed of 3-cycles. Discret. Math. 345(7): 112895 (2022) - 2021
- [j10]Kassie Archer:
Enumerating two permutation classes by the number of cycles. Discret. Math. Theor. Comput. Sci. 22(2) (2021) - 2020
- [j9]Kassie Archer, Abigail C. Bishop, Alexander Diaz-Lopez
, Luis David García-Puente, Darren B. Glass, Joel Louwsma
:
Arithmetical structures on bidents. Discret. Math. 343(7): 111850 (2020) - [j8]Kassie Archer, Ira M. Gessel, Christina Graves, Xuming Liang:
Counting acyclic and strong digraphs by descents. Discret. Math. 343(11): 112041 (2020)
2010 – 2019
- 2019
- [j7]Kassie Archer, Adam Gregory, Bryan Pennington, Stephanie Slayden:
Pattern restricted quasi-Stirling permutations. Australas. J Comb. 74: 389-407 (2019) - [j6]Kassie Archer, Christina Graves, David Milan:
Classes of uniformly most reliable graphs for all-terminal reliability. Discret. Appl. Math. 267: 12-29 (2019) - [j5]Katie Anders, Kassie Archer
:
Rooted forests that avoid sets of permutations. Eur. J. Comb. 77: 1-16 (2019) - 2017
- [j4]Kassie Archer, Lindsey-Kay Lauderdale:
Unimodal Permutations and Almost-Increasing Cycles. Electron. J. Comb. 24(3): 3 (2017) - [j3]Kassie Archer
:
Characterization of the allowed patterns of signed shifts. Discret. Appl. Math. 217: 97-109 (2017) - [j2]Kassie Archer, Scott M. LaLonde:
Allowed Patterns of Symmetric Tent Maps via Commuter Functions. SIAM J. Discret. Math. 31(1): 317-334 (2017) - 2016
- [j1]Kassie Archer
:
Descents of λ-unimodal cycles in a character formula. Discret. Math. 339(10): 2399-2409 (2016)
Coauthor Index
![](https://dblp.uni-trier.de./img/cog.dark.24x24.png)
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 2025-01-21 00:24 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint