John C. Wierman

2002

A researcher in the Science corpus: 1 paper; trusts 1 researcher and is trusted by 0 researchers here, as inferred from the citation graph.

Whom John C. Wierman trusts overall

Their strongest outbound trust, strongest first, inferred from their citations.

  1. Carey E. Priebe
  2. Lenore J. Cowen

Papers from John C. Wierman's perspective

Ordered by how strongly the researchers John C. Wierman trusts endorse each paper. Same corpus, a different order for every researcher.

  1. Classification Using Class Cover Catch Digraphs
  2. Approximation Algorithms for the Class Cover Problem
  3. The geometry of graphs and some of its algorithmic applications
  4. Mathematical Programming for Data Mining: Formulations and Challenges
  5. Finding and evaluating community structure in networks. (Physical review. E, Statistical, nonlinear, and soft matter physics)
  6. Random graphs (Wiley-Interscience series in discrete mathematics and optimization)
  7. Random matrices: Universal properties of eigenvectors
  8. Algebraic connectivity of graphs
  9. Random Dot Product Graph Models for Social Networks (Workshop on Algorithms and Models for the Web-Graph)
  10. Graph limits and exchangeable random graphs

Their papers