( en | de | ru )

 

Disambiguation of "Jenssen, Matthew"

Author of the publication

copydeleteadd this publication to your clipboard
Approximately counting independent sets in bipartite graphs via graph containers.

, , and . Random Struct. Algorithms, 63 (1): 215-241 (August 2023)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Horst Jenssen

Bruno Jenssen

Siegfried Jenssen

Christian Jenssen

Walter Jenssen

 

Other publications of authors with the same name

Independent sets of a given size and structure in the hypercube., , and . Comb. Probab. Comput., 31 (4): 702-720 (2022)The singularity probability of a random symmetric matrix is exponentially small, , , and . (2021)cite arxiv:2105.11384Comment: 48 pages.Independent sets, matchings, and occupancy fractions., , , and . J. Lond. Math. Soc., 96 (1): 47-66 (2017)The size?Ramsey number of powers of paths., , , , , , and . J. Graph Theory, 91 (3): 290-299 (2019)Approximately counting independent sets in bipartite graphs via graph containers., , and . CoRR, (2021)Algorithms for #BIS-hard problems on expander graphs., , and . SODA, page 2235-2247. SIAM, (2019)Quasipolynomial-time algorithms for Gibbs point processes., , and . Comb. Probab. Comput., 33 (1): 1-15 (January 2024)The multicolour size-Ramsey number of powers of paths., , , , and . J. Comb. Theory, Ser. B, (2020)Approximately counting independent sets in bipartite graphs via graph containers., , and . Random Struct. Algorithms, 63 (1): 215-241 (August 2023)Tight bounds on the coefficients of partition functions via stability., , , and . J. Comb. Theory, Ser. A, (2018)