The following pages link to Daniel Raible (Q653319):
Displayed 14 items.
- An exact algorithm for the maximum leaf spanning tree problem (Q653320) (← links)
- A parameterized perspective on packing paths of length two (Q849135) (← links)
- Improved algorithms and complexity results for power domination in graphs (Q958210) (← links)
- An Amortized Search Tree Analysis for k-Leaf Spanning Tree (Q3401120) (← links)
- Power Domination in $\mathcal{O}^*(1.7548^n)$ Using Reference Search Trees (Q3596713) (← links)
- A New Upper Bound for Max-2-SAT: A Graph-Theoretic Approach (Q3599157) (← links)
- Searching Trees: An Essay (Q3630190) (← links)
- The Complexity of Probabilistic Lobbying (Q3645307) (← links)
- An Exact Algorithm for the Maximum Leaf Spanning Tree Problem (Q3656859) (← links)
- Kernel(s) for Problems with No Kernel: On Out-Trees with Many Leaves (Q5389996) (← links)
- Exact Algorithms for Maximum Acyclic Subgraph on a Superclass of Cubic Graphs (Q5452161) (← links)
- Fundamentals of Computation Theory (Q5492926) (← links)
- A Parameterized Perspective on Packing Paths of Length Two (Q5505643) (← links)
- Exact and Parameterized Algorithms for Max Internal Spanning Tree (Q5851097) (← links)