7 citations · 12 across the 4 of their papers we have counts for
4 papers
A Faster Exact Algorithm for the Directed Maximum Leaf Spanning Tree Problem
Daniel Raible, Henning Fernau
Given a directed graph , the Directed Maximum Leaf Spanning Tree problem asks to compute a directed spanning tree (i.e., an out-branching) with as many leaves as possible.…
The Complexity of Probabilistic Lobbying
Daniel Binkele-Raible, Gábor Erdélyi, Henning Fernau +3
We propose models for lobbying in a probabilistic environment, in which an actor (called "The Lobby") seeks to influence voters' preferences of voting for or against multiple issue…
Exact Exponential Time Algorithms for Max Internal Spanning Tree
Henning Fernau, Serge Gaspers, Daniel Raible
We consider the NP-hard problem of finding a spanning tree with a maximum number of internal vertices. This problem is a generalization of the famous Hamiltonian Path problem. Our…
A New Upper Bound for Max-2-Sat: A Graph-Theoretic Approach
Daniel Raible, Henning Fernau
In {\sc MaxSat}, we ask for an assignment which satisfies the maximum number of clauses for a boolean formula in CNF. We present an algorithm yielding a run time upper bound of $O^…