Sang-il Oum

Computational Theory and Mathematics · 2005–2017

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

Subfields

• Computational Theory and Mathematics — 10 citations into it; #7,535 of 12,182 by trust here, #9,306 by citations

Whom Sang-il Oum trusts overall

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

1. Alexander Schrijver
2. Bruno Courcelle
3. Satoru Iwata
4. Lisa Fleischer

Who trusts Sang-il Oum overall

1. Anthony Bonato
2. Daniel Marx
3. Jeannette C. M. Janssen
4. Changping Wang

Papers from Sang-il Oum's perspective

Ordered by how strongly the researchers Sang-il Oum trusts endorse each paper. Same corpus, a different order for every researcher.

1. A Combinatorial Algorithm Minimizing Submodular Functions in Strongly Polynomial Time
2. A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions (Symposium on the Theory of Computing)
3. I and J
4. Submodular Functions, Matroids, and Certain Polyhedra (Combinatorial Optimization)
5. Submodular functions and convexity
6. Upper bounds to the clique width of graphs (Discrete Applied Mathematics)
7. Solution of a Large-Scale Traveling-Salesman Problem
8. ACTIVITY ANALYSIS OF PRODUCTION AND ALLOCATION
9. Harmonic Analysis on Semigroups: Theory of Positive Definite and Related Functions
10. Mathematical Methods of Organizing and Planning Production

Their papers

• Approximating clique-width and branch-width (2006) — 549 citations
• Tangle-tree duality in abstract separation systems (2017) — 48 citations
• Graphs of bounded rank-width (2005) — 56 citations