Joachim Kneis

According to our database, Joachim Kneis authored at least 25 papers between 2003 and 2016.

Collaborative distances:

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

2016

Are there any good digraph width measures?

Robert Ganian, Petr Hlinený, Joachim Kneis, Daniel Meister, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar

J. Comb. Theory B, 2016

2014

Digraph width measures in parameterized algorithmics.

Robert Ganian, Petr Hlinený, Joachim Kneis, Alexander Langer, Jan Obdrzálek, Peter Rossmanith

Discret. Appl. Math., 2014

2011

An exact algorithm for the Maximum Leaf Spanning Tree problem.

Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Daniel Raible, Peter Rossmanith

Theor. Comput. Sci., 2011

Breaking the 2ⁿ-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

Courcelle's theorem - A game-theoretic approach.

Joachim Kneis, Alexander Langer, Peter Rossmanith

Discret. Optim., 2011

A New Algorithm for Finding Trees with Many Leaves.

Joachim Kneis, Alexander Langer, Peter Rossmanith

Algorithmica, 2011

2010

A Parameterized Route to Exact Puzzles: Breaking the 2^<i>n</i>-Barrier for Irredundance.

Daniel Binkele-Raible, Ljiljana Brankovic, Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Peter Rossmanith

Proceedings of the Algorithms and Complexity, 7th International Conference, 2010

2009

Intuitive algorithms.

Joachim Kneis

PhD thesis, 2009

Approximation hardness of deadline-TSP reoptimization.

Hans-Joachim Böckenhauer, Joachim Kneis, Joachim Kupke

Theor. Comput. Sci., 2009

A Bound on the Pathwidth of Sparse Graphs with Applications to Exact Algorithms.

Joachim Kneis, Daniel Mölle, Stefan Richter, Peter Rossmanith

SIAM J. Discret. Math., 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, Peter Rossmanith

CoRR, 2009

A Fine-grained Analysis of a Simple Independent Set Algorithm.

Joachim Kneis, Alexander Langer, Peter Rossmanith

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2009

2008

A Practical Approach to Courcelle's Theorem.

Joachim Kneis, Alexander Langer

Proceedings of the International Doctoral Workshop on Mathematical and Engineering Methods in Computer Science, 2008

Improved Upper Bounds for Partial Vertex Cover.

Joachim Kneis, Alexander Langer, Peter Rossmanith

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

2007

The Parameterized Approximability of TSP with Deadlines.

Hans-Joachim Böckenhauer, Juraj Hromkovic, Joachim Kneis, Joachim Kupke

Theory Comput. Syst., 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, Guido Proietti, Peter Widmayer

Algorithmic Oper. Res., 2007

Partial vs. Complete Domination: t-Dominating Set.

Joachim Kneis, Daniel Mölle, Peter Rossmanith

Proceedings of the SOFSEM 2007: Theory and Practice of Computer Science, 2007

2006

Parameterized power domination complexity.

Joachim Kneis, Daniel Mölle, Stefan Richter, Peter Rossmanith

Inf. Process. Lett., 2006

Divide-and-Color.

Joachim Kneis, Daniel Mölle, Stefan Richter, Peter Rossmanith

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

On the Approximation Hardness of Some Generalizations of TSP.

Hans-Joachim Böckenhauer, Juraj Hromkovic, Joachim Kneis, Joachim Kupke

Proceedings of the Algorithm Theory, 2006

Intuitive Algorithms and t-Vertex Cover.

Joachim Kneis, Daniel Mölle, Stefan Richter, Peter Rossmanith

Proceedings of the Algorithms and Computation, 17th International Symposium, 2006

Reusing Optimal TSP Solutions for Locally Modified Input Instances.

Hans-Joachim Böckenhauer, Luca Forlizzi, Juraj Hromkovic, Joachim Kneis, Joachim Kupke, Guido Proietti, Peter Widmayer

Proceedings of the Fourth IFIP International Conference on Theoretical Computer Science (TCS 2006), 2006

2005

Algorithms Based on the Treewidth of Sparse Graphs.

Joachim Kneis, Daniel Mölle, Stefan Richter, Peter Rossmanith

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

On the Parameterized Complexity of Exact Satisfiability Problems.

Joachim Kneis, Daniel Mölle, Stefan Richter, Peter Rossmanith

Proceedings of the Mathematical Foundations of Computer Science 2005, 2005

2003

Generic Programming for Scientific Computing in C++, Java, and C#.

Jens Gerlach, Joachim Kneis

Proceedings of the Advanced Parallel Programming Technologies, 5th International Workshop, 2003