1. Bhatt, S.N., Leighton, F.T.: A framework for solving VLSI graph layout problems. J. Comput. Syst. Sci. 28(2), 300–343 (1984)
2. Borndörfer, R., Schwartz, S., Surau, W.: Vertex Covering with Capacitated Trees. Eng. Tech. rep. 21–14. Takustr. 7, 14195 Berlin: ZIB (2021)
3. Lecture Notes in Computer Science;S Brandt,2017
4. Nguyen Bui, T., Jones, C.: Finding good approximate vertex and edge partitions is NP-hard. Inf. Process. Lett. 42(3) 153–159 (1992)
5. Casel, K., Friedrich, T., Issac, D., Niklanovits, A., Zeif, Z.: Balanced crown decomposition for connectivity constraints. arXiv:2011.0452, arXiv.preprint (2020)