34351 articles – 26894 Notices  [english version]
.:. Consultation > Par auteur > Addario-Berry .:.
8 documents classés par :

fulltext accessible on an other server The scaling limit of the minimum spanning tree of the complete graph
Addario-Berry L., Broutin N., Goldschmidt C., Miermont G.
(08/01/2013) [hal-00773360 - version 1]
Oriented trees in digraphs
Addario-Berry L., Havet F., Linhares Sales C., Reed B., Thomassé S.
Discrete Mathematics 313, 8 (2013) 967-974 [hal-00821609 - version 1]
fulltext accessible on an other server Cutting down trees with a Markov chainsaw
Addario-Berry L., Broutin N., Holmgren C.
(02/08/2012) [hal-00773364 - version 1]
fulltext accessible on an other server The continuum limit of critical random graphs
Addario-Berry L., Broutin N., Goldschmidt C.
Probability Theory and Related Fields 152 (2012) 367-406 [hal-00773370 - version 1]
fulltext access Oriented trees in digraphs.
Addario-Berry L., Havet F., Linhares Sales C., Reed B., Thomassé S.
N° RR-7502 (2011) [inria-00551133 - version 1]
fulltext access Guarding Art Galleries: The Extra Cost for Sculptures is Linear
Addario-Berry L., Amini O., Sereni J.-S., Thomassé S.
Dans SWAT'08: 11th Scandinavian Workshop on Algorithm Theory (2008) 41-52 [lirmm-00325147 - version 1]
fulltext access Paths with two blocks in n-chromatic digraphs
Thomassé S., Havet F., Addario-Berry L.
Journal of Combinatorial Theory Series B 97 (2007) 620-626 [lirmm-00197151 - version 1]
fulltext access Paths with two blocks in $n$-chromatic digraphs
Addario-Berry L., Thomassé S., Havet F.
N° RR-5688 (2005) [inria-00070325 - version 1]