Jenish C. Mehta. Dynamic Complexity of Planar 3-Connected Graph Isomorphism. In Edward A. Hirsch, Sergei O. Kuznetsov, Jean-Éric Pin, Nikolay K. Vereshchagin, editors, Computer Science - Theory and Applications - 9th International Computer Science Symposium in Russia, CSR 2014, Moscow, Russia, June 7-11, 2014. Proceedings. Volume 8476 of Lecture Notes in Computer Science, pages 273-286, Springer, 2014. [doi]
@inproceedings{Mehta14, title = {Dynamic Complexity of Planar 3-Connected Graph Isomorphism}, author = {Jenish C. Mehta}, year = {2014}, doi = {10.1007/978-3-319-06686-8_21}, url = {http://dx.doi.org/10.1007/978-3-319-06686-8_21}, researchr = {https://researchr.org/publication/Mehta14}, cites = {0}, citedby = {0}, pages = {273-286}, booktitle = {Computer Science - Theory and Applications - 9th International Computer Science Symposium in Russia, CSR 2014, Moscow, Russia, June 7-11, 2014. Proceedings}, editor = {Edward A. Hirsch and Sergei O. Kuznetsov and Jean-Éric Pin and Nikolay K. Vereshchagin}, volume = {8476}, series = {Lecture Notes in Computer Science}, publisher = {Springer}, isbn = {978-3-319-06685-1}, }