Computing maximum upward planar subgraphs of single-source embedded digraphs

Aimal Rextin, Patrick Healy. Computing maximum upward planar subgraphs of single-source embedded digraphs. J. Comb. Optim., 25(3):368-392, 2013. [doi]

@article{RextinH13,
  title = {Computing maximum upward planar subgraphs of single-source embedded digraphs},
  author = {Aimal Rextin and Patrick Healy},
  year = {2013},
  doi = {10.1007/s10878-010-9373-z},
  url = {http://dx.doi.org/10.1007/s10878-010-9373-z},
  researchr = {https://researchr.org/publication/RextinH13},
  cites = {0},
  citedby = {0},
  journal = {J. Comb. Optim.},
  volume = {25},
  number = {3},
  pages = {368-392},
}