Keith Edwards

发表

Detachments of Complete Graphs

Keith Edwards, 2005, Comb. Probab. Comput..

The Harmonious Chromatic Number of Bounded Degree Trees

Keith Edwards, Keith J. Edwards, 1996, Combinatorics, Probability and Computing.

The harmonious chromatic number of complete r-ary trees

Keith Edwards, 1999, Discret. Math..

Planarization and fragmentability of some classes of graphs

Graham Farr, Keith Edwards, 2008, Discret. Math..

Smart homes or homes that smart?

Beki Grinter, Keith Edwards, Gregory Abowd, 2003, CHIB.

The Complexity of Harmonious Colouring for Trees

Colin McDiarmid, Keith Edwards, 1995, Discret. Appl. Math..

A General Reduction Theorem with Applications to Pathwidth and the Complexity of MAX 2-CSP

Eric McDermid, Keith Edwards, Keith J. Edwards, 2015, Algorithmica.

The Complexity of Colouring Problems on Dense Graphs

Keith Edwards, Keith J. Edwards, 1986, Theor. Comput. Sci..

New upper bounds on harmonious colorings

Colin McDiarmid, Keith Edwards, 1994, J. Graph Theory.

An Algorithm for Finding Large Induced Planar Subgraphs

Graham Farr, Keith Edwards, 2001, Graph Drawing.

Trial Applications of Voice Processing in Automated Telephone Banking Services. Deliverable 3: Trial Application Software

Paul Dalsgaard, Keith Edwards, Lars Bo Larsen, 1997 .

Preface

Keith Edwards, 2011, Discret. Math..

Achromatic number of fragmentable graphs

Keith Edwards, 2010, J. Graph Theory.

Accent specific modifications for continuous speech recognition based on a sub-word lattice approach

Mervyn A. Jack, Keith Edwards, Fergus R. McInnes, 1991, EUROSPEECH.

The complexity of some graph colouring problems

Keith Edwards, Keith J. Edwards, 1992, Discrete Applied Mathematics.

Preface

Keith Edwards, 2008, Discret. Math..

Improved Upper Bounds for Planarization and Series-Parallelization of Degree-Bounded Graphs

Graham Farr, Keith Edwards, G. Farr, 2012, Electron. J. Comb..

On the Neighbour-Distinguishing Index of a Graph

Keith Edwards, Mirko Hornák, Mariusz Wozniak, 2006, Graphs Comb..

Preface

Keith Edwards, 2013, Discret. Math..

The computational complexity of cordial and equitable labelling

Keith Edwards, Niall Cairnie, 2000, Discret. Math..

A new lower bound for the harmonious chromatic number

Keith Edwards, 1998, Australas. J Comb..

ROCKIT: Roadmap for Conversational Interaction Technologies

Jean Carletta, Dietrich Klakow, Hervé Bourlard, 2014, RFMIR '14.

On monochromatic component size for improper colourings

Graham Farr, Keith Edwards, 2005, Discret. Appl. Math..

On a problem concerning piles of counters

Keith Edwards, 1996, Discret. Math..

The Harmonious Chromatic Number of Almost All Trees

Keith Edwards, 1995, Comb. Probab. Comput..

Fragmentability of Graphs

Graham Farr, Keith Edwards, G. Farr, 2001, J. Comb. Theory, Ser. B.

Spoken dialogues for human-computer interaction over the telephone: complexity measures

John C. Foster, Mervyn A. Jack, Keith Edwards, 1993, EUROSPEECH.

Edge decomposition of complete tripartite graphs

Keith Edwards, 2003, Discret. Math..

Some results on the achromatic number

Keith Edwards, Niall Cairnie, 1997, J. Graph Theory.

The achromatic number of bounded degree trees

Keith Edwards, Niall Cairnie, 1998, Discret. Math..

Classifying Textile Designs using Region Graphs

Stephen J. McKenna, Keith Edwards, Wei Jia, 2010, BMVC.

A new upper bound for the harmonious chromatic number

Keith Edwards, 1998 .

Some results on the achromatic number

Keith Edwards, Niall Cairnie, Keith J. Edwards, 1997 .

The Harmonious Chromatic Number of Bounded Degree Graphs

Keith Edwards, Keith J. Edwards, 1997 .

The harmonious chromatic number and the achromatic number

Keith Edwards, Keith J. Edwards, 1997 .