|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 6 occurrences of 6 keywords
|
|
|
|
|
Results
Found 46 publication records. Showing 46 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Fedor V. Fomin, Saket Saurabh, Yngve Villanger |
A Polynomial kernel for Proper Interval Vertex Deletion  |
CoRR  |
2012 |
DBLP BibTeX RDF |
|
| 1 | 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. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Yngve Villanger |
Subexponential parameterized algorithm for minimum fill-in. |
SODA |
2012 |
DBLP BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans L. Bodlaender, Pinar Heggernes, Yngve Villanger |
Faster Parameterized Algorithms for Minimum Fill-in. |
Algorithmica |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Yngve Villanger |
Subexponential Parameterized Algorithm for Minimum Fill-in |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | 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 |
2011 |
DBLP BibTeX RDF |
|
| 1 | Fedor V. Fomin, Stefan Kratsch, Marcin Pilipczuk, Michal Pilipczuk, Yngve Villanger |
Subexponential fixed-parameter tractability of cluster editing |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Fedor V. Fomin, Ioan Todinca, Yngve Villanger |
Exact Algorithm for the Maximum Induced Planar Subgraph Problem. |
ESA |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Pinar Heggernes, Dieter Kratsch, Charis Papadopoulos, Yngve Villanger |
Enumerating Minimal Subset Feedback Vertex Sets. |
WADS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Geevarghese Philip, Yngve Villanger |
Minimum Fill-in of Sparse Graphs: Kernelization and Approximation. |
FSTTCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Geevarghese Philip, Venkatesh Raman, Yngve Villanger |
A Quartic Kernel for Pathwidth-One Vertex Deletion |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Geevarghese Philip, Venkatesh Raman, Yngve Villanger |
A Quartic Kernel for Pathwidth-One Vertex Deletion. |
WG |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Mathieu Liedloff, Ioan Todinca, Yngve Villanger |
Solving Capacitated Dominating Set by Using Covering by Subsets and Maximum Matching. |
WG |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Yngve Villanger |
Proper Interval Vertex Deletion. |
IPEC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Yngve Villanger |
Finding Induced Subgraphs via Minimal Triangulations. |
STACS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Pinar Heggernes, Daniel Meister, Yngve Villanger |
Induced Subgraph Isomorphism on Interval and Proper Interval Graphs. |
ISAAC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Pinar Heggernes, Federico Mancini, Jesper Nederlof, Yngve Villanger |
A Parameterized Algorithm for Chordal Sandwich. |
CIAC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Yngve Villanger |
Finding Induced Subgraphs via Minimal Triangulations |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Yngve Villanger, Pinar Heggernes, Christophe Paul, Jan Arne Telle |
Interval Completion Is Fixed Parameter Tractable. |
SIAM J. Comput. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael R. Fellows, Frances A. Rosamond, Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Yngve Villanger |
Local Search: Is Brute-Force Avoidable? |
IJCAI |
2009 |
DBLP BibTeX RDF |
|
| 1 | Karol Suchan, Yngve Villanger |
Computing Pathwidth Faster Than 2n. |
IWPEC |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Yngve Villanger |
Treewidth computation and extremal combinatorics |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | 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 |
2008 |
DBLP BibTeX RDF |
|
| 1 | Jianer Chen, Fedor V. Fomin, Yang Liu 0002, Songjian Lu, Yngve Villanger |
Improved algorithms for feedback vertex set problems. |
J. Comput. Syst. Sci. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Dieter Kratsch, Ioan Todinca, Yngve Villanger |
Exact Algorithms for Treewidth and Minimum Fill-In. |
SIAM J. Comput. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Yngve Villanger |
Fast Minimal Triangulation. |
Encyclopedia of Algorithms |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Petr A. Golovach, Yngve Villanger |
Parameterized Complexity for Domination Problems on Degenerate Graphs. |
WG |
2008 |
DBLP DOI BibTeX RDF |
degenerate graphs, algorithms, domination, Parameterized complexity |
| 1 | Fedor V. Fomin, Yngve Villanger |
Treewidth Computation and Extremal Combinatorics. |
ICALP |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Dom, Daniel Lokshtanov, Saket Saurabh, Yngve Villanger |
Capacitated Domination and Covering: A Parameterized Perspective. |
IWPEC |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans L. Bodlaender, Pinar Heggernes, Yngve Villanger |
Faster Parameterized Algorithms for Minimum Fill-In. |
ISAAC |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Pinar Heggernes, Karol Suchan, Ioan Todinca, Yngve Villanger |
Characterizing Minimal Interval Completions. |
STACS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Jianer Chen, Fedor V. Fomin, Yang Liu 0002, Songjian Lu, Yngve Villanger |
Improved Algorithms for the Feedback Vertex Set Problems. |
WADS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Pinar Heggernes, Christophe Paul, Jan Arne Telle, Yngve Villanger |
Interval completion with few edges. |
STOC |
2007 |
DBLP DOI BibTeX RDF |
FPT algorithm, edge completion, profile minimization, interval graphs, branching, physical mapping |
| 1 | Anne Berry, Pinar Heggernes, Yngve Villanger |
A vertex incremental approach for maintaining chordality. |
Discrete Mathematics |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Yngve Villanger |
Lex M versus MCS-M. |
Discrete Mathematics |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Yngve Villanger |
Improved Exponential-Time Algorithms for Treewidth and Minimum Fill-In. |
LATIN |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Pinar Heggernes, Jan Arne Telle, Yngve Villanger |
Computing Minimal Triangulations in Time O(nalpha log n) = o(n 2.376). |
SIAM J. Discrete Math. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Pinar Heggernes, Karol Suchan, Ioan Todinca, Yngve Villanger |
Minimal Interval Completions. |
ESA |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Pinar Heggernes, Jan Arne Telle, Yngve Villanger |
Computing minimal triangulations in time O(nalpha log n) = o(n2.376). |
SODA |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Pinar Heggernes, Yngve Villanger |
Simple and Efficient Modifications of Elimination Orderings. |
PARA |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Anne Berry, Pinar Heggernes, Yngve Villanger |
A Vertex Incremental Approach for Dynamically Maintaining Chordal Graphs. |
ISAAC |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Pinar Heggernes, Yngve Villanger |
Efficient Implementation of a Minimal Triangulation Algorithm. |
ESA |
2002 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #46 of 46 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")