Fionn Mc Inerney

Orcid: 0000-0002-5634-9506

Affiliations:

CISPA Helmholtz Center for Information Security, Saarbrücken, Germany

According to our database¹, Fionn Mc Inerney authored at least 39 papers between 2018 and 2025.

Collaborative distances:

Dijkstra number² of three.
Erdős number³ of three.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Bibliography

2025

The complexity of optimizing atomic congestion.

[BibT_eX]

[DOI]

Cornelius Brand

Robert Ganian

Subrahmanyam Kalyanasundaram

Fionn Mc Inerney

Artif. Intell., 2025

2024

Smash and grab: The 0 ⋅ 6 scoring game on graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2024

Parameterized Complexity of Caching in Networks.

[BibT_eX]

[DOI]

Robert Ganian

Fionn Mc Inerney

Dimitra Tsigkari

CoRR, 2024

Metric Dimension and Geodetic Set Parameterized by Vertex Cover.

[BibT_eX]

[DOI]

CoRR, 2024

The Boundaries of Tractability in Hierarchical Task Network Planning.

[BibT_eX]

[DOI]

CoRR, 2024

Enumerating Minimal Solution Sets for Metric Graph Problems.

[BibT_eX]

[DOI]

Benjamin Bergougnoux

Oscar Defrain

Fionn Mc Inerney

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2024

Hypergraph Dualization with FPT-delay Parameterized by the Degeneracy and Dimension.

[BibT_eX]

[DOI]

Valentin Bartier

Oscar Defrain

Fionn Mc Inerney

Proceedings of the Combinatorial Algorithms - 35th International Workshop, 2024

Problems in NP Can Admit Double-Exponential Lower Bounds When Parameterized by Treewidth or Vertex Cover.

[BibT_eX]

[DOI]

Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

Non-Clashing Teaching Maps for Balls in Graphs.

[BibT_eX]

[DOI]

Proceedings of the Thirty Seventh Annual Conference on Learning Theory, June 30, 2024

2023

Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., December, 2023

Sample Compression Schemes for Balls in Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., December, 2023

The Complexity of Two Colouring Games.

[BibT_eX]

[DOI]

Stephan Dominique Andres

François Dross

Melissa A. Huggan

Fionn Mc Inerney

Richard J. Nowakowski

Algorithmica, April, 2023

The Maker-Breaker Largest Connected Subgraph game.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2023

Tight (Double) Exponential Bounds for NP-Complete Problems: Treewidth and Vertex Cover Parameterizations.

[BibT_eX]

[DOI]

CoRR, 2023

Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs Part II: Hardness Results.

[BibT_eX]

[DOI]

CoRR, 2023

Minimal dominating sets enumeration with FPT-delay parameterized by the degeneracy and maximum degree.

[BibT_eX]

[DOI]

Valentin Bartier

Oscar Defrain

Fionn Mc Inerney

CoRR, 2023

Complexity of Maker-Breaker Games on Edge Sets of Graphs.

[BibT_eX]

[DOI]

CoRR, 2023

Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs.

[BibT_eX]

[DOI]

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

2022

On a vertex-capturing game.

[BibT_eX]

[DOI]

Julien Bensmail

Fionn Mc Inerney

Theor. Comput. Sci., 2022

On {a, b}-edge-weightings of bipartite graphs with odd a, b.

[BibT_eX]

[DOI]

Julien Bensmail

Fionn Mc Inerney

Kasper Szabo Lyngsie

Discuss. Math. Graph Theory, 2022

Metric dimension: From graphs to oriented graphs.

[BibT_eX]

[DOI]

Julien Bensmail

Fionn Mc Inerney

Nicolas Nisse

Discret. Appl. Math., 2022

Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs Part I: Algorithmic Results.

[BibT_eX]

[DOI]

CoRR, 2022

The Largest Connected Subgraph Game.

[BibT_eX]

[DOI]

Algorithmica, 2022

2021

The game of Cops and Eternal Robbers.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

On the role of 3s for the 1-2-3 Conjecture.

[BibT_eX]

[DOI]

Julien Bensmail

Foivos Fioravantes

Fionn Mc Inerney

Theor. Comput. Sci., 2021

On Generalisations of the AVD Conjecture to Digraphs.

[BibT_eX]

[DOI]

Julien Bensmail

Fionn Mc Inerney

Graphs Comb., 2021

Further results on an equitable 1-2-3 Conjecture.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2021

Weighted total acquisition.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2021

Eternal Domination: D-Dimensional Cartesian and Strong Grids and Everything in Between.

[BibT_eX]

[DOI]

Fionn Mc Inerney

Nicolas Nisse

Stéphane Pérennes

Algorithmica, 2021

On the Role of 3's for the 1-2-3 Conjecture.

[BibT_eX]

[DOI]

Julien Bensmail

Foivos Fioravantes

Fionn Mc Inerney

Proceedings of the Algorithms and Complexity - 12th International Conference, 2021

2020

Corrigendum to "The orthogonal colouring game" [Theor. Comput. Sci. 795 (2019) 312-325].

[BibT_eX]

[DOI]

Stephan Dominique Andres

Melissa A. Huggan

Fionn Mc Inerney

Richard J. Nowakowski

Theor. Comput. Sci., 2020

A method for eternally dominating strong grids.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2020

Study of a Combinatorial Game in Graphs Through Linear Programming.

[BibT_eX]

[DOI]

Algorithmica, 2020

Sequential Metric Dimension.

[BibT_eX]

[DOI]

Algorithmica, 2020

2019

Domination and Identification Games in Graphs. (Jeux de Domination et d'Identification dans les Graphes).

[BibT_eX]

[DOI]

Fionn Mc Inerney

PhD thesis, 2019

Hyperopic Cops and Robbers.

[BibT_eX]

[DOI]

Margaret-Ellen Messinger

Theor. Comput. Sci., 2019

The orthogonal colouring game.

[BibT_eX]

[DOI]

Stephan Dominique Andres

Melissa A. Huggan

Fionn Mc Inerney

Richard J. Nowakowski

Theor. Comput. Sci., 2019

Eternal Domination in Grids.

[BibT_eX]

[DOI]

Fionn Mc Inerney

Nicolas Nisse

Stéphane Pérennes

Proceedings of the Algorithms and Complexity - 11th International Conference, 2019

2018

Spy-game on graphs: Complexity and simple topologies.

[BibT_eX]

[DOI]

Nathann Cohen

Nicolas Almeida Martins

Theor. Comput. Sci., 2018

Fionn Mc Inerney

Timeline

Legend:

Links

Online presence:

On csauthors.net:

Bibliography

Loading...