1. Abu-Khzam, F.N.: A kernelization algorithm for $$d$$-hitting set. J. Comput. Syst. Sci. 76(7), 524–531 (2010)
2. An, S., Oh, E.: Feedback vertex set on geometric intersection graphs. In: Proceedings of the 32nd International Symposium on Algorithms and Computation (ISAAC 2021), pp. 47:1–47:12 (2021)
3. Bandyapadhyay, S., Lochet, W., Lokshtanov, D., Saurabh, S., Xue, J.: Subexponential parameterized algorithms for cut and cycle hitting problems on H-minor-free graphs$$\star $$. In: Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 2063–2084. SIAM (2022)
4. Bandyapadhyay, S., Lochet, W., Lokshtanov, D., Saurabh, S., Xue, J.: True contraction decomposition and almost eth-tight bipartization for unit-disk graphs. In: 38th International Symposium on Computational Geometry (SoCG 2022), vol. 224, pp. 11:1–11:16 (2022)
5. de Berg, M., Bodlaender, H.L., Kisfaludi-Bak, S., Marx, D., Van Der Zanden, T.C.: A framework for exponential-time-hypothesis-tight algorithms and lower bounds in geometric intersection graphs. SIAM J. Comput. 49(6), 1291–1331 (2020)