Publisher
Springer Berlin Heidelberg
Reference21 articles.
1. Bateni, M., Hajiaghayi, M., Klein, P.N., Mathieu, C.: A polynomial-time approximation scheme for planar multiway cut. In: Proc. ACM-SIAM Symp. on Discrete Algorithms, pp. 639–655 (2012)
2. Bentz, C.: On the complexity of the multicut problem in bounded tree-width graphs and digraphs. Disc. Applied Math. 156(10), 1908–1917 (2008)
3. Bentz, C.: A simple algorithm for multicuts in planar graphs with outer terminals. Disc. Applied Math. 157, 1959–1964 (2009)
4. Bentz, C.: A polynomial-time algorithm for planar multicuts with few source-sink pairs. In: International Workshop on Parameterized and Exact Computation, pp. 109–119 (2012), Also in arXiv:1206.3999
5. Chambers, E.W., Colin de Verdière, É., Erickson, J., Lazarus, F., Whittlesey, K.: Splitting (complicated) surfaces is hard. Comput. Geom.: Theory Appl. 41(1–2), 94–110 (2008)