DSpace at KOASAS
Browsing DSpace

Browse "MA-Conference Papers(학술회의논문)" by Author Kim, Eun Jung

A to Z

All 0-9

A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

or enter first few letters:

Showing results 1 to 7 of 7

1
Constructive algorithm for path-width and branch-width of matroids and rank-width of graphs

Jeong, Ji Su; Kim, Eun Jung; Oum, Sang Il, International Workshop on Graph Decomposition 
, Centre International De Rencontres Mathematiques, 2015-01-19

2
Constructive algorithm for path-width of matroids

Jeong, Ji Su; Kim, Eun Jung; Oum, Sang Il, GROW 2015 :the 7th workshop on Graph Classes, Optimization, and Width Parameters, Laboratoire d'Informatique, de Robotique et de Microélectronique de Montpellier, 2015-10-13

3
Constructive algorithm for path-width of matroids

Jeong, Jisu; Kim, Eun Jung; Oum, Sang-Il, 27th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, pp.1695 - 1704, ACM SIGACT and SIAM Activity Group on Discrete Mathematics, 2016-01-12

4
Constructive algorithm for path-width of matroids

Jeong, Ji Su; Kim, Eun Jung; Oum, Sang Il, 2015 International Workshop on Mathematical Sciences in Dalian, Dalian University of Technology, 2015-11-01

5
Constructive algorithm for rank-width of graphs and path-width/branch-width of matroids

Jeong, Ji Su; Kim, Eun Jung; Oum, Sang Il, Algorithmic Graph Theory on the Adriatic Coast (16-19 June 2015), University of Primorska, 2015-06-17

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

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

7
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

Discover

rss_1.0 rss_2.0 atom_1.0