1. Alber, J., Fernau, H., and Niedermeier., R. (2001a). Graph separators: a parameterized view. In Proc. 7th COCOON 2001, pages 318–327. Springer-Verlag LNCS 2108.
2. Alber, J., Fernau, H., and Niedermeier., R. (2001b). Parameterized complexity: exponential speed-up for planar graph problems. In Proc. 28th ICALP 2001, pages 261–272. Springer-Verlag LNCS 2076.
3. Cai, L. and Juedes, D. W. (2001). On the existence of subexponential parameterized algorithms. revised version of: Subexponential parameterized algorithms collapse the W-hierarchy. In Proc. 28th ICALP 2001, pages 273–284. Springer-Verlag LNCS 2076.
4. Clark, B. N., Colbourn, C. J., and Johnson, D. S. (1990). Unit disk graphs. Discrete Math., 86 (1–3): 165–177.
5. Downey, R. G. and Fellows, M. R. (1995). Fixed-parameter tractability and completeness II: On completeness for W[1]. Theor. Comput. Sci., 141: 109–131.