![]() |
| 2008 | ||
|---|---|---|
| 4 | 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 |
| 2007 | ||
| 3 | EE | Federico Mancini: Minimum Fill-In and Treewidth of Split+ ke and Split+ kv Graphs. ISAAC 2007: 881-892 |
| 2006 | ||
| 2 | EE | Pinar Heggernes, Federico Mancini, Charis Papadopoulos: Making Arbitrary Graphs Transitively Orientable: Minimal Comparability Completions. ISAAC 2006: 419-428 |
| 1 | EE | Pinar Heggernes, Federico Mancini: Minimal Split Completions of Graphs. LATIN 2006: 592-604 |
| 1 | Fedor V. Fomin | [4] |
| 2 | Pinar Heggernes | [1] [2] |
| 3 | Jan Kratochvíl | [4] |
| 4 | Daniel Lokshtanov | [4] |
| 5 | Charis Papadopoulos | [2] |
| 6 | Jan Arne Telle | [4] |