|
Search the dblp DataBase
Federico Mancini:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Pinar Heggernes, Federico Mancini, Charis Papadopoulos
Making Arbitrary Graphs Transitively Orientable: Minimal Comparability Completions. [Citation Graph (0, 0)][DBLP] ISAAC, 2006, pp:419-428 [Conf]
- Pinar Heggernes, Federico Mancini
Minimal Split Completions of Graphs. [Citation Graph (0, 0)][DBLP] LATIN, 2006, pp:592-604 [Conf]
Investigating the Limitations of Java Annotations for Input Validation. [Citation Graph (, )][DBLP]
A Parameterized Algorithm for Chordal Sandwich. [Citation Graph (, )][DBLP]
Strongly Chordal and Chordal Bipartite Graphs Are Sandwich Monotone. [Citation Graph (, )][DBLP]
Minimum Fill-In and Treewidth of Split+ ke and Split+ kv Graphs. [Citation Graph (, )][DBLP]
On the Complexity of Reconstructing H -free Graphs from Their Star Systems. [Citation Graph (, )][DBLP]
Clustering with Partial Information. [Citation Graph (, )][DBLP]
Characterizing and Computing Minimal Cograph Completions. [Citation Graph (, )][DBLP]
Minimal comparability completions of arbitrary graphs. [Citation Graph (, )][DBLP]
Dynamically maintaining split graphs. [Citation Graph (, )][DBLP]
Minimal split completions. [Citation Graph (, )][DBLP]
Minimum fill-in and treewidth of split+ke and split+kv graphs. [Citation Graph (, )][DBLP]
Characterizing and computing minimal cograph completions. [Citation Graph (, )][DBLP]
Rooted directed path graphs are leaf powers. [Citation Graph (, )][DBLP]
Search in 0.001secs, Finished in 0.002secs
|