1. R. Balasubramanian, M, R. Fellows, and V. Raman, An improved fixed parameter algorithm for vertex cover, Information Processing Letters 65, (1998), pp. 163–168.
2. R. Beigel and D. Eppstein, 3-coloring in time O(1.3446n): a no-MIS algorithm, Proc. 36th IEEE Symp. on Foundations of Computer Science, (1995), pp. 444–452.
3. Lect Notes Comput Sci;J. Chen,1999
4. DIMACS Workshop on Faster Exact Solutions for NP-Hard Problems, Princeton, February 23–24, 2000.
5. R. G. Downey, M. R. Fellows, and U. Stege, Parameterized complexity: A framework for systematically confronting computational intractability, AMS-DIMACS Proceedings Series 49, F. Roberts, J. Kratochvil, and J. Nesetril, eds., (1999), pp. 49–99.