default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKeith Edwards
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j26]Keith Edwards, Pawel Rzazewski
:
Complete colourings of hypergraphs. Discret. Math. 343(2): 111673 (2020)
2010 – 2019
- 2015
- [j25]Keith Edwards, Eric McDermid:
A General Reduction Theorem with Applications to Pathwidth and the Complexity of MAX 2-CSP. Algorithmica 72(4): 940-968 (2015) - 2014
- [c5]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:
ROCKIT: Roadmap for Conversational Interaction Technologies. RFMIR@ICMI 2014: 39-42 - 2013
- [j24]Keith Edwards:
Preface. Discret. Math. 313(11): 1131 (2013) - 2012
- [j23]Keith Edwards, Graham Farr:
Improved Upper Bounds for Planarization and Series-Parallelization of Degree-Bounded Graphs. Electron. J. Comb. 19(2): 25 (2012) - 2011
- [j22]Keith Edwards:
Preface. Discret. Math. 311(13): 1073 (2011) - 2010
- [j21]Keith Edwards:
Achromatic number of fragmentable graphs. J. Graph Theory 65(2): 94-114 (2010) - [c4]Wei Jia, Stephen J. McKenna, Annette A. Ward, Keith Edwards:
Classifying Textile Designs using Region Graphs. BMVC 2010: 1-10
2000 – 2009
- 2008
- [j20]Keith Edwards:
Preface. Discret. Math. 308(5-6): 619 (2008) - [j19]Keith Edwards, Graham Farr:
Planarization and fragmentability of some classes of graphs. Discret. Math. 308(12): 2396-2406 (2008) - 2006
- [j18]Keith Edwards, Mirko Hornák, Mariusz Wozniak:
On the Neighbour-Distinguishing Index of a Graph. Graphs Comb. 22(3): 341-350 (2006) - 2005
- [j17]Keith Edwards:
Detachments of Complete Graphs. Comb. Probab. Comput. 14(3): 275-310 (2005) - [j16]Keith Edwards, Graham Farr:
On monochromatic component size for improper colourings. Discret. Appl. Math. 148(1): 89-105 (2005) - 2004
- [j15]Duncan Campbell, Keith Edwards:
A new lower bound for the harmonious chromatic number. Australas. J Comb. 29: 99-102 (2004) - 2003
- [j14]Keith Edwards:
Edge decomposition of complete tripartite graphs. Discret. Math. 272(2-3): 269-275 (2003) - 2001
- [j13]Keith Edwards, Graham Farr:
Fragmentability of Graphs. J. Comb. Theory B 82(1): 30-37 (2001) - [c3]Keith Edwards, Graham Farr:
An Algorithm for Finding Large Induced Planar Subgraphs. GD 2001: 75-83 - 2000
- [j12]Niall Cairnie, Keith Edwards:
The computational complexity of cordial and equitable labelling. Discret. Math. 216(1-3): 29-34 (2000)
1990 – 1999
- 1999
- [j11]Keith Edwards:
The harmonious chromatic number of complete r-ary trees. Discret. Math. 203(1-3): 83-99 (1999) - 1998
- [j10]Niall Cairnie, Keith Edwards:
The achromatic number of bounded degree trees. Discret. Math. 188(1-3): 87-97 (1998) - [j9]Keith Edwards:
A new upper bound for the harmonious chromatic number. J. Graph Theory 29(4): 257-261 (1998) - 1997
- [j8]Niall Cairnie, Keith Edwards:
Some results on the achromatic number. J. Graph Theory 26(3): 129-136 (1997) - 1996
- [j7]Keith Edwards:
The Harmonious Chromatic Number of Bounded Degree Trees. Comb. Probab. Comput. 5: 15-28 (1996) - [j6]Keith Edwards:
On a problem concerning piles of counters. Discret. Math. 156(1-3): 263-264 (1996) - 1995
- [j5]Keith Edwards:
The Harmonious Chromatic Number of Almost All Trees. Comb. Probab. Comput. 4: 31-46 (1995) - [j4]Keith Edwards, Colin McDiarmid:
The Complexity of Harmonious Colouring for Trees. Discret. Appl. Math. 57(2-3): 133-144 (1995) - 1994
- [j3]Keith Edwards, Colin McDiarmid:
New upper bounds on harmonious colorings. J. Graph Theory 18(3): 257-267 (1994) - 1993
- [c2]Nathalie A. Vergeynst, Keith Edwards, John C. Foster, Mervyn A. Jack:
Spoken dialogues for human-computer interaction over the telephone: complexity measures. EUROSPEECH 1993: 1415-1418 - 1992
- [j2]Keith Edwards:
The complexity of some graph colouring problems. Discret. Appl. Math. 36(2): 131-140 (1992) - 1991
- [c1]Keith Edwards, Fergus R. McInnes, Mervyn A. Jack:
Accent specific modifications for continuous speech recognition based on a sub-word lattice approach. EUROSPEECH 1991: 1195-1198
1980 – 1989
- 1986
- [j1]Keith Edwards:
The Complexity of Colouring Problems on Dense Graphs. Theor. Comput. Sci. 43: 337-343 (1986)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 21:27 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
