default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEwan Davies
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j15]Charlie Carlson, Ewan Davies, Nicolas Fraiman, Alexandra Kolla, Aditya Potukuchi, Corrine Yap:
Algorithms for the ferromagnetic Potts model on expanders. Comb. Probab. Comput. 33(4): 487-517 (2024)- [j14]Stijn Cambie, Wouter Cames van Batenburg, Ewan Davies, Ross J. Kang:
List packing number of bounded degree graphs. Comb. Probab. Comput. 33(6): 807-828 (2024) - [j13]Stijn Cambie
, Wouter Cames van Batenburg, Ewan Davies, Ross J. Kang:
Packing list-colorings. Random Struct. Algorithms 64(1): 62-93 (2024) - [c6]Charlie Carlson, Ewan Davies, Alexandra Kolla, Aditya Potukuchi:
A Spectral Approach to Approximately Counting Independent Sets in Dense Bipartite Graphs. ICALP 2024: 35:1-35:18 - [i12]Evan Camrud, Ewan Davies, Alex Karduna, Holden Lee:
Sampling List Packings. CoRR abs/2402.03520 (2024) - 2023
- [j12]Ewan Davies, Will Perkins:
Approximately Counting Independent Sets of a Given Size in Bounded-Degree Graphs. SIAM J. Comput. 52(2): 618-640 (2023) - [i11]Charlie Carlson, Ewan Davies, Alexandra Kolla, Aditya Potukuchi:
Approximately counting independent sets in dense bipartite graphs via subspace enumeration. CoRR abs/2307.09533 (2023) - 2022
- [j11]Ewan Davies, Freddie Illingworth:
The $\chi$-Ramsey Problem for Triangle-Free Graphs. SIAM J. Discret. Math. 36(2): 1124-1134 (2022) - [c5]Charlie Carlson, Ewan Davies, Nicolas Fraiman, Alexandra Kolla, Aditya Potukuchi, Corrine Yap:
Algorithms for the ferromagnetic Potts model on expanders. FOCS 2022: 344-355 - [c4]Charlie Carlson, Ewan Davies, Alexandra Kolla, Will Perkins:
Computational thresholds for the fixed-magnetization Ising model. STOC 2022: 1459-1472 - [i10]Charlie Carlson, Ewan Davies, Nicolas Fraiman, Alexandra Kolla, Aditya Potukuchi, Corrine Yap:
Algorithms for the ferromagnetic Potts model on expanders. CoRR abs/2204.01923 (2022) - 2021
- [j10]Ewan Davies, Matthew Jenssen, Will Perkins:
A proof of the upper matching conjecture for large graphs. J. Comb. Theory B 151: 393-416 (2021) - [j9]Ewan Davies, Rémi de Joannis de Verclos, Ross J. Kang, François Pirot:
Occupancy fraction, fractional colouring, and triangle fraction. J. Graph Theory 97(4): 557-568 (2021) - [c3]Ewan Davies, Will Perkins:
Approximately Counting Independent Sets of a Given Size in Bounded-Degree Graphs. ICALP 2021: 62:1-62:18 - [c2]Peter Allen, Julia Böttcher, Eng Keat Hng, Jozef Skokan, Ewan Davies:
An Approximate Blow-up Lemma for Sparse Hypergraphs. LAGOS 2021: 394-403 - [i9]Ewan Davies, Will Perkins:
Approximately counting independent sets of a given size in bounded-degree graphs. CoRR abs/2102.04984 (2021) - [i8]Stijn Cambie, Wouter Cames van Batenburg, Ewan Davies, Ross J. Kang:
Packing list-colourings. CoRR abs/2110.05230 (2021) - [i7]Charlie Carlson, Ewan Davies, Alexandra Kolla, Will Perkins:
Computational thresholds for the fixed-magnetization Ising model. CoRR abs/2111.03033 (2021) - 2020
- [j8]Ewan Davies, Rémi de Joannis de Verclos, Ross J. Kang, François Pirot:
Coloring triangle-free graphs with local list sizes. Random Struct. Algorithms 57(3): 730-744 (2020) - [c1]Matthew Coulson, Ewan Davies, Alexandra Kolla, Viresh Patel, Guus Regts:
Statistical Physics Approaches to Unique Games. CCC 2020: 13:1-13:27 - [i6]Charles Carlson, Ewan Davies, Alexandra Kolla:
Efficient algorithms for the Potts model on small-set expanders. CoRR abs/2003.01154 (2020) - [i5]Ewan Davies, Ross J. Kang, François Pirot, Jean-Sébastien Sereni:
An algorithmic framework for colouring locally sparse graphs. CoRR abs/2004.07151 (2020)
2010 – 2019
- 2019
- [i4]Matthew Coulson, Ewan Davies, Alexandra Kolla, Viresh Patel, Guus Regts:
Statistical physics approaches to Unique Games. CoRR abs/1911.01504 (2019) - 2018
- [j7]Ewan Davies:
Counting Proper Colourings in 4-Regular Graphs via the Potts Model. Electron. J. Comb. 25(4): 4 (2018) - [j6]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) - [j5]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) - [i3]Ewan Davies, Rémi de Joannis de Verclos, Ross J. Kang, François Pirot:
Colouring triangle-free graphs with local list sizes. CoRR abs/1812.01534 (2018) - [i2]Ferenc Bencs, Ewan Davies, Viresh Patel, Guus Regts:
On zero-free regions for the anti-ferromagnetic Potts model on bounded-degree graphs. CoRR abs/1812.07532 (2018) - [i1]Ewan Davies, Rémi de Joannis de Verclos, Ross J. Kang, François Pirot:
Occupancy fraction, fractional colouring, and triangle fraction. CoRR abs/1812.11152 (2018) - 2017
- [j4]Ewan Davies, Matthew Jenssen, Barnaby Roberts:
Multicolour Ramsey numbers of paths and even cycles. Eur. J. Comb. 63: 124-133 (2017) - [j3]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) - [j2]Ewan Davies, Matthew Jenssen, Will Perkins, Barnaby Roberts:
Independent sets, matchings, and occupancy fractions. J. Lond. Math. Soc. 96(1): 47-66 (2017) - 2015
- [j1]Ewan Davies:
Counting in hypergraphs via regularity inheritance. Electron. Notes Discret. Math. 49: 413-417 (2015)
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-12-10 21:46 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:
