Go to the corresponding LIPIcs Volume Portal 
Gupta, Chetan ; Jain, Rahul ; Tewari, Raghunath
pdfformat: 

@InProceedings{gupta_et_al:LIPIcs.FSTTCS.2021.23, author = {Gupta, Chetan and Jain, Rahul and Tewari, Raghunath}, title = {{Time Space Optimal Algorithm for Computing Separators in Bounded Genus Graphs}}, booktitle = {41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2021)}, pages = {23:123:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959772150}, ISSN = {18688969}, year = {2021}, volume = {213}, editor = {Boja\'{n}czy, Miko{\l}aj and Chekuri, Chandra}, publisher = {Schloss Dagstuhl  LeibnizZentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/opus/volltexte/2021/15534}, URN = {urn:nbn:de:0030drops155344}, doi = {10.4230/LIPIcs.FSTTCS.2021.23}, annote = {Keywords: Graph algorithms, spacebounded algorithms, surface embedded graphs, reachability, Euler genus, algorithmic graph theory, computational complexity theory} }
Keywords:  Graph algorithms, spacebounded algorithms, surface embedded graphs, reachability, Euler genus, algorithmic graph theory, computational complexity theory  
Collection:  41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2021)  
Issue Date:  2021  
Date of publication:  29.11.2021 