20 citations · 118 across the 29 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2014
An exact characterization of tractable demand patterns for maximum disjoint path problems
Dániel Marx, Paul Wollan
We study the following general disjoint paths problem: given a supply graph , a set of terminals, a demand graph on the vertices , and an integer , t…
cs.DS2010★ 5 cited
Finding topological subgraphs is fixed-parameter tractable
Martin Grohe, Ken-ichi Kawarabayashi, Dániel Marx +1
We show that for every fixed undirected graph , there is a time algorithm that tests, given a graph , if contains as a topological subgraph (that is, a…