Search the dblp DataBase

Publications of Author

1. Jiong Guo, Rolf Niedermeier, Daniel Raible
   Improved Algorithms and Complexity Results for Power Domination in Graphs. [Citation Graph (0, 0)][DBLP]
   FCT, 2005, pp:172-184 [Conf]
   
2. Henning Fernau, Daniel Raible
   Alliances in Graphs: a Complexity-Theoretic Study. [Citation Graph (0, 0)][DBLP]
   SOFSEM (2), 2007, pp:61-70 [Conf]
   
3. 
   Exact Elimination of Cycles in Graphs. [Citation Graph (, )][DBLP]
   
   
4. 
   Power Domination in O^*(1.7548ⁿ) Using Reference Search Trees. [Citation Graph (, )][DBLP]
   
   
5. 
   An Exact Algorithm for the Maximum Leaf Spanning Tree Problem. [Citation Graph (, )][DBLP]
   
   
6. 
   A New Upper Bound for Max-2-SAT: A Graph-Theoretic Approach. [Citation Graph (, )][DBLP]
   
   
7. 
   An Amortized Search Tree Analysis for k-Leaf Spanning Tree. [Citation Graph (, )][DBLP]
   
   
8. 
   Kernel(s) for Problems with No Kernel: On Out-Trees with Many Leaves. [Citation Graph (, )][DBLP]
   
   
9. 
   Searching Trees: An Essay. [Citation Graph (, )][DBLP]
   
   
10. 
    Exact and Parameterized Algorithms for Max Internal Spanning Tree. [Citation Graph (, )][DBLP]
    
    
11. 
    Exact Algorithms for Maximum Acyclic Subgraph on a Superclass of Cubic Graphs. [Citation Graph (, )][DBLP]
    
    
12. 
    A Parameterized Perspective on Packing Paths of Length Two. [Citation Graph (, )][DBLP]
    
    
13. 
    Packing Paths: Recycling Saves Time. [Citation Graph (, )][DBLP]
    
    
14. 
    Exact Exponential-Time Algorithms for Finding Bicliques in a Graph. [Citation Graph (, )][DBLP]
    
    
15. 
    The Complexity of Probabilistic Lobbying. [Citation Graph (, )][DBLP]
    
    
16. 
    Improved Algorithms and Complexity Results for Power Domination in Graphs. [Citation Graph (, )][DBLP]
    
    
17. 
    A New Upper Bound for Max-2-Sat: A Graph-Theoretic Approach [Citation Graph (, )][DBLP]
    
    
18. 
    A Parameterized Perspective on P₂-Packings [Citation Graph (, )][DBLP]
    
    
19. 
    Kernel(s) for Problems With no Kernel: On Out-Trees With Many Leaves [Citation Graph (, )][DBLP]
    
    
20. 
    Exact Exponential Time Algorithms for Max Internal Spanning Tree [Citation Graph (, )][DBLP]
    
    
21. 
    The Complexity of Probabilistic Lobbying [Citation Graph (, )][DBLP]
    
    
22. 
    Breaking the 2^n-Barrier for Irredundance: A Parameterized Route to Solving Exact Puzzles [Citation Graph (, )][DBLP]
    
    
23. 
    A Faster Exact Algorithm for the Directed Maximum Leaf Spanning Tree Problem [Citation Graph (, )][DBLP]