Either/Or: Using Vertex Cover Structure in Designing FPT-Algorithms - The Case of k-Internal Spanning Tree. - Elena Prieto-Rodriguez; Christian Sloper (WADS, 2003)

Evolutionary Search of Thresholds for Robust Feature Set Selection: Application to the Analysis of Microarray Data. - Carlos Cotta; Christian Sloper; Pablo Moscato (EvoWorkshops, 2004)

Finding k Disjoint Triangles in an Arbitrary Graph. - Mike Fellows; Pinar Heggernes; Frances A. Rosamond; Christian Sloper; Jan Arne Telle (WG, 2004)

An eccentric coloring of trees. - Christian Sloper (Australas. J Comb., 2004)

Black Box and White Box Identification of Formal Languages Using Test Sets. - Marc Bezem; Christian Sloper; Tore Langholm (Grammars, 2004)

Fixed Parameter Set Splitting, Linear Kernel and Improved Running Time. - Daniel Lokshtanov; Christian Sloper (ACiD, 2005)

Reducing to Independent Set Structure – the Case of k-Internal Spanning Tree. - Elena Prieto-Rodriguez; Christian Sloper (Nord. J. Comput., 2005)

Towards a Taxonomy of Techniques for Designing Parameterized Algorithms. - Christian Sloper; Jan Arne Telle (IWPEC, 2006)

Looking at the stars. - Elena Prieto-Rodriguez; Christian Sloper (Theor. Comput. Sci., 2006)

An Overview of Techniques for Designing Parameterized Algorithms. - Christian Sloper; Jan Arne Telle (Comput. J., 2008)