| 2008 |
|---|
| 10 | EE | Daniel Lokshtanov,
Federico Mancini,
Charis Papadopoulos:
Characterizing and Computing Minimal Cograph Completions.
FAW 2008: 147-158 |
| 9 | EE | Daniel Lokshtanov:
Wheel-Free Deletion Is W[2]-Hard.
IWPEC 2008: 141-147 |
| 8 | EE | Michael Dom,
Daniel Lokshtanov,
Saket Saurabh,
Yngve Villanger:
Capacitated Domination and Covering: A Parameterized Perspective.
IWPEC 2008: 78-90 |
| 7 | 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 |
| 6 | 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) |
| 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 |
