1. Bienstock, D.: On the complexity of testing for odd holes and induced odd paths. Discrete Math. 90(1), 85–92 (1991). https://doi.org/10.1016/0012-365X(91)90098-M. http://www.sciencedirect.com/science/article/pii/0012365X9190098M
2. Bienstock, D.: On the complexity of testing for odd holes and induced odd paths. Discrete Math. 90, 85–92 (1991). Discrete Math. 102(1), 109 (1992). https://doi.org/10.1016/0012-365X(92)90357-L. http://www.sciencedirect.com/science/article/pii/0012365X9290357L
3. Bodlaender, H.L., Cygan, M., Kratsch, S., Nederlof, J.: Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth. Inf. Comput. 243, 86–111 (2015). 40th International Colloquium on Automata, Languages and Programming (ICALP 2013). https://doi.org/10.1016/j.ic.2014.12.008. http://www.sciencedirect.com/science/article/pii/S0890540114001606
4. Bodlaender, H.L., Downey, R.G., Fellows, M.R., Hermelin, D.: On problems without polynomial kernels. J. Comput. Syst. Sci. 75(8), 423–434 (2009). https://doi.org/10.1016/j.jcss.2009.04.001. http://www.sciencedirect.com/science/article/pii/S0022000009000282
5. Bodlaender, H.L., Jansen, B.M.P., Kratsch, S.: Cross-composition: a new technique for kernelization lower bounds. In: Proceedings of the 28th International Symposium on Theoretical Aspects of Computer Science (STACS), Volume 9 of LIPIcs, pp. 165–176 (2011)