| * | 2009 |
|---|
| 11 | EE | Pinar Heggernes,
Federico Mancini,
Charis Papadopoulos,
R. Sritharan:
Strongly Chordal and Chordal Bipartite Graphs Are Sandwich Monotone.
COCOON 2009: 398-407 |
| 10 | EE | Pinar Heggernes,
Federico Mancini:
Minimal split completions.
Discrete Applied Mathematics 157(12): 2659-2669 (2009) |
| 9 | EE | Pinar Heggernes,
Federico Mancini:
Dynamically maintaining split graphs.
Discrete Applied Mathematics 157(9): 2057-2069 (2009) |
| 2008 |
|---|
| 8 | EE | Daniel Lokshtanov,
Federico Mancini,
Charis Papadopoulos:
Characterizing and Computing Minimal Cograph Completions.
FAW 2008: 147-158 |
| 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 | Hans L. Bodlaender,
Michael R. Fellows,
Pinar Heggernes,
Federico Mancini,
Charis Papadopoulos,
Frances A. Rosamond:
Clustering with Partial Information.
MFCS 2008: 144-155 |
| 5 | EE | Pinar Heggernes,
Federico Mancini,
Charis Papadopoulos:
Minimal comparability completions of arbitrary graphs.
Discrete Applied Mathematics 156(5): 705-718 (2008) |
| 2007 |
|---|
| 4 | EE | Federico Mancini:
Minimum Fill-In and Treewidth of Split+ ke and Split+ kv Graphs.
ISAAC 2007: 881-892 |
| 2006 |
|---|
| 3 | EE | Pinar Heggernes,
Federico Mancini,
Charis Papadopoulos:
Making Arbitrary Graphs Transitively Orientable: Minimal Comparability Completions.
ISAAC 2006: 419-428 |
| 2 | EE | Pinar Heggernes,
Federico Mancini:
Minimal Split Completions of Graphs.
LATIN 2006: 592-604 |
| 1 | EE | Federico Mancini,
Pinar Heggernes:
A completely dynamic algorithm for split graphs.
Electronic Notes in Discrete Mathematics 27: 69-70 (2006) |
