@InProceedings{kiefer_et_al:LIPIcs.MFCS.2019.45,
  author =	{Kiefer, Sandra and Neuen, Daniel},
  title =	{{The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs}},
  booktitle =	{44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019)},
  pages =	{45:1--45:15},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-117-7},
  ISSN =	{1868-8969},
  year =	{2019},
  volume =	{138},
  editor =	{Rossmanith, Peter and Heggernes, Pinar and Katoen, Joost-Pieter},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2019.45},
  URN =		{urn:nbn:de:0030-drops-109893},
  doi =		{10.4230/LIPIcs.MFCS.2019.45},
  annote =	{Keywords: Weisfeiler-Leman, separators, first-order logic, counting quantifiers}
}