Advances on Testing C-Planarity of Embedded Flat Clustered Graphs
  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. 
Markus Chimani, Giuseppe Di Battista, Fabrizio Frati and Karsten Klein
cs.DS cs.CG cs.DM