Matthew Jenssen

Publication Activity (10 Years)

Years Active: 2013-2024
Publications (10 Years): 20

Top Topics

Grow Exponentially

Bipartite Graph

Hyper Heuristics

Top Venues

Comb. Probab. Comput.

Random Struct. Algorithms

Electron. Notes Discret. Math.

Publications

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 (2024)
Matthew Jenssen, Marcus Michelen, Mohan Ravichandran
Quasipolynomial-time algorithms for Gibbs point processes. Comb. Probab. Comput. 33 (1) (2024)
Matthew Jenssen, Viresh Patel, Guus Regts
Improved bounds for the zeros of the chromatic polynomial via Whitney's Broken Circuit Theorem. CoRR (2023)
Matthew Jenssen, Will Perkins, Aditya Potukuchi
Approximately counting independent sets in bipartite graphs via graph containers. Random Struct. Algorithms 63 (1) (2023)
Matthew Jenssen, Marcus Michelen, Mohan Ravichandran
Quasipolynomial-time algorithms for repulsive Gibbs point processes. CoRR (2022)
Matthew Jenssen, Will Perkins, Aditya Potukuchi
Independent sets of a given size and structure in the hypercube. Comb. Probab. Comput. 31 (4) (2022)
Matthew Jenssen, Aditya Potukuchi, Will Perkins
Approximately counting independent sets in bipartite graphs via graph containers. SODA (2022)
Matthew Jenssen, Will Perkins, Aditya Potukuchi
Approximately counting independent sets in bipartite graphs via graph containers. CoRR (2021)
Ewan Davies, Matthew Jenssen, Will Perkins
A proof of the upper matching conjecture for large graphs. J. Comb. Theory, Ser. B 151 (2021)
Matthew Jenssen, Peter Keevash, Will Perkins
Algorithms for #BIS-Hard Problems on Expander Graphs. SIAM J. Comput. 49 (4) (2020)
Tyler Helmuth, Matthew Jenssen, Will Perkins
Finite-size scaling, phase coexistence, and algorithms for the random cluster model on random graphs. CoRR (2020)
Jie Han, Matthew Jenssen, Yoshiharu Kohayakawa, Guilherme Oliveira Mota, Barnaby Roberts
The multicolour size-Ramsey number of powers of paths. J. Comb. Theory, Ser. B 145 (2020)
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) (2019)
Matthew Jenssen, Peter Keevash, Will Perkins
Algorithms for #BIS-hard problems on expander graphs. SODA (2019)
Ewan Davies, Matthew Jenssen, Will Perkins, Barnaby Roberts
Tight bounds on the coefficients of partition functions via stability. J. Comb. Theory, Ser. A 160 (2018)
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) (2018)
Matthew Jenssen, Peter Keevash, Will Perkins
Algorithms for #BIS-hard problems on expander graphs. CoRR (2018)
Ewan Davies, Matthew Jenssen, Barnaby Roberts
Multicolour Ramsey numbers of paths and even cycles. Eur. J. Comb. 63 (2017)
Ewan Davies, Matthew Jenssen, Will Perkins, Barnaby Roberts
Independent sets, matchings, and occupancy fractions. J. Lond. Math. Soc. 96 (1) (2017)
Ewan Davies, Matthew Jenssen, Barnaby Roberts, Will Perkins
Tight bounds on the coefficients of partition functions via stability. Electron. Notes Discret. Math. 61 (2017)
Matthew Jenssen
The Multicolour Ramsey Number of a Long Odd Cycle. Electron. Notes Discret. Math. 49 (2015)
Matthew Jenssen, Daniel Montealegre, Vadim Ponomarenko
Irreducible Factorization Lengths and the Elasticity Problem within ℕ. Am. Math. Mon. 120 (4) (2013)