Polar permutation graphs are polynomial-time recognisable

Tinaz Ekim, Pinar Heggernes, Daniel Meister. Polar permutation graphs are polynomial-time recognisable. Eur. J. Comb., 34(3):576-592, 2013. [doi]

@article{EkimHM13,
  title = {Polar permutation graphs are polynomial-time recognisable},
  author = {Tinaz Ekim and Pinar Heggernes and Daniel Meister},
  year = {2013},
  doi = {10.1016/j.ejc.2011.12.007},
  url = {http://dx.doi.org/10.1016/j.ejc.2011.12.007},
  researchr = {https://researchr.org/publication/EkimHM13},
  cites = {0},
  citedby = {0},
  journal = {Eur. J. Comb.},
  volume = {34},
  number = {3},
  pages = {576-592},
}