@InProceedings{eppstein_et_al:LIPIcs.FUN.2021.13,
  author =	{Eppstein, David and Frishberg, Daniel and Maxwell, William},
  title =	{{On the Treewidth of Hanoi Graphs}},
  booktitle =	{10th International Conference on Fun with Algorithms (FUN 2021)},
  pages =	{13:1--13:21},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-145-0},
  ISSN =	{1868-8969},
  year =	{2020},
  volume =	{157},
  editor =	{Farach-Colton, Martin and Prencipe, Giuseppe and Uehara, Ryuhei},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2021.13},
  URN =		{urn:nbn:de:0030-drops-127741},
  doi =		{10.4230/LIPIcs.FUN.2021.13},
  annote =	{Keywords: Hanoi graph, Treewidth, Graph separators, Kneser graph, Vertex expansion, Haven, Tensor product}
}