• Publications
  • Influence
An exact algorithm for the Maximum Leaf Spanning Tree problem
TLDR
We present an algorithm to solve the Maximum Leaf Spanning Tree problem from an exponential time viewpoint, where it is equivalent to the Connected Dominating Set problem. Expand
  • 65
  • 6
  • PDF
Kernel(s) for Problems with No Kernel: On Out-Trees with Many Leaves
TLDR
The {\sc $k$-Leaf Out-Branching} problem is to find an out-branching, that is a rooted oriented spanning tree, with at least $k leaves in a given digraph. Expand
  • 70
  • 5
Improved Algorithms and Complexity Results for Power Domination in Graphs
TLDR
The Power Dominating Set problem is a variant of the classical domination problem in graphs: Given an undirected graph G=(V,E), find a minimum P⊆V such that all vertices in V are “observed” by P. Herein, a vertex observes itself and all its neighbors, and if an observed vertex has all but one of its neighbors observed, then the remaining neighbor becomes observed. Expand
  • 45
  • 5
A New Upper Bound for Max-2-SAT: A Graph-Theoretic Approach
TLDR
We present an algorithm yielding a run time upper bound of ${\mathcal{O}}^*({2^{\frac{K}{6.2158}}})$ for Max-2-Sat (each clause contains at most 2 literals), where every formula is constrained to have at most two literals. Expand
  • 14
  • 5
  • PDF
Improved Algorithms and Complexity Results for Power Domination in Graphs
Abstract The NP-complete Power Dominating Set problem is an “electric power networks variant” of the classical domination problem in graphs: Given an undirected graph G=(V,E), find a minimum-size setExpand
  • 52
  • 4
  • PDF
Kernel(s) for problems with no kernel: On out-trees with many leaves
TLDR
The k-Leaf Out-Branching problem is to find an out-branching, that is a rooted oriented spanning tree, with at least k leaves in a given digraph. Expand
  • 57
  • 3
  • PDF
A parameterized perspective on packing paths of length two
TLDR
We study (vertex-disjoint) packings of paths of length two (i.e., of P2’s) in graphs under a parameterized perspective. Expand
  • 26
  • 2
  • PDF
Exact and Parameterized Algorithms for Max Internal Spanning Tree
TLDR
We consider the $\mathcal{NP}$-hard problem of finding a spanning tree with a maximum number of internal vertices. Expand
  • 22
  • 2
An Amortized Search Tree Analysis for k-Leaf Spanning Tree
TLDR
We present an algorithm which finds a spanning tree with at least k leaves in time O *(3.4575 k ) which improves the currently best algorithm. Expand
  • 18
  • 1
An Exact Algorithm for the Maximum Leaf Spanning Tree Problem
TLDR
We study the Maximum Leaf Spanning Tree problem from an exact exponential time point of view, where it is equivalent to the Connected Dominating Set problem. Expand
  • 14
  • 1