1. Bentert, M., Haag, R., Hofer, C., Koana, T., Nichterlein, A.: Parameterized complexity of min-power asymmetric connectivity. Theory Comput. Syst. 64(7), 1158–1182 (2020)
2. Bodlaender, H.L., Drange, P.G., Dregi, M.S., Fomin, F.V., Lokshtanov, D., Pilipczuk, M.: A c$${}^{\text{k}}$$ n 5-approximation algorithm for treewidth. SIAM J. Comput. 45(2), 317–378 (2016)
3. Bodlaender, H.L., Jansen, B.M.P., Kratsch, S.: Preprocessing for treewidth: a combinatorial analysis through kernelization. SIAM J. Discret. Math. 27(4), 2108–2142 (2013)
4. Bonnet, É., Kim, E.J., Thomassé, S., Watrigant, R.: Twin-width I: tractable FO model checking. In: 61st IEEE Annual Symposium on Foundations of Computer Science, FOCS 2020, Durham, NC, USA, 16–19 November 2020, pp. 601–612. IEEE (2020)
5. Bredereck, R., Heeger, K., Knop, D., Niedermeier, R.: Parameterized complexity of stable roommates with ties and incomplete lists through the lens of graph parameters. In: Lu, P., Zhang, G. (eds.) 30th International Symposium on Algorithms and Computation, ISAAC 2019, 8–11 December 2019, Shanghai University of Finance and Economics, Shanghai, China. LIPIcs, vol. 149, pp. 44:1–44:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2019)