Yngve Villanger

Publication Activity (10 Years)

Years Active: 2002-2019
Publications (10 Years): 8

Top Topics

Subgraph Isomorphism

Parameterized Complexity

Maximum Matching

Top Venues

J. Comput. Syst. Sci.

Discret. Appl. Math.

Publications

Jan Arne Telle, Yngve Villanger
FPT algorithms for domination in sparse graphs and beyond. Theor. Comput. Sci. 770 (2019)
Petr A. Golovach, Pinar Heggernes, Mamadou Moustapha Kanté, Dieter Kratsch, Sigve Hortemo Sæther, Yngve Villanger
Output-Polynomial Enumeration on Graphs of Bounded (Local) Linear MIM-Width. Algorithmica 80 (2) (2018)
Mathieu Chapelle, Mathieu Liedloff, Ioan Todinca, Yngve Villanger
Treewidth and Pathwidth parameterized by the vertex cover number. Discret. Appl. Math. 216 (2017)
Petr A. Golovach, Pinar Heggernes, Mamadou Moustapha Kanté, Dieter Kratsch, Yngve Villanger
Minimal dominating sets in interval graphs and trees. Discret. Appl. Math. 216 (2017)
Manu Basavaraju, Pinar Heggernes, Pim van 't Hof, Reza Saei, Yngve Villanger
Maximal Induced Matchings in Triangle-Free Graphs. J. Graph Theory 83 (3) (2016)
Petr A. Golovach, Pinar Heggernes, Mamadou Moustapha Kanté, Dieter Kratsch, Yngve Villanger
Enumerating minimal dominating sets in chordal bipartite graphs. Discret. Appl. Math. 199 (2016)
Ivan Bliznets, Fedor V. Fomin, Michal Pilipczuk, Yngve Villanger
Largest Chordal and Interval Subgraphs Faster than $$2^n$$ 2 n. Algorithmica 76 (2) (2016)
Henning Fernau, Markus L. Schmid, Yngve Villanger
On the Parameterised Complexity of String Morphism Problems. Theory Comput. Syst. 59 (1) (2016)
Petr A. Golovach, Pinar Heggernes, Mamadou Moustapha Kanté, Dieter Kratsch, Sigve Hortemo Sæther, Yngve Villanger
Output-Polynomial Enumeration on Graphs of Bounded (Local) Linear MIM-Width. CoRR (2015)
Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Yngve Villanger
An Incremental Polynomial Time Algorithm to Enumerate All Minimal Edge Dominating Sets. Algorithmica 72 (3) (2015)
Petr A. Golovach, Pinar Heggernes, Mamadou Moustapha Kanté, Dieter Kratsch, Sigve Hortemo Sæther, Yngve Villanger
Output-Polynomial Enumeration on Graphs of Bounded (Local) Linear MIM-Width. ISAAC (2015)
Pål Grønås Drange, Fedor V. Fomin, Michal Pilipczuk, Yngve Villanger
Exploring the Subexponential Complexity of Completion Problems. ACM Trans. Comput. Theory 7 (4) (2015)
Henning Fernau, Pinar Heggernes, Yngve Villanger
A multi-parameter analysis of hard problems on deterministic finite automata. J. Comput. Syst. Sci. 81 (4) (2015)
Fedor V. Fomin, Geevarghese Philip, Yngve Villanger
Minimum Fill-in of Sparse Graphs: Kernelization and Approximation. Algorithmica 71 (1) (2015)
Pinar Heggernes, Pim van 't Hof, Dániel Marx, Neeldhara Misra, Yngve Villanger
On the Parameterized Complexity of Finding Separators with Non-Hereditary Properties. Algorithmica 72 (3) (2015)
Fedor V. Fomin, Ioan Todinca, Yngve Villanger
Large Induced Subgraphs via Triangulations and CMSO. SIAM J. Comput. 44 (1) (2015)
Pinar Heggernes, Pim van 't Hof, Daniel Meister, Yngve Villanger
Induced Subgraph Isomorphism on proper interval and bipartite permutation graphs. Theor. Comput. Sci. 562 (2015)
Fedor V. Fomin, Stefan Kratsch, Marcin Pilipczuk, Michal Pilipczuk, Yngve Villanger
Tight bounds for parameterized complexity of Cluster Editing with a small number of clusters. J. Comput. Syst. Sci. 80 (7) (2014)
Mathieu Liedloff, Ioan Todinca, Yngve Villanger
Solving Capacitated Dominating Set by using covering by subsets and maximum matching. Discret. Appl. Math. 168 (2014)
Manu Basavaraju, Pinar Heggernes, Pim van 't Hof, Reza Saei, Yngve Villanger
Maximal Induced Matchings in Triangle-Free Graphs. WG (2014)
Daniel Lokshantov, Martin Vatshelle, Yngve Villanger
-Free Graphs in Polynomial Time. SODA (2014)
Fedor V. Fomin, Ioan Todinca, Yngve Villanger
Large induced subgraphs via triangulations and CMSO. SODA (2014)
Fedor V. Fomin, Yngve Villanger
Searching for better fill-in. J. Comput. Syst. Sci. 80 (7) (2014)
Fedor V. Fomin, Pinar Heggernes, Dieter Kratsch, Charis Papadopoulos, Yngve Villanger
Enumerating Minimal Subset Feedback Vertex Sets. Algorithmica 69 (1) (2014)
Pål Grønås Drange, Fedor V. Fomin, Michal Pilipczuk, Yngve Villanger
Exploring Subexponential Parameterized Complexity of Completion Problems. STACS (2014)
Mathieu Chapelle, Mathieu Liedloff, Ioan Todinca, Yngve Villanger
TREEWIDTH and PATHWIDTH parameterized by vertex cover CoRR (2013)
Fedor V. Fomin, Ioan Todinca, Yngve Villanger
Large induced subgraphs via triangulations and CMSO. CoRR (2013)
Manu Basavaraju, Pinar Heggernes, Pim van 't Hof, Reza Saei, Yngve Villanger
Maximal induced matchings in triangle-free graphs. CoRR (2013)
Ivan Bliznets, Fedor V. Fomin, Michal Pilipczuk, Yngve Villanger
Largest chordal and interval subgraphs faster than 2^n. CoRR (2013)
Jan Arne Telle, Yngve Villanger
Connecting Terminals and 2-Disjoint Connected Subgraphs CoRR (2013)
Fedor V. Fomin, Yngve Villanger
Searching for better fill-in. STACS (2013)
Pål Grønås Drange, Fedor V. Fomin, Michal Pilipczuk, Yngve Villanger
Exploring Subexponential Parameterized Complexity of Completion Problems. CoRR (2013)
Fedor V. Fomin, Stefan Kratsch, Marcin Pilipczuk, Michal Pilipczuk, Yngve Villanger
Tight bounds for Parameterized Complexity of Cluster Editing. STACS (2013)
Fedor V. Fomin, Saket Saurabh, Yngve Villanger
A Polynomial Kernel for Proper Interval Vertex Deletion. SIAM J. Discret. Math. 27 (4) (2013)
Henning Fernau, Pinar Heggernes, Yngve Villanger
A Multivariate Analysis of Some DFA Problems. LATA (2013)
Pinar Heggernes, Pim van 't Hof, Bart M. P. Jansen, Stefan Kratsch, Yngve Villanger
Parameterized complexity of vertex deletion into perfect graph classes. Theor. Comput. Sci. 511 (2013)
Henning Fernau, Markus L. Schmid, Yngve Villanger
On the Parameterised Complexity of String Morphism Problems. FSTTCS (2013)
Jan Arne Telle, Yngve Villanger
Connecting Terminals and 2-Disjoint Connected Subgraphs. WG (2013)
Mathieu Chapelle, Mathieu Liedloff, Ioan Todinca, Yngve Villanger
Treewidth and Pathwidth Parameterized by the Vertex Cover Number. WADS (2013)
Fedor V. Fomin, Yngve Villanger
Subexponential Parameterized Algorithm for Minimum Fill-In. SIAM J. Comput. 42 (6) (2013)
Ivan Bliznets, Fedor V. Fomin, Michal Pilipczuk, Yngve Villanger
Largest Chordal and Interval Subgraphs Faster Than 2 n. ESA (2013)
Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Yngve Villanger
An Incremental Polynomial Time Algorithm to Enumerate All Minimal Edge Dominating Sets. ICALP (1) (2013)
Pim van 't Hof, Yngve Villanger
Proper Interval Vertex Deletion. Algorithmica 65 (4) (2013)
Fedor V. Fomin, Yngve Villanger
Treewidth computation and extremal combinatorics. Comb. 32 (3) (2012)
Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Yngve Villanger
Generating All Minimal Edge Dominating Sets with Incremental-Polynomial Delay CoRR (2012)
Fedor V. Fomin, Serge Gaspers, Petr A. Golovach, Karol Suchan, Stefan Szeider, Erik Jan van Leeuwen, Martin Vatshelle, Yngve Villanger
k-Gap Interval Graphs. LATIN (2012)
Jean-François Couturier, Pinar Heggernes, Pim van 't Hof, Yngve Villanger
Maximum Number of Minimal Feedback Vertex Sets in Chordal Graphs and Cographs. COCOON (2012)
Jan Arne Telle, Yngve Villanger
FPT Algorithms for Domination in Biclique-Free Graphs. ESA (2012)
Michael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Frances A. Rosamond, Saket Saurabh, Yngve Villanger
Local search: Is brute-force avoidable? J. Comput. Syst. Sci. 78 (3) (2012)
Fedor V. Fomin, Yngve Villanger
Subexponential parameterized algorithm for minimum fill-in. SODA (2012)
Daniel Binkele-Raible, Henning Fernau, Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Yngve Villanger
Kernel(s) for problems with no kernel: On out-trees with many leaves. ACM Trans. Algorithms 8 (4) (2012)
Pinar Heggernes, Pim van 't Hof, Dániel Marx, Neeldhara Misra, Yngve Villanger
On the Parameterized Complexity of Finding Separators with Non-Hereditary Properties. WG (2012)
Fedor V. Fomin, Saket Saurabh, Yngve Villanger
A Polynomial kernel for Proper Interval Vertex Deletion CoRR (2012)
Fedor V. Fomin, Saket Saurabh, Yngve Villanger
A Polynomial Kernel for Proper Interval Vertex Deletion. ESA (2012)
Fedor V. Fomin, Geevarghese Philip, Yngve Villanger
Minimum Fill-in of Sparse Graphs: Kernelization and Approximation. FSTTCS (2011)
Hans L. Bodlaender, Pinar Heggernes, Yngve Villanger
Faster Parameterized Algorithms for Minimum Fill-in. Algorithmica 61 (4) (2011)
Fedor V. Fomin, Stefan Kratsch, Marcin Pilipczuk, Michal Pilipczuk, Yngve Villanger
Subexponential fixed-parameter tractability of cluster editing CoRR (2011)
Pinar Heggernes, Pim van 't Hof, Bart M. P. Jansen, Stefan Kratsch, Yngve Villanger
Parameterized Complexity of Vertex Deletion into Perfect Graph Classes. FCT (2011)
Fedor V. Fomin, Serge Gaspers, Petr A. Golovach, Karol Suchan, Stefan Szeider, Erik Jan van Leeuwen, Martin Vatshelle, Yngve Villanger
k-Gap Interval Graphs CoRR (2011)
Fedor V. Fomin, Pinar Heggernes, Dieter Kratsch, Charis Papadopoulos, Yngve Villanger
Enumerating Minimal Subset Feedback Vertex Sets. WADS (2011)
Fedor V. Fomin, Yngve Villanger
Subexponential Parameterized Algorithm for Minimum Fill-in CoRR (2011)
Fedor V. Fomin, Ioan Todinca, Yngve Villanger
Exact Algorithm for the Maximum Induced Planar Subgraph Problem. ESA (2011)
Geevarghese Philip, Venkatesh Raman, Yngve Villanger
A Quartic Kernel for Pathwidth-One Vertex Deletion CoRR (2010)
Pinar Heggernes, Federico Mancini, Jesper Nederlof, Yngve Villanger
A Parameterized Algorithm for Chordal Sandwich. CIAC (2010)
Mathieu Liedloff, Ioan Todinca, Yngve Villanger
Solving Capacitated Dominating Set by Using Covering by Subsets and Maximum Matching. WG (2010)
Geevarghese Philip, Venkatesh Raman, Yngve Villanger
A Quartic Kernel for Pathwidth-One Vertex Deletion. WG (2010)
Fedor V. Fomin, Yngve Villanger
Finding Induced Subgraphs via Minimal Triangulations. STACS (2010)
Yngve Villanger
Proper Interval Vertex Deletion. IPEC (2010)
Pinar Heggernes, Daniel Meister, Yngve Villanger
Induced Subgraph Isomorphism on Interval and Proper Interval Graphs. ISAAC (2) (2010)
Henning Fernau, Fedor V. Fomin, Daniel Lokshtanov, Daniel Raible, Saket Saurabh, Yngve Villanger
Kernel(s) for Problems with No Kernel: On Out-Trees with Many Leaves. STACS (2009)
Karol Suchan, Yngve Villanger
. IWPEC (2009)
Michael R. Fellows, Frances A. Rosamond, Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Yngve Villanger
Local Search: Is Brute-Force Avoidable? IJCAI (2009)
Yngve Villanger, Pinar Heggernes, Christophe Paul, Jan Arne Telle
Interval Completion Is Fixed Parameter Tractable. SIAM J. Comput. 38 (5) (2009)
Fedor V. Fomin, Yngve Villanger
Finding Induced Subgraphs via Minimal Triangulations CoRR (2009)
Petr A. Golovach, Yngve Villanger
Parameterized Complexity for Domination Problems on Degenerate Graphs. WG (2008)
Fedor V. Fomin, Yngve Villanger
Treewidth Computation and Extremal Combinatorics. ICALP (1) (2008)
Fedor V. Fomin, Dieter Kratsch, Ioan Todinca, Yngve Villanger
Exact Algorithms for Treewidth and Minimum Fill-In. SIAM J. Comput. 38 (3) (2008)
Henning Fernau, Fedor V. Fomin, Daniel Lokshtanov, Daniel Raible, Saket Saurabh, Yngve Villanger
Kernel(s) for Problems With no Kernel: On Out-Trees With Many Leaves CoRR (2008)
Michael Dom, Daniel Lokshtanov, Saket Saurabh, Yngve Villanger
Capacitated Domination and Covering: A Parameterized Perspective. IWPEC (2008)
Fedor V. Fomin, Yngve Villanger
Treewidth computation and extremal combinatorics CoRR (2008)
Hans L. Bodlaender, Pinar Heggernes, Yngve Villanger
Faster Parameterized Algorithms for Minimum Fill-In. ISAAC (2008)
Jianer Chen, Fedor V. Fomin, Yang Liu, Songjian Lu, Yngve Villanger
Improved algorithms for feedback vertex set problems. J. Comput. Syst. Sci. 74 (7) (2008)
Jianer Chen, Fedor V. Fomin, Yang Liu, Songjian Lu, Yngve Villanger
Improved Algorithms for the Feedback Vertex Set Problems. WADS (2007)
Pinar Heggernes, Karol Suchan, Ioan Todinca, Yngve Villanger
Characterizing Minimal Interval Completions. STACS (2007)
Pinar Heggernes, Christophe Paul, Jan Arne Telle, Yngve Villanger
Interval completion with few edges. STOC (2007)
Yngve Villanger
Improved Exponential-Time Algorithms for Treewidth and Minimum Fill-In. LATIN (2006)
Yngve Villanger
Lex M versus MCS-M. Discret. Math. 306 (3) (2006)
Anne Berry, Pinar Heggernes, Yngve Villanger
A vertex incremental approach for maintaining chordality. Discret. Math. 306 (3) (2006)
Anne Berry, Jean Paul Bordat, Pinar Heggernes, Geneviève Simonet, Yngve Villanger
A wide-range algorithm for minimal triangulation from an arbitrary ordering. J. Algorithms 58 (1) (2006)
Pinar Heggernes, Jan Arne Telle, Yngve Villanger
). SIAM J. Discret. Math. 19 (4) (2005)
Pinar Heggernes, Jan Arne Telle, Yngve Villanger
). SODA (2005)
Pinar Heggernes, Karol Suchan, Ioan Todinca, Yngve Villanger
Minimal Interval Completions. ESA (2005)
Pinar Heggernes, Yngve Villanger
Simple and Efficient Modifications of Elimination Orderings. PARA (2004)
Anne Berry, Pinar Heggernes, Yngve Villanger
A Vertex Incremental Approach for Dynamically Maintaining Chordal Graphs. ISAAC (2003)
Pinar Heggernes, Yngve Villanger
Efficient Implementation of a Minimal Triangulation Algorithm. ESA (2002)