Keith Edwards

Publication Activity (10 Years)

Years Active: 1986-2020
Publications (10 Years): 1

Top Topics

Generalization Error

Top Venues

Electron. J. Comb.

Publications

Keith Edwards, Pawel Rzazewski
Complete colourings of hypergraphs. Discret. Math. 343 (2) (2020)
Keith Edwards, Eric McDermid
A General Reduction Theorem with Applications to Pathwidth and the Complexity of MAX 2-CSP. Algorithmica 72 (4) (2015)
Steve Renals, Jean Carletta, Keith Edwards, Hervé Bourlard, Philip N. Garner, Andrei Popescu-Belis, Dietrich Klakow, Andrey Girenko, Volha Petukhova, Philippe Wacker, Andrew Joscelyne, Costis Kompis, Simon Aliwell, William Stevens, Youssef Sabbah
ROCKIT: Roadmap for Conversational Interaction Technologies. RFMIR@ICMI (2014)
Keith Edwards
Preface. Discret. Math. 313 (11) (2013)
Keith Edwards, Graham Farr
Improved Upper Bounds for Planarization and Series-Parallelization of Degree-Bounded Graphs. Electron. J. Comb. 19 (2) (2012)
Keith Edwards
Preface. Discret. Math. 311 (13) (2011)
Wei Jia, Stephen J. McKenna, Annette A. Ward, Keith Edwards
Classifying Textile Designs using Region Graphs. BMVC (2010)
Keith Edwards
Achromatic number of fragmentable graphs. J. Graph Theory 65 (2) (2010)
Keith Edwards, Graham Farr
Planarization and fragmentability of some classes of graphs. Discret. Math. 308 (12) (2008)
Keith Edwards
Preface. Discret. Math. 308 (5-6) (2008)
Keith Edwards, Mirko Hornák, Mariusz Wozniak
On the Neighbour-Distinguishing Index of a Graph. Graphs Comb. 22 (3) (2006)
Keith Edwards
Detachments of Complete Graphs. Comb. Probab. Comput. 14 (3) (2005)
Keith Edwards, Graham Farr
On monochromatic component size for improper colourings. Discret. Appl. Math. 148 (1) (2005)
Duncan Campbell, Keith Edwards
A new lower bound for the harmonious chromatic number. Australas. J Comb. 29 (2004)
Keith Edwards
Edge decomposition of complete tripartite graphs. Discret. Math. 272 (2-3) (2003)
Keith Edwards, Graham Farr
Fragmentability of Graphs. J. Comb. Theory, Ser. B 82 (1) (2001)
Keith Edwards, Graham Farr
An Algorithm for Finding Large Induced Planar Subgraphs. Graph Drawing (2001)
Niall Cairnie, Keith Edwards
The computational complexity of cordial and equitable labelling. Discret. Math. 216 (1-3) (2000)
Keith Edwards
The harmonious chromatic number of complete r-ary trees. Discret. Math. 203 (1-3) (1999)
Keith Edwards
A new upper bound for the harmonious chromatic number. J. Graph Theory 29 (4) (1998)
Niall Cairnie, Keith Edwards
The achromatic number of bounded degree trees. Discret. Math. 188 (1-3) (1998)
Niall Cairnie, Keith Edwards
Some results on the achromatic number. J. Graph Theory 26 (3) (1997)
Keith Edwards
The Harmonious Chromatic Number of Bounded Degree Trees. Comb. Probab. Comput. 5 (1996)
Keith Edwards
On a problem concerning piles of counters. Discret. Math. 156 (1-3) (1996)
Keith Edwards, Colin McDiarmid
The Complexity of Harmonious Colouring for Trees. Discret. Appl. Math. 57 (2-3) (1995)
Keith Edwards
The Harmonious Chromatic Number of Almost All Trees. Comb. Probab. Comput. 4 (1995)
Keith Edwards, Colin McDiarmid
New upper bounds on harmonious colorings. J. Graph Theory 18 (3) (1994)
Nathalie A. Vergeynst, Keith Edwards, John C. Foster, Mervyn A. Jack
Spoken dialogues for human-computer interaction over the telephone: complexity measures. EUROSPEECH (1993)
Keith Edwards
The complexity of some graph colouring problems. Discret. Appl. Math. 36 (2) (1992)
Keith Edwards, Fergus R. McInnes, Mervyn A. Jack
Accent specific modifications for continuous speech recognition based on a sub-word lattice approach. EUROSPEECH (1991)
Keith Edwards
The Complexity of Colouring Problems on Dense Graphs. Theor. Comput. Sci. 43 (1986)