Fionn Mc Inerney | AC Group | TU Wienhttps://ac.notready.eu/author/fionn-mc-inerney/Fionn Mc InerneyHugo Blox Builder (https://hugoblox.com)en-usThu, 01 Jan 2026 00:00:00 +0000https://ac.notready.eu/media/logo_hu10234977157890132473.pngFionn Mc Inerneyhttps://ac.notready.eu/author/fionn-mc-inerney/Makespan Minimization in Split Learning: From Theory to Practicehttps://ac.notready.eu/publication/makespan-minimization-in-split-learning-from-theory-to-practice/Thu, 01 Jan 2026 00:00:00 +0000https://ac.notready.eu/publication/makespan-minimization-in-split-learning-from-theory-to-practice/A Structural Complexity Analysis of Hierarchical Task Network Planninghttps://ac.notready.eu/publication/a-structural-complexity-analysis-of-hierarchical-task-network-planning/Wed, 01 Jan 2025 00:00:00 +0000https://ac.notready.eu/publication/a-structural-complexity-analysis-of-hierarchical-task-network-planning/Metric Dimension and Geodetic Set Parameterized by Vertex Coverhttps://ac.notready.eu/publication/metric-dimension-and-geodetic-set-parameterized-by-vertex-cover/Wed, 01 Jan 2025 00:00:00 +0000https://ac.notready.eu/publication/metric-dimension-and-geodetic-set-parameterized-by-vertex-cover/Parameterized Complexity of Caching in Networkshttps://ac.notready.eu/publication/parameterized-complexity-of-caching-in-networks/Wed, 01 Jan 2025 00:00:00 +0000https://ac.notready.eu/publication/parameterized-complexity-of-caching-in-networks/The complexity of optimizing atomic congestionhttps://ac.notready.eu/publication/the-complexity-of-optimizing-atomic-congestion-2/Wed, 01 Jan 2025 00:00:00 +0000https://ac.notready.eu/publication/the-complexity-of-optimizing-atomic-congestion-2/The Computational Complexity of Positive Non-Clashing Teaching in Graphshttps://ac.notready.eu/publication/the-computational-complexity-of-positive-non-clashing-teaching-in-graphs/Wed, 01 Jan 2025 00:00:00 +0000https://ac.notready.eu/publication/the-computational-complexity-of-positive-non-clashing-teaching-in-graphs/Enumerating Minimal Solution Sets for Metric Graph Problemshttps://ac.notready.eu/publication/enumerating-minimal-solution-sets-for-metric-graph-problems/Mon, 01 Jan 2024 00:00:00 +0000https://ac.notready.eu/publication/enumerating-minimal-solution-sets-for-metric-graph-problems/Hypergraph Dualization with FPT-delay Parameterized by the Degeneracy and Dimensionhttps://ac.notready.eu/publication/hypergraph-dualization-with-fpt-delay-parameterized-by-the-degeneracy-and-dimension/Mon, 01 Jan 2024 00:00:00 +0000https://ac.notready.eu/publication/hypergraph-dualization-with-fpt-delay-parameterized-by-the-degeneracy-and-dimension/Non-Clashing Teaching Maps for Balls in Graphshttps://ac.notready.eu/publication/non-clashing-teaching-maps-for-balls-in-graphs/Mon, 01 Jan 2024 00:00:00 +0000https://ac.notready.eu/publication/non-clashing-teaching-maps-for-balls-in-graphs/Problems in NP Can Admit Double-Exponential Lower Bounds When Parameterized by Treewidth or Vertex Coverhttps://ac.notready.eu/publication/problems-in-np-can-admit-double-exponential-lower-bounds-when-parameterized-by-treewidth-or-vertex-cover/Mon, 01 Jan 2024 00:00:00 +0000https://ac.notready.eu/publication/problems-in-np-can-admit-double-exponential-lower-bounds-when-parameterized-by-treewidth-or-vertex-cover/Smash and grab: The 0*6 scoring game on graphshttps://ac.notready.eu/publication/smash-and-grab-the-0-6-scoring-game-on-graphs/Mon, 01 Jan 2024 00:00:00 +0000https://ac.notready.eu/publication/smash-and-grab-the-0-6-scoring-game-on-graphs/