Joachim Kneis

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

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2016
Are there any good digraph width measures?
J. Comb. Theory B, 2016

2014
Digraph width measures in parameterized algorithmics.
Discret. Appl. Math., 2014

2011
An exact algorithm for the Maximum Leaf Spanning Tree problem.
Theor. Comput. Sci., 2011

Breaking the 2<sup>n</sup>-barrier for Irredundance: Two lines of attack.
J. Discrete Algorithms, 2011

Courcelle's theorem - A game-theoretic approach.
Discret. Optim., 2011

A New Algorithm for Finding Trees with Many Leaves.
Algorithmica, 2011

2010
A Parameterized Route to Exact Puzzles: Breaking the 2<sup><i>n</i></sup>-Barrier for Irredundance.
Proceedings of the Algorithms and Complexity, 7th International Conference, 2010

2009
Intuitive algorithms.
PhD thesis, 2009

Approximation hardness of deadline-TSP reoptimization.
Theor. Comput. Sci., 2009

A Bound on the Pathwidth of Sparse Graphs with Applications to Exact Algorithms.
SIAM J. Discret. Math., 2009

Breaking the 2^n-Barrier for Irredundance: A Parameterized Route to Solving Exact Puzzles
CoRR, 2009

A Fine-grained Analysis of a Simple Independent Set Algorithm.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2009

2008
A Practical Approach to Courcelle's Theorem.
Proceedings of the International Doctoral Workshop on Mathematical and Engineering Methods in Computer Science, 2008

Improved Upper Bounds for Partial Vertex Cover.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2008

2007
The Parameterized Approximability of TSP with Deadlines.
Theory Comput. Syst., 2007

On the Approximability of TSP on Local Modifications of Optimally Solved Instances.
Algorithmic Oper. Res., 2007

Partial vs. Complete Domination: t-Dominating Set.
Proceedings of the SOFSEM 2007: Theory and Practice of Computer Science, 2007

2006
Parameterized power domination complexity.
Inf. Process. Lett., 2006

Divide-and-Color.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2006

On the Approximation Hardness of Some Generalizations of TSP.
Proceedings of the Algorithm Theory, 2006

Intuitive Algorithms and t-Vertex Cover.
Proceedings of the Algorithms and Computation, 17th International Symposium, 2006

Reusing Optimal TSP Solutions for Locally Modified Input Instances.
Proceedings of the Fourth IFIP International Conference on Theoretical Computer Science (TCS 2006), 2006

2005
Algorithms Based on the Treewidth of Sparse Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2005

On the Parameterized Complexity of Exact Satisfiability Problems.
Proceedings of the Mathematical Foundations of Computer Science 2005, 2005

2003
Generic Programming for Scientific Computing in C++, Java, and C#.
Proceedings of the Advanced Parallel Programming Technologies, 5th International Workshop, 2003


  Loading...