Jeannette C. M. Janssen

Computational Theory and Mathematics · 2009

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

Subfields

Whom Jeannette C. M. Janssen trusts overall

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

  1. Bruno Courcelle
  2. Sang-il Oum

Papers from Jeannette C. M. Janssen's perspective

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

  1. Upper bounds to the clique width of graphs (Discrete Applied Mathematics)
  2. Approximating clique-width and branch-width (J. Comb. Theory B)
  3. An extremal problem for H -linked graphs
  4. Network structure and minimum degree
  5. Directed Tree-Width (J. Comb. Theory B)
  6. Efficient graph representations (Fields Institute Monographs)
  7. A Combinatorial Algorithm Minimizing Submodular Functions in Strongly Polynomial Time
  8. A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions (Symposium on the Theory of Computing)
  9. I and J
  10. Graph Minors. XX. Wagner's conjecture (J. Comb. Theory B)

Their papers