The following pages link to Daniel Binkele-Raible (Q450577):
Displaying 14 items.
- An exact exponential-time algorithm for the directed maximum leaf spanning tree problem (Q450578) (← links)
- A new upper bound for Max-2-SAT: A graph-theoretic approach (Q616992) (← links)
- Breaking the \(2^{n}\)-barrier for irredundance: two lines of attack (Q635734) (← links)
- The complexity of probabilistic lobbying (Q1662102) (← links)
- Parameterized measure \& conquer for problems with no small kernels (Q1759684) (← links)
- Exact and parameterized algorithms for \textsc{Max Internal Spanning Tree} (Q1939668) (← links)
- Exact exponential-time algorithms for finding bicliques (Q1944039) (← links)
- An exact exponential time algorithm for \textsc{Power} \textsc{Dominating} \textsc{Set} (Q2429350) (← links)
- Packing paths: recycling saves time (Q2446295) (← links)
- Enumerate and Measure: Improving Parameter Budget Management (Q3058690) (← links)
- Kernel(s) for problems with no kernel (Q3189081) (← links)
- A Parameterized Route to Exact Puzzles: Breaking the 2 n -Barrier for Irredundance (Q3563012) (← links)
- A Faster Exact Algorithm for the Directed Maximum Leaf Spanning Tree Problem (Q3569757) (← links)
- (Q5413909) (← links)
