Yngve Villanger

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

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2019
FPT algorithms for domination in sparse graphs and beyond.
Theor. Comput. Sci., 2019

2018
Output-Polynomial Enumeration on Graphs of Bounded (Local) Linear MIM-Width.
Algorithmica, 2018

2017
Minimal dominating sets in interval graphs and trees.
Discret. Appl. Math., 2017

Treewidth and Pathwidth parameterized by the vertex cover number.
Discret. Appl. Math., 2017

2016
Fast Minimal Triangulation.
Encyclopedia of Algorithms, 2016

On the Parameterised Complexity of String Morphism Problems.
Theory Comput. Syst., 2016

Maximal Induced Matchings in Triangle-Free Graphs.
Journal of Graph Theory, 2016

Enumerating minimal dominating sets in chordal bipartite graphs.
Discret. Appl. Math., 2016

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

2015
Exploring the Subexponential Complexity of Completion Problems.
TOCT, 2015

Induced Subgraph Isomorphism on proper interval and bipartite permutation graphs.
Theor. Comput. Sci., 2015

Large Induced Subgraphs via Triangulations and CMSO.
SIAM J. Comput., 2015

A multi-parameter analysis of hard problems on deterministic finite automata.
J. Comput. Syst. Sci., 2015

On the Parameterized Complexity of Finding Separators with Non-Hereditary Properties.
Algorithmica, 2015

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

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

2014
Searching for better fill-in.
J. Comput. Syst. Sci., 2014

Tight bounds for parameterized complexity of Cluster Editing with a small number of clusters.
J. Comput. Syst. Sci., 2014

Solving Capacitated Dominating Set by using covering by subsets and maximum matching.
Discret. Appl. Math., 2014

Enumerating Minimal Subset Feedback Vertex Sets.
Algorithmica, 2014

Exploring Subexponential Parameterized Complexity of Completion Problems.
Proceedings of the 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), 2014

Independent Set in P5-Free Graphs in Polynomial Time.
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

2013
Parameterized complexity of vertex deletion into perfect graph classes.
Theor. Comput. Sci., 2013

A Polynomial Kernel for Proper Interval Vertex Deletion.
SIAM J. Discrete Math., 2013

Subexponential Parameterized Algorithm for Minimum Fill-In.
SIAM J. Comput., 2013

TREEWIDTH and PATHWIDTH parameterized by vertex cover
CoRR, 2013

Proper Interval Vertex Deletion.
Algorithmica, 2013

Connecting Terminals and 2-Disjoint Connected Subgraphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2013

Tight bounds for Parameterized Complexity of Cluster Editing.
Proceedings of the 30th International Symposium on Theoretical Aspects of Computer Science, 2013

A Multivariate Analysis of Some DFA Problems.
Proceedings of the Language and Automata Theory and Applications, 2013

Largest Chordal and Interval Subgraphs Faster Than 2 n.
Proceedings of the Algorithms - ESA 2013, 2013

2012
Kernel(s) for problems with no kernel: On out-trees with many leaves.
ACM Trans. Algorithms, 2012

Local search: Is brute-force avoidable?
J. Comput. Syst. Sci., 2012

Generating All Minimal Edge Dominating Sets with Incremental-Polynomial Delay
CoRR, 2012

Treewidth computation and extremal combinatorics.
Combinatorica, 2012

k-Gap Interval Graphs.
Proceedings of the LATIN 2012: Theoretical Informatics, 2012

FPT Algorithms for Domination in Biclique-Free Graphs.
Proceedings of the Algorithms - ESA 2012, 2012

Maximum Number of Minimal Feedback Vertex Sets in Chordal Graphs and Cographs.
Proceedings of the Computing and Combinatorics - 18th Annual International Conference, 2012

2011
Subexponential fixed-parameter tractability of cluster editing
CoRR, 2011

Faster Parameterized Algorithms for Minimum Fill-in.
Algorithmica, 2011

Exact Algorithm for the Maximum Induced Planar Subgraph Problem.
Proceedings of the Algorithms - ESA 2011, 2011

2010
A Quartic Kernel for Pathwidth-One Vertex Deletion.
Proceedings of the Graph Theoretic Concepts in Computer Science, 2010

Finding Induced Subgraphs via Minimal Triangulations.
Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science, 2010

Proper Interval Vertex Deletion.
Proceedings of the Parameterized and Exact Computation - 5th International Symposium, 2010

Induced Subgraph Isomorphism on Interval and Proper Interval Graphs.
Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

A Parameterized Algorithm for Chordal Sandwich.
Proceedings of the Algorithms and Complexity, 7th International Conference, 2010

2009
Interval Completion Is Fixed Parameter Tractable.
SIAM J. Comput., 2009

Computing Pathwidth Faster Than 2n.
Proceedings of the Parameterized and Exact Computation, 4th International Workshop, 2009

2008
Fast Minimal Triangulation.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Exact Algorithms for Treewidth and Minimum Fill-In.
SIAM J. Comput., 2008

Improved algorithms for feedback vertex set problems.
J. Comput. Syst. Sci., 2008

Parameterized Complexity for Domination Problems on Degenerate Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2008

Capacitated Domination and Covering: A Parameterized Perspective.
Proceedings of the Parameterized and Exact Computation, Third International Workshop, 2008

2007
Interval completion with few edges.
Proceedings of the 39th Annual ACM Symposium on Theory of Computing, 2007

Characterizing Minimal Interval Completions.
Proceedings of the STACS 2007, 2007

2006
A wide-range algorithm for minimal triangulation from an arbitrary ordering.
J. Algorithms, 2006

Lex M versus MCS-M.
Discrete Mathematics, 2006

A vertex incremental approach for maintaining chordality.
Discrete Mathematics, 2006

Improved Exponential-Time Algorithms for Treewidth and Minimum Fill-In.
Proceedings of the LATIN 2006: Theoretical Informatics, 2006

2005
Computing Minimal Triangulations in Time O(nalpha log n) = o(n 2.376).
SIAM J. Discrete Math., 2005

Computing minimal triangulations in time O(nalpha log n) = o(n2.376).
Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

Minimal Interval Completions.
Proceedings of the Algorithms, 2005

2004
Simple and Efficient Modifications of Elimination Orderings.
Proceedings of the Applied Parallel Computing, 2004

2003
A Vertex Incremental Approach for Dynamically Maintaining Chordal Graphs.
Proceedings of the Algorithms and Computation, 14th International Symposium, 2003

2002
Efficient Implementation of a Minimal Triangulation Algorithm.
Proceedings of the Algorithms, 2002


  Loading...