Toshimasa Ishii, Kengo Iwata, Hiroshi Nagamochi. Bisecting a Four-Connected Graph with Three Resource Sets. In Xiaotie Deng, Ding-Zhu Du, editors, Algorithms and Computation, 16th International Symposium, ISAAC 2005, Sanya, Hainan, China, December 19-21, 2005, Proceedings. Volume 3827 of Lecture Notes in Computer Science, pages 176-185, Springer, 2005. [doi]
@inproceedings{IshiiIN05, title = {Bisecting a Four-Connected Graph with Three Resource Sets}, author = {Toshimasa Ishii and Kengo Iwata and Hiroshi Nagamochi}, year = {2005}, doi = {10.1007/11602613_19}, url = {http://dx.doi.org/10.1007/11602613_19}, tags = {graph-rewriting, rewriting}, researchr = {https://researchr.org/publication/IshiiIN05}, cites = {0}, citedby = {0}, pages = {176-185}, booktitle = {Algorithms and Computation, 16th International Symposium, ISAAC 2005, Sanya, Hainan, China, December 19-21, 2005, Proceedings}, editor = {Xiaotie Deng and Ding-Zhu Du}, volume = {3827}, series = {Lecture Notes in Computer Science}, publisher = {Springer}, isbn = {3-540-30935-7}, }