Characterizing minimal interval completions towards better understanding of profile and pathwidth
Ioan Todinca , Yngve Villanger , Karol Suchan , Pinar Heggernes
symposium on theoretical aspects of computer science 236 -247
13
2007
Fast Minimal Triangulation.
Yngve Villanger
Encyclopedia of Algorithms 731 -735
2008
Tight bounds for parameterized complexity of Cluster Editing
Yngve Villanger , Marcin Łukasz Pilipczuk , Fedor V. Fomin , Michał Pilipczuk
symposium on theoretical aspects of computer science 32 -43
21
2013
Computing minimal triangulations in time O(nα log n) = o(n2.376)
Yngve Villanger , Jan Arne Telle , Pinar Heggernes
symposium on discrete algorithms 907 -916
16
2005
Independent set in P 5 -free graphs in polynomial time
Yngve Villanger , Martin Vatshelle , Daniel Lokshantov
symposium on discrete algorithms 570 -581
54
2014
Computing minimal triangulation in Time o(n^2.376)
Yngve Villanger , Jan Arne Telle , Pinar Heggernes
SIAM Journals
2005
Improved exponential-time algorithms for treewidth and minimum fill-in
Yngve Villanger
Lecture Notes in Computer Science 800 -811
26
2006
New Results on Minimal Triangulations
Yngve Villanger
The University of Bergen
2006
Calcul de grands sous-graphes induits à l'aide des séparateurs minimaux et de la logique MSO
Ioan Todinca , Yngve Villanger , Fedor V. Fomin
ROADEF - 15ème congrès annuel de la Société française de recherche opérationnelle et d'aide à la décision
2014
Faster Parameterized Algorithms for Minimum Fill-in
Hans L. Bodlaender , Pinar Heggernes , Yngve Villanger
Algorithmica 61 ( 4) 817 -838
15
2011
Proper Interval Vertex Deletion
Pim van ’t Hof , Yngve Villanger
Algorithmica 65 ( 4) 845 -867
34
2013
Minimum Fill-in of Sparse Graphs: Kernelization and Approximation
Fedor V. Fomin , Geevarghese Philip , Yngve Villanger
Algorithmica 71 ( 1) 1 -20
3
2015
Enumerating Minimal Subset Feedback Vertex Sets
Fedor V. Fomin , Pinar Heggernes , Dieter Kratsch , Charis Papadopoulos
Algorithmica 69 ( 1) 216 -231
32
2014
An Incremental Polynomial Time Algorithm to Enumerate All Minimal Edge Dominating Sets
Petr A. Golovach , Pinar Heggernes , Dieter Kratsch , Yngve Villanger
Algorithmica 72 ( 3) 836 -859
20
2015
On the Parameterized Complexity of Finding Separators with Non-Hereditary Properties
Pinar Heggernes , Pim van ’t Hof , Dániel Marx , Neeldhara Misra
Algorithmica 72 ( 3) 687 -713
2
2015
A wide-range algorithm for minimal triangulation from an arbitrary ordering
Anne Berry , Jean-Paul Bordat , Pinar Heggernes , Geneviève Simonet
Journal of Algorithms 58 ( 1) 33 -66
43
2006
Characterizing Minimal Interval Completions
Pinar Heggernes , Karol Suchan , Ioan Todinca , Yngve Villanger
STACS 2007 4393 236 -247
14
2007
On the Parameterized Complexity of Finding Separators with Non-Hereditary Properties
Pinar Heggernes , Pim van’t Hof , Dániel Marx , Neeldhara Misra
Graph-Theoretic Concepts in Computer Science 332 -343
2012
FPT Algorithms for Domination in Biclique-Free Graphs
Jan Arne Telle , Yngve Villanger
Algorithms – ESA 2012 802 -812
14
2012
A multi-parameter analysis of hard problems on deterministic finite automata
Henning Fernau , Pinar Heggernes , Yngve Villanger
Journal of Computer and System Sciences 81 ( 4) 747 -765
13
2015