Browsing by Author Noble, SD
Showing results 5 to 11 of 11
< previous
Issue Date | Title | Author(s) |
---|---|---|
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 |