Luis Cereceda

2007

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

Whom Luis Cereceda trusts overall

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

  1. David S. Johnson
  2. Bojan Mohar
  3. Erik D. Demaine

Papers from Luis Cereceda's perspective

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

  1. The NP-Completeness Column: An Ongoing Guide
  2. Graphs on Surfaces (Johns Hopkins series in the mathematical sciences)
  3. PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation (Theoretical Computer Science)
  4. Kempe Equivalence of Colorings
  5. A personal communication
  6. HOW GOOD IS THE SIMPLEX ALGORITHM
  7. A and V
  8. On the computational complexity of Ising spin glass models
  9. The Complexity of Computing the Permanent
  10. A dynamic programming approach to sequencing problems

Their papers