Jisu Jeong

activity

20132023

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

19 citations · 50 across the 10 of their papers we have counts for

collaborators

Showing cs.DSShow all

2 papers · 1 filter

cs.DS2015★ 4 cited

Maximum matching width: new characterizations and a fast algorithm for dominating set

Jisu Jeong, Sigve Hortemo Sæther, Jan Arne Telle

We give alternative definitions for maximum matching width, e.g. a graph $G$ has $mmw (G) \leq k$ if and only if it is a subgraph of a chordal graph $H$ and for every…

cs.DS2015★ 13 cited

The "art of trellis decoding" is fixed-parameter tractable

Jisu Jeong, Eun Jung Kim, Sang-il Oum

Given n subspaces of a finite-dimensional vector space over a fixed finite field $F$ , we wish to find a linear layout $V_{1}, V_{2}, \dots, V_{n}$ of the subspaces such that $\dim(…