Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time

Pinar Heggernes, Pim van 't Hof, Daniel Lokshtanov, Jesper Nederlof. Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time. SIAM J. Discrete Math., 26(3):1008-1021, 2012. [doi]

@article{HeggernesHLN12,
  title = {Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time},
  author = {Pinar Heggernes and Pim van 't Hof and Daniel Lokshtanov and Jesper Nederlof},
  year = {2012},
  doi = {10.1137/110830514},
  url = {http://dx.doi.org/10.1137/110830514},
  researchr = {https://researchr.org/publication/HeggernesHLN12},
  cites = {0},
  citedby = {0},
  journal = {SIAM J. Discrete Math.},
  volume = {26},
  number = {3},
  pages = {1008-1021},
}