Go to the corresponding LIPIcs Volume Portal 
Balaji, Nikhil ; Datta, Samir ; Ganesan, Venkatesh
pdfformat: 

@InProceedings{balaji_et_al:LIPIcs:2015:5649, author = {Nikhil Balaji and Samir Datta and Venkatesh Ganesan}, title = {{Counting Euler Tours in Undirected Bounded Treewidth Graphs}}, booktitle = {35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015)}, pages = {246260}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783939897972}, ISSN = {18688969}, year = {2015}, volume = {45}, editor = {Prahladh Harsha and G. Ramalingam}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2015/5649}, URN = {urn:nbn:de:0030drops56493}, doi = {10.4230/LIPIcs.FSTTCS.2015.246}, annote = {Keywords: Euler Tours, Bounded Treewidth, Bounded cliquewidth, Hamiltonian cycles, Parallel algorithms} }
Keywords:  Euler Tours, Bounded Treewidth, Bounded cliquewidth, Hamiltonian cycles, Parallel algorithms  
Seminar:  35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015)  
Issue Date:  2015  
Date of publication:  11.12.2015 