Efficient Implementation of a Minimal Triangulation Algorithm. - Pinar Heggernes; Yngve Villanger (ESA, 2002)

A Vertex Incremental Approach for Dynamically Maintaining Chordal Graphs. - Anne Berry; Pinar Heggernes; Yngve Villanger (ISAAC, 2003)

Simple and Efficient Modifications of Elimination Orderings. - Pinar Heggernes; Yngve Villanger (PARA, 2004)

Minimal Interval Completions. - Pinar Heggernes; Karol Suchan; Ioan Todinca; Yngve Villanger (ESA, 2005)

Computing minimal triangulations in time O(nalpha log n) = o(n2.376). - Pinar Heggernes; Jan Arne Telle; Yngve Villanger (SODA, 2005)

Computing Minimal Triangulations in Time O(nalpha log n) = o(n 2.376). - Pinar Heggernes; Jan Arne Telle; Yngve Villanger (SIAM J. Discret. Math., 2005)

Improved Exponential-Time Algorithms for Treewidth and Minimum Fill-In. - Yngve Villanger (LATIN, 2006)

A vertex incremental approach for maintaining chordality. - Anne Berry; Pinar Heggernes; Yngve Villanger (Discret. Math., 2006)

Lex M versus MCS-M. - Yngve Villanger (Discret. Math., 2006)

A wide-range algorithm for minimal triangulation from an arbitrary ordering. - Anne Berry; Jean Paul Bordat; Pinar Heggernes; Geneviève Simonet; Yngve Villanger (J. Algorithms, 2006)

Characterizing Minimal Interval Completions. - Pinar Heggernes; Karol Suchan; Ioan Todinca; Yngve Villanger (STACS, 2007)

Interval completion with few edges. - Pinar Heggernes; Christophe Paul; Jan Arne Telle; Yngve Villanger (STOC, 2007)

Improved Algorithms for the Feedback Vertex Set Problems. - Jianer Chen; Fedor V. Fomin; Yang Liu 002; Songjian Lu; Yngve Villanger (WADS, 2007)

Treewidth Computation and Extremal Combinatorics. - Fedor V. Fomin; Yngve Villanger (ICALP (1), 2008)

Faster Parameterized Algorithms for Minimum Fill-In. - Hans L. Bodlaender; Pinar Heggernes; Yngve Villanger (ISAAC, 2008)

Capacitated Domination and Covering: A Parameterized Perspective. - Michael Dom; Daniel Lokshtanov; Saket Saurabh 001; Yngve Villanger (IWPEC, 2008)

Parameterized Complexity for Domination Problems on Degenerate Graphs. - Petr A. Golovach; Yngve Villanger (WG, 2008)

Exact Algorithms for Treewidth and Minimum Fill-In. - Fedor V. Fomin; Dieter Kratsch; Ioan Todinca; Yngve Villanger (SIAM J. Comput., 2008)

Fast Minimal Triangulation. - Yngve Villanger (Encyclopedia of Algorithms, 2008)

Local Search: Is Brute-Force Avoidable? - Michael R. Fellows; Frances A. Rosamond; Fedor V. Fomin; Daniel Lokshtanov; Saket Saurabh 001; Yngve Villanger (IJCAI, 2009)

Computing Pathwidth Faster Than 2n. - Karol Suchan; Yngve Villanger (IWPEC, 2009)

Kernel(s) for Problems with No Kernel: On Out-Trees with Many Leaves. - Henning Fernau; Fedor V. Fomin; Daniel Lokshtanov; Daniel Raible 001; Saket Saurabh 001; Yngve Villanger (STACS, 2009)

Interval Completion Is Fixed Parameter Tractable. - Yngve Villanger; Pinar Heggernes; Christophe Paul; Jan Arne Telle (SIAM J. Comput., 2009)

A Parameterized Algorithm for Chordal Sandwich. - Pinar Heggernes; Federico Mancini 001; Jesper Nederlof; Yngve Villanger (CIAC, 2010)

Induced Subgraph Isomorphism on Interval and Proper Interval Graphs. - Pinar Heggernes; Daniel Meister 001; Yngve Villanger (ISAAC (2), 2010)

Proper Interval Vertex Deletion. - Yngve Villanger (IPEC, 2010)

Finding Induced Subgraphs via Minimal Triangulations. - Fedor V. Fomin; Yngve Villanger (STACS, 2010)

Solving Capacitated Dominating Set by Using Covering by Subsets and Maximum Matching. - Mathieu Liedloff; Ioan Todinca; Yngve Villanger (WG, 2010)

A Quartic Kernel for Pathwidth-One Vertex Deletion. - Geevarghese Philip; Venkatesh Raman 001; Yngve Villanger (WG, 2010)

Exact Algorithm for the Maximum Induced Planar Subgraph Problem. - Fedor V. Fomin; Ioan Todinca; Yngve Villanger (ESA, 2011)

Parameterized Complexity of Vertex Deletion into Perfect Graph Classes. - Pinar Heggernes; Pim van 't Hof; Bart M. P. Jansen; Stefan Kratsch; Yngve Villanger (FCT, 2011)

Minimum Fill-in of Sparse Graphs: Kernelization and Approximation. - Fedor V. Fomin; Geevarghese Philip; Yngve Villanger (FSTTCS, 2011)

Enumerating Minimal Subset Feedback Vertex Sets. - Fedor V. Fomin; Pinar Heggernes; Dieter Kratsch; Charis Papadopoulos; Yngve Villanger (WADS, 2011)

Subexponential fixed-parameter tractability of cluster editing - Fedor V. Fomin; Stefan Kratsch; Marcin Pilipczuk; Michal Pilipczuk; Yngve Villanger (CoRR, 2011)

Maximum Number of Minimal Feedback Vertex Sets in Chordal Graphs and Cographs. - Jean-François Couturier 001; Pinar Heggernes; Pim van 't Hof; Yngve Villanger (COCOON, 2012)

A Polynomial Kernel for Proper Interval Vertex Deletion. - Fedor V. Fomin; Saket Saurabh 001; Yngve Villanger (ESA, 2012)

FPT Algorithms for Domination in Biclique-Free Graphs. - Jan Arne Telle; Yngve Villanger (ESA, 2012)

k-Gap Interval Graphs. - Fedor V. Fomin; Serge Gaspers; Petr A. Golovach; Karol Suchan; Stefan Szeider; Erik Jan van Leeuwen; Martin Vatshelle; Yngve Villanger (LATIN, 2012)

Subexponential parameterized algorithm for minimum fill-in. - Fedor V. Fomin; Yngve Villanger (SODA, 2012)

On the Parameterized Complexity of Finding Separators with Non-Hereditary Properties. - Pinar Heggernes; Pim van 't Hof; Dániel Marx; Neeldhara Misra; Yngve Villanger (WG, 2012)

Generating All Minimal Edge Dominating Sets with Incremental-Polynomial Delay - Petr A. Golovach; Pinar Heggernes; Dieter Kratsch; Yngve Villanger (CoRR, 2012)

Largest Chordal and Interval Subgraphs Faster Than 2 n. - Ivan Bliznets; Fedor V. Fomin; Michal Pilipczuk; Yngve Villanger (ESA, 2013)

On the Parameterised Complexity of String Morphism Problems. - Henning Fernau; Markus L. Schmid; Yngve Villanger (FSTTCS, 2013)

An Incremental Polynomial Time Algorithm to Enumerate All Minimal Edge Dominating Sets. - Petr A. Golovach; Pinar Heggernes; Dieter Kratsch; Yngve Villanger (ICALP (1), 2013)

A Multivariate Analysis of Some DFA Problems. - Henning Fernau; Pinar Heggernes; Yngve Villanger (LATA, 2013)

Tight bounds for Parameterized Complexity of Cluster Editing. - Fedor V. Fomin; Stefan Kratsch; Marcin Pilipczuk; Michal Pilipczuk; Yngve Villanger (STACS, 2013)

Searching for better fill-in. - Fedor V. Fomin; Yngve Villanger (STACS, 2013)

Treewidth and Pathwidth Parameterized by the Vertex Cover Number. - Mathieu Chapelle; Mathieu Liedloff; Ioan Todinca; Yngve Villanger (WADS, 2013)

Connecting Terminals and 2-Disjoint Connected Subgraphs. - Jan Arne Telle; Yngve Villanger (WG, 2013)

Proper Interval Vertex Deletion. - Pim van 't Hof; Yngve Villanger (Algorithmica, 2013)

TREEWIDTH and PATHWIDTH parameterized by vertex cover - Mathieu Chapelle; Mathieu Liedloff; Ioan Todinca; Yngve Villanger (CoRR, 2013)

Large induced subgraphs via triangulations and CMSO. - Fedor V. Fomin; Ioan Todinca; Yngve Villanger (SODA, 2014)

Independent Set in P5-Free Graphs in Polynomial Time. - Daniel Lokshtanov; Martin Vatshelle; Yngve Villanger (SODA, 2014)

Exploring Subexponential Parameterized Complexity of Completion Problems. - Pål Grønås Drange; Fedor V. Fomin; Michal Pilipczuk; Yngve Villanger (STACS, 2014)

Maximal Induced Matchings in Triangle-Free Graphs. - Manu Basavaraju; Pinar Heggernes; Pim van 't Hof; Reza Saei; Yngve Villanger (WG, 2014)

Tight bounds for parameterized complexity of Cluster Editing with a small number of clusters. - Fedor V. Fomin; Stefan Kratsch; Marcin Pilipczuk; Michal Pilipczuk; Yngve Villanger (J. Comput. Syst. Sci., 2014)

Output-Polynomial Enumeration on Graphs of Bounded (Local) Linear MIM-Width. - Petr A. Golovach; Pinar Heggernes; Mamadou Moustapha Kanté; Dieter Kratsch; Sigve Hortemo Sæther; Yngve Villanger (ISAAC, 2015)

A multi-parameter analysis of hard problems on deterministic finite automata. - Henning Fernau; Pinar Heggernes; Yngve Villanger (J. Comput. Syst. Sci., 2015)

Induced Subgraph Isomorphism on proper interval and bipartite permutation graphs. - Pinar Heggernes; Pim van 't Hof; Daniel Meister 001; Yngve Villanger (Theor. Comput. Sci., 2015)

Exploring the Subexponential Complexity of Completion Problems. - Pål Grønås Drange; Fedor V. Fomin; Michal Pilipczuk; Yngve Villanger (ACM Trans. Comput. Theory, 2015)

Largest Chordal and Interval Subgraphs Faster than $$2^n$$ 2 n. - Ivan Bliznets; Fedor V. Fomin; Michal Pilipczuk; Yngve Villanger (Algorithmica, 2016)

Enumerating minimal dominating sets in chordal bipartite graphs. - Petr A. Golovach; Pinar Heggernes; Mamadou Moustapha Kanté; Dieter Kratsch; Yngve Villanger (Discret. Appl. Math., 2016)

Fast Minimal Triangulation. - Yngve Villanger (Encyclopedia of Algorithms, 2016)

Minimal dominating sets in interval graphs and trees. - Petr A. Golovach; Pinar Heggernes; Mamadou Moustapha Kanté; Dieter Kratsch; Yngve Villanger (Discret. Appl. Math., 2017)

FPT algorithms for domination in sparse graphs and beyond. - Jan Arne Telle; Yngve Villanger (Theor. Comput. Sci., 2019)