Items where Author is "Mc Inerney, Fionn"

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Group by: Item Type | No Grouping
Number of items: 6.

Focke, Jacob and Marx, Dániel and Mc Inerney, Fionn and Neuen, Daniel and Sankar, Govind and Schepper, Philipp and Wellnitz, Philip
(2023) Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs.
In: ACM-SIAM Symposium on Discrete Algorithms (SODA 2023).
Conference: SODA ACM/SIAM Symposium on Discrete Algorithms
(In Press)

Galby, Esther and Khazaliya, Liana and Mc Inerney, Fionn and Sharma, Roohani and Tale, Prafullkumar
(2022) Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters.
In: MFCS 2022.
Conference: MFCS International Symposium on Mathematical Foundations of Computer Science

Chalopin, Jérémie and Chepoi, Victor and Mc Inerney, Fionn and Ratel, Sébastien and Vaxès, Yann
(2022) Sample Compression Schemes for Balls in Graphs.
In: MFCS 2022.
Conference: MFCS International Symposium on Mathematical Foundations of Computer Science

Bensmail, Julien and Mc Inerney, Fionn
(2022) On a vertex-capturing game.
Theoretical Computer Science, 923. pp. 27-46. ISSN 0304-3975

Bensmail, Julien and Fioravantes, Foivos and Mc Inerney, Fionn and Nisse, Nicolas
(2022) The Largest Connected Subgraph Game.
Algorithmica, 84 (9). pp. 2533-2555. ISSN 0178-4617

Bensmail, Julien and Fioravantes, Foivos and Mc Inerney, Fionn and Nisse, Nicolas
(2021) The Largest Connected Subgraph Game.
In: WG 2021.
Conference: WG International Workshop on Graph-Theoretic Concepts in Computer Science

This list was generated on Thu Nov 21 12:42:00 2024 CET.
CISPA is powered by EPrints 3 which is developed by the School of Electronics and Computer Science at the University of Southampton. More information and software credits.