Tom Kelly

ORCID

Publication Activity (10 Years)

Years Active: 1986-2024
Publications (10 Years): 44

Top Venues

CoRR

J. Comb. Theory, Ser. B

Comput. Graph. Forum

J. Graph Theory

University of Glasgow, UK (PHD)

Education History

University of Glasgow, UK

PHD

Publications

Yiangos Georgiou, Marios Loizou, Tom Kelly, Melinos Averkiou
FacadeNet: Conditional Facade Synthesis via Selective Editing. WACV (2024)
Yiangos Georgiou, Marios Loizou, Tom Kelly, Melinos Averkiou
FacadeNet: Conditional Facade Synthesis via Selective Editing. CoRR (2023)
Tom Kelly, Luke Postle
On the Density of Critical Graphs with No Large Cliques. Comb. 43 (1) (2023)
Stephen Gould, Tom Kelly
Hamilton transversals in random Latin squares. Random Struct. Algorithms 62 (2) (2023)
Tom Kelly, Sid Kolichala, Caleb McFarland, Jatong Su
The independence ratio of 4-cycle-free planar graphs. CoRR (2023)
Tom Kelly, John Femiani, Peter Wonka
WinSyn: A High Resolution Testbed for Synthetic Data. CoRR (2023)
Yiangos Georgiou, Melinos Averkiou, Tom Kelly, Evangelos Kalogerakis
Projective Urban Texturing. CoRR (2022)
Ross J. Kang, Tom Kelly
Colorings, transversals, and local sparsity. Random Struct. Algorithms 61 (1) (2022)
Marthe Bonamy, Tom Kelly, Peter Nelson, Luke Postle
by a fraction of Δ for graphs without large cliques. J. Comb. Theory, Ser. B 157 (2022)
Michael Birsak, Tom Kelly, Wamiq Para, Peter Wonka
Large-Scale Auto-Regressive Modeling Of Street Networks. CoRR (2022)
Dong Yeap Kang, Tom Kelly, Daniela Kühn, Abhishek Methuku, Deryk Osthus
A proof of the Erdös-Faber-Lovász conjecture: Algorithmic aspects. FOCS (2022)
Stephen Gould, Tom Kelly, Daniela Kühn, Deryk Osthus
Almost all optimally coloured complete graphs contain a rainbow Hamilton path. J. Comb. Theory, Ser. B 156 (2022)
Yiangos Georgiou, Melinos Averkiou, Tom Kelly, Evangelos Kalogerakis
Projective Urban Texturing. 3DV (2021)
Wamiq Para, Paul Guerrero, Tom Kelly, Leonidas J. Guibas, Peter Wonka
Generative Layout Modeling using Constraint Graphs. ICCV (2021)
Gemma Gordon, Amelia Holcomb, Tom Kelly, Srinivasan Keshav, Jon Ludlum, Anil Madhavapeddy
How Computer Science Can Aid Forest Restoration. CoRR (2021)
K. C. Sivaramakrishnan, Stephen Dolan, Leo White, Tom Kelly, Sadiq Jaffer, Anil Madhavapeddy
Retrofitting Effect Handlers onto OCaml. CoRR (2021)
Tom Kelly, Daniela Kühn, Deryk Osthus
A special case of Vu's conjecture: Coloring nearly disjoint graphs of bounded maximum degree. CoRR (2021)
Dong Yeap Kang, Tom Kelly, Daniela Kühn, Abhishek Methuku, Deryk Osthus
Graph and hypergraph colouring via nibble methods: A survey. CoRR (2021)
Wamiq Reyaz Para, Shariq Farooq Bhat, Paul Guerrero, Tom Kelly, Niloy J. Mitra, Leonidas J. Guibas, Peter Wonka
SketchGen: Generating Constrained CAD Sketches. CoRR (2021)
Jialin Zhu, Tom Kelly
Seamless Satellite-image Synthesis. CoRR (2021)
K. C. Sivaramakrishnan, Stephen Dolan, Leo White, Tom Kelly, Sadiq Jaffer, Anil Madhavapeddy
Retrofitting effect handlers onto OCaml. PLDI (2021)
Dong Yeap Kang, Tom Kelly, Daniela Kühn, Abhishek Methuku, Deryk Osthus
A proof of the Erdös-Faber-Lovász conjecture: Algorithmic aspects. FOCS (2021)
Wamiq Reyaz Para, Shariq Farooq Bhat, Paul Guerrero, Tom Kelly, Niloy J. Mitra, Leonidas J. Guibas, Peter Wonka
SketchGen: Generating Constrained CAD Sketches. NeurIPS (2021)
Jialin Zhu, Tom Kelly
Seamless Satellite-image Synthesis. Comput. Graph. Forum 40 (7) (2021)
Tom Kelly, Luke Postle
Corrigendum to "A local epsilon version of Reed's Conjecture" [J. Combin. Theory Ser. B 141 (2020) 181-222]. J. Comb. Theory, Ser. B 151 (2021)
K. C. Sivaramakrishnan, Stephen Dolan, Leo White, Sadiq Jaffer, Tom Kelly, Anmol Sahoo, Sudha Parimala, Atul Dhiman, Anil Madhavapeddy
Retrofitting parallelism onto OCaml. Proc. ACM Program. Lang. 4 (ICFP) (2020)
Wamiq Reyaz Para, Paul Guerrero, Tom Kelly, Leonidas J. Guibas, Peter Wonka
Generative Layout Modeling using Constraint Graphs. CoRR (2020)
K. C. Sivaramakrishnan, Stephen Dolan, Leo White, Sadiq Jaffer, Tom Kelly, Anmol Sahoo, Sudha Parimala, Atul Dhiman, Anil Madhavapeddy
Retrofitting Parallelism onto OCaml. CoRR (2020)
Tom Kelly, Luke Postle
A local epsilon version of Reed's Conjecture. J. Comb. Theory, Ser. B 141 (2020)
Tom Kelly, Luke Postle
On the density of critical graphs with no large cliques. CoRR (2019)
Tom Kelly, Luke Postle
A local epsilon version of Reed's Conjecture. CoRR (2019)
Zdenek Dvorák, Tom Kelly
Induced 2-Degenerate Subgraphs of Triangle-Free Planar Graphs. Electron. J. Comb. 25 (1) (2018)
Tom Kelly, Paul Guerrero, Anthony Steed, Peter Wonka, Niloy J. Mitra
FrankenGAN: Guided Detail Synthesis for Building Mass-Models Using Style-Synchonized GANs. CoRR (2018)
Tom Kelly, Chun-Hung Liu
Size of the largest induced forest in subcubic graphs of girth at least four and five. J. Graph Theory 89 (4) (2018)
Tom Kelly, Luke Postle
Fractional coloring with local demands. CoRR (2018)
Tom Kelly, Paul Guerrero, Anthony Steed, Peter Wonka, Niloy J. Mitra
FrankenGAN: guided detail synthesis for building mass models using style-synchonized GANs. ACM Trans. Graph. 37 (6) (2018)
Tom Kelly, Luke Postle
Exponentially many 4-list-colorings of triangle-free graphs on surfaces. J. Graph Theory 87 (2) (2018)
Tom Kelly, Niloy J. Mitra
Simplifying Urban Data Fusion with BigSUR. CoRR (2018)
Tom Kelly, John Femiani, Peter Wonka, Niloy J. Mitra
BigSUR: large-scale structured urban reconstruction. ACM Trans. Graph. 36 (6) (2017)
Jan Benes, Tom Kelly, Filip Dechterenko, Jaroslav Krivánek, Pascal Müller
On Realism of Architectural Procedural Models. Comput. Graph. Forum 36 (2) (2017)
Zdenek Dvorák, Tom Kelly
Induced 2-degenerate Subgraphs of Triangle-free Planar Graphs. CoRR (2017)
Tom Kelly, Chun-Hung Liu
Minimum size of feedback vertex sets of planar graphs of girth at least five. Eur. J. Comb. 61 (2017)
Tom Kelly, Luke Postle
A Local Epsilon Version of Reed's Conjecture. Electron. Notes Discret. Math. 61 (2017)
Tom Kelly, Peter Wonka, Pascal Müller
Interactive Dimensioning of Parametric Models. Comput. Graph. Forum 34 (2) (2015)
Carlos A. Vanegas, Tom Kelly, Basil Weber, Jan Halatsch, Daniel G. Aliaga, Pascal Müller
Procedural Generation of Parcels in Urban Modeling. Comput. Graph. Forum 31 (2pt3) (2012)
Tom Kelly, Peter Wonka
Interactive architectural modeling with procedural extrusions. ACM Trans. Graph. 30 (2) (2011)
Tom Kelly
Scalable TCP: improving performance in highspeed wide area networks. Comput. Commun. Rev. 33 (2) (2003)
Tom Kelly
An ECN probe-based connection acceptance control. Comput. Commun. Rev. 31 (3) (2001)
Earl Dalton, Walter Ahern, Stephen Denker, Ken Sweitzer, Bill Cooper, Tom Kelly, Stan Smith
Systematic Yield Improvement in Board Testing Practice. ITC (1986)

Tom Kelly.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Tom Kelly