54 citations · 64 across the 8 of their papers we have counts for
Showing 2013Show all
2 papers · 1 filter
cs.DS2013
Finding small patterns in permutations in linear time
Sylvain Guillemot, Dániel Marx
Given two permutations and , the \textsc{Permutation Pattern} problem asks if is a subpattern of . We show that the problem can be solved in time $2^{O(\ell^2\log \el…
cs.DS2013
A faster FPT algorithm for Bipartite Contraction
Sylvain Guillemot, Dániel Marx
The \textsc{Bipartite Contraction} problem is to decide, given a graph and a parameter , whether we can can obtain a bipartite graph from by at most edge contraction…