Yngve Villanger
According to our database1,
Yngve Villanger
authored at least 65 papers
between 2002 and 2019.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2019
2018
Algorithmica, 2018
2017
Discret. Appl. Math., 2017
2016
Theory Comput. Syst., 2016
Discret. Appl. Math., 2016
2015
ACM Trans. Comput. Theory, 2015
Theor. Comput. Sci., 2015
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
Algorithmica, 2015
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
Proceedings of the 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), 2014
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014
2013
Theor. Comput. Sci., 2013
SIAM J. Discret. Math., 2013
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2013
Proceedings of the 30th International Symposium on Theoretical Aspects of Computer Science, 2013
Proceedings of the Language and Automata Theory and Applications, 2013
Proceedings of the Algorithms - ESA 2013, 2013
2012
ACM Trans. Algorithms, 2012
CoRR, 2012
Proceedings of the Algorithms - ESA 2012, 2012
Proceedings of the Computing and Combinatorics - 18th Annual International Conference, 2012
2011
Proceedings of the Algorithms - ESA 2011, 2011
2010
Proceedings of the Graph Theoretic Concepts in Computer Science, 2010
Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science, 2010
Proceedings of the Parameterized and Exact Computation - 5th International Symposium, 2010
Proceedings of the Algorithms and Computation - 21st International Symposium, 2010
Proceedings of the Algorithms and Complexity, 7th International Conference, 2010
2009
Proceedings of the Parameterized and Exact Computation, 4th International Workshop, 2009
2008
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2008
Proceedings of the Parameterized and Exact Computation, Third International Workshop, 2008
2007
Proceedings of the 39th Annual ACM Symposium on Theory of Computing, 2007
2006
J. Algorithms, 2006
Proceedings of the LATIN 2006: Theoretical Informatics, 2006
2005
Computing Minimal Triangulations in Time <i>O</i>(<i>n</i><sup>alpha</sup> <i>log n</i>) = <i>o</i>(<i>n</i> <sup>2.376</sup>).
SIAM J. Discret. Math., 2005
Computing minimal triangulations in time O(n<sup>alpha</sup> log n) = o(n<sup>2.376</sup>).
Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005
2004
Proceedings of the Applied Parallel Computing, 2004
2003
Proceedings of the Algorithms and Computation, 14th International Symposium, 2003
2002
Proceedings of the Algorithms, 2002