18 citations · 50 across the 37 of their papers we have counts for
Showing 2013 · cs.DSShow all
2 papers · 2 filters
cs.DS2013★ 2 cited
Augmenting graphs to minimize the diameter
Fabrizio Frati, Serge Gaspers, Joachim Gudmundsson +1
We study the problem of augmenting a weighted graph by inserting edges of bounded total cost while minimizing the diameter of the augmented graph. Our main result is an FPT 4-appro…
cs.DS2013
SEFE with No Mapping via Large Induced Outerplane Graphs in Plane Graphs
Patrizio Angelini, William Evans, Fabrizio Frati +1
We show that every -vertex planar graph admits a simultaneous embedding with no mapping and with fixed edges with any -vertex planar graph. In order to achieve this resul…