Steven D. Noble

Publication Activity (10 Years)

Years Active: 1996-2021
Publications (10 Years): 11

Top Topics

Complexity Analysis

Independent Set

Bounded Tree Width

Linear Equations

Top Venues

Adv. Appl. Math.

Discret. Appl. Math.

Publications

Joseph E. Bonin, Carolyn Chun, Steven D. Noble
The excluded 3-minors for vf-safe delta-matroids. Adv. Appl. Math. 126 (2021)
Joseph E. Bonin, Carolyn Chun, Steven D. Noble
Delta-matroids as subsystems of sequences of Higgs lifts. Adv. Appl. Math. 126 (2021)
Carolyn Chun, Deborah Chun, Tyler Moss, Steven D. Noble
The e-exchange basis graph and matroid connectedness. Discret. Math. 342 (3) (2019)
Keith J. Edwards, Steven D. Noble
The complexity of solution-free sets of integers for general linear equations. Discret. Appl. Math. 270 (2019)
Carolyn Chun, Iain Moffatt, Steven D. Noble, Ralf Rueckriemen
Matroids, delta-matroids and embedded graphs. J. Comb. Theory, Ser. A 167 (2019)
Daryl Funk, Dillon Mayhew, Steven D. Noble
How many delta-matroids are there? Eur. J. Comb. 69 (2018)
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) (2018)
Andrew J. Goodall, Miki Hermann, Tomer Kotek, Johann A. Makowsky, Steven D. Noble
On the complexity of generalized chromatic polynomials. Adv. Appl. Math. 94 (2018)
Carolyn Chun, Deborah Chun, Steven D. Noble
Inductive tools for connected delta-matroids and multimatroids. Eur. J. Comb. 63 (2017)
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 (2017)
Andrew J. Goodall, Miki Hermann, Tomer Kotek, Johann A. Makowsky, Steven D. Noble
On the complexity of generalized chromatic polynomials. CoRR (2017)
Steven D. Noble, Gordon F. Royle
The Merino-Welsh conjecture holds for series-parallel graphs. Eur. J. Comb. 38 (2014)
Nicole Eggemann, Steven D. Noble
The complexity of two graph orientation problems. Discret. Appl. Math. 160 (4-5) (2012)
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) (2012)
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) (2012)
Nicole Eggemann, Steven D. Noble
The clustering coefficient of a scale-free random graph. Discret. Appl. Math. 159 (10) (2011)
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) (2011)
Andrew J. Goodall, Anna de Mier, Steven D. Noble, Marc Noy
The Tutte polynomial characterizes simple outerplanar graphs. Electron. Notes Discret. Math. 38 (2011)
Steven D. Noble, Pierre Hansen, Nenad Mladenovic
Maximizing edge-ratio is NP-complete. Discret. Appl. Math. 159 (18) (2011)
Andrew J. Goodall, Anna de Mier, Steven D. Noble, Marc Noy
The Tutte Polynomial Characterizes Simple Outerplanar Graphs. Comb. Probab. Comput. 20 (4) (2011)
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) (2010)
Steven D. Noble
Evaluating a Weighted Graph Polynomial for Graphs of Bounded Tree-Width. Electron. J. Comb. 16 (1) (2009)
Nicole Eggemann, Steven D. Noble
Minimizing the Oriented Diameter of a Planar Graph. Electron. Notes Discret. Math. 34 (2009)
Criel Merino, Steven D. Noble
The Equivalence of Two Graph Polynomials and a Symmetric Function. Comb. Probab. Comput. 18 (4) (2009)
Steven D. Noble
Evaluating the Rank Generating Function of a Graphic 2-Polymatroid. Comb. Probab. Comput. 15 (3) (2006)
R. A. Leese, Steven D. Noble
Cyclic Labellings with Constraints at Two Distances. Electron. J. Comb. 11 (1) (2004)
A. E. Koller, Steven D. Noble
Domination analysis of greedy heuristics for the frequency assignment problem. Discret. Math. 275 (1-3) (2004)
Ilia Krasikov, Steven D. Noble
Finding next-to-shortest paths in a graph. Inf. Process. Lett. 92 (3) (2004)
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)
Malwina J. Luczak, Steven D. Noble
Optimal arrangement of data in a tree directory. Discret. Appl. Math. 121 (1-3) (2002)
Henrik Blank, Rainer E. Burkard, Gautam Mitra, Toshihide Ibaraki, Steven D. Noble, William R. Pulleyblank
Preface. Ann. Oper. Res. 107 (1-4) (2001)
Malwina J. Luczak, Steven D. Noble
Optimal arrangement of data in a tree directory. Discret. Appl. Math. 113 (2-3) (2001)
Steven D. Noble, D. J. A. Welsh
Knot graphs. J. Graph Theory 34 (1) (2000)
Steven D. Noble
Evaluating the Tutte Polynomial for Graphs of Bounded Tree-Width. Comb. Probab. Comput. 7 (3) (1998)
Steven D. Noble
Recognising a partitionable simplicial complex is in NP. Discret. Math. 152 (1-3) (1996)