Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time

Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time. Heggernes, P., van 't Hof, P., Lokshtanov, D., & Nederlof, J. SIAM J. Discrete Math., 26(3):1008–1021, 2012.

Paper doi bibtex

@article{DBLP:journals/siamdm/HeggernesHLN12,
  author    = {Pinar Heggernes and
               Pim van 't Hof and
               Daniel Lokshtanov and
               Jesper Nederlof},
  title     = {Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time},
  journal   = {{SIAM} J. Discrete Math.},
  volume    = {26},
  number    = {3},
  pages     = {1008--1021},
  year      = {2012},
  url       = {https://doi.org/10.1137/110830514},
  doi       = {10.1137/110830514},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/siamdm/HeggernesHLN12},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

Downloads: 0

{"_id":"cBXsTjSYxSiDKhXpQ","bibbaseid":"heggernes-vanthof-lokshtanov-nederlof-computingthecutwidthofbipartitepermutationgraphsinlineartime-2012","downloads":0,"creationDate":"2018-12-05T09:14:34.528Z","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":"https://dblp.org/pid/33/7187.bib","bibdata":{"bibtype":"article","type":"article","author":[{"firstnames":["Pinar"],"propositions":[],"lastnames":["Heggernes"],"suffixes":[]},{"firstnames":["Pim"],"propositions":["van"],"lastnames":["'t","Hof"],"suffixes":[]},{"firstnames":["Daniel"],"propositions":[],"lastnames":["Lokshtanov"],"suffixes":[]},{"firstnames":["Jesper"],"propositions":[],"lastnames":["Nederlof"],"suffixes":[]}],"title":"Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time","journal":"SIAM J. Discrete Math.","volume":"26","number":"3","pages":"1008–1021","year":"2012","url":"https://doi.org/10.1137/110830514","doi":"10.1137/110830514","timestamp":"Thu, 08 Jun 2017 01:00:00 +0200","biburl":"https://dblp.org/rec/bib/journals/siamdm/HeggernesHLN12","bibsource":"dblp computer science bibliography, https://dblp.org","bibtex":"@article{DBLP:journals/siamdm/HeggernesHLN12,\n author = {Pinar Heggernes and\n Pim van 't Hof and\n Daniel Lokshtanov and\n Jesper Nederlof},\n title = {Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time},\n journal = {{SIAM} J. Discrete Math.},\n volume = {26},\n number = {3},\n pages = {1008--1021},\n year = {2012},\n url = {https://doi.org/10.1137/110830514},\n doi = {10.1137/110830514},\n timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},\n biburl = {https://dblp.org/rec/bib/journals/siamdm/HeggernesHLN12},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n","author_short":["Heggernes, P.","van 't Hof, P.","Lokshtanov, D.","Nederlof, J."],"key":"DBLP:journals/siamdm/HeggernesHLN12","id":"DBLP:journals/siamdm/HeggernesHLN12","bibbaseid":"heggernes-vanthof-lokshtanov-nederlof-computingthecutwidthofbipartitepermutationgraphsinlineartime-2012","role":"author","urls":{"Paper":"https://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":["qoaa8S6oo6iCH58av"]}