E-LIB Suche - Ergebnisse für: Mc Inerney, Fionn

1

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

Duchêne, Éric ; Gledel, Valentin ; Gravier, Sylvain...
Theoretical Computer Science. 990 (2024) - p. 114417 , 2024

Link: https://doi.org/10.1016/..

2

Hypergraph Dualization with $$\textsf{FPT}$$-delay Paramete..:

, In: Lecture Notes in Computer Science; Combinatorial Algorithms,

Bartier, Valentin ; Defrain, Oscar ; Mc Inerney, Fionn - p. 111-125 , 2024

Link: https://doi.org/10.1007/..

3

Metric Dimension Parameterized by Feedback Vertex Set and O..:

Galby, Esther ; Khazaliya, Liana ; Mc Inerney, Fionn..
SIAM Journal on Discrete Mathematics. 37 (2023) 4 - p. 2241-2264 , 2023

Link: https://doi.org/10.1137/..

4

The Maker-Breaker Largest Connected Subgraph game:

Bensmail, Julien ; Fioravantes, Foivos ; Mc Inerney, Fionn..
Theoretical Computer Science. 943 (2023) - p. 102-120 , 2023

Link: https://doi.org/10.1016/..

5

Sample Compression Schemes for Balls in Graphs:

Chalopin, Jérémie ; Chepoi, Victor ; Mc Inerney, Fionn..
SIAM Journal on Discrete Mathematics. 37 (2023) 4 - p. 2585-2616 , 2023

Link: https://doi.org/10.1137/..

6

The Complexity of Two Colouring Games:

Andres, Stephan Dominique ; Dross, François ; Huggan, Melissa A...
Algorithmica. 85 (2022) 4 - p. 1067-1090 , 2022

Link: https://doi.org/10.1007/..

7

On a vertex-capturing game:

Bensmail, Julien ; Mc Inerney, Fionn
Theoretical Computer Science. 923 (2022) - p. 27-46 , 2022

Link: https://doi.org/10.1016/..

8

The Largest Connected Subgraph Game:

Bensmail, Julien ; Fioravantes, Foivos ; Mc Inerney, Fionn.
Algorithmica. 84 (2022) 9 - p. 2533-2555 , 2022

Link: https://doi.org/10.1007/..

9

Metric dimension: From graphs to oriented graphs:

Bensmail, Julien ; Mc Inerney, Fionn ; Nisse, Nicolas
Discrete Applied Mathematics. 323 (2022) - p. 28-42 , 2022

Link: https://doi.org/10.1016/..

10

Eternal Domination: D-Dimensional Cartesian and Strong Grid..:

Mc Inerney, Fionn ; Nisse, Nicolas ; Pérennes, Stéphane
Algorithmica. 83 (2021) 5 - p. 1459-1492 , 2021

Link: https://doi.org/10.1007/..

11

The Largest Connected Subgraph Game:

, In: Graph-Theoretic Concepts in Computer Science; Lecture Notes in Computer Science,

Bensmail, Julien ; Fioravantes, Foivos ; Mc Inerney, Fionn. - p. 296-307 , 2021

Link: https://doi.org/10.1007/..

12

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

Bensmail, Julien ; Fioravantes, Foivos ; Mc Inerney, Fionn.
Discrete Applied Mathematics. 297 (2021) - p. 1-20 , 2021

Link: https://doi.org/10.1016/..

13

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

Bensmail, Julien ; Fioravantes, Foivos ; Mc Inerney, Fionn
Theoretical Computer Science. 892 (2021) - p. 238-257 , 2021

Link: https://doi.org/10.1016/..

14

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

, In: Lecture Notes in Computer Science; Algorithms and Complexity,

Bensmail, Julien ; Fioravantes, Foivos ; Mc Inerney, Fionn - p. 103-115 , 2021

Link: https://doi.org/10.1007/..

15

The game of Cops and Eternal Robbers:

Bonato, Anthony ; Huggan, Melissa A. ; Marbach, Trent G..
Theoretical Computer Science. 874 (2021) - p. 80-93 , 2021

Link: https://doi.org/10.1016/..