|
Brunel University Research Archive (BURA) >
Browsing by Author Noble, SD
Showing results 1 to 9 of 9
| 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 |
| 2011 | Maximizing edge-ratio is NP-complete | Noble, SD; Hansen, P; Mladenović, N |
| 2009 | Minimizing the oriented diameter of a planar graph | Eggemann, N; Noble, SD |
| 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 |
| 2011 | The Tutte polynomial characterizes simple outerplanar graphs | Goodall, AJ; de Mier, A; Noble, SD; Noy, M |
Showing results 1 to 9 of 9
|
