Generic Programming for Scientific Computing in C++, Java, and C#. - Jens Gerlach; Joachim Kneis (APPT, 2003)

On the Parameterized Complexity of Exact Satisfiability Problems. - Joachim Kneis; Daniel Mölle; Stefan Richter 001; Peter Rossmanith (MFCS, 2005)

Algorithms Based on the Treewidth of Sparse Graphs. - Joachim Kneis; Daniel Mölle; Stefan Richter 001; Peter Rossmanith (WG, 2005)

Reusing Optimal TSP Solutions for Locally Modified Input Instances. - Hans-Joachim Böckenhauer; Luca Forlizzi; Juraj Hromkovic; Joachim Kneis; Joachim Kupke 002; Guido Proietti; Peter Widmayer (IFIP TCS, 2006)

Intuitive Algorithms and t-Vertex Cover. - Joachim Kneis; Daniel Mölle; Stefan Richter 001; Peter Rossmanith (ISAAC, 2006)

On the Approximation Hardness of Some Generalizations of TSP. - Hans-Joachim Böckenhauer; Juraj Hromkovic; Joachim Kneis; Joachim Kupke 002 (SWAT, 2006)

Divide-and-Color. - Joachim Kneis; Daniel Mölle; Stefan Richter 001; Peter Rossmanith (WG, 2006)

Parameterized power domination complexity. - Joachim Kneis; Daniel Mölle; Stefan Richter 001; Peter Rossmanith (Inf. Process. Lett., 2006)

Partial vs. Complete Domination: t-Dominating Set. - Joachim Kneis; Daniel Mölle; Peter Rossmanith (SOFSEM (1), 2007)

On the Approximability of TSP on Local Modifications of Optimally Solved Instances. - Hans-Joachim Böckenhauer; Luca Forlizzi; Juraj Hromkovic; Joachim Kneis; Joachim Kupke 002; Guido Proietti; Peter Widmayer (Algorithmic Oper. Res., 2007)

The Parameterized Approximability of TSP with Deadlines. - Hans-Joachim Böckenhauer; Juraj Hromkovic; Joachim Kneis; Joachim Kupke 002 (Theory Comput. Syst., 2007)

Improved Upper Bounds for Partial Vertex Cover. - Joachim Kneis; Alexander Langer; Peter Rossmanith (WG, 2008)

A Practical Approach to Courcelle's Theorem. - Joachim Kneis; Alexander Langer (MEMICS, 2008)

A Fine-grained Analysis of a Simple Independent Set Algorithm. - Joachim Kneis; Alexander Langer; Peter Rossmanith (FSTTCS, 2009)

Breaking the 2^n-Barrier for Irredundance: A Parameterized Route to Solving Exact Puzzles - Ljiljana Brankovic; Henning Fernau; Joachim Kneis; Dieter Kratsch; Alexander Langer; Mathieu Liedloff; Daniel Raible 001; Peter Rossmanith (CoRR, 2009)

A Bound on the Pathwidth of Sparse Graphs with Applications to Exact Algorithms. - Joachim Kneis; Daniel Mölle; Stefan Richter 001; Peter Rossmanith (SIAM J. Discret. Math., 2009)

Approximation hardness of deadline-TSP reoptimization. - Hans-Joachim Böckenhauer; Joachim Kneis; Joachim Kupke 002 (Theor. Comput. Sci., 2009)

Intuitive algorithms. - Joachim Kneis (2009)

A Parameterized Route to Exact Puzzles: Breaking the 2n-Barrier for Irredundance. - Daniel Binkele-Raible; Ljiljana Brankovic; Henning Fernau; Joachim Kneis; Dieter Kratsch; Alexander Langer; Mathieu Liedloff; Peter Rossmanith (CIAC, 2010)

A New Algorithm for Finding Trees with Many Leaves. - Joachim Kneis; Alexander Langer; Peter Rossmanith (Algorithmica, 2011)

Courcelle's theorem - A game-theoretic approach. - Joachim Kneis; Alexander Langer; Peter Rossmanith (Discret. Optim., 2011)

Breaking the 2n-barrier for Irredundance: Two lines of attack. - Daniel Binkele-Raible; Ljiljana Brankovic; Marek Cygan; Henning Fernau; Joachim Kneis; Dieter Kratsch; Alexander Langer; Mathieu Liedloff; Marcin Pilipczuk; Peter Rossmanith; Jakub Onufry Wojtaszczyk (J. Discrete Algorithms, 2011)

An exact algorithm for the Maximum Leaf Spanning Tree problem. - Henning Fernau; Joachim Kneis; Dieter Kratsch; Alexander Langer; Mathieu Liedloff; Daniel Raible 001; Peter Rossmanith (Theor. Comput. Sci., 2011)

Digraph width measures in parameterized algorithmics. - Robert Ganian; Petr Hlinený; Joachim Kneis; Alexander Langer; Jan Obdrzálek; Peter Rossmanith (Discret. Appl. Math., 2014)

Are there any good digraph width measures? - Robert Ganian; Petr Hlinený; Joachim Kneis; Daniel Meister 001; Jan Obdrzálek; Peter Rossmanith; Somnath Sikdar (J. Comb. Theory B, 2016)