×
Compute Distance To:
Author ID: villanger.yngve Recent zbMATH articles by "Villanger, Yngve"
Published as: Villanger, Yngve; Villanger, Y.
External Links: MGP
Documents Indexed: 77 Publications since 2002
Co-Authors: 51 Co-Authors with 74 Joint Publications
1,224 Co-Co-Authors

Publications by Year

Citations contained in zbMATH Open

73 Publications have been cited 697 times in 468 Documents Cited by Year
Improved algorithms for feedback vertex set problems. Zbl 1152.68055
Chen, Jianer; Fomin, Fedor V.; Liu, Yang; Lu, Songjian; Villanger, Yngve
50
2008
Independent set in \(P_5\)-free graphs in polynomial time. Zbl 1422.68126
Lokshantov, Daniel; Vatshelle, Martin; Villanger, Yngve
38
2014
Finding induced subgraphs via minimal triangulations. Zbl 1230.68108
Fomin, Fedor V.; Villanger, Yngve
37
2010
Exact algorithms for treewidth and minimum fill-in. Zbl 1163.05320
Fomin, Fedor V.; Kratsch, Dieter; Todinca, Ioan; Villanger, Yngve
28
2008
Interval completion is fixed parameter tractable. Zbl 1227.05241
Villanger, Yngve; Heggernes, Pinar; Paul, Christophe; Telle, Jan Arne
25
2009
Capacitated domination and covering: A parameterized perspective. Zbl 1142.68371
Dom, Michael; Lokshtanov, Daniel; Saurabh, Saket; Villanger, Yngve
25
2008
Subexponential parameterized algorithm for minimum fill-in. Zbl 1285.68055
Fomin, Fedor V.; Villanger, Yngve
24
2013
Large induced subgraphs via triangulations and CMSO. Zbl 1357.05144
Fomin, Fedor V.; Todinca, Ioan; Villanger, Yngve
23
2015
\(\text{Kernel}(s)\) for problems with no kernel: on out-trees with many leaves. Zbl 1236.68087
Fernau, Henning; Fomin, Fedor V.; Lokshtanov, Daniel; Raible, Daniel; Saurabh, Saket; Villanger, Yngve
23
2009
A wide-range algorithm for minimal triangulation from an arbitrary ordering. Zbl 1093.68137
Berry, Anne; Bordat, Jean-Paul; Heggernes, Pinar; Simonet, Geneviéve; Villanger, Yngve
20
2006
Computing minimal triangulations in time \(O(n^{\alpha}\log n) = o(n ^{2.376})\). Zbl 1105.05066
Heggernes, Pinar; Telle, Jan Arne; Villanger, Yngve
20
2005
Tight bounds for parameterized complexity of cluster editing with a small number of clusters. Zbl 1311.68076
Fomin, Fedor V.; Kratsch, Stefan; Pilipczuk, Marcin; Pilipczuk, Michał; Villanger, Yngve
19
2014
Kernel(s) for problems with no kernel, on out-trees with many leaves. Zbl 1295.68120
Binkele-Raible, Daniel; Fernau, Henning; Fomin, Fedor V.; Lokshtanov, Daniel; Saurabh, Saket; Villanger, Yngve
17
2012
A polynomial kernel for proper interval vertex deletion. Zbl 1285.05160
Fomin, Fedor V.; Saurabh, Saket; Villanger, Yngve
16
2013
Treewidth computation and extremal combinatorics. Zbl 1289.05447
Fomin, Fedor V.; Villanger, Yngve
16
2012
Local search: is brute-force avoidable? Zbl 1244.68070
Fellows, Michael R.; Fomin, Fedor V.; Lokshtanov, Daniel; Rosamond, Frances; Saurabh, Saket; Villanger, Yngve
15
2012
Enumerating minimal subset feedback vertex sets. Zbl 1303.05189
Fomin, Fedor V.; Heggernes, Pinar; Kratsch, Dieter; Papadopoulos, Charis; Villanger, Yngve
14
2014
Proper interval vertex deletion. Zbl 1262.68052
van ’t Hof, Pim; Villanger, Yngve
12
2013
A vertex incremental approach for maintaining chordality. Zbl 1087.05054
Berry, Anne; Heggernes, Pinar; Villanger, Yngve
11
2006
Parameterized complexity for domination problems on degenerate graphs. Zbl 1202.68278
Golovach, Petr A.; Villanger, Yngve
11
2008
Computing pathwidth faster than \(2^{n }\). Zbl 1273.68284
Suchan, Karol; Villanger, Yngve
10
2009
Interval completion with few edges. Zbl 1232.68074
Heggernes, Pinar; Paul, Christophe; Teile, Jan Arne; Villanger, Yngve
10
2007
Induced subgraph isomorphism on proper interval and bipartite permutation graphs. Zbl 1303.68060
Heggernes, Pinar; van ’t Hof, Pim; Meister, Daniel; Villanger, Yngve
9
2015
Enumerating minimal dominating sets in chordal bipartite graphs. Zbl 1326.05105
Golovach, Petr A.; Heggernes, Pinar; Kanté, Mamadou M.; Kratsch, Dieter; Villanger, Yngve
9
2016
A quartic kernel for pathwidth-one vertex deletion. Zbl 1309.68100
Philip, Geevarghese; Raman, Venkatesh; Villanger, Yngve
9
2010
An incremental polynomial time algorithm to enumerate all minimal edge dominating sets. Zbl 1330.05118
Golovach, Petr A.; Heggernes, Pinar; Kratsch, Dieter; Villanger, Yngve
9
2015
Output-polynomial enumeration on graphs of bounded (local) linear MIM-width. Zbl 1383.05162
Golovach, Petr A.; Heggernes, Pinar; Kanté, Mamadou Moustapha; Kratsch, Dieter; Sæther, Sigve H.; Villanger, Yngve
8
2018
Connecting terminals and 2-disjoint connected subgraphs. Zbl 1417.05112
Telle, Jan Arne; Villanger, Yngve
8
2013
Parameterized complexity of vertex deletion into perfect graph classes. Zbl 1407.68223
Heggernes, Pinar; van ’t Hof, Pim; Jansen, Bart M. P.; Kratsch, Stefan; Villanger, Yngve
8
2013
Parameterized complexity of vertex deletion into perfect graph classes. Zbl 1342.68165
Heggernes, Pinar; van’t Hof, Pim; Jansen, Bart M. P.; Kratsch, Stefan; Villanger, Yngve
8
2011
Exploring the subexponential complexity of completion problems. Zbl 1347.68180
Drange, Pål Grønås; Fomin, Fedor V.; Pilipczuk, Michał; Villanger, Yngve
8
2015
Exploring subexponential parameterized complexity of completion problems. Zbl 1359.68126
Drange, Pål Grønås; Fomin, Fedor V.; Pilipczuk, Michał; Villanger, Yngve
8
2014
A multi-parameter analysis of hard problems on deterministic finite automata. Zbl 1320.68090
Fernau, Henning; Heggernes, Pinar; Villanger, Yngve
7
2015
Exact algorithm for the maximum induced planar subgraph problem. Zbl 1346.05283
Fomin, Fedor V.; Todinca, Ioan; Villanger, Yngve
7
2011
Minimal interval completions. Zbl 1162.68494
Heggernes, Pinar; Suchan, Karol; Todinca, Ioan; Villanger, Yngve
7
2005
Treewidth computation and extremal combinatorics. Zbl 1152.05376
Fomin, Fedor V.; Villanger, Yngve
7
2008
Characterizing minimal interval completions. Towards better understanding of profile and pathwidth. (Extended abstract). Zbl 1171.68620
Heggernes, Pinar; Suchan, Karol; Todinca, Ioan; Villanger, Yngve
7
2007
A vertex incremental approach for dynamically maintaining chordal graphs. Zbl 1205.68256
Berry, Anne; Heggernes, Pinar; Villanger, Yngve
6
2003
Improved exponential-time algorithms for treewidth and minimum fill-in. Zbl 1145.68475
Villanger, Yngve
6
2006
Proper interval vertex deletion. Zbl 1309.68157
Villanger, Yngve
6
2010
Induced subgraph isomorphism on interval and proper interval graphs. Zbl 1310.68109
Heggernes, Pinar; Meister, Daniel; Villanger, Yngve
6
2010
Faster parameterized algorithms for Minimum Fill-in. Zbl 1230.68100
Bodlaender, Hans L.; Heggernes, Pinar; Villanger, Yngve
6
2011
Maximum number of minimal feedback vertex sets in chordal graphs and cographs. Zbl 1365.05133
Couturier, Jean-François; Heggernes, Pinar; van ’t Hof, Pim; Villanger, Yngve
6
2012
Tight bounds for parameterized complexity of cluster editing. Zbl 1354.68119
Fomin, Fedor V.; Kratsch, Stefan; Pilipczuk, Marcin; Pilipczuk, Michał; Villanger, Yngve
5
2013
Minimal dominating sets in interval graphs and trees. Zbl 1350.05121
Golovach, Petr A.; Heggernes, Pinar; Kanté, Mamadou Moustapha; Kratsch, Dieter; Villanger, Yngve
5
2017
On the parameterised complexity of string morphism problems. Zbl 1350.68139
Fernau, Henning; Schmid, Markus L.; Villanger, Yngve
5
2016
On the parameterised complexity of string morphism problems. Zbl 1359.68128
Fernau, Henning; Schmid, Markus L.; Villanger, Yngve
5
2013
Computing minimal triangulations in time \(O(n^{\alpha \log n}) = o(n^{2.376})\). Zbl 1297.05120
Heggernes, Pinar; Telle, Jan Arne; Villanger, Yngve
4
2005
Enumerating minimal subset feedback vertex sets. Zbl 1342.68162
Fomin, Fedor V.; Heggernes, Pinar; Kratsch, Dieter; Papadopoulos, Charis; Villanger, Yngve
4
2011
Efficient implementation of a minimal triangulation algorithm. Zbl 1019.68809
Heggernes, Pinar; Villanger, Yngve
4
2002
Improved algorithms for the feedback vertex set problems. Zbl 1170.68653
Chen, Jianer; Fomin, Fedor V.; Liu, Yang; Lu, Songjian; Villanger, Yngve
4
2007
Minimum fill-in of sparse graphs: kernelization and approximation. Zbl 1310.68106
Fomin, Fedor V.; Philip, Geevarghese; Villanger, Yngve
3
2015
FPT algorithms for domination in biclique-free graphs. Zbl 1365.68291
Telle, Jan Arne; Villanger, Yngve
3
2012
Solving capacitated dominating set by using covering by subsets and maximum matching. Zbl 1310.05162
Liedloff, Mathieu; Todinca, Ioan; Villanger, Yngve
3
2010
Maximal induced matchings in triangle-free graphs. Zbl 1350.05130
Basavaraju, Manu; Heggernes, Pinar; Hof, Pim van’t; Saei, Reza; Villanger, Yngve
3
2016
Treewidth and pathwidth parameterized by the vertex cover number. Zbl 1305.68100
Chapelle, Mathieu; Liedloff, Mathieu; Todinca, Ioan; Villanger, Yngve
3
2013
A multivariate analysis of some DFA problems. Zbl 1377.68109
Fernau, Henning; Heggernes, Pinar; Villanger, Yngve
3
2013
Largest chordal and interval subgraphs faster than \(2^{n }\). Zbl 1394.68164
Bliznets, Ivan; Fomin, Fedor V.; Pilipczuk, Michał; Villanger, Yngve
3
2013
Subexponential parameterized algorithm for minimum fill-in. Zbl 1421.68061
Fomin, Fedor V.; Villanger, Yngve
2
2012
\(k\)-gap interval graphs. Zbl 1353.68124
Fomin, Fedor V.; Gaspers, Serge; Golovach, Petr; Suchan, Karol; Szeider, Stefan; van Leeuwen, Erik Jan; Vatshelle, Martin; Villanger, Yngve
2
2012
A parameterized algorithm for chordal sandwich. Zbl 1200.05226
Heggernes, Pinar; Mancini, Federico; Nederlof, Jesper; Villanger, Yngve
2
2010
Largest chordal and interval subgraphs faster than \(2^n\). Zbl 1347.05236
Bliznets, Ivan; Fomin, Fedor V.; Pilipczuk, Michał; Villanger, Yngve
2
2016
An incremental polynomial time algorithm to enumerate all minimal edge dominating sets. Zbl 1336.05133
Golovach, Petr A.; Heggernes, Pinar; Kratsch, Dieter; Villanger, Yngve
2
2013
Maximal induced matchings in triangle-free graphs. Zbl 1417.05159
Basavaraju, Manu; Heggernes, Pinar; van’t Hof, Pim; Saei, Reza; Villanger, Yngve
2
2014
Output-polynomial enumeration on graphs of bounded (local) linear MIM-width. Zbl 1382.05033
Golovach, Petr A.; Heggernes, Pinar; Kanté, Mamadou Moustapha; Kratsch, Dieter; Sæther, Sigve H.; Villanger, Yngve
1
2015
A polynomial kernel for Proper Interval Vertex Deletion. Zbl 1366.68092
Fomin, Fedor V.; Saurabh, Saket; Villanger, Yngve
1
2012
On the parameterized complexity of finding separators with non-hereditary properties. Zbl 1341.68060
Heggernes, Pinar; van’t Hof, Pim; Marx, Dániel; Misra, Neeldhara; Villanger, Yngve
1
2012
Solving Capacitated Dominating Set by using covering by subsets and maximum matching. Zbl 1285.05142
Liedloff, Mathieu; Todinca, Ioan; Villanger, Yngve
1
2014
Treewidth and pathwidth parameterized by the vertex cover number. Zbl 1350.68136
Chapelle, Mathieu; Liedloff, Mathieu; Todinca, Ioan; Villanger, Yngve
1
2017
On the parameterized complexity of finding separators with non-hereditary properties. Zbl 1328.68094
Heggernes, Pinar; van ’t Hof, Pim; Marx, Dániel; Misra, Neeldhara; Villanger, Yngve
1
2015
Lex M versus MCS-M. Zbl 1084.05071
Villanger, Yngve
1
2006
Faster parameterized algorithms for Minimum Fill-In. Zbl 1183.05075
Bodlaender, Hans L.; Heggernes, Pinar; Villanger, Yngve
1
2008
Minimum fill-in of sparse graphs: kernelization and approximation. Zbl 1246.68130
Fomin, Fedor V.; Philip, Geevarghese; Villanger, Yngve
1
2011
Output-polynomial enumeration on graphs of bounded (local) linear MIM-width. Zbl 1383.05162
Golovach, Petr A.; Heggernes, Pinar; Kanté, Mamadou Moustapha; Kratsch, Dieter; Sæther, Sigve H.; Villanger, Yngve
8
2018
Minimal dominating sets in interval graphs and trees. Zbl 1350.05121
Golovach, Petr A.; Heggernes, Pinar; Kanté, Mamadou Moustapha; Kratsch, Dieter; Villanger, Yngve
5
2017
Treewidth and pathwidth parameterized by the vertex cover number. Zbl 1350.68136
Chapelle, Mathieu; Liedloff, Mathieu; Todinca, Ioan; Villanger, Yngve
1
2017
Enumerating minimal dominating sets in chordal bipartite graphs. Zbl 1326.05105
Golovach, Petr A.; Heggernes, Pinar; Kanté, Mamadou M.; Kratsch, Dieter; Villanger, Yngve
9
2016
On the parameterised complexity of string morphism problems. Zbl 1350.68139
Fernau, Henning; Schmid, Markus L.; Villanger, Yngve
5
2016
Maximal induced matchings in triangle-free graphs. Zbl 1350.05130
Basavaraju, Manu; Heggernes, Pinar; Hof, Pim van’t; Saei, Reza; Villanger, Yngve
3
2016
Largest chordal and interval subgraphs faster than \(2^n\). Zbl 1347.05236
Bliznets, Ivan; Fomin, Fedor V.; Pilipczuk, Michał; Villanger, Yngve
2
2016
Large induced subgraphs via triangulations and CMSO. Zbl 1357.05144
Fomin, Fedor V.; Todinca, Ioan; Villanger, Yngve
23
2015
Induced subgraph isomorphism on proper interval and bipartite permutation graphs. Zbl 1303.68060
Heggernes, Pinar; van ’t Hof, Pim; Meister, Daniel; Villanger, Yngve
9
2015
An incremental polynomial time algorithm to enumerate all minimal edge dominating sets. Zbl 1330.05118
Golovach, Petr A.; Heggernes, Pinar; Kratsch, Dieter; Villanger, Yngve
9
2015
Exploring the subexponential complexity of completion problems. Zbl 1347.68180
Drange, Pål Grønås; Fomin, Fedor V.; Pilipczuk, Michał; Villanger, Yngve
8
2015
A multi-parameter analysis of hard problems on deterministic finite automata. Zbl 1320.68090
Fernau, Henning; Heggernes, Pinar; Villanger, Yngve
7
2015
Minimum fill-in of sparse graphs: kernelization and approximation. Zbl 1310.68106
Fomin, Fedor V.; Philip, Geevarghese; Villanger, Yngve
3
2015
Output-polynomial enumeration on graphs of bounded (local) linear MIM-width. Zbl 1382.05033
Golovach, Petr A.; Heggernes, Pinar; Kanté, Mamadou Moustapha; Kratsch, Dieter; Sæther, Sigve H.; Villanger, Yngve
1
2015
On the parameterized complexity of finding separators with non-hereditary properties. Zbl 1328.68094
Heggernes, Pinar; van ’t Hof, Pim; Marx, Dániel; Misra, Neeldhara; Villanger, Yngve
1
2015
Independent set in \(P_5\)-free graphs in polynomial time. Zbl 1422.68126
Lokshantov, Daniel; Vatshelle, Martin; Villanger, Yngve
38
2014
Tight bounds for parameterized complexity of cluster editing with a small number of clusters. Zbl 1311.68076
Fomin, Fedor V.; Kratsch, Stefan; Pilipczuk, Marcin; Pilipczuk, Michał; Villanger, Yngve
19
2014
Enumerating minimal subset feedback vertex sets. Zbl 1303.05189
Fomin, Fedor V.; Heggernes, Pinar; Kratsch, Dieter; Papadopoulos, Charis; Villanger, Yngve
14
2014
Exploring subexponential parameterized complexity of completion problems. Zbl 1359.68126
Drange, Pål Grønås; Fomin, Fedor V.; Pilipczuk, Michał; Villanger, Yngve
8
2014
Maximal induced matchings in triangle-free graphs. Zbl 1417.05159
Basavaraju, Manu; Heggernes, Pinar; van’t Hof, Pim; Saei, Reza; Villanger, Yngve
2
2014
Solving Capacitated Dominating Set by using covering by subsets and maximum matching. Zbl 1285.05142
Liedloff, Mathieu; Todinca, Ioan; Villanger, Yngve
1
2014
Subexponential parameterized algorithm for minimum fill-in. Zbl 1285.68055
Fomin, Fedor V.; Villanger, Yngve
24
2013
A polynomial kernel for proper interval vertex deletion. Zbl 1285.05160
Fomin, Fedor V.; Saurabh, Saket; Villanger, Yngve
16
2013
Proper interval vertex deletion. Zbl 1262.68052
van ’t Hof, Pim; Villanger, Yngve
12
2013
Connecting terminals and 2-disjoint connected subgraphs. Zbl 1417.05112
Telle, Jan Arne; Villanger, Yngve
8
2013
Parameterized complexity of vertex deletion into perfect graph classes. Zbl 1407.68223
Heggernes, Pinar; van ’t Hof, Pim; Jansen, Bart M. P.; Kratsch, Stefan; Villanger, Yngve
8
2013
Tight bounds for parameterized complexity of cluster editing. Zbl 1354.68119
Fomin, Fedor V.; Kratsch, Stefan; Pilipczuk, Marcin; Pilipczuk, Michał; Villanger, Yngve
5
2013
On the parameterised complexity of string morphism problems. Zbl 1359.68128
Fernau, Henning; Schmid, Markus L.; Villanger, Yngve
5
2013
Treewidth and pathwidth parameterized by the vertex cover number. Zbl 1305.68100
Chapelle, Mathieu; Liedloff, Mathieu; Todinca, Ioan; Villanger, Yngve
3
2013
A multivariate analysis of some DFA problems. Zbl 1377.68109
Fernau, Henning; Heggernes, Pinar; Villanger, Yngve
3
2013
Largest chordal and interval subgraphs faster than \(2^{n }\). Zbl 1394.68164
Bliznets, Ivan; Fomin, Fedor V.; Pilipczuk, Michał; Villanger, Yngve
3
2013
An incremental polynomial time algorithm to enumerate all minimal edge dominating sets. Zbl 1336.05133
Golovach, Petr A.; Heggernes, Pinar; Kratsch, Dieter; Villanger, Yngve
2
2013
Kernel(s) for problems with no kernel, on out-trees with many leaves. Zbl 1295.68120
Binkele-Raible, Daniel; Fernau, Henning; Fomin, Fedor V.; Lokshtanov, Daniel; Saurabh, Saket; Villanger, Yngve
17
2012
Treewidth computation and extremal combinatorics. Zbl 1289.05447
Fomin, Fedor V.; Villanger, Yngve
16
2012
Local search: is brute-force avoidable? Zbl 1244.68070
Fellows, Michael R.; Fomin, Fedor V.; Lokshtanov, Daniel; Rosamond, Frances; Saurabh, Saket; Villanger, Yngve
15
2012
Maximum number of minimal feedback vertex sets in chordal graphs and cographs. Zbl 1365.05133
Couturier, Jean-François; Heggernes, Pinar; van ’t Hof, Pim; Villanger, Yngve
6
2012
FPT algorithms for domination in biclique-free graphs. Zbl 1365.68291
Telle, Jan Arne; Villanger, Yngve
3
2012
Subexponential parameterized algorithm for minimum fill-in. Zbl 1421.68061
Fomin, Fedor V.; Villanger, Yngve
2
2012
\(k\)-gap interval graphs. Zbl 1353.68124
Fomin, Fedor V.; Gaspers, Serge; Golovach, Petr; Suchan, Karol; Szeider, Stefan; van Leeuwen, Erik Jan; Vatshelle, Martin; Villanger, Yngve
2
2012
A polynomial kernel for Proper Interval Vertex Deletion. Zbl 1366.68092
Fomin, Fedor V.; Saurabh, Saket; Villanger, Yngve
1
2012
On the parameterized complexity of finding separators with non-hereditary properties. Zbl 1341.68060
Heggernes, Pinar; van’t Hof, Pim; Marx, Dániel; Misra, Neeldhara; Villanger, Yngve
1
2012
Parameterized complexity of vertex deletion into perfect graph classes. Zbl 1342.68165
Heggernes, Pinar; van’t Hof, Pim; Jansen, Bart M. P.; Kratsch, Stefan; Villanger, Yngve
8
2011
Exact algorithm for the maximum induced planar subgraph problem. Zbl 1346.05283
Fomin, Fedor V.; Todinca, Ioan; Villanger, Yngve
7
2011
Faster parameterized algorithms for Minimum Fill-in. Zbl 1230.68100
Bodlaender, Hans L.; Heggernes, Pinar; Villanger, Yngve
6
2011
Enumerating minimal subset feedback vertex sets. Zbl 1342.68162
Fomin, Fedor V.; Heggernes, Pinar; Kratsch, Dieter; Papadopoulos, Charis; Villanger, Yngve
4
2011
Minimum fill-in of sparse graphs: kernelization and approximation. Zbl 1246.68130
Fomin, Fedor V.; Philip, Geevarghese; Villanger, Yngve
1
2011
Finding induced subgraphs via minimal triangulations. Zbl 1230.68108
Fomin, Fedor V.; Villanger, Yngve
37
2010
A quartic kernel for pathwidth-one vertex deletion. Zbl 1309.68100
Philip, Geevarghese; Raman, Venkatesh; Villanger, Yngve
9
2010
Proper interval vertex deletion. Zbl 1309.68157
Villanger, Yngve
6
2010
Induced subgraph isomorphism on interval and proper interval graphs. Zbl 1310.68109
Heggernes, Pinar; Meister, Daniel; Villanger, Yngve
6
2010
Solving capacitated dominating set by using covering by subsets and maximum matching. Zbl 1310.05162
Liedloff, Mathieu; Todinca, Ioan; Villanger, Yngve
3
2010
A parameterized algorithm for chordal sandwich. Zbl 1200.05226
Heggernes, Pinar; Mancini, Federico; Nederlof, Jesper; Villanger, Yngve
2
2010
Interval completion is fixed parameter tractable. Zbl 1227.05241
Villanger, Yngve; Heggernes, Pinar; Paul, Christophe; Telle, Jan Arne
25
2009
\(\text{Kernel}(s)\) for problems with no kernel: on out-trees with many leaves. Zbl 1236.68087
Fernau, Henning; Fomin, Fedor V.; Lokshtanov, Daniel; Raible, Daniel; Saurabh, Saket; Villanger, Yngve
23
2009
Computing pathwidth faster than \(2^{n }\). Zbl 1273.68284
Suchan, Karol; Villanger, Yngve
10
2009
Improved algorithms for feedback vertex set problems. Zbl 1152.68055
Chen, Jianer; Fomin, Fedor V.; Liu, Yang; Lu, Songjian; Villanger, Yngve
50
2008
Exact algorithms for treewidth and minimum fill-in. Zbl 1163.05320
Fomin, Fedor V.; Kratsch, Dieter; Todinca, Ioan; Villanger, Yngve
28
2008
Capacitated domination and covering: A parameterized perspective. Zbl 1142.68371
Dom, Michael; Lokshtanov, Daniel; Saurabh, Saket; Villanger, Yngve
25
2008
Parameterized complexity for domination problems on degenerate graphs. Zbl 1202.68278
Golovach, Petr A.; Villanger, Yngve
11
2008
Treewidth computation and extremal combinatorics. Zbl 1152.05376
Fomin, Fedor V.; Villanger, Yngve
7
2008
Faster parameterized algorithms for Minimum Fill-In. Zbl 1183.05075
Bodlaender, Hans L.; Heggernes, Pinar; Villanger, Yngve
1
2008
Interval completion with few edges. Zbl 1232.68074
Heggernes, Pinar; Paul, Christophe; Teile, Jan Arne; Villanger, Yngve
10
2007
Characterizing minimal interval completions. Towards better understanding of profile and pathwidth. (Extended abstract). Zbl 1171.68620
Heggernes, Pinar; Suchan, Karol; Todinca, Ioan; Villanger, Yngve
7
2007
Improved algorithms for the feedback vertex set problems. Zbl 1170.68653
Chen, Jianer; Fomin, Fedor V.; Liu, Yang; Lu, Songjian; Villanger, Yngve
4
2007
A wide-range algorithm for minimal triangulation from an arbitrary ordering. Zbl 1093.68137
Berry, Anne; Bordat, Jean-Paul; Heggernes, Pinar; Simonet, Geneviéve; Villanger, Yngve
20
2006
A vertex incremental approach for maintaining chordality. Zbl 1087.05054
Berry, Anne; Heggernes, Pinar; Villanger, Yngve
11
2006
Improved exponential-time algorithms for treewidth and minimum fill-in. Zbl 1145.68475
Villanger, Yngve
6
2006
Lex M versus MCS-M. Zbl 1084.05071
Villanger, Yngve
1
2006
Computing minimal triangulations in time \(O(n^{\alpha}\log n) = o(n ^{2.376})\). Zbl 1105.05066
Heggernes, Pinar; Telle, Jan Arne; Villanger, Yngve
20
2005
Minimal interval completions. Zbl 1162.68494
Heggernes, Pinar; Suchan, Karol; Todinca, Ioan; Villanger, Yngve
7
2005
Computing minimal triangulations in time \(O(n^{\alpha \log n}) = o(n^{2.376})\). Zbl 1297.05120
Heggernes, Pinar; Telle, Jan Arne; Villanger, Yngve
4
2005
A vertex incremental approach for dynamically maintaining chordal graphs. Zbl 1205.68256
Berry, Anne; Heggernes, Pinar; Villanger, Yngve
6
2003
Efficient implementation of a minimal triangulation algorithm. Zbl 1019.68809
Heggernes, Pinar; Villanger, Yngve
4
2002
all top 5

Cited by 566 Authors

35 Saurabh, Saket
33 Fomin, Fedor V.
32 Heggernes, Pinar
31 Pilipczuk, Michał
28 Golovach, Petr A.
27 Villanger, Yngve
26 Lokshtanov, Daniel
26 Pilipczuk, Marcin L.
21 Kratsch, Dieter
18 Cygan, Marek
15 Gutin, Gregory Z.
15 Todinca, Ioan
13 van ’t Hof, Pim
12 Bodlaender, Hans L.
12 Paulusma, Daniël
11 Niedermeier, Rolf
11 Raman, Venkatesh
11 Thilikos, Dimitrios M.
10 Fernau, Henning
10 Komusiewicz, Christian
10 Liedloff, Mathieu
10 Papadopoulos, Charis
10 Paul, Christophe
9 Agrawal, Akanksha
9 Ramanujan, M. S.
9 Yeo, Anders
8 Kanté, Mamadou Moustapha
8 Marx, Dániel
8 Panolan, Fahad
8 Van Leeuwen, Erik Jan
8 Wojtaszczyk, Jakub Onufry
7 Cao, Yixin
7 Jansen, Bart M. P.
7 Mancini, Federico
7 Misra, Neeldhara
7 Otachi, Yota
7 Philip, Geevarghese
7 Szeider, Stefan
7 Thomassé, Stéphan
6 Berry, Anne
6 Brandstädt, Andreas
6 Crespelle, Christophe
6 Gaspers, Serge
6 Guo, Jiong
6 Kratsch, Stefan
6 Perez, Anthony
6 Uno, Takeaki
6 Xiao, Mingyu
6 Zehavi, Meirav
5 Bergougnoux, Benjamin
5 Chen, Jian-er
5 Chudnovsky, Maria
5 Drange, Pål Grønås
5 Fellows, Michael Ralph
5 Hermelin, Danny
5 Kanesh, Lawqueen
5 Karthick, T.
5 Kim, Eun Jung
5 Kim, Eunjung
5 Maffray, Frédéric
5 Mnich, Matthias
5 Montealegre, Pedro
5 Mosca, Raffaele
5 Weller, Mathias
4 Bliznets, Ivan A.
4 Guillemot, Sylvain
4 Hanaka, Tesshu
4 Johnson, Matthew
4 Kobayashi, Yasuaki
4 Kwon, Ojoung
4 Lévêque, Benjamin
4 Li, Wenjun
4 Liu, Tian
4 Malyshev, Dmitry S.
4 Misra, Pranabendu
4 Moser, Hannes
4 Mouawad, Amer E.
4 Ono, Hirotaka
4 Sayadi, Mohamed Yosri
4 Schmid, Markus L.
4 Tale, Prafullkumar
4 van Bevern, René
4 Wang, Jianxin
4 Wrochna, Marcin
4 Xu, Ke
3 Bonnet, Edouard
3 Bousquet, Nicolas
3 Brettell, Nick
3 Chen, Li-Hsuan
3 Couturier, Jean-Francois
3 Dabrowski, Konrad Kazimierz
3 Dell, Holger
3 Eiben, Eduard
3 Escoffier, Bruno
3 Ganian, Robert
3 Gysel, Rob
3 Hartung, Sepp
3 Jain, Pallavi
3 Ke, Yuping
3 Kobayashi, Yusuke
...and 466 more Authors
all top 5

Cited in 53 Serials

69 Algorithmica
64 Theoretical Computer Science
50 Discrete Applied Mathematics
34 Journal of Computer and System Sciences
19 Theory of Computing Systems
15 Information Processing Letters
15 SIAM Journal on Discrete Mathematics
11 Discrete Mathematics
11 Journal of Combinatorial Optimization
8 Information and Computation
6 Discrete Optimization
4 Artificial Intelligence
4 Journal of Discrete Algorithms
4 Algorithms
3 The Electronic Journal of Combinatorics
2 Information Sciences
2 Journal of Combinatorial Theory. Series B
2 Journal of Graph Theory
2 SIAM Journal on Computing
2 Graphs and Combinatorics
2 Annals of Operations Research
2 Optimization Letters
2 ACM Transactions on Computation Theory
1 Computer Methods in Applied Mechanics and Engineering
1 Operations Research
1 European Journal of Combinatorics
1 Operations Research Letters
1 Combinatorica
1 Optimization
1 Journal of Automated Reasoning
1 International Journal of Approximate Reasoning
1 International Journal of Computational Geometry & Applications
1 Computational Geometry
1 International Journal of Foundations of Computer Science
1 Journal of Global Optimization
1 Numerical Algorithms
1 Computational Statistics and Data Analysis
1 Cybernetics and Systems Analysis
1 Computational Optimization and Applications
1 Fractals
1 Soft Computing
1 Journal of the ACM
1 Data Mining and Knowledge Discovery
1 RAIRO. Operations Research
1 South East Asian Journal of Mathematics and Mathematical Sciences
1 ACM Journal of Experimental Algorithmics
1 Mathematics in Computer Science
1 Logical Methods in Computer Science
1 Discrete Mathematics, Algorithms and Applications
1 RAIRO. Theoretical Informatics and Applications
1 Computer Science Review
1 Journal of Siberian Federal University. Mathematics & Physics
1 Bulletin of the Hellenic Mathematical Society

Citations by Year