Yngve Villanger

According to our database, Yngve Villanger authored at least 65 papers between 2002 and 2019.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2019

FPT algorithms for domination in sparse graphs and beyond.

Jan Arne Telle, Yngve Villanger

Theor. Comput. Sci., 2019

2017

Minimal dominating sets in interval graphs and trees.

Petr A. Golovach, Pinar Heggernes, Mamadou Moustapha Kanté, Dieter Kratsch, Yngve Villanger

Discret. Appl. Math., 2017

2016

Fast Minimal Triangulation.

Yngve Villanger

Encyclopedia of Algorithms, 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

Largest Chordal and Interval Subgraphs Faster than $$2^n$$ 2 n.

Ivan Bliznets, Fedor V. Fomin, Michal Pilipczuk, Yngve Villanger

Algorithmica, 2016

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

Induced Subgraph Isomorphism on proper interval and bipartite permutation graphs.

Pinar Heggernes, Pim van 't Hof, Daniel Meister, Yngve Villanger

Theor. Comput. Sci., 2015

A multi-parameter analysis of hard problems on deterministic finite automata.

Henning Fernau, Pinar Heggernes, Yngve Villanger

J. Comput. Syst. Sci., 2015

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

Proceedings of the Algorithms and Computation - 26th International Symposium, 2015

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

Maximal Induced Matchings in Triangle-Free Graphs.

Manu Basavaraju, Pinar Heggernes, Pim van 't Hof, Reza Saei, Yngve Villanger

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2014

Exploring Subexponential Parameterized Complexity of Completion Problems.

Pål Grønås Drange, Fedor V. Fomin, Michal Pilipczuk, Yngve Villanger

Proceedings of the 31st International Symposium on Theoretical Aspects of Computer Science, 2014

Independent Set in <i>P</i>₅-Free Graphs in Polynomial Time.

Daniel Lokshtanov, Martin Vatshelle, Yngve Villanger

Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

Large induced subgraphs via triangulations and CMSO.

Fedor V. Fomin, Ioan Todinca, Yngve Villanger

Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

2013

TREEWIDTH and PATHWIDTH parameterized by vertex cover

Mathieu Chapelle, Mathieu Liedloff, Ioan Todinca, Yngve Villanger

CoRR, 2013

Proper Interval Vertex Deletion.

Pim van 't Hof, Yngve Villanger

Algorithmica, 2013

Connecting Terminals and 2-Disjoint Connected Subgraphs.

Jan Arne Telle, Yngve Villanger

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2013

Treewidth and Pathwidth Parameterized by the Vertex Cover Number.

Mathieu Chapelle, Mathieu Liedloff, Ioan Todinca, Yngve Villanger

Proceedings of the Algorithms and Data Structures - 13th International Symposium, 2013

Searching for better fill-in.

Fedor V. Fomin, Yngve Villanger

Proceedings of the 30th International Symposium on Theoretical Aspects of Computer Science, 2013

Tight bounds for Parameterized Complexity of Cluster Editing.

Fedor V. Fomin, Stefan Kratsch, Marcin Pilipczuk, Michal Pilipczuk, Yngve Villanger

Proceedings of the 30th International Symposium on Theoretical Aspects of Computer Science, 2013

A Multivariate Analysis of Some DFA Problems.

Henning Fernau, Pinar Heggernes, Yngve Villanger

Proceedings of the Language and Automata Theory and Applications, 2013

An Incremental Polynomial Time Algorithm to Enumerate All Minimal Edge Dominating Sets.

Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Yngve Villanger

Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

On the Parameterised Complexity of String Morphism Problems.

Henning Fernau, Markus L. Schmid, Yngve Villanger

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2013

Largest Chordal and Interval Subgraphs Faster Than 2 n.

Ivan Bliznets, Fedor V. Fomin, Michal Pilipczuk, Yngve Villanger

Proceedings of the Algorithms - ESA 2013, 2013

2012

Generating All Minimal Edge Dominating Sets with Incremental-Polynomial Delay

Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Yngve Villanger

CoRR, 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

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2012

Subexponential parameterized algorithm for minimum fill-in.

Fedor V. Fomin, Yngve Villanger

Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 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

Proceedings of the LATIN 2012: Theoretical Informatics, 2012

FPT Algorithms for Domination in Biclique-Free Graphs.

Jan Arne Telle, Yngve Villanger

Proceedings of the Algorithms - ESA 2012, 2012

A Polynomial Kernel for Proper Interval Vertex Deletion.

Fedor V. Fomin, Saket Saurabh, Yngve Villanger

Proceedings of the Algorithms - ESA 2012, 2012

Maximum Number of Minimal Feedback Vertex Sets in Chordal Graphs and Cographs.

Jean-François Couturier, Pinar Heggernes, Pim van 't Hof, Yngve Villanger

Proceedings of the Computing and Combinatorics - 18th Annual International Conference, 2012

2011

Subexponential fixed-parameter tractability of cluster editing

Fedor V. Fomin, Stefan Kratsch, Marcin Pilipczuk, Michal Pilipczuk, Yngve Villanger

CoRR, 2011

Enumerating Minimal Subset Feedback Vertex Sets.

Fedor V. Fomin, Pinar Heggernes, Dieter Kratsch, Charis Papadopoulos, Yngve Villanger

Proceedings of the Algorithms and Data Structures - 12th International Symposium, 2011

Minimum Fill-in of Sparse Graphs: Kernelization and Approximation.

Fedor V. Fomin, Geevarghese Philip, Yngve Villanger

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2011

Parameterized Complexity of Vertex Deletion into Perfect Graph Classes.

Pinar Heggernes, Pim van 't Hof, Bart M. P. Jansen, Stefan Kratsch, Yngve Villanger

Proceedings of the Fundamentals of Computation Theory - 18th International Symposium, 2011

Exact Algorithm for the Maximum Induced Planar Subgraph Problem.

Fedor V. Fomin, Ioan Todinca, Yngve Villanger

Proceedings of the Algorithms - ESA 2011, 2011

2010

A Quartic Kernel for Pathwidth-One Vertex Deletion.

Geevarghese Philip, Venkatesh Raman, Yngve Villanger

Proceedings of the Graph Theoretic Concepts in Computer Science, 2010

Solving Capacitated Dominating Set by Using Covering by Subsets and Maximum Matching.

Mathieu Liedloff, Ioan Todinca, Yngve Villanger

Proceedings of the Graph Theoretic Concepts in Computer Science, 2010

Finding Induced Subgraphs via Minimal Triangulations.

Fedor V. Fomin, Yngve Villanger

Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science, 2010

Proper Interval Vertex Deletion.

Yngve Villanger

Proceedings of the Parameterized and Exact Computation - 5th International Symposium, 2010

Induced Subgraph Isomorphism on Interval and Proper Interval Graphs.

Pinar Heggernes, Daniel Meister, Yngve Villanger

Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

A Parameterized Algorithm for Chordal Sandwich.

Pinar Heggernes, Federico Mancini, Jesper Nederlof, Yngve Villanger

Proceedings of the Algorithms and Complexity, 7th International Conference, 2010

2009

Interval Completion Is Fixed Parameter Tractable.

Yngve Villanger, Pinar Heggernes, Christophe Paul, Jan Arne Telle

SIAM J. Comput., 2009

Kernel(s) for Problems with No Kernel: On Out-Trees with Many Leaves.

Henning Fernau, Fedor V. Fomin, Daniel Lokshtanov, Daniel Raible, Saket Saurabh, Yngve Villanger

Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science, 2009

Computing Pathwidth Faster Than 2^<i>n</i>.

Karol Suchan, Yngve Villanger

Proceedings of the Parameterized and Exact Computation, 4th International Workshop, 2009

Local Search: Is Brute-Force Avoidable?

Michael R. Fellows, Frances A. Rosamond, Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Yngve Villanger

Proceedings of the IJCAI 2009, 2009

2008

Fast Minimal Triangulation.

Yngve Villanger

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Exact Algorithms for Treewidth and Minimum Fill-In.

Fedor V. Fomin, Dieter Kratsch, Ioan Todinca, Yngve Villanger

SIAM J. Comput., 2008

Parameterized Complexity for Domination Problems on Degenerate Graphs.

Petr A. Golovach, Yngve Villanger

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2008

Capacitated Domination and Covering: A Parameterized Perspective.

Michael Dom, Daniel Lokshtanov, Saket Saurabh, Yngve Villanger

Proceedings of the Parameterized and Exact Computation, Third International Workshop, 2008

Faster Parameterized Algorithms for Minimum Fill-In.

Hans L. Bodlaender, Pinar Heggernes, Yngve Villanger

Proceedings of the Algorithms and Computation, 19th International Symposium, 2008

Treewidth Computation and Extremal Combinatorics.

Fedor V. Fomin, Yngve Villanger

Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

2007

Improved Algorithms for the Feedback Vertex Set Problems.

Jianer Chen, Fedor V. Fomin, Yang Liu, Songjian Lu, Yngve Villanger

Proceedings of the Algorithms and Data Structures, 10th International Workshop, 2007

Interval completion with few edges.

Pinar Heggernes, Christophe Paul, Jan Arne Telle, Yngve Villanger

Proceedings of the 39th Annual ACM Symposium on Theory of Computing, 2007

Characterizing Minimal Interval Completions.

Pinar Heggernes, Karol Suchan, Ioan Todinca, Yngve Villanger

Proceedings of the STACS 2007, 2007

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

Lex M versus MCS-M.

Yngve Villanger

Discret. Math., 2006

A vertex incremental approach for maintaining chordality.

Anne Berry, Pinar Heggernes, Yngve Villanger

Discret. Math., 2006

Improved Exponential-Time Algorithms for Treewidth and Minimum Fill-In.

Yngve Villanger

Proceedings of the LATIN 2006: Theoretical Informatics, 2006

2005

Computing Minimal Triangulations in Time <i>O</i>(<i>n</i>^alpha <i>log n</i>) = <i>o</i>(<i>n</i> ^2.376).

Pinar Heggernes, Jan Arne Telle, Yngve Villanger

SIAM J. Discret. Math., 2005

Computing minimal triangulations in time O(n^alpha log n) = o(n^2.376).

Pinar Heggernes, Jan Arne Telle, Yngve Villanger

Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

Minimal Interval Completions.

Pinar Heggernes, Karol Suchan, Ioan Todinca, Yngve Villanger

Proceedings of the Algorithms, 2005

2004

Simple and Efficient Modifications of Elimination Orderings.

Pinar Heggernes, Yngve Villanger

Proceedings of the Applied Parallel Computing, 2004

2003

A Vertex Incremental Approach for Dynamically Maintaining Chordal Graphs.

Anne Berry, Pinar Heggernes, Yngve Villanger

Proceedings of the Algorithms and Computation, 14th International Symposium, 2003

2002

Efficient Implementation of a Minimal Triangulation Algorithm.

Pinar Heggernes, Yngve Villanger

Proceedings of the Algorithms, 2002