 | 2009 |
| 24 |  | Oren Ben-Zwi,
Danny Hermelin,
Daniel Lokshtanov,
Ilan Newman:
An exact almost optimal algorithm for target set selection in social networks.
ACM Conference on Electronic Commerce 2009: 355-362 |
| 23 |  | Michael Dom,
Daniel Lokshtanov,
Saket Saurabh:
Incompressibility through Colors and IDs.
ICALP (1) 2009: 378-389 |
| 22 |  | Michael R. Fellows,
Fedor V. Fomin,
Daniel Lokshtanov,
Elena Losievskaja,
Frances A. Rosamond,
Saket Saurabh:
Distortion Is Fixed Parameter Tractable.
ICALP (1) 2009: 463-474 |
| 21 |  | Noga Alon,
Daniel Lokshtanov,
Saket Saurabh:
Fast FAST.
ICALP (1) 2009: 49-58 |
| 20 |  | Michael R. Fellows,
Frances A. Rosamond,
Fedor V. Fomin,
Daniel Lokshtanov,
Saket Saurabh,
Yngve Villanger:
Local Search: Is Brute-Force Avoidable?
IJCAI 2009: 486-491 |
| 19 |  | Daniel Lokshtanov,
Saket Saurabh,
Somnath Sikdar:
Simpler Parameterized Algorithm for OCT.
IWOCA 2009: 380-384 |
| 18 |  | Fedor V. Fomin,
Petr A. Golovach,
Daniel Lokshtanov,
Saket Saurabh:
Clique-width: on the price of generality.
SODA 2009: 825-834 |
| 17 |  | 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 |
| 16 |  | Daniel Lokshtanov,
Matthias Mnich,
Saket Saurabh:
Linear Kernel for Planar Connected Dominating Set.
TAMC 2009: 281-290 |
| 15 |  | Hans L. Bodlaender,
Fedor V. Fomin,
Daniel Lokshtanov,
Eelko Penninkx,
Saket Saurabh,
Dimitrios M. Thilikos:
(Meta) Kernelization
CoRR abs/0904.0727: (2009) |
| 14 |  | Daniel Lokshtanov:
Finding the longest isometric cycle in a graph.
Discrete Applied Mathematics 157(12): 2670-2674 (2009) |
| 2008 |
| 13 |  | Daniel Lokshtanov,
Federico Mancini,
Charis Papadopoulos:
Characterizing and Computing Minimal Cograph Completions.
FAW 2008: 147-158 |
| 12 |  | Michael R. Fellows,
Daniel Lokshtanov,
Neeldhara Misra,
Frances A. Rosamond,
Saket Saurabh:
Graph Layout Problems Parameterized by Vertex Cover.
ISAAC 2008: 294-305 |
| 11 |  | Daniel Lokshtanov:
Wheel-Free Deletion Is W[2]-Hard.
IWPEC 2008: 141-147 |
| 10 |  | Michael Dom,
Daniel Lokshtanov,
Saket Saurabh,
Yngve Villanger:
Capacitated Domination and Covering: A Parameterized Perspective.
IWPEC 2008: 78-90 |
| 9 |  | 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 |  | Pinar Heggernes,
Daniel Lokshtanov,
Rodica Mihai,
Charis Papadopoulos:
Cutwidth of Split Graphs, Threshold Graphs, and Proper Interval Graphs.
WG 2008: 218-229 |
| 7 |  | 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 |  | 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 |  | 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 |  | Daniel Lokshtanov:
On the Complexity of Computing Treelength.
MFCS 2007: 276-287 |
| 2006 |
| 3 |  | 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 |  | Pinar Heggernes,
Daniel Lokshtanov:
Optimal Broadcast Domination of Arbitrary Graphs in Polynomial Time.
WG 2005: 187-198 |