Subject
General Computer Science,Theoretical Computer Science
Reference26 articles.
1. New graph-based algorithms for partitioning VLSI circuits;Augeri,2004
2. LP relaxation and tree packing for minimum k-cut;Chekuri;SIAM J. Discrete Math.,2020
3. The complexity of generalized clique packing;Corneil;Discrete Appl. Math.,1985
4. Randomized contractions meet lean decompositions;Cygan;ACM Trans. Algorithms,2021
5. Cutting up is hard to do: the parameterised complexity of k-cut and related problems;Downey;Electron. Notes Theor. Comput. Sci.,2003