Keith Edwards - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 31 from 31

2020

Complete colourings of hypergraphsKeith Edwards, Pawel Rzazewski. DM, 343(2):111673, 2020. [doi]

2015

A General Reduction Theorem with Applications to Pathwidth and the Complexity of MAX 2-CSPKeith Edwards, Eric McDermid. algorithmica, 72(4):940-968, 2015. [doi]

2014

ROCKIT: Roadmap for Conversational Interaction TechnologiesSteve 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. icmi 2014: 39-42 [doi]

2013

PrefaceKeith Edwards. DM, 313(11):1131, 2013. [doi]

2012

Improved Upper Bounds for Planarization and Series-Parallelization of Degree-Bounded GraphsKeith Edwards, Graham Farr. combinatorics, 19(2):25, 2012. [doi]

2011

PrefaceKeith Edwards. DM, 311(13):1073, 2011. [doi]

2010

Achromatic number of fragmentable graphsKeith Edwards. jgt, 65(2):94-114, 2010. [doi]

Classifying Textile Designs using Region GraphsWei Jia, Stephen J. McKenna, Annette A. Ward, Keith Edwards. bmvc 2010: 1-10 [doi]

2008

PrefaceKeith Edwards. DM, 308(5-6):619, 2008. [doi]

2006

On the Neighbour-Distinguishing Index of a GraphKeith Edwards, Mirko Hornák, Mariusz Wozniak. gc, 22(3):341-350, 2006. [doi]

2005

Detachments of Complete GraphsKeith Edwards. cpc, 14(3):275-310, 2005. [doi]

On monochromatic component size for improper colouringsKeith Edwards, Graham Farr. DAM, 148(1):89-105, 2005. [doi]

2004

An Empirical Study of a Qualitative Systematic Approach to Requirements Analysis (QSARA)Ban Al-Ani, Keith Edwards. isese 2004: 177-186 [doi]

A new lower bound for the harmonious chromatic numberDuncan Campbell, Keith Edwards. ajc, 29:99-102, 2004. [doi]

2003

Edge decomposition of complete tripartite graphsKeith Edwards. DM, 272(2-3):269-275, 2003. [doi]

2001

Fragmentability of GraphsKeith Edwards, Graham Farr. JCT, 82(1):30-37, 2001. [doi]

An Algorithm for Finding Large Induced Planar SubgraphsKeith Edwards, Graham Farr. gd 2002: 75-83 [doi]

2000

The computational complexity of cordial and equitable labellingNiall Cairnie, Keith Edwards. DM, 216(1-3):29-34, 2000. [doi]

1999

The harmonious chromatic number of complete r-ary treesKeith Edwards. DM, 203(1-3):83-99, 1999. [doi]

1998

The achromatic number of bounded degree treesNiall Cairnie, Keith Edwards. DM, 188(1-3):87-97, 1998. [doi]

A new upper bound for the harmonious chromatic numberKeith Edwards. jgt, 29(4):257-261, 1998. [doi]

1997

Some results on the achromatic numberNiall Cairnie, Keith Edwards. jgt, 26(3):129-136, 1997. [doi]

1996

The Harmonious Chromatic Number of Bounded Degree TreesKeith Edwards. cpc, 5:15-28, 1996.

On a problem concerning piles of countersKeith Edwards. DM, 156(1-3):263-264, 1996. [doi]

1995

The Harmonious Chromatic Number of Almost All TreesKeith Edwards. cpc, 4:31-46, 1995.

The Complexity of Harmonious Colouring for TreesKeith Edwards, Colin McDiarmid. DAM, 57(2-3):133-144, 1995. [doi]

1994

New upper bounds on harmonious coloringsKeith Edwards, Colin McDiarmid. jgt, 18(3):257-267, 1994. [doi]

1993

Spoken dialogues for human-computer interaction over the telephone: complexity measuresNathalie A. Vergeynst, Keith Edwards, John C. Foster, Mervyn A. Jack. interspeech 1993: 1415-1418 [doi]

1992

The complexity of some graph colouring problemsKeith Edwards. DAM, 36(2):131-140, 1992. [doi]

1991

Accent specific modifications for continuous speech recognition based on a sub-word lattice approachKeith Edwards, Fergus R. McInnes, Mervyn A. Jack. interspeech 1991: 1195-1198 [doi]

1986

The Complexity of Colouring Problems on Dense GraphsKeith Edwards. TCS, 43:337-343, 1986.

Sign in or sign up to see more results.

runs on WebDSL