Search the dblp DataBase

Publications of Author

1. Jens Gerlach, Joachim Kneis
   Generic Programming for Scientific Computing in C++, Java, and C#. [Citation Graph (0, 0)][DBLP]
   APPT, 2003, pp:301-310 [Conf]
   
2. Joachim Kneis, Daniel Mölle, Stefan Richter, Peter Rossmanith
   Intuitive Algorithms and t-Vertex Cover. [Citation Graph (0, 0)][DBLP]
   ISAAC, 2006, pp:598-607 [Conf]
   
3. Joachim Kneis, Daniel Mölle, Stefan Richter, Peter Rossmanith
   On the Parameterized Complexity of Exact Satisfiability Problems. [Citation Graph (0, 0)][DBLP]
   MFCS, 2005, pp:568-579 [Conf]
   
4. Hans-Joachim Böckenhauer, Juraj Hromkovic, Joachim Kneis, Joachim Kupke
   On the Approximation Hardness of Some Generalizations of TSP. [Citation Graph (0, 0)][DBLP]
   SWAT, 2006, pp:184-195 [Conf]
   
5. Joachim Kneis, Daniel Mölle, Stefan Richter, Peter Rossmanith
   Algorithms Based on the Treewidth of Sparse Graphs. [Citation Graph (0, 0)][DBLP]
   WG, 2005, pp:385-396 [Conf]
   
6. Joachim Kneis, Daniel Mölle, Stefan Richter, Peter Rossmanith
   Divide-and-Color. [Citation Graph (0, 0)][DBLP]
   WG, 2006, pp:58-67 [Conf]
   
7. Joachim Kneis, Daniel Mölle, Stefan Richter, Peter Rossmanith
   Parameterized power domination complexity. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2006, v:98, n:4, pp:145-149 [Journal]
   
8. Joachim Kneis, Daniel Mölle, Peter Rossmanith
   Partial vs. Complete Domination: t-Dominating Set. [Citation Graph (0, 0)][DBLP]
   SOFSEM (1), 2007, pp:367-376 [Conf]
   
9. 
   A Parameterized Route to Exact Puzzles: Breaking the 2ⁿ-Barrier for Irredundance. [Citation Graph (, )][DBLP]
   
   
10. 
    A Fine-grained Analysis of a Simple Independent Set Algorithm. [Citation Graph (, )][DBLP]
    
    
11. 
    Reusing Optimal TSP Solutions for Locally Modified Input Instances. [Citation Graph (, )][DBLP]
    
    
12. 
    A New Algorithm for Finding Trees with Many Leaves. [Citation Graph (, )][DBLP]
    
    
13. 
    An Exact Algorithm for the Maximum Leaf Spanning Tree Problem. [Citation Graph (, )][DBLP]
    
    
14. 
    On Digraph Width Measures in Parameterized Algorithmics. [Citation Graph (, )][DBLP]
    
    
15. 
    Improved Upper Bounds for Partial Vertex Cover. [Citation Graph (, )][DBLP]
    
    
16. 
    Breaking the 2^n-Barrier for Irredundance: A Parameterized Route to Solving Exact Puzzles [Citation Graph (, )][DBLP]
    
    
17. 
    Are there any good digraph width measures? [Citation Graph (, )][DBLP]
    
    
18. 
    A Practical Approach to Courcelle's Theorem. [Citation Graph (, )][DBLP]