@InProceedings{hlineny_et_al:LIPIcs.ICALP.2023.75,
  author =	{Hlin\v{e}n\'{y}, Petr and Jedelsk\'{y}, Jan},
  title =	{{Twin-Width of Planar Graphs Is at Most 8, and at Most 6 When Bipartite Planar}},
  booktitle =	{50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
  pages =	{75:1--75:18},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-278-5},
  ISSN =	{1868-8969},
  year =	{2023},
  volume =	{261},
  editor =	{Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.75},
  URN =		{urn:nbn:de:0030-drops-181271},
  doi =		{10.4230/LIPIcs.ICALP.2023.75},
  annote =	{Keywords: twin-width, planar graph}
}