Brunel University Research Archive(BURA) preserves and enables easy and open access to all
types of digital content. It showcases Brunel's research outputs.
Research contained within BURA is open access, although some publications may be subject
to publisher imposed embargoes. All awarded PhD theses are also archived on BURA.
Browsing by Author Noble, SD
Showing results 1 to 11 of 11
Issue Date | Title | Author(s) |
2012 | The complexity of two graph orientation problems | Eggemann, N; Noble, SD |
2004 | Domination Analysis of Greedy Heuristics For The Frequency Assignment Problem | Koller, AE; Noble, SD |
2009 | The equivalence of two graph polynomials and a symmetric function | Merino, C; Noble, SD |
2006 | Evaluating the rank generating function of a graphic 2-polymatroid | Noble, SD |
2011 | Maximizing edge-ratio is NP-complete | Noble, SD; Hansen, P; Mladenović, N |
2014 | The Merino–Welsh conjecture holds for series–parallel graphs | Noble, SD; Royle, GF |
2009 | Minimizing the oriented diameter of a planar graph | Eggemann, N; Noble, SD |
2012 | On the structure of the h-vector of a paving matroid. | Merino, C; Noble, SD; Ramirez-Ibanez, M; Villarroel-Flores, R |
1996 | Recognising a partitionable simplicial complex is in NP | Noble, SD |
2011 | Some inequalities for the Tutte polynomial | Chavez-Lomeli, LE; Merino, C; Noble, SD; Ramirez-Ibanez, M |
2011 | The Tutte polynomial characterizes simple outerplanar graphs | Goodall, AJ; de Mier, A; Noble, SD; Noy, M |