Yngve Villanger

2009
24	EE	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
23	EE	Yngve Villanger, Pinar Heggernes, Christophe Paul, Jan Arne Telle: Interval Completion Is Fixed Parameter Tractable. SIAM J. Comput. 38(5): 2007-2020 (2009)
2008
22	EE	Fedor V. Fomin, Yngve Villanger: Treewidth Computation and Extremal Combinatorics. ICALP (1) 2008: 210-221
21	EE	Hans L. Bodlaender, Pinar Heggernes, Yngve Villanger: Faster Parameterized Algorithms for Minimum Fill-In. ISAAC 2008: 282-293
20	EE	Michael Dom, Daniel Lokshtanov, Saket Saurabh, Yngve Villanger: Capacitated Domination and Covering: A Parameterized Perspective. IWPEC 2008: 78-90
19	EE	Petr A. Golovach, Yngve Villanger: Parameterized Complexity for Domination Problems on Degenerate Graphs. WG 2008: 195-205
18	EE	Yngve Villanger: Fast Minimal Triangulation. Encyclopedia of Algorithms 2008
17	EE	Fedor V. Fomin, Yngve Villanger: Treewidth computation and extremal combinatorics CoRR abs/0803.1321: (2008)
16	EE	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)
15	EE	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)
14	EE	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)
2007
13	EE	Pinar Heggernes, Karol Suchan, Ioan Todinca, Yngve Villanger: Characterizing Minimal Interval Completions. STACS 2007: 236-247
12	EE	Pinar Heggernes, Christophe Paul, Jan Arne Telle, Yngve Villanger: Interval completion with few edges. STOC 2007: 374-381
11	EE	Jianer Chen, Fedor V. Fomin, Yang Liu, Songjian Lu, Yngve Villanger: Improved Algorithms for the Feedback Vertex Set Problems. WADS 2007: 422-433
2006
10	EE	Yngve Villanger: Improved Exponential-Time Algorithms for Treewidth and Minimum Fill-In. LATIN 2006: 800-811
9	EE	Anne Berry, Pinar Heggernes, Yngve Villanger: A vertex incremental approach for maintaining chordality. Discrete Mathematics 306(3): 318-336 (2006)
8	EE	Yngve Villanger: Lex M versus MCS-M. Discrete Mathematics 306(3): 393-400 (2006)
7	EE	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)
2005
6	EE	Pinar Heggernes, Karol Suchan, Ioan Todinca, Yngve Villanger: Minimal Interval Completions. ESA 2005: 403-414
5	EE	Pinar Heggernes, Jan Arne Telle, Yngve Villanger: Computing minimal triangulations in time O(nalpha log n) = o(n2.376). SODA 2005: 907-916
4	EE	Pinar Heggernes, Jan Arne Telle, Yngve Villanger: Computing Minimal Triangulations in Time O(nalpha log n) = o(n 2.376). SIAM J. Discrete Math. 19(4): 900-913 (2005)
2004
3	EE	Pinar Heggernes, Yngve Villanger: Simple and Efficient Modifications of Elimination Orderings. PARA 2004: 788-797
2003
2	EE	Anne Berry, Pinar Heggernes, Yngve Villanger: A Vertex Incremental Approach for Dynamically Maintaining Chordal Graphs. ISAAC 2003: 47-57
2002
1	EE	Pinar Heggernes, Yngve Villanger: Efficient Implementation of a Minimal Triangulation Algorithm. ESA 2002: 550-561

Coauthor Index

1	Anne Berry	[2] [7] [9]
2	Hans L. Bodlaender	[21]
3	Jean Paul Bordat	[7]
4	Jianer Chen	[11] [15]
5	Michael Dom	[20]
6	Henning Fernau	[16] [24]
7	Fedor V. Fomin	[11] [14] [15] [16] [17] [22] [24]
8	Petr A. Golovach	[19]
9	Pinar Heggernes	[1] [2] [3] [4] [5] [6] [7] [9] [12] [13] [21] [23]
10	Dieter Kratsch	[14]
11	Yang Liu	[11] [15]
12	Daniel Lokshtanov	[16] [20] [24]
13	Songjian Lu	[11] [15]
14	Christophe Paul	[12] [23]
15	Daniel Raible	[16] [24]
16	Saket Saurabh	[16] [20] [24]
17	Geneviève Simonet	[7]
18	Karol Suchan	[6] [13]
19	Jan Arne Telle	[4] [5] [12] [23]
20	Ioan Todinca	[6] [13] [14]