F. Mancini

Available identifiers

Publication	Date of Publication	Type
Trade-offs in delayed information transmission in biochemical networks	2016-06-01	Paper
Strongly chordal and chordal bipartite graphs are sandwich monotone	2011-12-15	Paper
On the complexity of reconstructing H-free graphs from their Star Systems	2011-10-12	Paper
A Parameterized Algorithm for Chordal Sandwich	2010-05-28	Paper
Minimum fill-in and treewidth of split \(+ ke\) and split \(+kv\) graphs	2010-05-25	Paper
Characterizing and computing minimal cograph completions	2010-05-25	Paper
Minimal split completions	2010-04-28	Paper
Rooted directed path graphs are leaf powers	2010-04-27	Paper
Clustering with partial information	2010-03-09	Paper
Strongly Chordal and Chordal Bipartite Graphs Are Sandwich Monotone	2009-07-23	Paper
Dynamically maintaining split graphs	2009-06-24	Paper
Clustering with Partial Information	2009-02-03	Paper
Minimal Split Completions of Graphs	2008-09-18	Paper
Characterizing and Computing Minimal Cograph Completions	2008-06-19	Paper
Minimum Fill-In and Treewidth of Split+ ke and Split+ kv Graphs	2008-05-27	Paper
Making Arbitrary Graphs Transitively Orientable: Minimal Comparability Completions	2008-04-24	Paper
On the Complexity of Reconstructing H-free Graphs from Their Star Systems	2008-04-15	Paper
Minimal comparability completions of arbitrary graphs	2008-03-18	Paper
A completely dynamic algorithm for split graphs	2007-05-29	Paper

This page was built for person: F. Mancini