Yngve Villanger

Pim van 't Hof, Yngve Villanger: Proper Interval Vertex Deletion. Algorithmica 65(4): 845-867 (2013)

Henning Fernau, Pinar Heggernes, Yngve Villanger: A Multivariate Analysis of Some DFA Problems. LATA 2013: 275-286

Fedor V. Fomin, Yngve Villanger: Searching for better fill-in. STACS 2013: 8-19

Fedor V. Fomin, Stefan Kratsch, Marcin Pilipczuk, Michal Pilipczuk, Yngve Villanger: Tight bounds for Parameterized Complexity of Cluster Editing. STACS 2013: 32-43

Jan Arne Telle, Yngve Villanger: Connecting Terminals and 2-Disjoint Connected Subgraphs. CoRR abs/1301.2506 (2013)

Fedor V. Fomin, Yngve Villanger: Treewidth computation and extremal combinatorics. Combinatorica 32(3): 289-308 (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): 707-719 (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 Transactions on Algorithms 8(4): 38 (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: 133-144

Fedor V. Fomin, Saket Saurabh, Yngve Villanger: A Polynomial Kernel for Proper Interval Vertex Deletion. ESA 2012: 467-478

Jan Arne Telle, Yngve Villanger: FPT Algorithms for Domination in Biclique-Free Graphs. ESA 2012: 802-812

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: 350-361

Fedor V. Fomin, Yngve Villanger: Subexponential parameterized algorithm for minimum fill-in. SODA 2012: 1737-1746

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: 332-343

Fedor V. Fomin, Saket Saurabh, Yngve Villanger: A Polynomial kernel for Proper Interval Vertex Deletion. CoRR abs/1204.4880 (2012)

Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Yngve Villanger: Generating All Minimal Edge Dominating Sets with Incremental-Polynomial Delay. CoRR abs/1208.5345 (2012)

Hans L. Bodlaender, Pinar Heggernes, Yngve Villanger: Faster Parameterized Algorithms for Minimum Fill-in. Algorithmica 61(4): 817-838 (2011)

Fedor V. Fomin, Ioan Todinca, Yngve Villanger: Exact Algorithm for the Maximum Induced Planar Subgraph Problem. ESA 2011: 287-298

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: 240-251

Fedor V. Fomin, Geevarghese Philip, Yngve Villanger: Minimum Fill-in of Sparse Graphs: Kernelization and Approximation. FSTTCS 2011: 164-175

Fedor V. Fomin, Pinar Heggernes, Dieter Kratsch, Charis Papadopoulos, Yngve Villanger: Enumerating Minimal Subset Feedback Vertex Sets. WADS 2011: 399-410

Fedor V. Fomin, Yngve Villanger: Subexponential Parameterized Algorithm for Minimum Fill-in. CoRR abs/1104.2230 (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 abs/1112.3244 (2011)

Fedor V. Fomin, Stefan Kratsch, Marcin Pilipczuk, Michal Pilipczuk, Yngve Villanger: Subexponential fixed-parameter tractability of cluster editing. CoRR abs/1112.4419 (2011)

Pinar Heggernes, Federico Mancini, Jesper Nederlof, Yngve Villanger: A Parameterized Algorithm for Chordal Sandwich. CIAC 2010: 120-130

Pinar Heggernes, Daniel Meister, Yngve Villanger: Induced Subgraph Isomorphism on Interval and Proper Interval Graphs. ISAAC (2) 2010: 399-409

Yngve Villanger: Proper Interval Vertex Deletion. IPEC 2010: 228-238

Fedor V. Fomin, Yngve Villanger: Finding Induced Subgraphs via Minimal Triangulations. STACS 2010: 383-394

Mathieu Liedloff, Ioan Todinca, Yngve Villanger: Solving Capacitated Dominating Set by Using Covering by Subsets and Maximum Matching. WG 2010: 88-99

Geevarghese Philip, Venkatesh Raman, Yngve Villanger: A Quartic Kernel for Pathwidth-One Vertex Deletion. WG 2010: 196-207

Geevarghese Philip, Venkatesh Raman, Yngve Villanger: A Quartic Kernel for Pathwidth-One Vertex Deletion. CoRR abs/1009.0806 (2010)

Yngve Villanger, Pinar Heggernes, Christophe Paul, Jan Arne Telle: Interval Completion Is Fixed Parameter Tractable. SIAM J. Comput. 38(5): 2007-2020 (2009)

Michael R. Fellows, Frances A. Rosamond, Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Yngve Villanger: Local Search: Is Brute-Force Avoidable? IJCAI 2009: 486-491

Karol Suchan, Yngve Villanger: Computing Pathwidth Faster Than 2ⁿ. IWPEC 2009: 324-335

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: 421-432

Fedor V. Fomin, Yngve Villanger: Finding Induced Subgraphs via Minimal Triangulations. CoRR abs/0909.5278 (2009)

Jianer Chen, Fedor V. Fomin, Yang Liu, Songjian Lu, Yngve Villanger: Improved algorithms for feedback vertex set problems. J. Comput. Syst. Sci. 74(7): 1188-1198 (2008)

Fedor V. Fomin, Dieter Kratsch, Ioan Todinca, Yngve Villanger: Exact Algorithms for Treewidth and Minimum Fill-In. SIAM J. Comput. 38(3): 1058-1079 (2008)

Fedor V. Fomin, Yngve Villanger: Treewidth Computation and Extremal Combinatorics. ICALP (1) 2008: 210-221

Hans L. Bodlaender, Pinar Heggernes, Yngve Villanger: Faster Parameterized Algorithms for Minimum Fill-In. ISAAC 2008: 282-293

Michael Dom, Daniel Lokshtanov, Saket Saurabh, Yngve Villanger: Capacitated Domination and Covering: A Parameterized Perspective. IWPEC 2008: 78-90

Petr A. Golovach, Yngve Villanger: Parameterized Complexity for Domination Problems on Degenerate Graphs. WG 2008: 195-205

Yngve Villanger: Fast Minimal Triangulation. Encyclopedia of Algorithms 2008

Fedor V. Fomin, Yngve Villanger: Treewidth computation and extremal combinatorics. CoRR abs/0803.1321 (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 abs/0810.4796 (2008)

Pinar Heggernes, Karol Suchan, Ioan Todinca, Yngve Villanger: Characterizing Minimal Interval Completions. STACS 2007: 236-247

Pinar Heggernes, Christophe Paul, Jan Arne Telle, Yngve Villanger: Interval completion with few edges. STOC 2007: 374-381

Jianer Chen, Fedor V. Fomin, Yang Liu, Songjian Lu, Yngve Villanger: Improved Algorithms for the Feedback Vertex Set Problems. WADS 2007: 422-433

Anne Berry, Pinar Heggernes, Yngve Villanger: A vertex incremental approach for maintaining chordality. Discrete Mathematics 306(3): 318-336 (2006)

Yngve Villanger: Lex M versus MCS-M. Discrete Mathematics 306(3): 393-400 (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): 33-66 (2006)

Yngve Villanger: Improved Exponential-Time Algorithms for Treewidth and Minimum Fill-In. LATIN 2006: 800-811

Pinar Heggernes, Jan Arne Telle, Yngve Villanger: Computing Minimal Triangulations in Time O(n^alpha log n) = o(n ^2.376). SIAM J. Discrete Math. 19(4): 900-913 (2005)

Pinar Heggernes, Karol Suchan, Ioan Todinca, Yngve Villanger: Minimal Interval Completions. ESA 2005: 403-414

Pinar Heggernes, Jan Arne Telle, Yngve Villanger: Computing minimal triangulations in time O(n^alpha log n) = o(n^2.376). SODA 2005: 907-916

Pinar Heggernes, Yngve Villanger: Simple and Efficient Modifications of Elimination Orderings. PARA 2004: 788-797

Anne Berry, Pinar Heggernes, Yngve Villanger: A Vertex Incremental Approach for Dynamically Maintaining Chordal Graphs. ISAAC 2003: 47-57

Pinar Heggernes, Yngve Villanger: Efficient Implementation of a Minimal Triangulation Algorithm. ESA 2002: 550-561