Publisher
Springer International Publishing
Reference18 articles.
1. Augeri, C.J., Ali, H.H.: New graph-based algorithms for partitioning VLSI circuits. In: 2004 IEEE International Symposium on Circuits and Systems (IEEE Cat. No. 04CH37512), vol. 4, pp. IV-IV. IEEE (2004)
2. Chekuri, C., Quanrud, K., Chao, X.: LP relaxation and tree packing for minimum $$ k $$-cut. SIAM J. Discret. Math. 34(2), 1334–1353 (2020)
3. Corneil, D.G.: The complexity of generalized clique packing. Discrete Appl. Math. 12(3), 233–239 (1985)
4. Cygan, M., et al.: Randomized contractions meet lean decompositions. ACM Trans. Algorithms, 17(1), 6:1–6:30 (2021)
5. Downey, R.G., Estivill-Castro, V., Fellows, M., Prieto, E., Rosamund, F.A.: Cutting up is hard to do: the parameterised complexity of $$ k $$-cut and related problems. Electron. Notes Theor. Comput. Sci. 78, 209–222 (2003)