1. Partitioning into graphs with only small components;Guoli Noga Alon;J. Comb. Theory, Ser. B,2003
2. New tools and connections for exponential-time approximation;Nikhil Bansal;Algorithmica,2019
3. Deciding twin-width at most 4 is NP-complete;Pierre Berg�;49th International Colloquium on Automata, Languages, and Programming, ICALP 2022,2022
4. Twin-width II: small classes;�douard Bonnet;Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA),1977