Go to the corresponding LIPIcs Volume Portal 
pdfformat: 

@InProceedings{dawar_et_al:LIPIcs.MFCS.2021.37, author = {Dawar, Anuj and Vagnozzi, Danny}, title = {{On the Relative Power of Linear Algebraic Approximations of Graph Isomorphism}}, booktitle = {46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)}, pages = {37:137:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959772013}, ISSN = {18688969}, year = {2021}, volume = {202}, editor = {Bonchi, Filippo and Puglisi, Simon J.}, publisher = {Schloss Dagstuhl  LeibnizZentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/opus/volltexte/2021/14477}, URN = {urn:nbn:de:0030drops144774}, doi = {10.4230/LIPIcs.MFCS.2021.37}, annote = {Keywords: Graph isomorphism, proof complexity, invertible map tests} }
Keywords:  Graph isomorphism, proof complexity, invertible map tests  
Collection:  46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)  
Issue Date:  2021  
Date of publication:  18.08.2021 