Brian Alspach
2006
A researcher in the Science corpus: 1 paper; trusts 0 researchers and is trusted by 0 researchers here, as inferred from the citation graph.
Whom Brian Alspach trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
Who trusts Brian Alspach overall
Papers from Brian Alspach's perspective
Ordered by how strongly the researchers Brian Alspach trusts endorse each paper. Same corpus, a different order for every researcher.
- The NP-Completeness Column: An Ongoing Guide
- Introduction to graph theory
- A personal communication
- HOW GOOD IS THE SIMPLEX ALGORITHM
- A and V
- On the computational complexity of Ising spin glass models
- The Complexity of Computing the Permanent
- A dynamic programming approach to sequencing problems
- A Note on the Graph Isomorphism counting Problem
- A machine program for theorem-proving (CACM)
Their papers
- SEARCHING AND SWEEPING GRAPHS: A BRIEF SURVEY (2006) — 178 citations