@InProceedings{izumi_et_al:LIPIcs.ICALP.2020.67,
  author =	{Izumi, Taisuke and Otachi, Yota},
  title =	{{Sublinear-Space Lexicographic Depth-First Search for Bounded Treewidth Graphs and Planar Graphs}},
  booktitle =	{47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
  pages =	{67:1--67:17},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-138-2},
  ISSN =	{1868-8969},
  year =	{2020},
  volume =	{168},
  editor =	{Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.67},
  URN =		{urn:nbn:de:0030-drops-124745},
  doi =		{10.4230/LIPIcs.ICALP.2020.67},
  annote =	{Keywords: depth-first search, space complexity, treewidth}
}