I agree that this site is using cookies. You can find further informations here.
X
HAVET, FRÉDÉRIC
5  results:
Bookchapter (Online) X
Search for persons X
?
1

On the Minimum Number of Arcs in 4-Dicritical Oriented Grap..:

, In: Graph-Theoretic Concepts in Computer Science; Lecture Notes in Computer Science,
Havet, Frédéric ; Picasarri-Arrieta, Lucas ; Rambaud, Clément - p. 376-387 , 2023
Link: https://doi.org/10.1007/..
 
?
2

On the Dichromatic Number of Surfaces:

, In: Trends in Mathematics; Extended Abstracts EuroComb 2021,
Aboulker, Pierre ; Havet, Frédéric ; Knauer, Kolja. - p. 181-187 , 2021
Link: https://doi.org/10.1007/..
 
?
3

Overlaying a Hypergraph with a Graph with Bounded Maximum D..:

, In: Algorithms and Discrete Applied Mathematics; Lecture Notes in Computer Science,
Havet, Frédéric ; Mazauric, Dorian ; Nguyen, Viet-Ha. - p. 403-414 , 2020
Link: https://doi.org/10.1007/..
 
?
4

L(2,1)-labelling of graphs:

, In: Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms,
Havet, Frédéric ; Reed, Bruce ; Sereni, Jean-Sébastien - p. 621-630 , 2008
Link: https://dl.acm.org/doi/1..
 
?
5

The push tree problem:

, In: Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures,
Havet, Frédéric ; Wennink, Marc - p. 318-319 , 2001
Link: https://dl.acm.org/doi/1..
 
1-5