Steven Noble

Cited by

	All	Since 2020
Citations	831	253
h-index	16	8
i10-index	20	6

199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202420254 1 3 5 4 6 10 16 17 31 24 23 21 28 38 40 47 46 41 37 38 43 39 41 43 55 43 67 3

Public access

View all

4 articles

0 articles

available

not available

Based on funding mandates

Co-authors

Iain MoffattRoyal Holloway, University of LondonVerified email at rhul.ac.uk
Criel MerinoUniversidad Nacional Autónoma de MéxicoVerified email at matem.unam.mx
Andrew GoodallIUUK, Charles UniversityVerified email at iuuk.mff.cuni.cz
Marc NoyProfessor of Mathematics, Universitat Politècnica de CatalunyaVerified email at upc.edu
Marcelino Ramírez-IbáñezUniversidad Pedagógica Nacional, Unidad 201Verified email at conacyt.mx
Rafael Villarroel-FloresUniversidad Autónoma del Estado de HidalgoVerified email at uaeh.edu.mx
Neil CalkinClemson UniversityVerified email at clemson.edu
Ilia KrasikovBrunel UniversityVerified email at brunel.ac.uk
Malwina LuczakUniversity of MelbourneVerified email at unimelb.edu.au
Joanna Ellis-MonaghanKorteweg-de Vries Instituut voor WiskundeVerified email at uva.nl
Rhiannon HallBrunel UniversityVerified email at brunel.ac.uk
Tomer KotekTU WienVerified email at forsyte.at
Johann (Janos) A. MakowskyFaculty of Computer Science, Technion - Israel Institute of Technology, Haifa, IsraelVerified email at cs.technion.ac.il
Dillon MayhewUniversity of LeedsVerified email at leeds.ac.uk
Nenad MladenovicProfessor, Khalifa University, UAEVerified email at ku.ac.ae
Anna de MierUniversitat Politècnica de CatalunyaVerified email at upc.edu
yanluan linTsinghua UniversityVerified email at tsinghua.edu.cn

Steven Noble

University of Leeds

Verified email at leeds.ac.uk

Mathematics


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
A weighted graph polynomial from chromatic invariants of knots SD Noble, DJA Welsh Annales de l'institut Fourier 49 (3), 1057-1087, 1999	145	1999
Evaluating the Tutte polynomial for graphs of bounded tree-width SD Noble Combinatorics, Probability & Computing 7 (3), 307-321, 1998	95	1998
Matroids, delta-matroids and embedded graphs C Chun, I Moffatt, SD Noble, R Rueckriemen Journal of Combinatorial Theory, Series A 167, 7-59, 2019	70*	2019
The clustering coefficient of a scale-free random graph N Eggemann, SD Noble Discrete Applied Mathematics 159 (10), 953-965, 2011	69	2011
On the interplay between embedded graphs and delta‐matroids C Chun, I Moffatt, SD Noble, R Rueckriemen Proceedings of the London Mathematical Society 118 (3), 675-700, 2019	42	2019
On the structure of the h-vector of a paving matroid C Merino, SD Noble, M Ramírez-Ibáñez, R Villarroel-Flores European Journal of Combinatorics 33 (8), 1787-1799, 2012	40	2012
Improved bounds for the number of forests and acyclic orientations in the square lattice N Calkin, C Merino, S Noble, M Noy the electronic journal of combinatorics 10 (1), R4, 2003	35	2003
Domination analysis of greedy heuristics for the frequency assignment problem AE Koller, SD Noble Discrete Mathematics 275 (1-3), 331-338, 2004	32	2004
Knot graphs SD Noble, DJA Welsh Journal of Graph Theory 34 (1), 2000	32	2000
Cyclic labellings with constraints at two distances RA Leese, SD Noble the electronic journal of combinatorics 11 (1), 16, 2004	28	2004
Finding next-to-shortest paths in a graph I Krasikov, SD Noble Information processing letters 92 (3), 117-119, 2004	27	2004
The sequencing of aircraft departures A Craig, R Ketzscer, RA Leese, SD Noble, K Parrott, J Preater, RE Wilson, ... 40th European study group with industry, Keele, 2001	21*	2001
The equivalence of two graph polynomials and a symmetric function C Merino, SD Noble Combinatorics, Probability & Computing 18 (4), 601-615, 2009	18	2009
Evaluating a weighted graph polynomial for graphs of bounded tree-width SD Noble the electronic journal of combinatorics 16 (1), 64, 2009	18	2009
The Merino–Welsh conjecture holds for series–parallel graphs SD Noble, GF Royle European Journal of Combinatorics 38, 24-35, 2014	17	2014
kL (2, 1)-labelling for planar graphs is NP-complete for k≥ 4 N Eggemann, F Havet, SD Noble Discrete Applied Mathematics 158 (16), 1777-1788, 2010	16	2010
Minimizing the oriented diameter of a planar graph N Eggemann, SD Noble Electronic Notes in Discrete Mathematics 34, 267-271, 2009	16	2009
Some inequalities for the Tutte polynomial LE Chávez-Lomelí, C Merino, SD Noble, M Ramírez-Ibáñez European Journal of Combinatorics 32 (3), 422-433, 2011	15	2011
Delta-matroids as subsystems of sequences of Higgs lifts JE Bonin, C Chun, SD Noble Advances in Applied Mathematics, 2019	10	2019
Optimal arrangement of data in a tree directory:[Discrete Appl. Math 113 (2001) 243–253] MJ Luczak, SD Noble Discrete applied mathematics 121 (1), 307-315, 2002	10*	2002

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors