Browse "MA-Conference Papers(학술회의논문)" by Author Oum, Sang-il

Showing results 1 to 18 of 18

1
An FPT 2-approximation for tree-cut decomposition

Kim, Eunjung; Oum, Sang-il; Paul, Christophe; Sau, Ignasi; Thilikos, Dimitrios M., 13th International Workshop on Approximation and Online Algorithms, WAOA 2015, pp.35 - 46, Springer Verlag, 2015-09

2
Certifying Large Branch-width

Paul Seymour; Oum, Sang-il, the 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp.810 - 813, 2006-01-22

3
Chi-boundedness of graph classes excluding wheel vertex-minors

Oum, Sang-il, Geometric and Structural Graph Theory, Banff International Research Station, 2017-08-21

4
Chi-boundedness of graph classes excluding wheel vertex-minors

Oum, Sang-il, Workshop on Graph Classes, Optimization, and Width Parameters (GROW2017), The Fields Institute, 2017-10-12

5
Computing small pivot-minors

Dabrowski, Konrad K; Dross, Francois; Jeong, Jisu; Kanté, Mamadou Moustapha; Kwon, O-joung; Oum, Sang-il; Paulusma, Daniel, 44th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2018, pp.125 - 138, Springer Verlag, 2018-06

6
Defective coloring of graphs with excluded subgraphs

Oum, Sang-il, Southern Italian Workshop no Algorithms and Graphs, Sapienza Università di Roma, 2016-09-26

7
Doubles of free groups and hyperbolic surface subgroups

Kim, Sang-Hyun; Oum, Sang-il, Workshop on Immersed surfaces in 3-manifolds, a part of the IHP program "Geometry and analysis of surface group representations”, IHP, Paris, 2012-03-26

8
Doubles of free groups and hyperbolic surface subgroups

Kim, Sang-hyun; Oum, Sang-il, Hot Topics: Surface subgroups and cube complexes, Mathematical Sciences Research Institute, 2013-03-19

9
Excluded vertex-minors for graphs of linear rank-width at most k

Jeong, Jisu; Kwon, O-joung; Oum, Sang-il, The 30th Symposium on Theoretical Aspects of Computer Science (STACS’13), pp.221 - 232, University of Kiel, 2013-02-28

10
Finding Branch-decompositions and Rank-decompositions

Petr Hlineny; Oum, Sang-il, 15th Annual European Symposium on Algorithms, v.4698, pp.163 - 174, 2007-10-08

11
Finding branch-decompositions of matroids, hypergraphs, and more

Jeong, Jisu; Kim, Eun Jung; Oum, Sang-il, 18th KIAS Combinatorics Workshop, KIAS, 2017-12-18

12
Obstructions for Matroids of Path-Width at most k and Graphs of Linear Rank-Width at most k

Kanté, Mamadou Moustapha; Kim, Eun Jung; Kwon, O-Joung; Oum, Sang-il, 39th International Symposium on Theoretical Aspects of Computer Science, STACS 2022, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2022-03

13
Properties of intersecting families of ordered sets: revisited

Oum, Sang-il, 2017 Korea-China International Conference on Matrix Theory with Applications, Sungkyunkwan University, 2017-12-16

14
Properties of intersecting families of ordered sets: revisited

Oum, Sang-il; Wee, Sounggun, 2018 International Workshop on Graph Theory, 이화여자대학교, 2018-01-05

15
Scattered classes of graphs

Kwon, O-joung; Oum, Sang-il, SIAM Conference on Discrete Mathematics, SIAM, 2018-06-04

16
Unifying duality theorems for width parameters in graphs and matroids (Extended abstract)

Diestel, Reinhard; Oum, Sang-il, 40th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2014, pp.1 - 14, Springer Verlag, 2014-06

17
Variants of Hadwiger's conjecture

Oum, Sang-il, Workshop on Probabilistic and Extremal Combinatorics Downunder, Monash University, 2016-06-16

18
Variants of HAdwiger's conjecture

Oum, Sang-il, 2016 International Workshop on Graph Theory and Combinatorics, 이화여대, 2016-02-19

rss_1.0 rss_2.0 atom_1.0