Y
Yngve Villanger
Researcher at University of Bergen
Publications - 104
Citations - 3031
Yngve Villanger is an academic researcher from University of Bergen. The author has contributed to research in topics: Chordal graph & Parameterized complexity. The author has an hindex of 31, co-authored 104 publications receiving 2828 citations.
Papers
More filters
Journal ArticleDOI
Improved algorithms for feedback vertex set problems
TL;DR: Improved parameterized algorithms for the feedback vertex set problem on both unweighted and weighted graphs are presented, both of which run in time O(5^kkn^2).
Proceedings ArticleDOI
Independent Set inP5-Free Graphs in Polynomial Time
TL;DR: The first polynomial-time algorithm for Independent Set on P5-free graphs was given in this paper, which is the first algorithm for the Independent Set problem in general.
Proceedings ArticleDOI
Finding Induced Subgraphs via Minimal Triangulations
Fedor V. Fomin,Yngve Villanger +1 more
TL;DR: In this article, it was shown that given an n-vertex graph G together with its set of potential maximal cliques, and an integer t, it is possible to find a maximum induced subgraph of treewidth t in G in time O(n −1.734601^n)
Proceedings ArticleDOI
Kernel(s) for Problems with No Kernel: On Out-Trees with Many Leaves
TL;DR: The first polynomial kernel is given for {\sc Rooted $k$-Leaf-Out-Branching}, a variant of {\sc $k $-Le leaf-out-branching} where the root of the tree searched for is also a part of the input, and is obtained using extremal combinatorics.
Journal ArticleDOI
Exact Algorithms for Treewidth and Minimum Fill-In
TL;DR: It is shown that the treewidth and the minimum fill-in of an $n$-vertex graph can be computed in time $\mathcal{O}(1.8899^n)$ and the running time of the algorithms can be reduced to 1.4142 minutes.