I agree that this site is using cookies. You can find further informations here.
X
Bonnet, Edouard
406  results:
OpenAccess-fulltext X
Search for persons X
?
1

Neighbourhood complexity of graphs of bounded twin-width:

Bonnet, Édouard ; Foucaud, Florent ; Lehtilä, Tuomo.
info:eu-repo/semantics/altIdentifier/arxiv/2301.04217.  , 2024
Link: https://hal.science/hal-..
 
?
2

Neighbourhood complexity of graphs of bounded twin-width:

Bonnet, Édouard ; Foucaud, Florent ; Lehtilä, Tuomo.
info:eu-repo/semantics/altIdentifier/arxiv/2301.04217.  , 2024
Link: https://hal.science/hal-..
 
?
3

Neighbourhood complexity of graphs of bounded twin-width:

Bonnet, Édouard ; Foucaud, Florent ; Lehtilä, Tuomo.
info:eu-repo/semantics/altIdentifier/arxiv/2301.04217.  , 2024
Link: https://hal.science/hal-..
 
?
4

Neighbourhood complexity of graphs of bounded twin-width:

Bonnet, Édouard ; Foucaud, Florent ; Lehtilä, Tuomo.
info:eu-repo/semantics/altIdentifier/arxiv/2301.04217.  , 2024
Link: https://hal.science/hal-..
 
?
5

Factoring Pattern-Free Permutations into Separable ones:

Bonnet, Édouard ; Bourneuf, Romain ; Geniet, Colin.
hal-04292977.  , 2024
Link: https://hal.science/hal-..
 
?
6

Neighbourhood complexity of graphs of bounded twin-width:

Bonnet, Édouard ; Foucaud, Florent ; Lehtilä, Tuomo.
info:eu-repo/semantics/altIdentifier/arxiv/2301.04217.  , 2024
Link: https://hal.science/hal-..
 
?
7

Neighbourhood complexity of graphs of bounded twin-width:

Bonnet, Édouard ; Foucaud, Florent ; Lehtilä, Tuomo.
info:eu-repo/semantics/altIdentifier/arxiv/2301.04217.  , 2024
Link: https://hal.science/hal-..
 
?
8

Neighbourhood complexity of graphs of bounded twin-width:

Bonnet, Édouard ; Foucaud, Florent ; Lehtilä, Tuomo.
info:eu-repo/semantics/altIdentifier/arxiv/2301.04217.  , 2024
Link: https://hal.science/hal-..
 
?
9

Small But Unwieldy: A Lower Bound on Adjacency Labels for S..:

Bonnet, Edouard ; Duron, Julien ; Sylvester, John..
hal-04292984.  , 2024
Link: https://hal.science/hal-..
 
?
10

Neighbourhood complexity of graphs of bounded twin-width:

Bonnet, Édouard ; Foucaud, Florent ; Lehtilä, Tuomo.
info:eu-repo/semantics/altIdentifier/arxiv/2301.04217.  , 2024
Link: https://hal.science/hal-..
 
?
11

Treewidth Is NP-Complete on Cubic Graphs:

Bodlaender, Hans L ; Bonnet, Édouard ; Jaffke, Lars...
Is Part Of LIPIcs, Volume 285, 18th International Symposium on Parameterized and Exact Computation (IPEC 2023).  , 2023
Link: https://doi.org/10.4230/..
 
?
12

Treewidth is NP-Complete for Cubic Graphs (and related resu..:

Bodlaender, Hans, L ; Bonnet, Edouard ; Jaffke, Lars...
hal-04292980.  , 2023
Link: https://hal.science/hal-..
 
?
13

Twin-width V: linear minors, modular counting, and matrix m..:

Bonnet, Edouard ; Giocanti, Ugo ; Ossona de Mendez, Patrice.
info:eu-repo/semantics/altIdentifier/doi/10.4230/LIPIcs.STACS.2023.15.  , 2023
Link: https://hal.science/hal-..
 
?
14

Tight bounds on adjacency labels for monotone graph classes:

Bonnet, Édouard ; Duron, Julien ; Sylvester, John..
http://arxiv.org/abs/2310.20522.  , 2023
Link: http://arxiv.org/abs/231..
 
?
15

Twin-width and permutations:

Bonnet, Édouard ; Nesetril, Jaroslav ; Ossona de Mendez, Patrice..
http://journals.muni.cz/eurocomb/article/view/35556/31429.  , 2023
Link: http://journals.muni.cz/..
 
1-15