Go to the corresponding LIPIcs Volume Portal 
Elberfeld, Michael ; Schweitzer, Pascal
pdfformat: 

@InProceedings{elberfeld_et_al:LIPIcs:2016:5733, author = {Michael Elberfeld and Pascal Schweitzer}, title = {{Canonizing Graphs of Bounded Tree Width in Logspace}}, booktitle = {33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016)}, pages = {32:132:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959770019}, ISSN = {18688969}, year = {2016}, volume = {47}, editor = {Nicolas Ollinger and Heribert Vollmer}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2016/5733}, URN = {urn:nbn:de:0030drops57336}, doi = {10.4230/LIPIcs.STACS.2016.32}, annote = {Keywords: algorithmic graph theory, computational complexity, graph isomorphism, logspace, tree width} }
Keywords:  algorithmic graph theory, computational complexity, graph isomorphism, logspace, tree width  
Seminar:  33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016)  
Issue Date:  2016  
Date of publication:  16.02.2016 