Search
Add filters:
Use filters to refine the search results.
Results 1-8 of 8 (Search time: 0.016 seconds).
- previous
- 1
- next
Item hits:
Issue Date | Title | Author(s) |
---|---|---|
2011 | Maximizing edge-ratio is NP-complete | Noble, SD; Hansen, P; Mladenović, N |
2004 | Domination Analysis of Greedy Heuristics For The Frequency Assignment Problem | Koller, AE; Noble, SD |
1996 | Recognising a partitionable simplicial complex is in NP | Noble, SD |
2009 | Minimizing the oriented diameter of a planar graph | Eggemann, N; Noble, SD |
2009 | The equivalence of two graph polynomials and a symmetric function | Merino, C; Noble, SD |
2011 | Some inequalities for the Tutte polynomial | Chavez-Lomeli, LE; Merino, C; Noble, SD; Ramirez-Ibanez, M |
2012 | The complexity of two graph orientation problems | Eggemann, N; Noble, SD |
2006 | Evaluating the rank generating function of a graphic 2-polymatroid | Noble, SD |
Discover
Subject
Date issued