default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFionn Mc Inerney
Person information
- affiliation: CISPA Helmholtz Center for Information Security, Saarbrücken, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2019
[b1]Fionn Mc Inerney:
Domination and Identification Games in Graphs. (Jeux de Domination et d'Identification dans les Graphes). University of Côte d'Azur, Nice, France, 2019
Journal Articles
- 2025
- [j23]Cornelius Brand, Robert Ganian, Subrahmanyam Kalyanasundaram, Fionn Mc Inerney:
The complexity of optimizing atomic congestion. Artif. Intell. 338: 104241 (2025) - 2024
- [j22]Éric Duchêne, Valentin Gledel, Sylvain Gravier, Fionn Mc Inerney
, Mehdi Mhalla, Aline Parreau:
Smash and grab: The 0 ⋅ 6 scoring game on graphs. Theor. Comput. Sci. 990: 114417 (2024) - 2023
- [j21]Stephan Dominique Andres, François Dross, Melissa A. Huggan, Fionn Mc Inerney, Richard J. Nowakowski:
The Complexity of Two Colouring Games. Algorithmica 85(4): 1067-1090 (2023) - [j20]Esther Galby, Liana Khazaliya, Fionn Mc Inerney, Roohani Sharma, Prafullkumar Tale:
Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters. SIAM J. Discret. Math. 37(4): 2241-2264 (2023) - [j19]Jérémie Chalopin, Victor Chepoi, Fionn Mc Inerney, Sébastien Ratel, Yann Vaxès:
Sample Compression Schemes for Balls in Graphs. SIAM J. Discret. Math. 37(4): 2585-2616 (2023) - [j18]Julien Bensmail, Foivos Fioravantes, Fionn Mc Inerney, Nicolas Nisse, Nacim Oijid:
The Maker-Breaker Largest Connected Subgraph game. Theor. Comput. Sci. 943: 102-120 (2023) - 2022
- [j17]Julien Bensmail, Foivos Fioravantes, Fionn Mc Inerney, Nicolas Nisse:
The Largest Connected Subgraph Game. Algorithmica 84(9): 2533-2555 (2022) - [j16]Julien Bensmail, Fionn Mc Inerney, Nicolas Nisse:
Metric dimension: From graphs to oriented graphs. Discret. Appl. Math. 323: 28-42 (2022) - [j15]Julien Bensmail, Fionn Mc Inerney, Kasper Szabo Lyngsie:
On {a, b}-edge-weightings of bipartite graphs with odd a, b. Discuss. Math. Graph Theory 42(1): 159-185 (2022) - [j14]Julien Bensmail, Fionn Mc Inerney:
On a vertex-capturing game. Theor. Comput. Sci. 923: 27-46 (2022) - 2021
- [j13]Fionn Mc Inerney, Nicolas Nisse, Stéphane Pérennes:
Eternal Domination: D-Dimensional Cartesian and Strong Grids and Everything in Between. Algorithmica 83(5): 1459-1492 (2021) - [j12]Julien Bensmail, Foivos Fioravantes, Fionn Mc Inerney, Nicolas Nisse:
Further results on an equitable 1-2-3 Conjecture. Discret. Appl. Math. 297: 1-20 (2021) - [j11]Guillaume Bagan, Valentin Gledel, Marc Heinrich, Fionn Mc Inerney:
Weighted total acquisition. Discret. Appl. Math. 304: 260-282 (2021) - [j10]Julien Bensmail, Fionn Mc Inerney:
On Generalisations of the AVD Conjecture to Digraphs. Graphs Comb. 37(2): 545-558 (2021) - [j9]Anthony Bonato, Melissa A. Huggan, Trent G. Marbach, Fionn Mc Inerney:
The game of Cops and Eternal Robbers. Theor. Comput. Sci. 874: 80-93 (2021) - [j8]Julien Bensmail, Foivos Fioravantes, Fionn Mc Inerney:
On the role of 3s for the 1-2-3 Conjecture. Theor. Comput. Sci. 892: 238-257 (2021) - 2020
- [j7]Nathann Cohen, Fionn Mc Inerney, Nicolas Nisse, Stéphane Pérennes:
Study of a Combinatorial Game in Graphs Through Linear Programming. Algorithmica 82(2): 212-244 (2020) - [j6]Julien Bensmail, Dorian Mazauric, Fionn Mc Inerney, Nicolas Nisse, Stéphane Pérennes:
Sequential Metric Dimension. Algorithmica 82(10): 2867-2901 (2020) - [j5]Alizée Gagnon, Alexander Hassler, Jerry Huang, Aaron Krim-Yee, Fionn Mc Inerney, Andrés Zacarías, Ben Seamone, Virgélot Virgile:
A method for eternally dominating strong grids. Discret. Math. Theor. Comput. Sci. 22(1) (2020) - [j4]Stephan Dominique Andres, Melissa A. Huggan, Fionn Mc Inerney, Richard J. Nowakowski:
Corrigendum to "The orthogonal colouring game" [Theor. Comput. Sci. 795 (2019) 312-325]. Theor. Comput. Sci. 842: 133-135 (2020) - 2019
- [j3]Anthony Bonato, Nancy E. Clarke, Danielle Cox, Stephen Finbow, Fionn Mc Inerney, Margaret-Ellen Messinger:
Hyperopic Cops and Robbers. Theor. Comput. Sci. 794: 59-68 (2019) - [j2]Stephan Dominique Andres, Melissa A. Huggan, Fionn Mc Inerney, Richard J. Nowakowski:
The orthogonal colouring game. Theor. Comput. Sci. 795: 312-325 (2019) - 2018
- [j1]Nathann Cohen, Nicolas Almeida Martins, Fionn Mc Inerney, Nicolas Nisse, Stéphane Pérennes, Rudini M. Sampaio:
Spy-game on graphs: Complexity and simple topologies. Theor. Comput. Sci. 725: 1-15 (2018)
Conference and Workshop Papers
- 2024
- [c13]Cornelius Brand, Robert Ganian, Subrahmanyam Kalyanasundaram, Fionn Mc Inerney:
The Complexity of Optimizing Atomic Congestion. AAAI 2024: 20044-20052 - [c12]Jérémie Chalopin, Victor Chepoi, Fionn Mc Inerney, Sébastien Ratel:
Non-Clashing Teaching Maps for Balls in Graphs. COLT 2024: 840-875 - [c11]Florent Foucaud, Esther Galby, Liana Khazaliya, Shaohua Li, Fionn Mc Inerney, Roohani Sharma, Prafullkumar Tale:
Problems in NP Can Admit Double-Exponential Lower Bounds When Parameterized by Treewidth or Vertex Cover. ICALP 2024: 66:1-66:19 - [c10]Valentin Bartier, Oscar Defrain, Fionn Mc Inerney:
Hypergraph Dualization with FPT-delay Parameterized by the Degeneracy and Dimension. IWOCA 2024: 111-125 - 2023
- [c9]Jacob Focke, Dániel Marx, Fionn Mc Inerney, Daniel Neuen, Govind S. Sankar, Philipp Schepper, Philip Wellnitz:
Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs. SODA 2023: 3664-3683 - 2022
- [c8]Jérémie Chalopin, Victor Chepoi, Fionn Mc Inerney, Sébastien Ratel, Yann Vaxès:
Sample Compression Schemes for Balls in Graphs. MFCS 2022: 31:1-31:14 - [c7]Esther Galby, Liana Khazaliya, Fionn Mc Inerney, Roohani Sharma, Prafullkumar Tale:
Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters. MFCS 2022: 51:1-51:15 - 2021
- [c6]Julien Bensmail, Foivos Fioravantes, Fionn Mc Inerney:
On the Role of 3's for the 1-2-3 Conjecture. CIAC 2021: 103-115 - [c5]Julien Bensmail, Foivos Fioravantes, Fionn Mc Inerney, Nicolas Nisse:
The Largest Connected Subgraph Game. WG 2021: 296-307 - 2019
- [c4]Fionn Mc Inerney, Nicolas Nisse, Stéphane Pérennes:
Eternal Domination in Grids. CIAC 2019: 311-322 - [c3]Julien Bensmail, Fionn Mc Inerney, Nicolas Nisse:
Metric Dimension: from Graphs to Oriented Graphs. LAGOS 2019: 111-123 - 2018
- [c2]Julien Bensmail, Dorian Mazauric, Fionn Mc Inerney, Nicolas Nisse, Stéphane Pérennes:
Sequential Metric Dimension. WAOA 2018: 36-50 - 2017
- [c1]Nathann Cohen, Fionn Mc Inerney, Nicolas Nisse, Stéphane Pérennes:
Study of a Combinatorial Game in Graphs Through Linear Programming. ISAAC 2017: 22:1-22:13
Informal and Other Publications
- 2024
- [i15]Cornelius Brand, Robert Ganian, Fionn Mc Inerney, Simon Wietheger:
The Boundaries of Tractability in Hierarchical Task Network Planning. CoRR abs/2401.14174 (2024) - [i14]Florent Foucaud, Esther Galby, Liana Khazaliya, Shaohua Li, Fionn Mc Inerney, Roohani Sharma, Prafullkumar Tale:
Metric Dimension and Geodetic Set Parameterized by Vertex Cover. CoRR abs/2405.01344 (2024) - 2023
- [i13]Éric Duchêne, Valentin Gledel, Fionn Mc Inerney, Nicolas Nisse, Nacim Oijid, Aline Parreau, Milos Stojakovic:
Complexity of Maker-Breaker Games on Edge Sets of Graphs. CoRR abs/2302.10972 (2023) - [i12]Valentin Bartier, Oscar Defrain, Fionn Mc Inerney:
Minimal dominating sets enumeration with FPT-delay parameterized by the degeneracy and maximum degree. CoRR abs/2305.06974 (2023) - [i11]Jacob Focke, Dániel Marx, Fionn Mc Inerney, Daniel Neuen, Govind S. Sankar, Philipp Schepper, Philip Wellnitz:
Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs Part II: Hardness Results. CoRR abs/2306.03640 (2023) - [i10]Florent Foucaud, Esther Galby, Liana Khazaliya, Shaohua Li, Fionn Mc Inerney, Roohani Sharma, Prafullkumar Tale:
Tight (Double) Exponential Bounds for NP-Complete Problems: Treewidth and Vertex Cover Parameterizations. CoRR abs/2307.08149 (2023) - [i9]Jérémie Chalopin, Victor Chepoi, Fionn Mc Inerney, Sébastien Ratel:
Non-Clashing Teaching Maps for Balls in Graphs. CoRR abs/2309.02876 (2023) - [i8]Benjamin Bergougnoux, Oscar Defrain, Fionn Mc Inerney:
Enumerating minimal solution sets for metric graph problems. CoRR abs/2309.17419 (2023) - [i7]Cornelius Brand, Robert Ganian, Subrahmanyam Kalyanasundaram, Fionn Mc Inerney:
The Complexity of Optimizing Atomic Congestion. CoRR abs/2312.10219 (2023) - 2022
- [i6]Jérémie Chalopin, Victor Chepoi, Fionn Mc Inerney, Sébastien Ratel, Yann Vaxès:
Sample compression schemes for balls in graphs. CoRR abs/2206.13254 (2022) - [i5]Esther Galby, Liana Khazaliya, Fionn Mc Inerney, Roohani Sharma, Prafullkumar Tale:
Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters. CoRR abs/2206.15424 (2022) - [i4]Jacob Focke, Dániel Marx, Fionn Mc Inerney, Daniel Neuen, Govind S. Sankar, Philipp Schepper, Philip Wellnitz:
Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs Part I: Algorithmic Results. CoRR abs/2211.04278 (2022) - 2020
- [i3]Alizée Gagnon, Alexander Hassler, Jerry Huang, Aaron Krim-Yee, Fionn Mc Inerney, Andrés Zacarías, Ben Seamone, Virgélot Virgile:
A method for eternally dominating strong grids. CoRR abs/2003.01495 (2020) - [i2]Anthony Bonato, Melissa A. Huggan, Trent G. Marbach, Fionn Mc Inerney:
The Game of Cops and Eternal Robbers. CoRR abs/2003.03791 (2020) - 2017
- [i1]Anthony Bonato, Nancy E. Clarke, Danielle Cox, Stephen Finbow, Fionn Mc Inerney, Margaret-Ellen Messinger:
Hyperopic Cops and Robbers. CoRR abs/1710.10112 (2017)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-07 21:29 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
