Changping Wang

Computational Theory and Mathematics · 2001–2009

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

Subfields

Whom Changping Wang trusts overall

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

  1. Bruno Courcelle
  2. Sang-il Oum

Who trusts Changping Wang overall

  1. Haizhong Li

Papers from Changping Wang's perspective

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

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

Their papers