Yngve Villanger

Baker Hughes (United States) — United States

Computer Science · Physical Sciences

27h-index2.2kcitations107works0.02yr avg
OpenAlex↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Advanced Graph Theory Research(96), Complexity and Algorithms in Graphs(69), Graph Labeling and Dimension Problems(23), Optimization and Search Problems(18), Algorithms and Data Compression(16)

Publications107 total

Non-Intrusive Monitoring of Subsea Boosting Systems
Offshore Technology Conference·2019· 1 cited
Output-Polynomial Enumeration on Graphs of Bounded (Local) Linear MIM-Width
Algorithmica·2017· 21 cited
Issue Information
Journal of Graph Theory·2016Open Access
Exploring Subexponential Parameterized Complexity of Completion Problems∗
2016
Minimal dominating sets in interval graphs and trees
Discrete Applied Mathematics·2016· 15 cited
Fast Minimal Triangulation
Encyclopedia of Algorithms·2016
Maximal Induced Matchings in Triangle-Free Graphs
Journal of Graph Theory·2015· 11 cited
Output-Polynomial Enumeration on Graphs of Bounded (Local) Linear\n MIM-Width
arXiv (Cornell University)·2015Open Access
Output-Polynomial Enumeration on Graphs of Bounded (Local) Linear MIM-Width
arXiv (Cornell University)·2015· 2 citedOpen Access
Exploring the Subexponential Complexity of Completion Problems
ACM Transactions on Computation Theory·2015· 27 cited
Largest Chordal and Interval Subgraphs Faster than $$2^n$$ 2 n
Algorithmica·2015· 10 citedOpen Access
On the Parameterised Complexity of String Morphism Problems
Theory of Computing Systems·2015· 25 cited
Treewidth and Pathwidth parameterized by the vertex cover number
Discrete Applied Mathematics·2015· 4 cited
Large Induced Subgraphs via Triangulations and CMSO
SIAM Journal on Computing·2015· 90 cited
Output-Polynomial Enumeration on Graphs of Bounded (Local) Linear MIM-Width
Lecture notes in computer science·2015· 2 cited
Enumerating minimal dominating sets in chordal bipartite graphs
Discrete Applied Mathematics·2015· 27 cited
A multi-parameter analysis of hard problems on deterministic finite automata
Journal of Computer and System Sciences·2014· 19 cited
Induced Subgraph Isomorphism on proper interval and bipartite permutation graphs
Theoretical Computer Science·2014· 22 cited
Searching for better fill-in
Journal of Computer and System Sciences·2014
Tight bounds for parameterized complexity of Cluster Editing with a small number of clusters
Journal of Computer and System Sciences·2014· 48 cited
page 1 of 6Next →

Frequent Co-authors

Fedor V. Fomin(20), Pinar Heggernes(19), Ioan Todinca(6), Saket Saurabh(6), Dieter Kratsch(6), Daniel Lokshtanov(5), Jan Arne Telle(5), Petr A. Golovach(5), Henning Fernau(4), Stefan Kratsch(4), Michał Pilipczuk(4), Pim van ’t Hof(4), Anne Berry(3), Karol Suchan(3), Jianer Chen(2), Songjian Lu(2), Daniel Lokshantov(2), Martin Vatshelle(2), Christophe Paul(2), Michael R. Fellows(2)