pdfformat: 

@InProceedings{chakraborty_et_al:LIPIcs:2014:4873, author = {Diptarka Chakraborty and A. Pavan and Raghunath Tewari and N. V. Vinodchandran and Lin Forrest Yang}, title = {{New TimeSpace Upperbounds for Directed Reachability in Highgenus and Hminorfree Graphs}}, booktitle = {34th International Conference on Foundation of Software Technology and Theoretical Computer Science (FSTTCS 2014)}, pages = {585595}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783939897774}, ISSN = {18688969}, year = {2014}, volume = {29}, editor = {Venkatesh Raman and S. P. Suresh}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2014/4873}, URN = {urn:nbn:de:0030drops48730}, doi = {10.4230/LIPIcs.FSTTCS.2014.585}, annote = {Keywords: Reachability, Space complexity, TimeSpace Efficient Algorithms, Graphs on Surfaces, Minor Free Graphs, Savitch's Algorithm, BBRS Bound} }
Keywords:  Reachability, Space complexity, TimeSpace Efficient Algorithms, Graphs on Surfaces, Minor Free Graphs, Savitch's Algorithm, BBRS Bound  
Seminar:  34th International Conference on Foundation of Software Technology and Theoretical Computer Science (FSTTCS 2014)  
Issue date:  2014  
Date of publication:  12.12.2014 