Parameterized Complexity of Simultaneous Planarity

Simon D. Fink, Matthias Pfretzschner, Ignaz Rutter

Given $k$ input graphs $G_1,\dots ,G_k$, where each pair $G_i$, $G_j$ with $i\ne j$ shares the same graph $G$, the problem Simultaneous Embedding With Fixed Edges (SEFE) asks wh…