61 citations · 158 across the 23 of their papers we have counts for
5 papers · 1 filter
Fractional coloring with local demands and applications to degree-sequence bounds on the independence number
Tom Kelly, Luke Postle
In a fractional coloring, vertices of a graph are assigned measurable subsets of the real line and adjacent vertices receive disjoint subsets; the fractional chromatic number of a…
Simplifying Urban Data Fusion with BigSUR
Tom Kelly, Niloy J. Mitra
Our ability to understand data has always lagged behind our ability to collect it. This is particularly true in urban environments, where mass data capture is particularly valuable…
FrankenGAN: Guided Detail Synthesis for Building Mass-Models Using Style-Synchonized GANs
Tom Kelly, Paul Guerrero, Anthony Steed +2
Coarse building mass models are now routinely generated at scales ranging from individual buildings through to whole cities. For example, they can be abstracted from raw measuremen…
The structure of binary matroids with no induced claw or Fano plane restriction
Marthe Bonamy, Frantisek Kardos, Tom Kelly +2
An 'induced restriction' of a simple binary matroid is a restriction , where is a flat of . We consider the class of all simple binary matroids co…
Bounding by a fraction of for graphs without large cliques
Marthe Bonamy, Tom Kelly, Peter Nelson +1
The greedy coloring algorithm shows that a graph of maximum degree at most has chromatic number at most , and this is tight for cliques. Much attention has been devoted t…