%0 Journal Article %1 journals/algorithmica/AngeliniBP11 %A Angelini, Patrizio %A Battista, Giuseppe Di %A Patrignani, Maurizio %D 2011 %J Algorithmica %K dblp %N 4 %P 890-937 %T Finding a Minimum-depth Embedding of a Planar Graph in O(n4) Time. %U http://dblp.uni-trier.de/db/journals/algorithmica/algorithmica60.html#AngeliniBP11 %V 60

@article{journals/algorithmica/AngeliniBP11, added-at = {2011-05-16T00:00:00.000+0200}, author = {Angelini, Patrizio and Battista, Giuseppe Di and Patrignani, Maurizio}, biburl = {https://www.bibsonomy.org/bibtex/22e33b0460b58e4b59a9c8f5f14494f67/dblp}, ee = {http://dx.doi.org/10.1007/s00453-009-9380-6}, interhash = {5471badd0c362ec23c67cca92feaa2dd}, intrahash = {2e33b0460b58e4b59a9c8f5f14494f67}, journal = {Algorithmica}, keywords = {dblp}, number = 4, pages = {890-937}, timestamp = {2011-05-17T11:32:33.000+0200}, title = {Finding a Minimum-depth Embedding of a Planar Graph in O(n4) Time.}, url = {http://dblp.uni-trier.de/db/journals/algorithmica/algorithmica60.html#AngeliniBP11}, volume = 60, year = 2011 }