Solving Planar k -Terminal Cut in $O(n^{c \sqrt{k}})$ Time

This publication has 9 references indexed in Scilit:

• Revisiting a simple algorithm for the planar multiterminal cut problem
  Operations Research Letters, 2010
• Which Problems Have Strongly Exponential Complexity?
  Journal of Computer and System Sciences, 2001
• A Simple Algorithm for the Planar Multiway Cut Problem
  Journal of Algorithms, 2001
• Rounding algorithms for a geometric embedding of minimum multiway cut
  1999
• Optimal 3-Terminal Cuts and Linear Programming
  Lecture Notes in Computer Science, 1999
• The planar multiterminal cut problem
  Discrete Applied Mathematics, 1998
• An improved approximation algorithm for multiway cut
  1998
• The Complexity of Multiterminal Cuts
  SIAM Journal on Computing, 1994
• The complexity of multiway cuts (extended abstract)
  1992