default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMatthew Jenssen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j15]Matthew Jenssen
, Marcus Michelen, Mohan Ravichandran:
Quasipolynomial-time algorithms for Gibbs point processes. Comb. Probab. Comput. 33(1): 1-15 (2024)- [j14]Matthew Jenssen, Viresh Patel, Guus Regts:
Improved bounds for the zeros of the chromatic polynomial via Whitney's Broken Circuit Theorem. J. Comb. Theory B 169: 233-252 (2024) - 2023
- [j13]Matthew Jenssen, Will Perkins, Aditya Potukuchi:
Approximately counting independent sets in bipartite graphs via graph containers. Random Struct. Algorithms 63(1): 215-241 (2023) - [i5]Matthew Jenssen, Viresh Patel, Guus Regts:
Improved bounds for the zeros of the chromatic polynomial via Whitney's Broken Circuit Theorem. CoRR abs/2309.10928 (2023) - 2022
- [j12]Matthew Jenssen, Will Perkins, Aditya Potukuchi:
Independent sets of a given size and structure in the hypercube. Comb. Probab. Comput. 31(4): 702-720 (2022) - [c2]Matthew Jenssen, Aditya Potukuchi, Will Perkins:
Approximately counting independent sets in bipartite graphs via graph containers. SODA 2022: 499-516 - [i4]Matthew Jenssen, Marcus Michelen, Mohan Ravichandran:
Quasipolynomial-time algorithms for repulsive Gibbs point processes. CoRR abs/2209.10453 (2022) - 2021
- [j11]Ewan Davies, Matthew Jenssen, Will Perkins:
A proof of the upper matching conjecture for large graphs. J. Comb. Theory B 151: 393-416 (2021) - [i3]Matthew Jenssen, Will Perkins, Aditya Potukuchi:
Approximately counting independent sets in bipartite graphs via graph containers. CoRR abs/2109.03744 (2021) - 2020
- [j10]Jie Han, Matthew Jenssen, Yoshiharu Kohayakawa, Guilherme Oliveira Mota, Barnaby Roberts:
The multicolour size-Ramsey number of powers of paths. J. Comb. Theory B 145: 359-375 (2020) - [j9]Matthew Jenssen, Peter Keevash, Will Perkins:
Algorithms for #BIS-Hard Problems on Expander Graphs. SIAM J. Comput. 49(4): 681-710 (2020) - [i2]Tyler Helmuth, Matthew Jenssen, Will Perkins:
Finite-size scaling, phase coexistence, and algorithms for the random cluster model on random graphs. CoRR abs/2006.11580 (2020)
2010 – 2019
- 2019
- [j8]Dennis Clemens, Matthew Jenssen, Yoshiharu Kohayakawa, Natasha Morrison, Guilherme Oliveira Mota, Damian Reding, Barnaby Roberts:
The size?Ramsey number of powers of paths. J. Graph Theory 91(3): 290-299 (2019) - [c1]Matthew Jenssen, Peter Keevash, Will Perkins:
Algorithms for #BIS-hard problems on expander graphs. SODA 2019: 2235-2247 - 2018
- [j7]Ewan Davies, Matthew Jenssen, Will Perkins, Barnaby Roberts:
Tight bounds on the coefficients of partition functions via stability. J. Comb. Theory A 160: 1-30 (2018) - [j6]Ewan Davies, Matthew Jenssen, Will Perkins, Barnaby Roberts:
Extremes of the internal energy of the Potts model on cubic graphs. Random Struct. Algorithms 53(1): 59-75 (2018) - [i1]Matthew Jenssen, Peter Keevash, Will Perkins:
Algorithms for #BIS-hard problems on expander graphs. CoRR abs/1807.04804 (2018) - 2017
- [j5]Ewan Davies, Matthew Jenssen, Barnaby Roberts:
Multicolour Ramsey numbers of paths and even cycles. Eur. J. Comb. 63: 124-133 (2017) - [j4]Ewan Davies, Matthew Jenssen, Barnaby Roberts, Will Perkins:
Tight bounds on the coefficients of partition functions via stability. Electron. Notes Discret. Math. 61: 317-321 (2017) - [j3]Ewan Davies, Matthew Jenssen, Will Perkins, Barnaby Roberts:
Independent sets, matchings, and occupancy fractions. J. Lond. Math. Soc. 96(1): 47-66 (2017) - 2015
- [j2]Matthew Jenssen:
The Multicolour Ramsey Number of a Long Odd Cycle. Electron. Notes Discret. Math. 49: 377-381 (2015) - 2013
- [j1]Matthew Jenssen, Daniel Montealegre, Vadim Ponomarenko:
Irreducible Factorization Lengths and the Elasticity Problem within ℕ. Am. Math. Mon. 120(4): 322-328 (2013)
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-07-20 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:
