The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Steven D. Noble" ( http://dblp.L3S.de/Authors/Steven_D._Noble )

  Author page on DBLP  Author page in RDF  Community of Steven D. Noble in ASPL-2

Publication years (Num. hits)
2001-2012 (11)
Publication types (Num. hits)
article(11)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
No Growbag Graphs found.

Results
Found 11 publication records. Showing 11 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Nicole Eggemann, Steven D. Noble The complexity of two graph orientation problems. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Laura Chávez-Lomelí, Criel Merino, Steven D. Noble, Marcelino Ramírez-Ibáñez Some inequalities for the Tutte polynomial. Search on Bibsonomy Eur. J. Comb. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1A. J. Goodall, Anna de Mier, Steven D. Noble, Marc Noy The Tutte Polynomial Characterizes Simple Outerplanar Graphs. Search on Bibsonomy Combinatorics, Probability & Computing The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Nicole Eggemann, Steven D. Noble The clustering coefficient of a scale-free random graph. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Steven D. Noble, Pierre Hansen, Nenad Mladenovic Maximizing edge-ratio is NP-complete. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Nicole Eggemann, Frédéric Havet, Steven D. Noble k-L(2, 1)-labelling for planar graphs is NP-complete for k>=4. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Nicole Eggemann, Steven D. Noble Minimizing the Oriented Diameter of a Planar Graph. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Criel Merino, Steven D. Noble The Equivalence of Two Graph Polynomials and a Symmetric Function. Search on Bibsonomy Combinatorics, Probability & Computing The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Neil J. Calkin, Criel Merino, Steven D. Noble, Marc Noy Improved Bounds for the Number of Forests and Acyclic Orientations in the Square Lattice. Search on Bibsonomy Electr. J. Comb. The full citation details ... 2003 DBLP  BibTeX  RDF
1Malwina J. Luczak, Steven D. Noble Optimal arrangement of data in a tree directory. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Malwina J. Luczak, Steven D. Noble Optimal arrangement of data in a tree directory. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #11 of 11 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.