Andreas Emil Feldmann, Peter Widmayer. An /mathcal{O}(n^4) Time Algorithm to Compute the Bisection Width of Solid Grid Graphs. In Camil Demetrescu, Magnús M. Halldórsson, editors, Algorithms - ESA 2011 - 19th Annual European Symposium, Saarbrücken, Germany, September 5-9, 2011. Proceedings. Volume 6942 of Lecture Notes in Computer Science, pages 143-154, Springer, 2011. [doi]
@inproceedings{FeldmannW11,
title = {An /mathcal{O}(n^4) Time Algorithm to Compute the Bisection Width of Solid Grid Graphs},
author = {Andreas Emil Feldmann and Peter Widmayer},
year = {2011},
doi = {10.1007/978-3-642-23719-5_13},
url = {http://dx.doi.org/10.1007/978-3-642-23719-5_13},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/FeldmannW11},
cites = {0},
citedby = {0},
pages = {143-154},
booktitle = {Algorithms - ESA 2011 - 19th Annual European Symposium, Saarbrücken, Germany, September 5-9, 2011. Proceedings},
editor = {Camil Demetrescu and Magnús M. Halldórsson},
volume = {6942},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-642-23718-8},
}