The Complexity of Colouring Problems on Dense Graphs. - Keith Edwards (Theor. Comput. Sci., 1986)

Accent specific modifications for continuous speech recognition based on a sub-word lattice approach. - Keith Edwards; Fergus R. McInnes; Mervyn A. Jack (EUROSPEECH, 1991)

The complexity of some graph colouring problems. - Keith Edwards (Discret. Appl. Math., 1992)

Spoken dialogues for human-computer interaction over the telephone: complexity measures. - Nathalie A. Vergeynst; Keith Edwards; John C. Foster; Mervyn A. Jack (EUROSPEECH, 1993)

New upper bounds on harmonious colorings. - Keith Edwards; Colin McDiarmid (J. Graph Theory, 1994)

The Harmonious Chromatic Number of Almost All Trees. - Keith Edwards (Comb. Probab. Comput., 1995)

The Complexity of Harmonious Colouring for Trees. - Keith Edwards; Colin McDiarmid (Discret. Appl. Math., 1995)

The Harmonious Chromatic Number of Bounded Degree Trees. - Keith Edwards (Comb. Probab. Comput., 1996)

On a problem concerning piles of counters. - Keith Edwards (Discret. Math., 1996)

Some results on the achromatic number. - Niall Cairnie; Keith Edwards (J. Graph Theory, 1997)

The achromatic number of bounded degree trees. - Niall Cairnie; Keith Edwards (Discret. Math., 1998)

A new upper bound for the harmonious chromatic number. - Keith Edwards (J. Graph Theory, 1998)

The harmonious chromatic number of complete r-ary trees. - Keith Edwards (Discret. Math., 1999)

The computational complexity of cordial and equitable labelling. - Niall Cairnie; Keith Edwards (Discret. Math., 2000)

An Algorithm for Finding Large Induced Planar Subgraphs. - Keith Edwards; Graham Farr (GD, 2001)

Fragmentability of Graphs. - Keith Edwards; Graham Farr (J. Comb. Theory B, 2001)

Edge decomposition of complete tripartite graphs. - Keith Edwards (Discret. Math., 2003)

A new lower bound for the harmonious chromatic number. - Duncan Campbell; Keith Edwards (Australas. J Comb., 2004)

Detachments of Complete Graphs. - Keith Edwards (Comb. Probab. Comput., 2005)

On monochromatic component size for improper colourings. - Keith Edwards; Graham Farr (Discret. Appl. Math., 2005)

On the Neighbour-Distinguishing Index of a Graph. - Keith Edwards; Mirko Hornák; Mariusz Wozniak (Graphs Comb., 2006)

Preface. - Keith Edwards (Discret. Math., 2008)

Planarization and fragmentability of some classes of graphs. - Keith Edwards; Graham Farr (Discret. Math., 2008)

Classifying Textile Designs using Region Graphs. - Wei Jia 007; Stephen J. McKenna; Annette A. Ward; Keith Edwards (BMVC, 2010)

Achromatic number of fragmentable graphs. - Keith Edwards (J. Graph Theory, 2010)

Improved Upper Bounds for Planarization and Series-Parallelization of Degree-Bounded Graphs. - Keith Edwards; Graham Farr (Electron. J. Comb., 2012)

ROCKIT: Roadmap for Conversational Interaction Technologies. - 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; et al. (RFMIR@ICMI, 2014)

A General Reduction Theorem with Applications to Pathwidth and the Complexity of MAX 2-CSP. - Keith Edwards; Eric McDermid (Algorithmica, 2015)

Complete colourings of hypergraphs. - Keith Edwards; Pawel Rzazewski (Discret. Math., 2020)