Joachim Kneis

Publication Activity (10 Years)

Years Active: 2003-2016
Publications (10 Years): 1

Top Venues

Discret. Appl. Math.

J. Comb. Theory, Ser. B

RWTH Aachen University (PHD)

Education History

RWTH Aachen University

PHD

Publications

Robert Ganian, Petr Hlinený, Joachim Kneis, Daniel Meister, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar
Are there any good digraph width measures? J. Comb. Theory, Ser. B 116 (2016)
Robert Ganian, Petr Hlinený, Joachim Kneis, Alexander Langer, Jan Obdrzálek, Peter Rossmanith
Digraph width measures in parameterized algorithmics. Discret. Appl. Math. 168 (2014)
Daniel Binkele-Raible, Ljiljana Brankovic, Marek Cygan, Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Marcin Pilipczuk, Peter Rossmanith, Jakub Onufry Wojtaszczyk
-barrier for Irredundance: Two lines of attack. J. Discrete Algorithms 9 (3) (2011)
Joachim Kneis, Alexander Langer, Peter Rossmanith
Courcelle's theorem - A game-theoretic approach. Discret. Optim. 8 (4) (2011)
Joachim Kneis, Alexander Langer, Peter Rossmanith
Courcelle's Theorem - A Game-Theoretic Approach CoRR (2011)
Joachim Kneis, Alexander Langer, Peter Rossmanith
A New Algorithm for Finding Trees with Many Leaves. Algorithmica 61 (4) (2011)
Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Daniel Raible, Peter Rossmanith
An exact algorithm for the Maximum Leaf Spanning Tree problem. Theor. Comput. Sci. 412 (45) (2011)
Daniel Binkele-Raible, Ljiljana Brankovic, Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Peter Rossmanith
-Barrier for Irredundance. CIAC (2010)
Robert Ganian, Petr Hlinený, Joachim Kneis, Daniel Meister, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar
Are There Any Good Digraph Width Measures? IPEC (2010)
Robert Ganian, Petr Hlinený, Joachim Kneis, Daniel Meister, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar
Are there any good digraph width measures? CoRR (2010)
Ljiljana Brankovic, Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Daniel Raible, Peter Rossmanith
Breaking the 2^n-Barrier for Irredundance: A Parameterized Route to Solving Exact Puzzles CoRR (2009)
Joachim Kneis, Alexander Langer, Peter Rossmanith
A Fine-grained Analysis of a Simple Independent Set Algorithm. FSTTCS (2009)
Joachim Kneis, Alexander Langer
A Practical Approach to Courcelle's Theorem. Electron. Notes Theor. Comput. Sci. 251 (2009)
Hans-Joachim Böckenhauer, Joachim Kneis, Joachim Kupke
Approximation hardness of deadline-TSP reoptimization. Theor. Comput. Sci. 410 (21-23) (2009)
Joachim Kneis, Daniel Mölle, Stefan Richter, Peter Rossmanith
A Bound on the Pathwidth of Sparse Graphs with Applications to Exact Algorithms. SIAM J. Discret. Math. 23 (1) (2009)
Robert Ganian, Petr Hlinený, Joachim Kneis, Alexander Langer, Jan Obdrzálek, Peter Rossmanith
On Digraph Width Measures in Parameterized Algorithmics. IWPEC (2009)
Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Daniel Raible, Peter Rossmanith
An Exact Algorithm for the Maximum Leaf Spanning Tree Problem. IWPEC (2009)
Joachim Kneis, Alexander Langer, Peter Rossmanith
Improved Upper Bounds for Partial Vertex Cover. WG (2008)
Joachim Kneis, Alexander Langer, Peter Rossmanith
A New Algorithm for Finding Trees with Many Leaves. ISAAC (2008)
Hans-Joachim Böckenhauer, Luca Forlizzi, Juraj Hromkovic, Joachim Kneis, Joachim Kupke, Guido Proietti, Peter Widmayer
On the Approximability of TSP on Local Modifications of Optimally Solved Instances. Algorithmic Oper. Res. 2 (2) (2007)
Hans-Joachim Böckenhauer, Juraj Hromkovic, Joachim Kneis, Joachim Kupke
The Parameterized Approximability of TSP with Deadlines. Theory Comput. Syst. 41 (3) (2007)
Joachim Kneis, Daniel Mölle, Peter Rossmanith
Partial vs. Complete Domination: t-Dominating Set. SOFSEM (1) (2007)
Joachim Kneis, Daniel Mölle, Stefan Richter, Peter Rossmanith
Divide-and-Color. WG (2006)
Hans-Joachim Böckenhauer, Juraj Hromkovic, Joachim Kneis, Joachim Kupke
On the Approximation Hardness of Some Generalizations of TSP. SWAT (2006)
Hans-Joachim Böckenhauer, Luca Forlizzi, Juraj Hromkovic, Joachim Kneis, Joachim Kupke, Guido Proietti, Peter Widmayer
Reusing Optimal TSP Solutions for Locally Modified Input Instances. IFIP TCS (2006)
Joachim Kneis, Daniel Mölle, Stefan Richter, Peter Rossmanith
Intuitive Algorithms and t-Vertex Cover. ISAAC (2006)
Joachim Kneis, Daniel Mölle, Stefan Richter, Peter Rossmanith
Parameterized power domination complexity. Inf. Process. Lett. 98 (4) (2006)
Joachim Kneis, Daniel Mölle, Stefan Richter, Peter Rossmanith
On the Parameterized Complexity of Exact Satisfiability Problems. MFCS (2005)
Joachim Kneis, Daniel Mölle, Stefan Richter, Peter Rossmanith
Algorithms Based on the Treewidth of Sparse Graphs. WG (2005)
Jens Gerlach, Joachim Kneis
Generic Programming for Scientific Computing in C++, Java, and C#. APPT (2003)

Joachim Kneis.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Joachim Kneis