default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKatherine Edwards
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j11]Katherine Edwards, W. Sean Kennedy:
Delay Colouring in Quartic Graphs. Electron. J. Comb. 27(3): 3 (2020)
2010 – 2019
- 2018
- [j10]Katherine Edwards
, W. Sean Kennedy, Iraj Saniee:
Fast Approximation Algorithms for p-Centers in Large $$\delta $$ δ -Hyperbolic Graphs. Algorithmica 80(12): 3889-3907 (2018) - [j9]Katherine Edwards, António Girão, Jan van den Heuvel, Ross J. Kang, Gregory J. Puleo, Jean-Sébastien Sereni:
Extension from Precoloured Sets of Edges. Electron. J. Comb. 25(3): 3 (2018) - 2017
- [c3]Katherine Edwards, Irene Muzi, Paul Wollan:
Half-Integral Linkages in Highly Connected Directed Graphs. ESA 2017: 36:1-36:12 - 2016
- [b1]Katherine Edwards:
On edge colouring, fractionally colouring and partitioning graphs. Princeton University, USA, 2016 - [j8]Katherine Edwards, Daniel P. Sanders, Paul D. Seymour, Robin Thomas:
Three-edge-colouring doublecross cubic graphs. J. Comb. Theory B 119: 66-95 (2016) - [j7]Maria Chudnovsky, Katherine Edwards, Ringi Kim, Alex Scott, Paul D. Seymour:
Disjoint dijoins. J. Comb. Theory B 120: 18-35 (2016) - [c2]Katherine Edwards, W. Sean Kennedy, Iraj Saniee:
Fast Approximation Algorithms for p-centers in Large \delta δ -hyperbolic Graphs. WAW 2016: 60-73 - [i8]Katherine Edwards, W. Sean Kennedy, Iraj Saniee:
Fast approximation algorithms for $p$-centres in large $δ$-hyperbolic graphs. CoRR abs/1604.07359 (2016) - [i7]Katherine Edwards, Irene Muzi, Paul Wollan:
Half-integral linkages in highly connected directed graphs. CoRR abs/1611.01004 (2016) - 2015
- [j6]Maria Chudnovsky, Katherine Edwards, Ken-ichi Kawarabayashi, Paul D. Seymour:
Edge-colouring seven-regular planar graphs. J. Comb. Theory B 115: 276-302 (2015) - [j5]Maria Chudnovsky, Katherine Edwards, Paul D. Seymour:
Edge-colouring eight-regular planar graphs. J. Comb. Theory B 115: 303-338 (2015) - [j4]Katherine Edwards, Dong Yeap Kang, Jaehoon Kim, Sang-il Oum, Paul D. Seymour:
A Relative of Hadwiger's Conjecture. SIAM J. Discret. Math. 29(4): 2385-2388 (2015) - [i6]Emmanuel Abbe, Katherine Edwards:
Concentration of the number of solutions of random planted CSPs and Goldreich's one-way candidates. CoRR abs/1504.08316 (2015) - 2014
- [j3]Katherine Edwards, Andrew D. King:
A Superlocal Version of Reed's Conjecture. Electron. J. Comb. 21(4): 4 (2014) - 2013
- [j2]Demetres Christofides, Katherine Edwards, Andrew D. King:
A Note on Hitting Maximum and Maximal Cliques With a Stable Set. J. Graph Theory 73(3): 354-360 (2013) - [j1]Katherine Edwards, Andrew D. King:
Bounding the Fractional Chromatic Number of KDelta-Free Graphs. SIAM J. Discret. Math. 27(2): 1184-1208 (2013) - [c1]Katherine Edwards, Simon Griffiths, William Sean Kennedy:
Partial Interval Set Cover - Trade-Offs between Scalability and Optimality. APPROX-RANDOM 2013: 110-125 - 2012
- [i5]Katherine Edwards, Andrew D. King:
Bounding the fractional chromatic number of KΔ-free graphs. CoRR abs/1206.2384 (2012) - [i4]Katherine Edwards, Andrew D. King:
A superlocal version of Reed's Conjecture. CoRR abs/1208.5188 (2012) - [i3]Maria Chudnovsky, Katherine Edwards, Paul D. Seymour:
Edge-colouring eight-regular planar graphs. CoRR abs/1209.1176 (2012) - [i2]Maria Chudnovsky, Katherine Edwards, Ken-ichi Kawarabayashi, Paul D. Seymour:
Edge-colouring seven-regular planar graphs. CoRR abs/1210.7349 (2012) - 2011
- [i1]Demetres Christofides, Katherine Edwards, Andrew D. King:
A note on hitting maximum and maximal cliques with a stable set. CoRR abs/1109.3092 (2011)
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-10-07 21:21 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:
