Keith Edwards

According to our database1, Keith Edwards authored at least 29 papers between 1986 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2020
Complete colourings of hypergraphs.
Discret. Math., 2020

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

2014
ROCKIT: Roadmap for Conversational Interaction Technologies.
Proceedings of the 2014 Workshop on Roadmapping the Future of Multimodal Interaction Research including Business Opportunities and Challenges, 2014

2012
Improved Upper Bounds for Planarization and Series-Parallelization of Degree-Bounded Graphs.
Electron. J. Comb., 2012

2010
Achromatic number of fragmentable graphs.
J. Graph Theory, 2010

Classifying Textile Designs using Region Graphs.
Proceedings of the British Machine Vision Conference, 2010

2008
Planarization and fragmentability of some classes of graphs.
Discret. Math., 2008

Preface.
Discret. Math., 2008

2006
On the Neighbour-Distinguishing Index of a Graph.
Graphs Comb., 2006

2005
On monochromatic component size for improper colourings.
Discret. Appl. Math., 2005

Detachments of Complete Graphs.
Comb. Probab. Comput., 2005

2004
A new lower bound for the harmonious chromatic number.
Australas. J Comb., 2004

2003
Edge decomposition of complete tripartite graphs.
Discret. Math., 2003

2001
Fragmentability of Graphs.
J. Comb. Theory B, 2001

An Algorithm for Finding Large Induced Planar Subgraphs.
Proceedings of the Graph Drawing, 9th International Symposium, 2001

2000
The computational complexity of cordial and equitable labelling.
Discret. Math., 2000

1999
The harmonious chromatic number of complete r-ary trees.
Discret. Math., 1999

1998
A new upper bound for the harmonious chromatic number.
J. Graph Theory, 1998

The achromatic number of bounded degree trees.
Discret. Math., 1998

1997
Some results on the achromatic number.
J. Graph Theory, 1997

1996
On a problem concerning piles of counters.
Discret. Math., 1996

The Harmonious Chromatic Number of Bounded Degree Trees.
Comb. Probab. Comput., 1996

1995
The Complexity of Harmonious Colouring for Trees.
Discret. Appl. Math., 1995

The Harmonious Chromatic Number of Almost All Trees.
Comb. Probab. Comput., 1995

1994
New upper bounds on harmonious colorings.
J. Graph Theory, 1994

1993
Spoken dialogues for human-computer interaction over the telephone: complexity measures.
Proceedings of the Third European Conference on Speech Communication and Technology, 1993

1992
The complexity of some graph colouring problems.
Discret. Appl. Math., 1992

1991
Accent specific modifications for continuous speech recognition based on a sub-word lattice approach.
Proceedings of the Second European Conference on Speech Communication and Technology, 1991

1986
The Complexity of Colouring Problems on Dense Graphs.
Theor. Comput. Sci., 1986


  Loading...