%0 Journal Article %1 journals/jda/AngeliniBFPR12 %A Angelini, Patrizio %A Battista, Giuseppe Di %A Frati, Fabrizio %A Patrignani, Maurizio %A Rutter, Ignaz %D 2012 %J J. Discrete Algorithms %K dblp %P 150-172 %T Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph. %U http://dblp.uni-trier.de/db/journals/jda/jda14.html#AngeliniBFPR12 %V 14

@article{journals/jda/AngeliniBFPR12, added-at = {2018-11-30T00:00:00.000+0100}, author = {Angelini, Patrizio and Battista, Giuseppe Di and Frati, Fabrizio and Patrignani, Maurizio and Rutter, Ignaz}, biburl = {https://puma.ub.uni-stuttgart.de/bibtex/2cebd3a68224056cdb87c6fa724d6060c/dblp}, ee = {https://www.wikidata.org/entity/Q56689204}, interhash = {e4946cc3f0499a645414c66adb219106}, intrahash = {cebd3a68224056cdb87c6fa724d6060c}, journal = {J. Discrete Algorithms}, keywords = {dblp}, pages = {150-172}, timestamp = {2019-09-27T08:36:54.000+0200}, title = {Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph.}, url = {http://dblp.uni-trier.de/db/journals/jda/jda14.html#AngeliniBFPR12}, volume = 14, year = 2012 }