5 citations · 11 across the 23 of their papers we have counts for
Showing cs.DMShow all
3 papers · 1 filter
cs.DM2023
The Parameterised Complexity of Integer Multicommodity Flow
Hans L. Bodlaender, Isja Mannens, Jelle J. Oostveen +2
The Integer Multicommodity Flow problem has been studied extensively in the literature. However, from a parameterised perspective, mostly special cases, such as the Disjoint Paths…
cs.DM2022
Complexity Framework for Forbidden Subgraphs II: Edge Subdivision and the "H"-graphs
Vadim Lozin, Barnaby Martin, Sukanya Pandey +4
For a fixed set of graphs, a graph is -subgraph-free if does not contain any as a (not necessarily induced) subgraph. A recently propo…
cs.DM2012★ 5 cited
Induced Disjoint Paths in Claw-Free Graphs
Petr A. Golovach, Daniel Paulusma, Erik Jan van Leeuwen
Paths P1,...,Pk in a graph G=(V,E) are said to be mutually induced if for any 1 <= i < j <= k, Pi and Pj have neither common vertices nor adjacent vertices (except perhaps their en…