Christian Sloper

According to our database, Christian Sloper authored at least 10 papers between 2003 and 2008.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2008

An Overview of Techniques for Designing Parameterized Algorithms.

Christian Sloper, Jan Arne Telle

Comput. J., 2008

2006

Looking at the stars.

Elena Prieto-Rodriguez, Christian Sloper

Theor. Comput. Sci., 2006

Towards a Taxonomy of Techniques for Designing Parameterized Algorithms.

Christian Sloper, Jan Arne Telle

Proceedings of the Parameterized and Exact Computation, Second International Workshop, 2006

2005

Reducing to Independent Set Structure -- the Case of k-Internal Spanning Tree.

Elena Prieto-Rodriguez, Christian Sloper

Nord. J. Comput., 2005

Fixed Parameter Set Splitting, Linear Kernel and Improved Running Time.

Daniel Lokshtanov, Christian Sloper

Proceedings of the Algorithms and Complexity in Durham 2005, 2005

2004

Black Box and White Box Identification of Formal Languages Using Test Sets.

Marc Bezem, Christian Sloper, Tore Langholm

Grammars, 2004

An eccentric coloring of trees.

Christian Sloper

Australas. J Comb., 2004

Finding k Disjoint Triangles in an Arbitrary Graph.

Mike Fellows, Pinar Heggernes, Frances A. Rosamond, Christian Sloper, Jan Arne Telle

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2004

Evolutionary Search of Thresholds for Robust Feature Set Selection: Application to the Analysis of Microarray Data.

Carlos Cotta, Christian Sloper, Pablo Moscato

Proceedings of the Applications of Evolutionary Computing, 2004

2003

Either/Or: Using Vertex Cover Structure in Designing FPT-Algorithms - The Case of k-Internal Spanning Tree.

Elena Prieto-Rodriguez, Christian Sloper

Proceedings of the Algorithms and Data Structures, 8th International Workshop, 2003