@InProceedings{brause_et_al:LIPIcs.ISAAC.2021.21,
  author =	{Brause, Christoph and Golovach, Petr and Martin, Barnaby and Paulusma, Dani\"{e}l and Smith, Siani},
  title =	{{Partitioning H-Free Graphs of Bounded Diameter}},
  booktitle =	{32nd International Symposium on Algorithms and Computation (ISAAC 2021)},
  pages =	{21:1--21:14},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-214-3},
  ISSN =	{1868-8969},
  year =	{2021},
  volume =	{212},
  editor =	{Ahn, Hee-Kap and Sadakane, Kunihiko},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2021.21},
  URN =		{urn:nbn:de:0030-drops-154543},
  doi =		{10.4230/LIPIcs.ISAAC.2021.21},
  annote =	{Keywords: vertex partitioning problem, H-free, diameter, complexity dichotomy}
}