1. R. Barbanchon. Planar Hamiltonian problems and linear parsimonious reductions. Tech. report, Les Cahiers du GREYC 1, 2001. (postscript available at http://www.info.unicaen.fr/algo/publications ).
2. R. Barbanchon. The problems Sat and Hamilton are equivalent under linear parsimonious reductions in the plane. Tech. report, Les Cahiers du GREYC 4, 2001. (postscript available at http://www.info.unicaen.fr/algo/publications ).
3. R. Barbanchon and E. Grandjean. Local problems and linear time. Tech. report, Les Cahiers du GREYC 8, 2001. (postscript available at http://www.info.unicaen.fr/algo/publications ).
4. Nadia Creignou. The class of problems that are linearly equivalent to Satisfiability or a uniform method for proving NP-completeness. Theoretical Computer Science, 145(1–2):111–145, 1995.
5. M. de Rougemont. Second order and inductive definability on finite structures. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, 33:47–63, 1987.