default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSteven D. Noble
Person information
- affiliation: Birkbeck, University of London, UK
- affiliation: Brunel University, Uxbridge, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j34]Joseph E. Bonin
, Carolyn Chun, Steven D. Noble:
The excluded 3-minors for vf-safe delta-matroids. Adv. Appl. Math. 126: 101909 (2021)- [j33]Joseph E. Bonin, Carolyn Chun, Steven D. Noble:
Delta-matroids as subsystems of sequences of Higgs lifts. Adv. Appl. Math. 126: 101910 (2021)
2010 – 2019
- 2019
- [j32]Keith J. Edwards, Steven D. Noble:
The complexity of solution-free sets of integers for general linear equations. Discret. Appl. Math. 270: 115-133 (2019) - [j31]Carolyn Chun, Deborah Chun, Tyler Moss, Steven D. Noble:
The e-exchange basis graph and matroid connectedness. Discret. Math. 342(3): 723-725 (2019) - [j30]Carolyn Chun, Iain Moffatt, Steven D. Noble, Ralf Rueckriemen:
Matroids, delta-matroids and embedded graphs. J. Comb. Theory A 167: 7-59 (2019) - 2018
- [j29]Andrew J. Goodall, Miki Hermann, Tomer Kotek, Johann A. Makowsky, Steven D. Noble:
On the complexity of generalized chromatic polynomials. Adv. Appl. Math. 94: 71-102 (2018) - [j28]Carolyn Chun, Rhiannon Hall, Criel Merino, Iain Moffatt, Steven D. Noble:
The Structure of Delta-Matroids with Width One Twists. Electron. J. Comb. 25(1): 1 (2018) - [j27]Daryl Funk, Dillon Mayhew, Steven D. Noble:
How many delta-matroids are there? Eur. J. Comb. 69: 149-158 (2018) - 2017
- [j26]Carolyn Chun, Rhiannon Hall, Criel Merino, Steven D. Noble:
On zeros of the characteristic polynomial of matroids of bounded tree-width. Eur. J. Comb. 60: 10-20 (2017) - [j25]Carolyn Chun, Deborah Chun, Steven D. Noble:
Inductive tools for connected delta-matroids and multimatroids. Eur. J. Comb. 63: 59-69 (2017) - [i1]Andrew J. Goodall, Miki Hermann, Tomer Kotek, Johann A. Makowsky, Steven D. Noble:
On the complexity of generalized chromatic polynomials. CoRR abs/1701.06639 (2017) - 2014
- [j24]Steven D. Noble, Gordon F. Royle:
The Merino-Welsh conjecture holds for series-parallel graphs. Eur. J. Comb. 38: 24-35 (2014) - 2012
- [j23]Nicole Eggemann, Steven D. Noble:
The complexity of two graph orientation problems. Discret. Appl. Math. 160(4-5): 513-517 (2012) - [j22]Yuefeng Lin, Steven D. Noble, Xian'an Jin, Wenfang Cheng:
On plane graphs with link component number equal to the nullity. Discret. Appl. Math. 160(9): 1369-1375 (2012) - [j21]Criel Merino, Steven D. Noble, Marcelino Ramírez-Ibáñez, Rafael Villarroel-Flores:
On the structure of the h-vector of a paving matroid. Eur. J. Comb. 33(8): 1787-1799 (2012) - 2011
- [j20]Andrew J. Goodall, Anna de Mier, Steven D. Noble, Marc Noy:
The Tutte Polynomial Characterizes Simple Outerplanar Graphs. Comb. Probab. Comput. 20(4): 609-616 (2011) - [j19]Nicole Eggemann, Steven D. Noble:
The clustering coefficient of a scale-free random graph. Discret. Appl. Math. 159(10): 953-965 (2011) - [j18]Steven D. Noble, Pierre Hansen, Nenad Mladenovic:
Maximizing edge-ratio is NP-complete. Discret. Appl. Math. 159(18): 2276-2280 (2011) - [j17]Laura Chávez-Lomelí, Criel Merino, Steven D. Noble, Marcelino Ramírez-Ibáñez:
Some inequalities for the Tutte polynomial. Eur. J. Comb. 32(3): 422-433 (2011) - [j16]Andrew J. Goodall, Anna de Mier, Steven D. Noble, Marc Noy:
The Tutte polynomial characterizes simple outerplanar graphs. Electron. Notes Discret. Math. 38: 639-644 (2011) - 2010
- [j15]Nicole Eggemann, Frédéric Havet, Steven D. Noble:
k-L(2, 1)-labelling for planar graphs is NP-complete for k>=4. Discret. Appl. Math. 158(16): 1777-1788 (2010)
2000 – 2009
- 2009
- [j14]Steven D. Noble:
Evaluating a Weighted Graph Polynomial for Graphs of Bounded Tree-Width. Electron. J. Comb. 16(1) (2009) - [j13]Criel Merino, Steven D. Noble:
The Equivalence of Two Graph Polynomials and a Symmetric Function. Comb. Probab. Comput. 18(4): 601-615 (2009) - [j12]Nicole Eggemann, Steven D. Noble:
Minimizing the Oriented Diameter of a Planar Graph. Electron. Notes Discret. Math. 34: 267-271 (2009) - 2006
- [j11]Steven D. Noble:
Evaluating the Rank Generating Function of a Graphic 2-Polymatroid. Comb. Probab. Comput. 15(3): 449-461 (2006) - 2004
- [j10]R. A. Leese, Steven D. Noble:
Cyclic Labellings with Constraints at Two Distances. Electron. J. Comb. 11(1) (2004) - [j9]A. E. Koller, Steven D. Noble:
Domination analysis of greedy heuristics for the frequency assignment problem. Discret. Math. 275(1-3): 331-338 (2004) - [j8]Ilia Krasikov, Steven D. Noble:
Finding next-to-shortest paths in a graph. Inf. Process. Lett. 92(3): 117-119 (2004) - 2003
- [j7]Neil J. Calkin, Criel Merino, Steven D. Noble, Marc Noy:
Improved Bounds for the Number of Forests and Acyclic Orientations in the Square Lattice. Electron. J. Comb. 10 (2003) - 2002
- [j6]Malwina J. Luczak, Steven D. Noble:
Optimal arrangement of data in a tree directory. Discret. Appl. Math. 121(1-3): 307-315 (2002) - 2001
- [j5]Henrik Blank, Rainer E. Burkard, Gautam Mitra, Toshihide Ibaraki, Steven D. Noble, William R. Pulleyblank:
Preface. Ann. Oper. Res. 107(1-4): 13 (2001) - [j4]Malwina J. Luczak, Steven D. Noble:
Optimal arrangement of data in a tree directory. Discret. Appl. Math. 113(2-3): 243-253 (2001) - 2000
- [j3]Steven D. Noble, D. J. A. Welsh:
Knot graphs. J. Graph Theory 34(1): 100-111 (2000)
1990 – 1999
- 1998
- [j2]Steven D. Noble:
Evaluating the Tutte Polynomial for Graphs of Bounded Tree-Width. Comb. Probab. Comput. 7(3): 307-321 (1998) - 1996
- [j1]Steven D. Noble:
Recognising a partitionable simplicial complex is in NP. Discret. Math. 152(1-3): 303-305 (1996)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-03-04 21:22 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
