#### Filter Results:

- Full text PDF available (5)

#### Publication Year

1996

2015

- This year (0)
- Last 5 years (1)
- Last 10 years (4)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Ilia Krasikov, S. D. Noble
- Inf. Process. Lett.
- 2004

We study the problem of finding the next-to-shortest paths in a graph. A next-to-shortest (u, v)-path is a shortest (u, v)-path amongst (u, v)paths with length strictly greater than the length of theâ€¦ (More)

- Adam Weiss, Anil Ramapanicker, Pranav R Shah, S. D. Noble, Larry Immohr
- 2007

In this study we test the feasibility of mouse movement biometrics. Building on ideas from previous work in mouse and keystroke biometrics, the study focuses on defining data collection, featureâ€¦ (More)

- S. D. Noble
- Combinatorics, Probability & Computing
- 1998

Our notation is fairly standard except that our graphs are allowed to have loops and parallel edges. V (G) and E(G), or just V and E, are used to denote the vertex set and edge set of a graph. Weâ€¦ (More)

- S. D. Noble
- Electr. J. Comb.
- 2009

We show that for any k there is a polynomial time algorithm to evaluate the weighted graph polynomial U of any graph with tree-width at most k at any point. For a graph with n vertices, the algorithmâ€¦ (More)

- A. E. Koller, S. D. Noble
- Discrete Mathematics
- 2004

We introduce the greedy expectation algorithm for the fixed spectrum version of the frequency assignment problem. This algorithm was previously studied for the travelling salesman problem. We showâ€¦ (More)

- S. D. Noble, R Blake Brown, T. G. Crowe
- The Review of scientific instruments
- 2012

Accounting for light that is diffusely scattered from a surface is one of the practical challenges in reflectance measurement. Integrating spheres are commonly used for this purpose in pointâ€¦ (More)

- Nitin U Jain, S. D. Noble, James H. Prestegard
- Journal of molecular biology
- 2003

The ligand-binding properties of a 53 kDa homomultimeric trimer from mannose-binding protein (MBP) have been investigated using residual dipolar couplings (RDCs) that are easily measured from NMRâ€¦ (More)

- Yuefeng Lin, S. D. Noble, Xian'an Jin, Wenfang Cheng
- Discrete Applied Mathematics
- 2012

- S. D. Noble
- Combinatorics, Probability & Computing
- 2006

We consider the complexity of the two-variable rank generating function, S , of a graphic 2-polymatroid. For a graph G, S is the generating function for the number of subsets of edges of G having aâ€¦ (More)

- S. D. Noble
- Discrete Mathematics
- 1996

We show that the problem of recognising a partitionable simplicial complex is a member of the complexity class NP, thus answering a question raised in [1].