Directed multicut is <i>W</i>[1]-hard, even for four terminal pairs

Article Details
Title:	Directed multicut is W[1]-hard, even for four terminal pairs
Article URLs:	https://doi.org/10.1137/1.9781611974331.ch81 http://dl.acm.org/citation.cfm?id=2884516
Alternative Article URLs:
Authors:	Marcin Pilipczuk	University of Warsaw, Poland
Authors:	Magnus Wahlström	Royal Holloway University of London, UK
Sharing:	Unknown
Verification:	Authors have not verified information
Artifact Evaluation Badge:	none
Artifact URLs:
Artifact Correspondence Email Addresses:
NSF Award Numbers:
DBLP Key:	conf/soda/PilipczukW16
Author Comments:

ACM Symposium on Discrete Algorithms, SODA 2016