Sang-il Oum

List of publications from the DBLP Bibliography Server - FAQ
Other views: by type - by year (modern) - classic-C

Ask others: ACM DL/Guide -

- CSB - MetaPress - Google - Bing - Yahoo

	2013
c5		Jisu Jeong, O-joung Kwon, Sang-il Oum: Excluded vertex-minors for graphs of linear rank-width at most k.. STACS 2013: 221-232
	2012
j18		Maria Chudnovsky, Sang-il Oum, Paul D. Seymour: Finding minimum clique capacity. Combinatorica 32(3): 283-287 (2012)
j17		Choongbum Lee, Joonkyung Lee, Sang-il Oum: Rank-width of random graphs. Journal of Graph Theory 70(3): 339-347 (2012)
c4		Tomás Gavenciak, Daniel Král, Sang-il Oum: Deciding First Order Properties of Matroids. ICALP (2) 2012: 239-250
i3		O-joung Kwon, Sang-il Oum: Graphs of Small Rank-width are Pivot-minors of Graphs of Small Tree-width. CoRR abs/1203.3606 (2012)
i2		Tony Huynh, Andrew D. King, Sang-il Oum, Maryam Verdian-Rizi: Strongly even cycle decomposable graphs. CoRR abs/1209.0160 (2012)
	2011
j16		Sang-il Oum: Perfect Matchings in Claw-free Cubic Graphs. Electr. J. Comb. 18(1) (2011)
j15		Sang-il Oum: Rank-width and Well-quasi-ordering of Skew-Symmetric or Symmetric Matrices (extended abstract). Electronic Notes in Discrete Mathematics 38: 693-698 (2011)
i1		Tomás Gavenciak, Daniel Král, Sang-il Oum: Deciding first order logic properties of matroids. CoRR abs/1108.5457 (2011)
	2010
j14		Fedor V. Fomin, Sang-il Oum, Dimitrios M. Thilikos: Rank-width and tree-width of H-minor-free graphs. Eur. J. Comb. 31(7): 1617-1628 (2010)
	2009
j13		Sang-il Oum: Computing rank-width exactly. Inf. Process. Lett. 109(13): 745-748 (2009)
j12		Sang-il Oum: Excluding a bipartite circle graph from line graphs. Journal of Graph Theory 60(3): 183-203 (2009)
j11		Jim Geelen, Sang-il Oum: Circle graph obstructions under pivoting. Journal of Graph Theory 61(1): 1-11 (2009)
	2008
j10		Petr Hlinený, Sang-il Oum, Detlef Seese, Georg Gottlob: Width Parameters Beyond Tree-width and their Applications. Comput. J. 51(3): 326-362 (2008)
j9		Sang-il Oum: Rank-width is less than or equal to branch-width. Journal of Graph Theory 57(3): 239-244 (2008)
j8		Petr Hlinený, Sang-il Oum: Finding Branch-Decompositions and Rank-Decompositions. SIAM J. Comput. 38(3): 1012-1032 (2008)
j7		Sang-il Oum: Rank-Width and Well-Quasi-Ordering. SIAM J. Discrete Math. 22(2): 666-682 (2008)
j6		Sang-il Oum: Approximating rank-width and clique-width quickly. ACM Transactions on Algorithms 5(1) (2008)
	2007
j5		Bruno Courcelle, Sang-il Oum: Vertex-minors, monadic second-order logic, and a conjecture by Seese. J. Comb. Theory, Ser. B 97(1): 91-126 (2007)
j4		Sang-il Oum, Paul D. Seymour: Testing branch-width. J. Comb. Theory, Ser. B 97(3): 385-393 (2007)
c3		Petr Hlinený, Sang-il Oum: Finding Branch-Decompositions and Rank-Decompositions. ESA 2007: 163-174
	2006
j3		Sang-il Oum, Paul D. Seymour: Approximating clique-width and branch-width. J. Comb. Theory, Ser. B 96(4): 514-528 (2006)
c2		Sang-il Oum, Paul D. Seymour: Certifying large branch-width. SODA 2006: 810-813
	2005
j2		Sang-il Oum: Rank-width and Well-quasi-ordering of Skew-symmetric Matrices: (extended abstract). Electronic Notes in Discrete Mathematics 22: 281-285 (2005)
j1		Sang-il Oum: Rank-width and vertex-minors. J. Comb. Theory, Ser. B 95(1): 79-100 (2005)
c1		Sang-il Oum: Approximating Rank-Width and Clique-Width Quickly. WG 2005: 49-58

Coauthor Index

1	Maria Chudnovsky	[j18]
2	Bruno Courcelle	[j5]
3	Fedor V. Fomin	[j14]
4	Tomás Gavenciak	[c4] [i1]
5	James F. Geelen (Jim Geelen)	[j11]
6	Georg Gottlob	[j10]
7	Petr Hlinený	[j10] [j8] [c3]
8	Tony Huynh	[i2]
9	Jisu Jeong	[c5]
10	Andrew D. King	[i2]
11	Daniel Král (Daniel Král')	[c4] [i1]
12	O-joung Kwon	[c5] [i3]
13	Choongbum Lee	[j17]
14	Joonkyung Lee	[j17]
15	Detlef Seese	[j10]
16	Paul D. Seymour	[j18] [j4] [j3] [c2]
17	Dimitrios M. Thilikos	[j14]
18	Maryam Verdian-Rizi	[i2]

Colors in the list of coauthors

Last update Wed May 22 20:36:56 2013 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page