Steven D. Noble

Orcid: 0000-0002-1621-0059

Affiliations:
  • Birkbeck, University of London, UK
  • Brunel University, Uxbridge, UK


According to our database1, Steven D. Noble authored at least 32 papers between 1996 and 2021.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
Delta-matroids as subsystems of sequences of Higgs lifts.
Adv. Appl. Math., 2021

The excluded 3-minors for vf-safe delta-matroids.
Adv. Appl. Math., 2021

2019
Matroids, delta-matroids and embedded graphs.
J. Comb. Theory, Ser. A, 2019

The e-exchange basis graph and matroid connectedness.
Discret. Math., 2019

The complexity of solution-free sets of integers for general linear equations.
Discret. Appl. Math., 2019

2018
How many delta-matroids are there?
Eur. J. Comb., 2018

The Structure of Delta-Matroids with Width One Twists.
Electron. J. Comb., 2018

On the complexity of generalized chromatic polynomials.
Adv. Appl. Math., 2018

2017
On zeros of the characteristic polynomial of matroids of bounded tree-width.
Eur. J. Comb., 2017

Inductive tools for connected delta-matroids and multimatroids.
Eur. J. Comb., 2017

2014
The Merino-Welsh conjecture holds for series-parallel graphs.
Eur. J. Comb., 2014

2012
On the structure of the h-vector of a paving matroid.
Eur. J. Comb., 2012

On plane graphs with link component number equal to the nullity.
Discret. Appl. Math., 2012

The complexity of two graph orientation problems.
Discret. Appl. Math., 2012

2011
The Tutte polynomial characterizes simple outerplanar graphs.
Electron. Notes Discret. Math., 2011

Some inequalities for the Tutte polynomial.
Eur. J. Comb., 2011

Maximizing edge-ratio is NP-complete.
Discret. Appl. Math., 2011

The clustering coefficient of a scale-free random graph.
Discret. Appl. Math., 2011

2010
k-L(2, 1)-labelling for planar graphs is NP-complete for k>=4.
Discret. Appl. Math., 2010

2009
Minimizing the Oriented Diameter of a Planar Graph.
Electron. Notes Discret. Math., 2009

The Equivalence of Two Graph Polynomials and a Symmetric Function.
Comb. Probab. Comput., 2009

Evaluating a Weighted Graph Polynomial for Graphs of Bounded Tree-Width.
Electron. J. Comb., 2009

2006
Evaluating the Rank Generating Function of a Graphic 2-Polymatroid.
Comb. Probab. Comput., 2006

2004
Finding next-to-shortest paths in a graph.
Inf. Process. Lett., 2004

Domination analysis of greedy heuristics for the frequency assignment problem.
Discret. Math., 2004

Cyclic Labellings with Constraints at Two Distances.
Electron. J. Comb., 2004

2003
Improved Bounds for the Number of Forests and Acyclic Orientations in the Square Lattice.
Electron. J. Comb., 2003

2002
Optimal arrangement of data in a tree directory.
Discret. Appl. Math., 2002

2001
Preface.
Ann. Oper. Res., 2001

2000
Knot graphs.
J. Graph Theory, 2000

1998
Evaluating the Tutte Polynomial for Graphs of Bounded Tree-Width.
Comb. Probab. Comput., 1998

1996
Recognising a partitionable simplicial complex is in NP.
Discret. Math., 1996


  Loading...