Villanger Yngve

Yngve Villanger

Information about the author Yngve Villanger will soon be added to the site.
Found 4 papers in total
On the Parameterized Complexity of Finding Separators with Non-Hereditary Properties
On the Parameterized Complexity of Finding Separators with Non-Hereditary Properties
2015
We study the problem of finding small s – t separators that induce graphs having...
An Incremental Polynomial Time Algorithm to Enumerate All Minimal Edge Dominating Sets
An Incremental Polynomial Time Algorithm to Enumerate All Minimal Edge Dominating Sets
2015
We show that all minimal edge dominating sets of a graph can be generated in...
Proper Interval Vertex Deletion
Proper Interval Vertex Deletion
2013
The NP‐complete problem Proper Interval Vertex Deletion is to decide whether an...
Faster Parameterized Algorithms for Minimum Fill‐in
Faster Parameterized Algorithms for Minimum Fill‐in
2011
We present two parameterized algorithms for the Minimum Fill‐in problem, also...
Papers per page: