@InProceedings{blazej_et_al:LIPIcs.IPEC.2024.4,
  author =	{Bla\v{z}ej, V\'{a}clav and Jana, Satyabrata and Ramanujan, M. S. and Strulo, Peter},
  title =	{{On the Parameterized Complexity of Eulerian Strong Component Arc Deletion}},
  booktitle =	{19th International Symposium on Parameterized and Exact Computation (IPEC 2024)},
  pages =	{4:1--4:20},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-353-9},
  ISSN =	{1868-8969},
  year =	{2024},
  volume =	{321},
  editor =	{Bonnet, \'{E}douard and Rz\k{a}\.{z}ewski, Pawe{\l}},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2024.4},
  URN =		{urn:nbn:de:0030-drops-222306},
  doi =		{10.4230/LIPIcs.IPEC.2024.4},
  annote =	{Keywords: Parameterized complexity, Eulerian graphs, Treewidth}
}