Joachim Kneis

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