@inbook {IOPORT.05825344,
    author       = {Haeupler, Bernhard and Jampani, Krishnam Raju and Lubiw, Anna},
    title        = {Testing simultaneous planarity when the common graph is 2-connected.},
    year         = {2010},
    booktitle    = {Algorithms and computation. 21st international symposium, ISAAC 2010, Jeju, Korea, December 15--17, 2010. Proceedings, Part II},
    isbn         = {978-3-642-17513-8},
    pages        = {410-421},
    publisher    = {Berlin: Springer},
    doi          = {10.1007/978-3-642-17514-5_35},
    abstract     = {Summary: Two planar graphs $G _{1}$ and $G _{2}$ sharing some vertices and edges are simultaneously planar if they have planar drawings such that a shared vertex [edge] is represented by the same point [curve] in both drawings. It is an open problem whether simultaneous planarity can be tested efficiently. We give a linear-time algorithm to test simultaneous planarity when the two graphs share a 2-connected subgraph. Our algorithm extends to the case of $k$ planar graphs where each vertex [edge] is either common to all graphs or belongs to exactly one of them.},
    identifier   = {05825344},
}