Fionn Mc Inerney
5 papers · 2024–2025 · 4 venues · across top CS/AI venues
Authors are matched by name, so researchers who share a name ("Yang Liu", "Wei Wang") appear as a single profile and their paper counts, venues and achievements are combined. How identity is handled.
Achievements
Jump to papers ↓
🌍
Conference Polyglot · Bronze
🌉
Interdisciplinary Bridge · Silver
🗺️
Taxonomy Completionist
(11)
Top co-authors
Research topics
Keywords
parameterized complexity
(4)
complexity analysis
(2)
teaching dimension
(2)
nash equilibrium
(1)
concept class
(1)
network optimization
(1)
machine teaching
(1)
polynomial time algorithm
(1)
network routing
(1)
routing optimization
(1)
price of anarchy
(1)
hierarchical task network
(1)
fixed-parameter tractability
(1)
polynomial algorithm
(1)
plan verification
(1)
algorithmic game theory
(1)
atomic congestion game
(1)
exponential time hypothesis
(1)
graph class
(1)
network caching
(1)
Papers
A Structural Complexity Analysis of Hierarchical Task Network Planning
IJCAI 2025
Parameterized Complexity of Caching in Networks
AAAI 2025
The Computational Complexity of Positive Non-Clashing Teaching in Graphs
ICLR 2025
Non-Clashing Teaching Maps for Balls in Graphs
COLT 2024
The Complexity of Optimizing Atomic Congestion
AAAI 2024