Daniel Lokshtanov

2009
16	EE	Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh: Clique-width: on the price of generality. SODA 2009: 825-834
15	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
14	EE	Hans L. Bodlaender, Fedor V. Fomin, Daniel Lokshtanov, Eelko Penninkx, Saket Saurabh, Dimitrios M. Thilikos: (Meta) Kernelization CoRR abs/0904.0727: (2009)
2008
13	EE	Daniel Lokshtanov, Federico Mancini, Charis Papadopoulos: Characterizing and Computing Minimal Cograph Completions. FAW 2008: 147-158
12	EE	Michael R. Fellows, Daniel Lokshtanov, Neeldhara Misra, Frances A. Rosamond, Saket Saurabh: Graph Layout Problems Parameterized by Vertex Cover. ISAAC 2008: 294-305
11	EE	Daniel Lokshtanov: Wheel-Free Deletion Is W[2]-Hard. IWPEC 2008: 141-147
10	EE	Michael Dom, Daniel Lokshtanov, Saket Saurabh, Yngve Villanger: Capacitated Domination and Covering: A Parameterized Perspective. IWPEC 2008: 78-90
9	EE	Fedor V. Fomin, Jan Kratochvíl, Daniel Lokshtanov, Federico Mancini, Jan Arne Telle: On the Complexity of Reconstructing H -free Graphs from Their Star Systems. LATIN 2008: 194-205
8	EE	Pinar Heggernes, Daniel Lokshtanov, Rodica Mihai, Charis Papadopoulos: Cutwidth of Split Graphs, Threshold Graphs, and Proper Interval Graphs. WG 2008: 218-229
7	EE	Michael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Elena Losievskaja, Frances A. Rosamond, Saket Saurabh: Parameterized Low-distortion Embeddings - Graph metrics into lines and trees CoRR abs/0804.3028: (2008)
6	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)
2007
5	EE	Michael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Frances A. Rosamond, Saket Saurabh, Stefan Szeider, Carsten Thomassen: On the Complexity of Some Colorful Problems Parameterized by Treewidth. COCOA 2007: 366-377
4	EE	Daniel Lokshtanov: On the Complexity of Computing Treelength. MFCS 2007: 276-287
2006
3	EE	Pinar Heggernes, Daniel Lokshtanov: Optimal broadcast domination in polynomial time. Discrete Mathematics 306(24): 3267-3280 (2006)
2005
2		Daniel Lokshtanov, Christian Sloper: Fixed Parameter Set Splitting, Linear Kernel and Improved Running Time. ACiD 2005: 105-113
1	EE	Pinar Heggernes, Daniel Lokshtanov: Optimal Broadcast Domination of Arbitrary Graphs in Polynomial Time. WG 2005: 187-198

Coauthor Index

1	Hans L. Bodlaender	[14]
2	Michael Dom	[10]
3	Michael R. Fellows (Mike Fellows)	[5] [7] [12]
4	Henning Fernau	[6] [15]
5	Fedor V. Fomin	[5] [6] [7] [9] [14] [15] [16]
6	Petr A. Golovach	[16]
7	Pinar Heggernes	[1] [3] [8]
8	Jan Kratochvíl	[9]
9	Elena Losievskaja	[7]
10	Federico Mancini	[9] [13]
11	Rodica Mihai	[8]
12	Neeldhara Misra	[12]
13	Charis Papadopoulos	[8] [13]
14	Eelko Penninkx	[14]
15	Daniel Raible	[6] [15]
16	Frances A. Rosamond	[5] [7] [12]
17	Saket Saurabh	[5] [6] [7] [10] [12] [14] [15] [16]
18	Christian Sloper	[2]
19	Stefan Szeider	[5]
20	Jan Arne Telle	[9]
21	Dimitrios M. Thilikos	[14]
22	Carsten Thomassen	[5]
23	Yngve Villanger	[6] [10] [15]