Keith Edwards

31 papers A 2Journal 26Unranked 3
YearRankTypeTitle / Venue / Authors
2020 J jnl
Complete colourings of hypergraphs.
Discret. Math.
Keith Edwards, Pawel Rzazewski
2015 J jnl
A General Reduction Theorem with Applications to Pathwidth and the Complexity of MAX 2-CSP.
Algorithmica
Keith Edwards, Eric McDermid
2014 — conf
ROCKIT: Roadmap for Conversational Interaction Technologies.
RFMIR@ICMI
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
2013 J jnl
Preface.
Discret. Math.
Keith Edwards
2012 J jnl
Improved Upper Bounds for Planarization and Series-Parallelization of Degree-Bounded Graphs.
Electron. J. Comb.
Keith Edwards, Graham Farr
2011 J jnl
Preface.
Discret. Math.
Keith Edwards
2010 J jnl
Achromatic number of fragmentable graphs.
J. Graph Theory
Keith Edwards
2010 A conf
Classifying Textile Designs using Region Graphs.
BMVC
Wei Jia, Stephen J. McKenna, Annette A. Ward, Keith Edwards
2008 J jnl
Planarization and fragmentability of some classes of graphs.
Discret. Math.
Keith Edwards, Graham Farr
2008 J jnl
Preface.
Discret. Math.
Keith Edwards
2006 J jnl
On the Neighbour-Distinguishing Index of a Graph.
Graphs Comb.
Keith Edwards, Mirko Hornák, Mariusz Wozniak
2005 J jnl
Detachments of Complete Graphs.
Comb. Probab. Comput.
Keith Edwards
2005 J jnl
On monochromatic component size for improper colourings.
Discret. Appl. Math.
Keith Edwards, Graham Farr
2004 J jnl
A new lower bound for the harmonious chromatic number.
Australas. J Comb.
Duncan Campbell, Keith Edwards
2003 J jnl
Edge decomposition of complete tripartite graphs.
Discret. Math.
Keith Edwards
2001 A conf
An Algorithm for Finding Large Induced Planar Subgraphs.
GD
Keith Edwards, Graham Farr
2001 J jnl
Fragmentability of Graphs.
J. Comb. Theory B
Keith Edwards, Graham Farr
2000 J jnl
The computational complexity of cordial and equitable labelling.
Discret. Math.
Niall Cairnie, Keith Edwards
1999 J jnl
The harmonious chromatic number of complete r-ary trees.
Discret. Math.
Keith Edwards
1998 J jnl
A new upper bound for the harmonious chromatic number.
J. Graph Theory
Keith Edwards
1998 J jnl
The achromatic number of bounded degree trees.
Discret. Math.
Niall Cairnie, Keith Edwards
1997 J jnl
Some results on the achromatic number.
J. Graph Theory
Niall Cairnie, Keith Edwards
1996 J jnl
On a problem concerning piles of counters.
Discret. Math.
Keith Edwards
1996 J jnl
The Harmonious Chromatic Number of Bounded Degree Trees.
Comb. Probab. Comput.
Keith Edwards
1995 J jnl
The Complexity of Harmonious Colouring for Trees.
Discret. Appl. Math.
Keith Edwards, Colin McDiarmid
1995 J jnl
The Harmonious Chromatic Number of Almost All Trees.
Comb. Probab. Comput.
Keith Edwards
1994 J jnl
New upper bounds on harmonious colorings.
J. Graph Theory
Keith Edwards, Colin McDiarmid
1993 — conf
Spoken dialogues for human-computer interaction over the telephone: complexity measures.
EUROSPEECH
Nathalie A. Vergeynst, Keith Edwards, John C. Foster, Mervyn A. Jack
1992 J jnl
The complexity of some graph colouring problems.
Discret. Appl. Math.
Keith Edwards
1991 — conf
Accent specific modifications for continuous speech recognition based on a sub-word lattice approach.
EUROSPEECH
Keith Edwards, Fergus R. McInnes, Mervyn A. Jack
1986 J jnl
The Complexity of Colouring Problems on Dense Graphs.
Theor. Comput. Sci.
Keith Edwards