The Complexity of Multiterminal Cuts
SIAM Journal on Computing
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Parameterized graph separation problems
Theoretical Computer Science - Parameterized and exact computation
A fixed-parameter algorithm for the directed feedback vertex set problem
Journal of the ACM (JACM)
Algorithms for multiterminal cuts
CSR'08 Proceedings of the 3rd international conference on Computer science: theory and applications
Proceedings of the forty-third annual ACM symposium on Theory of computing
Fixed-parameter tractability of multicut parameterized by the size of the cutset
Proceedings of the forty-third annual ACM symposium on Theory of computing
Clustering with local restrictions
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Fixed-parameter tractability of directed multiway cut parameterized by the size of the cutset
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
On multiway cut parameterized above lower bounds
IPEC'11 Proceedings of the 6th international conference on Parameterized and Exact Computation
Finding odd cycle transversals
Operations Research Letters
An improved parameterized algorithm for the minimum node multiway cut problem
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
Parameterized Complexity
Fixed-Parameter tractability of almost CSP problem with decisive relations
FAW-AAIM'12 Proceedings of the 6th international Frontiers in Algorithmics, and Proceedings of the 8th international conference on Algorithmic Aspects in Information and Management
| Hi-index | 0.00 |
The notion of "important separators" and bounding the number of such separators turned out to be a very useful technique in the design of fixed-parameter tractable algorithms for multi(way) cut problems. For example, the recent breakthrough result of Chen et al.[3] on the Directed Feedback Vertex Set problem can be also explained using this notion. In my talk, I will overview combinatorial and algorithmic results that can be obtained by studying such separators.