Markus Bläser, Radu Curticapean. The Complexity of the Cover Polynomials for Planar Graphs of Bounded Degree. In Filip Murlak, Piotr Sankowski, editors, Mathematical Foundations of Computer Science 2011 - 36th International Symposium, MFCS 2011, Warsaw, Poland, August 22-26, 2011. Proceedings. Volume 6907 of Lecture Notes in Computer Science, pages 96-107, Springer, 2011. [doi]
@inproceedings{BlaserC11, title = {The Complexity of the Cover Polynomials for Planar Graphs of Bounded Degree}, author = {Markus Bläser and Radu Curticapean}, year = {2011}, doi = {10.1007/978-3-642-22993-0_12}, url = {http://dx.doi.org/10.1007/978-3-642-22993-0_12}, tags = {planar graph, graph-rewriting, rewriting}, researchr = {https://researchr.org/publication/BlaserC11}, cites = {0}, citedby = {0}, pages = {96-107}, booktitle = {Mathematical Foundations of Computer Science 2011 - 36th International Symposium, MFCS 2011, Warsaw, Poland, August 22-26, 2011. Proceedings}, editor = {Filip Murlak and Piotr Sankowski}, volume = {6907}, series = {Lecture Notes in Computer Science}, publisher = {Springer}, isbn = {978-3-642-22992-3}, }