2 papers
cs.DS2014
Advances on Testing C-Planarity of Embedded Flat Clustered Graphs
Markus Chimani, Giuseppe Di Battista, Fabrizio Frati +1
We show a polynomial-time algorithm for testing c-planarity of embedded flat clustered graphs with at most two vertices per cluster on each face.
cs.NI2012
Computational Complexity of Traffic Hijacking under BGP and S-BGP
Marco Chiesa, Giuseppe Di Battista, Thomas Erlebach +1
Harmful Internet hijacking incidents put in evidence how fragile the Border Gateway Protocol (BGP) is, which is used to exchange routing information between Autonomous Systems (ASe…