The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

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

Publications of Author

  1. Neil J. Calkin, Criel Merino, S. Noble, Marc Noy
    Improved Bounds for the Number of Forests and Acyclic Orientations in the Square Lattice. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2003, v:10, n:, pp:- [Journal]
  2. Malwina J. Luczak, Steven D. Noble
    Optimal arrangement of data in a tree directory. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:113, n:2-3, pp:243-253 [Journal]
  3. Malwina J. Luczak, Steven D. Noble
    Optimal arrangement of data in a tree directory. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2002, v:121, n:1-3, pp:307-315 [Journal]

  4. The Equivalence of Two Graph Polynomials and a Symmetric Function. [Citation Graph (, )][DBLP]


  5. k-L(2, 1)-labelling for planar graphs is NP-complete for k>=4. [Citation Graph (, )][DBLP]


Search in 0.001secs, Finished in 0.001secs
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