The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

S. D. Noble: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. R. A. Leese, S. D. Noble
    Cyclic Labellings with Constraints at Two Distances. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2004, v:11, n:1, pp:- [Journal]
  2. S. D. Noble
    Evaluating the Tutte Polynomial for Graphs of Bounded Tree-Width. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1998, v:7, n:3, pp:307-321 [Journal]
  3. A. E. Koller, S. D. Noble
    Domination analysis of greedy heuristics for the frequency assignment problem. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:275, n:1-3, pp:331-338 [Journal]
  4. Ilia Krasikov, S. D. Noble
    Finding next-to-shortest paths in a graph. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2004, v:92, n:3, pp:117-119 [Journal]
  5. S. D. Noble
    Recognising a partitionable simplicial complex is in NP. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:152, n:1-3, pp:303-305 [Journal]

  6. Evaluating the Rank Generating Function of a Graphic 2-Polymatroid. [Citation Graph (, )][DBLP]


Search in 0.019secs, Finished in 0.020secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002