@InProceedings{wlodarczyk:LIPIcs.ISAAC.2024.57,
  author =	{W{\l}odarczyk, Micha{\l}},
  title =	{{Constant Approximating Disjoint Paths on Acyclic Digraphs Is W\lbrack1\rbrack-Hard}},
  booktitle =	{35th International Symposium on Algorithms and Computation (ISAAC 2024)},
  pages =	{57:1--57:16},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-354-6},
  ISSN =	{1868-8969},
  year =	{2024},
  volume =	{322},
  editor =	{Mestre, Juli\'{a}n and Wirth, Anthony},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2024.57},
  URN =		{urn:nbn:de:0030-drops-221853},
  doi =		{10.4230/LIPIcs.ISAAC.2024.57},
  annote =	{Keywords: fixed-parameter tractability, hardness of approximation, disjoint paths}
}