Yngve Villanger

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