Steven D. Noble

633 total citations
35 papers, 299 citations indexed

About

Steven D. Noble is a scholar working on Computational Theory and Mathematics, Geometry and Topology and Discrete Mathematics and Combinatorics. According to data from OpenAlex, Steven D. Noble has authored 35 papers receiving a total of 299 indexed citations (citations by other indexed papers that have themselves been cited), including 26 papers in Computational Theory and Mathematics, 14 papers in Geometry and Topology and 13 papers in Discrete Mathematics and Combinatorics. Recurrent topics in Steven D. Noble's work include Advanced Graph Theory Research (22 papers), Advanced Combinatorial Mathematics (12 papers) and Complexity and Algorithms in Graphs (9 papers). Steven D. Noble is often cited by papers focused on Advanced Graph Theory Research (22 papers), Advanced Combinatorial Mathematics (12 papers) and Complexity and Algorithms in Graphs (9 papers). Steven D. Noble collaborates with scholars based in United Kingdom, Spain and United States. Steven D. Noble's co-authors include Dominic Welsh, Criel Merino, Iain Moffatt, Robert Leese, Marc Noy, Neil J. Calkin, Ilia Krasikov, Gordon Royle, Frédéric Havet and Malwina Luczak and has published in prestigious journals such as Proceedings of the London Mathematical Society, Discrete Applied Mathematics and Discrete Mathematics.

In The Last Decade

Steven D. Noble

33 papers receiving 278 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Steven D. Noble United Kingdom	10	176	141	123	38	32	35	299
Jeremy L. Martin United States	9	147 0.8×	123 0.9×	112 0.9×	59 1.6×	21 0.7×	38	281
Caroline J. Klivans United States	9	229 1.3×	117 0.8×	153 1.2×	55 1.4×	17 0.5×	22	320
Wen-Ching Winnie Li United States	8	94 0.5×	84 0.6×	108 0.9×	57 1.5×	30 0.9×	22	259
Uroš Milutinović Slovenia	9	224 1.3×	76 0.5×	116 0.9×	61 1.6×	49 1.5×	22	343
Criel Merino Mexico	9	154 0.9×	135 1.0×	114 0.9×	92 2.4×	14 0.4×	23	293
Serguei Norine United States	10	374 2.1×	255 1.8×	245 2.0×	69 1.8×	35 1.1×	27	492
L. Lovász United States	3	157 0.9×	159 1.1×	149 1.2×	59 1.6×	18 0.6×	3	312
Anna de Mier Spain	11	198 1.1×	231 1.6×	99 0.8×	40 1.1×	50 1.6×	37	308
Emanuele Munarini Italy	9	117 0.7×	147 1.0×	133 1.1×	21 0.6×	24 0.8×	45	301
A. Nilli Israel	4	86 0.5×	97 0.7×	106 0.9×	23 0.6×	32 1.0×	7	211

Countries citing papers authored by Steven D. Noble

Since Specialization

Citations

This map shows the geographic impact of Steven D. Noble's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Steven D. Noble with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Steven D. Noble more than expected).

Fields of papers citing papers by Steven D. Noble

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Steven D. Noble. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Steven D. Noble. The network helps show where Steven D. Noble may publish in the future.

Co-authorship network of co-authors of Steven D. Noble

This figure shows the co-authorship network connecting the top 25 collaborators of Steven D. Noble. A scholar is included among the top collaborators of Steven D. Noble based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Steven D. Noble. Steven D. Noble is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Noble, Steven D., et al.. (2022). Transforming Production Phase WIMS to a Game Changer Smart Well Integrity Monitoring System with Real Time Automated Engineering Analytics. 3 indexed citations

Ellis-Monaghan, Joanna A., et al.. (2022). Irreducibility of the Tutte polynomial of an embedded graph. Algebraic Combinatorics. 5(6). 1337–1351.

Moffatt, Iain, et al.. (2019). Matroids, delta-matroids and embedded graphs. Journal of Combinatorial Theory Series A. 167. 7–59. 13 indexed citations

Noble, Steven D., et al.. (2017). Inductive tools for connected delta-matroids and multimatroids. European Journal of Combinatorics. 63. 59–69. 2 indexed citations

Goodall, Andrew, et al.. (2017). On the complexity of generalized chromatic polynomials. Advances in Applied Mathematics. 94. 71–102. 2 indexed citations

Noble, Steven D. & Gordon Royle. (2013). The Merino–Welsh conjecture holds for series–parallel graphs. European Journal of Combinatorics. 38. 24–35. 8 indexed citations

Noble, Steven D., et al.. (2012). On plane graphs with link component number equal to the nullity. Discrete Applied Mathematics. 160(9). 1369–1375. 2 indexed citations

Merino, Criel, et al.. (2012). On the structure of the h-vector of a paving matroid. European Journal of Combinatorics. 33(8). 1787–1799. 12 indexed citations

Noble, Steven D., et al.. (2011). The complexity of two graph orientation problems. Discrete Applied Mathematics. 160(4-5). 513–517. 1 indexed citations

10.

Noble, Steven D., et al.. (2011). The clustering coefficient of a scale-free random graph. Discrete Applied Mathematics. 159(10). 953–965. 27 indexed citations

11.

Goodall, Andrew, Anna de Mier, Steven D. Noble, & Marc Noy. (2011). The Tutte Polynomial Characterizes Simple Outerplanar Graphs. Combinatorics Probability Computing. 20(4). 609–616. 1 indexed citations

12.

Noble, Steven D., Pierre Hansen, & Nenad Mladenović. (2011). Maximizing edge-ratio is NP-complete. Discrete Applied Mathematics. 159(18). 2276–2280. 2 indexed citations

13.

Merino, Criel, et al.. (2010). Some inequalities for the Tutte polynomial. European Journal of Combinatorics. 32(3). 422–433. 8 indexed citations

14.

Noble, Steven D., et al.. (2009). Minimizing the Oriented Diameter of a Planar Graph. Electronic Notes in Discrete Mathematics. 34. 267–271. 8 indexed citations

15.

Noble, Steven D.. (2009). Evaluating a Weighted Graph Polynomial for Graphs of Bounded Tree-Width. The Electronic Journal of Combinatorics. 16(1). 4 indexed citations

16.

Leese, Robert & Steven D. Noble. (2004). Cyclic Labellings with Constraints at Two Distances. The Electronic Journal of Combinatorics. 11(1). 12 indexed citations

17.

Noble, Steven D., et al.. (2003). Domination analysis of greedy heuristics for the frequency assignment problem. Discrete Mathematics. 275(1-3). 331–338. 12 indexed citations

18.

Calkin, Neil J., Criel Merino, Steven D. Noble, & Marc Noy. (2003). Improved Bounds for the Number of Forests and Acyclic Orientations in the Square Lattice. The Electronic Journal of Combinatorics. 10(1). 21 indexed citations

19.

Luczak, Malwina & Steven D. Noble. (2001). Optimal arrangement of data in a tree directory. Discrete Applied Mathematics. 113(2-3). 243–253. 1 indexed citations

20.

Noble, Steven D. & Dominic Welsh. (1999). A weighted graph polynomial from chromatic invariants of knots. Annales de l’institut Fourier. 49(3). 1057–1087. 50 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact