@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:1--23:15},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-215-0},
  ISSN =	{1868-8969},
  year =	{2021},
  volume =	{213},
  editor =	{Boja\'{n}czyk, Miko{\l}aj and Chekuri, Chandra},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2021.23},
  URN =		{urn:nbn:de:0030-drops-155344},
  doi =		{10.4230/LIPIcs.FSTTCS.2021.23},
  annote =	{Keywords: Graph algorithms, space-bounded algorithms, surface embedded graphs, reachability, Euler genus, algorithmic graph theory, computational complexity theory}
}