default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJeremy L. Martin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j16]Emma Colaric, Ryan DeMuse
, Jeremy L. Martin, Mei Yin:
Interval parking functions. Adv. Appl. Math. 123: 102129 (2021)- [j15]Galen Dorpalen-Barry, Cyrus Hettle, David C. Livingston, Jeremy L. Martin, George D. Nasr, Julianne Vega, Hays Whitlatch:
A positivity phenomenon in Elser's Gaussian-cluster percolation model. J. Comb. Theory A 179: 105364 (2021) - 2020
- [j14]Ayomikun Adeniran, Steve Butler, Galen Dorpalen-Barry, Pamela E. Harris, Cyrus Hettle, Qingzhong Liang, Jeremy L. Martin, Hayan Nam:
Enumerating Parking Completions Using Join and Split. Electron. J. Comb. 27(2): 2 (2020)
2010 – 2019
- 2019
- [j13]Joshua Hallam, Jeremy L. Martin, Bruce E. Sagan:
Increasing spanning forests in graphs and simplicial complexes. Eur. J. Comb. 76: 178-198 (2019) - 2018
- [j12]Benjamin Braun, Hugo Corrales, Scott Corry, Luis David García-Puente, Darren B. Glass, Nathan Kaplan, Jeremy L. Martin, Gregg Musiker, Carlos E. Valencia:
Counting arithmetical structures on paths and cycles. Discret. Math. 341(10): 2949-2963 (2018) - [j11]Ghodratollah Aalipour, Art M. Duval, Woong Kook, Kang-Ju Lee, Jeremy L. Martin:
A weighted cellular matrix-tree theorem, with applications to complete colorful and cubical complexes. J. Comb. Theory A 158: 362-386 (2018) - 2015
- [j10]Jeremy L. Martin, Jennifer D. Wagner:
On the Spectra of Simplicial Rook Graphs. Graphs Comb. 31(5): 1589-1611 (2015) - 2014
- [j9]Matthias Beck, Felix Breuer, Logan Godkin, Jeremy L. Martin:
Enumerating colorings, tensions and flows in cell complexes. J. Comb. Theory A 122: 82-106 (2014) - 2012
- [j8]Brandon Humpert, Jeremy L. Martin:
The Incidence Hopf Algebra of Graphs. SIAM J. Discret. Math. 26(2): 555-570 (2012) - 2011
- [j7]Art M. Duval, Caroline J. Klivans, Jeremy L. Martin:
Cellular spanning trees and Laplacians of cubical complexes. Adv. Appl. Math. 46(1-4): 247-274 (2011)
2000 – 2009
- 2009
- [j6]Jeremy L. Martin, Jennifer D. Wagner:
Updown Numbers and the Initial Monomials of the Slope Variety. Electron. J. Comb. 16(1) (2009) - 2008
- [j5]Jeremy L. Martin, Matthew Morin, Jennifer D. Wagner:
On distinguishing trees by their chromatic symmetric functions. J. Comb. Theory A 115(2): 237-253 (2008) - 2007
- [j4]Robert B. Ellis, Jeremy L. Martin, Catherine H. Yan:
Random Geometric Graph Diameter in the Unit Ball. Algorithmica 47(4): 421-438 (2007) - [j3]Jeremy L. Martin, David Savitt, Ted Singer:
Harmonic Algebraic Curves and Noncrossing Partitions. Discret. Comput. Geom. 37(2): 267-286 (2007) - 2006
- [j2]John H. Conway, Noam D. Elkies, Jeremy L. Martin:
The Mathieu Group M 12 and Its Pseudogroup Extension M 13. Exp. Math. 15(2): 223-236 (2006) - 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
- [j1]Jeremy L. Martin, Victor Reiner:
Factorizations of some weighted spanning tree enumerators. J. Comb. Theory A 104(2): 287-300 (2003)
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 2025-01-09 12:54 CET 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:
