1. Abu-Khzam, F.N.: A kernelization algorithm for d-Hitting set. J. Comput. Syst. Sci. 76(7), 524–531 (2010)
2. Aspvall, B., Plass, M.F., Tarjan, R.E.: A linear-time algorithm for testing the truth of certain quantified Boolean formulas. Inf. Process. Lett. 8(3), 121–123 (1979)
3. Béjar, R., Hähnle, R., Manyà, F.: A modular reduction of regular logic to classical logic. In: Proceedings of 31st International Symposium on Multiple-Valued Logic, pp. 221–226 (2001)
4. Bringmann, K., Hermelin, D., Mnich, M., van Leeuwen, E.J.: Parameterized complexity dichotomy for Steiner multicut. In: Proceedings of 32nd STACS, pp. 157–170 (2015)
5. Coppersmith, D., Vishkin, U.: Solving NP-hard problems in ‘almost trees’: vertex cover. Discrete App. Math. 10(1), 27–45 (1985)