@InProceedings{fluck_et_al:LIPIcs.CSL.2024.27,
  author =	{Fluck, Eva and Seppelt, Tim and Spitzer, Gian Luca},
  title =	{{Going Deep and Going Wide: Counting Logic and Homomorphism Indistinguishability over Graphs of Bounded Treedepth and Treewidth}},
  booktitle =	{32nd EACSL Annual Conference on Computer Science Logic (CSL 2024)},
  pages =	{27:1--27:17},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-310-2},
  ISSN =	{1868-8969},
  year =	{2024},
  volume =	{288},
  editor =	{Murano, Aniello and Silva, Alexandra},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2024.27},
  URN =		{urn:nbn:de:0030-drops-196704},
  doi =		{10.4230/LIPIcs.CSL.2024.27},
  annote =	{Keywords: Treewidth, treedepth, homomorphism indistinguishability, counting first-order logic}
}