@article{ dblp2621636,
  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},
  author_short = {Heggernes, P. and van 't Hof, P. and Lokshtanov, D. and Nederlof, J.},
  bibtype = {article},
  type = {article},
  year = {2012},
  key = {dblp2621636},
  id = {dblp2621636},
  biburl = {http://www.dblp.org/rec/bibtex/journals/siamdm/HeggernesHLN12},
  url = {http://dx.doi.org/10.1137/110830514},
  journal = {SIAM J. Discrete Math. (SIAMDM)},
  pages = {1008-1021},
  number = {3},
  volume = {26},
  text = {SIAM J. Discrete Math. (SIAMDM) 26(3):1008-1021 (2012)}
}

{"_id":"enpjkKTkikkhoqjXK","bibbaseid":"heggernes-vanaposthof-lokshtanov-nederlof-computingthecutwidthofbipartitepermutationgraphsinlineartime-2012","downloads":0,"creationDate":"2016-02-19T11:50:52.810Z","title":"Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time","author_short":["Heggernes, P.","van 't Hof, P.","Lokshtanov, D.","Nederlof, J."],"year":2012,"bibtype":"article","biburl":"http://www.dblp.org/rec/bibtex/journals/siamdm/HeggernesHLN12","bibdata":{"title":"Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time","author":["Pinar Heggernes","Pim van 't Hof","Daniel Lokshtanov","Jesper Nederlof"],"author_short":["Heggernes, P.","van 't Hof, P.","Lokshtanov, D.","Nederlof, J."],"bibtype":"article","type":"article","year":"2012","key":"dblp2621636","id":"dblp2621636","biburl":"http://www.dblp.org/rec/bibtex/journals/siamdm/HeggernesHLN12","url":"http://dx.doi.org/10.1137/110830514","journal":"SIAM J. Discrete Math. (SIAMDM)","pages":"1008-1021","number":"3","volume":"26","text":"SIAM J. Discrete Math. (SIAMDM) 26(3):1008-1021 (2012)","bibtex":"@article{ dblp2621636,\n title = {Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time},\n author = {Pinar Heggernes and Pim van 't Hof and Daniel Lokshtanov and Jesper Nederlof},\n author_short = {Heggernes, P. and van 't Hof, P. and Lokshtanov, D. and Nederlof, J.},\n bibtype = {article},\n type = {article},\n year = {2012},\n key = {dblp2621636},\n id = {dblp2621636},\n biburl = {http://www.dblp.org/rec/bibtex/journals/siamdm/HeggernesHLN12},\n url = {http://dx.doi.org/10.1137/110830514},\n journal = {SIAM J. Discrete Math. (SIAMDM)},\n pages = {1008-1021},\n number = {3},\n volume = {26},\n text = {SIAM J. Discrete Math. (SIAMDM) 26(3):1008-1021 (2012)}\n}","bibbaseid":"heggernes-vanaposthof-lokshtanov-nederlof-computingthecutwidthofbipartitepermutationgraphsinlineartime-2012","role":"author","urls":{"Paper":"http://dx.doi.org/10.1137/110830514"},"downloads":0},"search_terms":["computing","cutwidth","bipartite","permutation","graphs","linear","time","heggernes","van 't hof","lokshtanov","nederlof"],"keywords":[],"authorIDs":[],"dataSources":["BG93bDko4r8d3vKdg"]}