Fionn Mc Inerney

From MaRDI portal
(Redirected from Person:1748986)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Problems in NP can admit double-exponential lower bounds when parameterized by treewidth or vertex cover2026-01-14Paper
Tight complexity bounds for counting generalized dominating sets in bounded-treewidth graphs. I: Algorithmic results
ACM Transactions on Algorithms
2025-10-01Paper
Tight complexity bounds for counting generalized dominating sets in bounded-treewidth graphs. II: Hardness results
ACM Transactions on Computation Theory
2025-08-01Paper
Enumerating minimal solution sets for metric graph problems
Algorithmica
2025-05-22Paper
Enumerating minimal solution sets for metric graph problems2025-05-02Paper
Hypergraph dualization with \textsf{FPT}-delay parameterized by the degeneracy and dimension2025-02-28Paper
The complexity of optimizing atomic congestion
Artificial Intelligence
2025-01-17Paper
Complexity of maker-breaker games on edge sets of graphs
Discrete Applied Mathematics
2025-01-06Paper
Tight complexity bounds for counting generalized dominating sets in bounded-treewidth graphs2024-05-14Paper
Smash and grab: the \(0 \cdot 6\) scoring game on graphs
Theoretical Computer Science
2024-02-20Paper
Sample Compression Schemes for Balls in Graphs
SIAM Journal on Discrete Mathematics
2023-11-14Paper
Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters
SIAM Journal on Discrete Mathematics
2023-10-13Paper
Enumerating minimal solution sets for metric graph problems2023-09-29Paper
Non-Clashing Teaching Maps for Balls in Graphs2023-09-06Paper
The complexity of two colouring games
Algorithmica
2023-04-11Paper
On the role of 3's for the 1-2-3 conjecture2023-03-22Paper
The maker-breaker largest connected subgraph game
Theoretical Computer Science
2023-01-05Paper
Metric dimension: from graphs to oriented graphs
Discrete Applied Mathematics
2022-11-02Paper
The largest connected subgraph game
Algorithmica
2022-08-18Paper
On a vertex-capturing game
Theoretical Computer Science
2022-06-13Paper
The largest connected subgraph game
Graph-Theoretic Concepts in Computer Science
2022-06-08Paper
Metric dimension: from graphs to oriented graphs
Electronic Notes in Theoretical Computer Science
2022-04-27Paper
On \(\{a, b\}\)-edge-weightings of bipartite graphs with odd \(a, b\)
Discussiones Mathematicae Graph Theory
2022-01-03Paper
On the role of 3s for the 1-2-3 conjecture
Theoretical Computer Science
2021-10-21Paper
Weighted total acquisition
Discrete Applied Mathematics
2021-09-30Paper
The game of cops and eternal robbers
Theoretical Computer Science
2021-06-22Paper
Further results on an equitable 1-2-3 conjecture
Discrete Applied Mathematics
2021-04-29Paper
Eternal domination: \(D\)-dimensional Cartesian and strong grids and everything in between
Algorithmica
2021-04-19Paper
On generalisations of the AVD conjecture to digraphs
Graphs and Combinatorics
2021-03-17Paper
A method for eternally dominating strong grids
(available as arXiv preprint)
2020-10-28Paper
Corrigendum to: ``The orthogonal colouring game''
Theoretical Computer Science
2020-10-12Paper
Sequential metric dimension
Algorithmica
2020-10-12Paper
Study of a combinatorial game in graphs through linear programming
Algorithmica
2020-04-09Paper
The Game of Cops and Eternal Robbers
(available as arXiv preprint)
2020-03-08Paper
Eternal domination in grids2020-02-06Paper
The orthogonal colouring game
Theoretical Computer Science
2019-10-18Paper
Sequential metric dimension
Approximation and Online Algorithms
2019-01-15Paper
Spy-game on graphs: complexity and simple topologies
Theoretical Computer Science
2018-05-15Paper
Hypergraph dualization with FPT-delay parameterized by the degeneracy and dimension
(available as arXiv preprint)
N/APaper
The Maker-Breaker Largest Connected Subgraph Game
(available as arXiv preprint)
N/APaper


Research outcomes over time


This page was built for person: Fionn Mc Inerney