Efficient Algorithms for k-Terminal Cuts on Planar Graphs
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Note: A simple algorithm for multicuts in planar graphs with outer terminals
Discrete Applied Mathematics
Disjoint paths in sparse graphs
Discrete Applied Mathematics
A polynomial-time approximation scheme for planar multiway cut
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Revisiting a simple algorithm for the planar multiterminal cut problem
Operations Research Letters
FPT suspects and tough customers: open problems of downey and fellows
The Multivariate Algorithmic Revolution and Beyond
Solving planar k-terminal cut in O(nc√k) time
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
A tight lower bound for planar multiway cut with fixed number of terminals
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
A polynomial-time algorithm for planar multicuts with few source-sink pairs
IPEC'12 Proceedings of the 7th international conference on Parameterized and Exact Computation
Hi-index | 0.04 |