1. Lecture Notes in Computer Science;D Marx,2013
2. Lecture Notes in Computer Science;D Marx,2012
3. Bodlaender, H.L., Nederlof, J., van der Zanden, T.C.: Subexponential time algorithms for embedding
$$H$$
-minor free graphs. In: Chatzigiannakis, I., Mitzenmacher, M., Rabani, Y., Sangiorgi, D. (eds.) 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016), vol. 55, Leibniz International Proceedings in Informatics (LIPIcs), Dagstuhl, Germany, Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, pp. 9: 1–9: 14 (2016)
4. Bodlaender, H.L., van Rooij, J.M.M.: Exact algorithms for Intervalizing Coloured Graphs. Theor. Comput. Syst. 58(2), 273–286 (2016)
5. Lecture Notes in Computer Science;HL Bodlaender,2015