7 citations · 26 across the 17 of their papers we have counts for
Showing math.COShow all
3 papers · 1 filter
math.CO2015
Linear rank-width of distance-hereditary graphs II. Vertex-minor obstructions
Mamadou Moustapha Kanté, O-joung Kwon
In the companion paper [Linear rank-width of distance-hereditary graphs I. A polynomial-time algorithm, Algorithmica 78(1):342--377, 2017], we presented a characterization of the l…
math.CO2014
Linear rank-width of distance-hereditary graphs I. A polynomial-time algorithm
Isolde Adler, Mamadou Moustapha Kanté, O-joung Kwon
Linear rank-width is a linearized variation of rank-width, and it is deeply related to matroid path-width. In this paper, we show that the linear rank-width of every -vertex dis…
math.CO2013
Irrelevant Vertices for the Planar Disjoint Paths Problem
Isolde Adler, Stavros G. Kolliopoulos, Philipp Klaus Krause +3
The Disjoint Paths Problem asks, given a graph and a set of pairs of terminals , whether there is a collection of pairwise vertex-disjoi…