Fabian Wagner. Hardness results for isomorphism and automorphism of bounded valence graphs. In Viliam Geffert, Juhani Karhumäki, Alberto Bertoni, Bart Preneel, Pavol Návrat, Mária Bieliková, editors, SOFSEM 2008: Theory and Practice of Computer Science, 34th Conference on Current Trends in Theory and Practice of Computer Science, Nový Smokovec, Slovakia, January 19-25, 2008, Volume II - Student Research Forum. pages 131-140, Safarik University, Kosice, Slovakia, 2008.
Abstract is missing.