Yngve Villanger
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
39
Venues
14
Active years
2002–2015
Best venue rank
A*
Where they publish
Papers
39 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2015 | ISAAC | Output-Polynomial Enumeration on Graphs of Bounded (Local) Linear MIM-Width. | Petr A. Golovach, Pinar Heggernes, Mamadou Moustapha Kant, Dieter Kratsch, Sigve Hortemo Sther, Yngve Villanger |
| 2014 | SODA | Large induced subgraphs via triangulations and CMSO. | Fedor V. Fomin, Ioan Todinca, Yngve Villanger |
| 2014 | SODA | Independent Set in | Daniel Lokshtanov, Martin Vatshelle, Yngve Villanger |
| 2014 | STACS | Exploring Subexponential Parameterized Complexity of Completion Problems. | Pl Grns Drange, Fedor V. Fomin, Michal Pilipczuk, Yngve Villanger |
| 2014 | WG | Maximal Induced Matchings in Triangle-Free Graphs. | Manu Basavaraju, Pinar Heggernes, Pim van 't Hof, Reza Saei, Yngve Villanger |
| 2013 | ESA | Largest Chordal and Interval Subgraphs Faster Than 2 n. | Ivan Bliznets, Fedor V. Fomin, Michal Pilipczuk, Yngve Villanger |
| 2013 | ICALP | An Incremental Polynomial Time Algorithm to Enumerate All Minimal Edge Dominating Sets. | Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Yngve Villanger |
| 2013 | LATA | A Multivariate Analysis of Some DFA Problems. | Henning Fernau, Pinar Heggernes, Yngve Villanger |
| 2013 | STACS | Tight bounds for Parameterized Complexity of Cluster Editing. | Fedor V. Fomin, Stefan Kratsch, Marcin Pilipczuk, Michal Pilipczuk, Yngve Villanger |
| 2013 | STACS | Searching for better fill-in. | Fedor V. Fomin, Yngve Villanger |
| 2013 | WADS | Treewidth and Pathwidth Parameterized by the Vertex Cover Number. | Mathieu Chapelle, Mathieu Liedloff, Ioan Todinca, Yngve Villanger |
| 2013 | WG | Connecting Terminals and 2-Disjoint Connected Subgraphs. | Jan Arne Telle, Yngve Villanger |
| 2012 | COCOON | Maximum Number of Minimal Feedback Vertex Sets in Chordal Graphs and Cographs. | Jean-Franois Couturier, Pinar Heggernes, Pim van 't Hof, Yngve Villanger |
| 2012 | ESA | A Polynomial Kernel for Proper Interval Vertex Deletion. | Fedor V. Fomin, Saket Saurabh, Yngve Villanger |
| 2012 | ESA | FPT Algorithms for Domination in Biclique-Free Graphs. | Jan Arne Telle, Yngve Villanger |
| 2012 | LATIN | k-Gap Interval Graphs. | Fedor V. Fomin, Serge Gaspers, Petr A. Golovach, Karol Suchan, Stefan Szeider, Erik Jan van Leeuwen, Martin Vatshelle, Yngve Villanger |
| 2012 | SODA | Subexponential parameterized algorithm for minimum fill-in. | Fedor V. Fomin, Yngve Villanger |
| 2012 | WG | On the Parameterized Complexity of Finding Separators with Non-Hereditary Properties. | Pinar Heggernes, Pim van 't Hof, Dniel Marx, Neeldhara Misra, Yngve Villanger |
| 2011 | ESA | Exact Algorithm for the Maximum Induced Planar Subgraph Problem. | Fedor V. Fomin, Ioan Todinca, Yngve Villanger |
| 2011 | FCT | Parameterized Complexity of Vertex Deletion into Perfect Graph Classes. | Pinar Heggernes, Pim van 't Hof, Bart M. P. Jansen, Stefan Kratsch, Yngve Villanger |
| 2011 | WADS | Enumerating Minimal Subset Feedback Vertex Sets. | Fedor V. Fomin, Pinar Heggernes, Dieter Kratsch, Charis Papadopoulos, Yngve Villanger |
| 2010 | CIAC | A Parameterized Algorithm for Chordal Sandwich. | Pinar Heggernes, Federico Mancini, Jesper Nederlof, Yngve Villanger |
| 2010 | ISAAC | Induced Subgraph Isomorphism on Interval and Proper Interval Graphs. | Pinar Heggernes, Daniel Meister, Yngve Villanger |
| 2010 | STACS | Finding Induced Subgraphs via Minimal Triangulations. | Fedor V. Fomin, Yngve Villanger |
| 2010 | WG | Solving Capacitated Dominating Set by Using Covering by Subsets and Maximum Matching. | Mathieu Liedloff, Ioan Todinca, Yngve Villanger |
| 2010 | WG | A Quartic Kernel for Pathwidth-One Vertex Deletion. | Geevarghese Philip, Venkatesh Raman, Yngve Villanger |
| 2009 | IJCAI | Local Search: Is Brute-Force Avoidable? | Michael R. Fellows, Frances A. Rosamond, Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Yngve Villanger |
| 2009 | STACS | Kernel(s) for Problems with No Kernel: On Out-Trees with Many Leaves. | Henning Fernau, Fedor V. Fomin, Daniel Lokshtanov, Daniel Raible, Saket Saurabh, Yngve Villanger |
| 2008 | ICALP | Treewidth Computation and Extremal Combinatorics. | Fedor V. Fomin, Yngve Villanger |
| 2008 | ISAAC | Faster Parameterized Algorithms for Minimum Fill-In. | Hans L. Bodlaender, Pinar Heggernes, Yngve Villanger |
| 2008 | WG | Parameterized Complexity for Domination Problems on Degenerate Graphs. | Petr A. Golovach, Yngve Villanger |
| 2007 | STOC | Interval completion with few edges. | Pinar Heggernes, Christophe Paul, Jan Arne Telle, Yngve Villanger |
| 2007 | STACS | Characterizing Minimal Interval Completions. | Pinar Heggernes, Karol Suchan, Ioan Todinca, Yngve Villanger |
| 2007 | WADS | Improved Algorithms for the Feedback Vertex Set Problems. | Jianer Chen, Fedor V. Fomin, Yang Liu, Songjian Lu, Yngve Villanger |
| 2006 | LATIN | Improved Exponential-Time Algorithms for Treewidth and Minimum Fill-In. | Yngve Villanger |
| 2005 | ESA | Minimal Interval Completions. | Pinar Heggernes, Karol Suchan, Ioan Todinca, Yngve Villanger |
| 2005 | SODA | Computing minimal triangulations in time O(n | Pinar Heggernes, Jan Arne Telle, Yngve Villanger |
| 2003 | ISAAC | A Vertex Incremental Approach for Dynamically Maintaining Chordal Graphs. | Anne Berry, Pinar Heggernes, Yngve Villanger |
| 2002 | ESA | Efficient Implementation of a Minimal Triangulation Algorithm. | Pinar Heggernes, Yngve Villanger |