E-LIB Suche - Ergebnisse für: Davies, Ewan

1

A robust Corrádi–Hajnal theorem:

Allen, Peter ; Böttcher, Julia ; Corsten, Jan...
Random Structures & Algorithms. 65 (2024) 1 - p. 61-130 , 2024

Link: https://doi.org/10.1002/..

2

Algorithms for the ferromagnetic Potts model on expanders:

Carlson, Charlie ; Davies, Ewan ; Fraiman, Nicolas...
Combinatorics, Probability and Computing. , 2024

Link: https://doi.org/10.1017/..

3

Detecting trends and shocks in terrorist activities:

Prieto-Curiel, Rafael ; Walther, Olivier ; Davies, Ewan.
PLOS ONE. 18 (2023) 9 - p. e0291514 , 2023

Link: https://doi.org/10.1371/..

4

Packing list‐colorings:

Cambie, Stijn ; Cames van Batenburg, Wouter ; Davies, Ewan.
Random Structures & Algorithms. 64 (2023) 1 - p. 62-93 , 2023

Link: https://doi.org/10.1002/..

5

Approximately Counting Independent Sets of a Given Size in ..:

Davies, Ewan ; Perkins, Will
SIAM Journal on Computing. 52 (2023) 2 - p. 618-640 , 2023

Link: https://doi.org/10.1137/..

6

The $\chi$-Ramsey Problem for Triangle-Free Graphs:

Davies, Ewan ; Illingworth, Freddie
SIAM Journal on Discrete Mathematics. 36 (2022) 2 - p. 1124-1134 , 2022

Link: https://doi.org/10.1137/..

7

Algorithms for the ferromagnetic Potts model on expanders:

, In: 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS),

Carlson, Charlie ; Davies, Ewan ; Fraiman, Nicolas... - p. 344-355 , 2022

Link: https://doi.org/10.1109/..

8

Computational thresholds for the fixed-magnetization Ising ..:

, In: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing,

Carlson, Charlie ; Davies, Ewan ; Kolla, Alexandra. - p. 1459-1472 , 2022

Link: https://dl.acm.org/doi/1..

9

A proof of the upper matching conjecture for large graphs:

Davies, Ewan ; Jenssen, Matthew ; Perkins, Will
Journal of Combinatorial Theory, Series B. 151 (2021) - p. 393-416 , 2021

Link: https://doi.org/10.1016/..

10

Occupancy fraction, fractional colouring, and triangle frac..:

Davies, Ewan ; de Joannis de Verclos, Rémi ; Kang, Ross J..
Journal of Graph Theory. 97 (2021) 4 - p. 557-568 , 2021

Link: https://doi.org/10.1002/..

11

An Approximate Blow-up Lemma for Sparse Hypergraphs:

Allen, Peter ; Böttcher, Julia ; Hng, Eng Keat..
Procedia Computer Science. 195 (2021) - p. 394-403 , 2021

Link: https://doi.org/10.1016/..

12

On zero-free regions for the anti-ferromagnetic Potts model..:

Bencs, Ferenc ; Davies, Ewan ; Patel, Viresh.
Annales de l'Institut Henri Poincaré D. 8 (2021) 3 - p. 459-489 , 2021

Link: https://doi.org/10.4171/..

13

Coloring triangle‐free graphs with local list sizes:

Davies, Ewan ; de Joannis de Verclos, Rémi ; Kang, Ross J..
Random Structures & Algorithms. 57 (2020) 3 - p. 730-744 , 2020

Link: https://doi.org/10.1002/..

14

Statistical physics approaches to unique games:

, In: Proceedings of the 35th Computational Complexity Conference,

Coulson, Matthew ; Davies, Ewan ; Kolla, Alexandra.. - p. 1-27 , 2020

Link: https://dl.acm.org/doi/1..

15

ON THE AVERAGE SIZE OF INDEPENDENT SETS IN TRIANGLE-FREE GR..:

DAVIES, EWAN ; JENSSEN, MATTHEW ; PERKINS, WILL.
Proceedings of the American Mathematical Society. 146 (2018) 1 - p. 111-124 , 2018

Link: https://www.jstor.org/st..