René Peeters

Discrete Applied Mathematics · 1996–2003

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

Whom René Peeters trusts overall

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

  1. David S. Johnson
  2. H. Nader

Who trusts René Peeters overall

  1. Santo Fortunato
  2. Yaroslav N. Shitov
  3. Nicolas Gillis
  4. Prateek Jain
  5. Ilya P. Razenshteyn
  6. Jaideep Vaidya
  7. Ziv Bar-Yossef
  8. Alex Beutel

Papers from René Peeters's perspective

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

  1. I Computational Complexity
  2. The Complexity of Computing the Permanent
  3. The NP-Completeness Column: An Ongoing Guide
  4. A personal communication
  5. HOW GOOD IS THE SIMPLEX ALGORITHM
  6. A and V
  7. On the computational complexity of Ising spin glass models
  8. A dynamic programming approach to sequencing problems
  9. A Note on the Graph Isomorphism counting Problem
  10. A machine program for theorem-proving (CACM)

Their papers