E-LIB Suche - Ergebnisse für: Foucaud, Florent

1

Extremal digraphs for open neighbourhood location-dominatio..:

Foucaud, Florent ; Ghareghani, Narges ; Sharifani, Pouyeh
Discrete Applied Mathematics. 347 (2024) - p. 62-74 , 2024

2

On Graphs Coverable by \({k}\) Shortest Paths:

Dumas, Maël ; Foucaud, Florent ; Perez, Anthony.
SIAM Journal on Discrete Mathematics. 38 (2024) 2 - p. 1840-1862 , 2024

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

3

Connected greedy colourings of perfect graphs and other cla..:

Beaudou, Laurent ; Brosse, Caroline ; Defrain, Oscar...
Discrete Mathematics & Theoretical Computer Science. 25:2 (2024) Graph Theory - p. , 2024

Link: https://doi.org/10.46298..

4

Neighbourhood complexity of graphs of bounded twin-width:

Bonnet, Édouard ; Foucaud, Florent ; Lehtilä, Tuomo.
European Journal of Combinatorics. 115 (2024) - p. 103772 , 2024

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

5

Monitoring Edge-Geodetic Sets in Graphs: Extremal Graphs, B..:

, In: Algorithms and Discrete Applied Mathematics; Lecture Notes in Computer Science,

Foucaud, Florent ; Marcille, Pierre-Marie ; Myint, Zin Mar... - p. 29-43 , 2024

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

6

The RED-BLUE SEPARATION problem on graphs:

Dev, Subhadeep Ranjan ; Dey, Sanjana ; Foucaud, Florent..
Theoretical Computer Science. 970 (2023) - p. 114061 , 2023

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

7

Parameterizing Path Partitions:

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

Fernau, Henning ; Foucaud, Florent ; Mann, Kevin.. - p. 187-201 , 2023

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

8

On Three Domination-Based Identification Problems in Block ..:

, In: Algorithms and Discrete Applied Mathematics; Lecture Notes in Computer Science,

Chakraborty, Dipayan ; Foucaud, Florent ; Parreau, Aline. - p. 271-283 , 2023

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

9

New Bounds and Constructions for Neighbor-Locating Coloring..:

, In: Algorithms and Discrete Applied Mathematics; Lecture Notes in Computer Science,

Chakraborty, Dipayan ; Foucaud, Florent ; Nandi, Soumen.. - p. 121-133 , 2023

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

10

Monitoring Edge-Geodetic Sets in Graphs:

, In: Algorithms and Discrete Applied Mathematics; Lecture Notes in Computer Science,

Foucaud, Florent ; Narayanan, Krishna ; Ramasubramony Sulochana, Lekshmi - p. 245-256 , 2023

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

11

Relation Between Broadcast Domination and Multipacking Numb..:

, In: Algorithms and Discrete Applied Mathematics; Lecture Notes in Computer Science,

Das, Sandip ; Foucaud, Florent ; Islam, Sk Samim. - p. 297-308 , 2023

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

12

Identifying codes in bipartite graphs of given maximum degr..:

Chakraborty, Dipayan ; Foucaud, Florent ; Lehtilä, Tuomo
Procedia Computer Science. 223 (2023) - p. 157-165 , 2023

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

13

Algorithms and Hardness for Metric Dimension on Digraphs:

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

Dailly, Antoine ; Foucaud, Florent ; Hakanen, Anni - p. 232-245 , 2023

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

14

Distance-Based Covering Problems for Graphs of Given Cyclom..:

, In: Fundamentals of Computation Theory; Lecture Notes in Computer Science,

Chakraborty, Dibyayan ; Foucaud, Florent ; Hakanen, Anni - p. 132-146 , 2023

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

15

Revisiting and Improving Upper Bounds for Identifying Codes:

Foucaud, Florent ; Lehtilä, Tuomo
SIAM Journal on Discrete Mathematics. 36 (2022) 4 - p. 2619-2634 , 2022

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