@InProceedings{dondi_et_al:LIPIcs.SAND.2024.10,
  author =	{Dondi, Riccardo and Lafond, Manuel},
  title =	{{On the Complexity of Temporal Arborescence Reconfiguration}},
  booktitle =	{3rd Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2024)},
  pages =	{10:1--10:15},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-315-7},
  ISSN =	{1868-8969},
  year =	{2024},
  volume =	{292},
  editor =	{Casteigts, Arnaud and Kuhn, Fabian},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2024.10},
  URN =		{urn:nbn:de:0030-drops-198888},
  doi =		{10.4230/LIPIcs.SAND.2024.10},
  annote =	{Keywords: Arborescence, Temporal Graphs, Graph Algorithms, Parameterized Complexity, Approximation Complexity}
}