22 citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- Centre National de la Recherche ScientifiqueFR7 papers
- Institut national de recherche en sciences et technologies du numériqueFR6 papers
- Laboratoire d'Informatique, Signaux et Systèmes de Sophia AntipolisFR6 papers
- Université Côte d'AzurFR5 papers
- Laboratoire Bordelais de Recherche en InformatiqueFR3 papers
- École Normale Supérieure de LyonFR2 papers
- McGill UniversityCA2 papers
- University of Rome Tor VergataIT2 papers
- AGH University of KrakowPL1 paper
- Aix-Marseille UniversitéFR1 paper
- Center for Mathematical ModelingCL1 paper
- Columbia UniversityUS1 paper
Showing 2016Show all
3 papers · 1 filter
math.CO2016★ 16 cited
A Variant of the Erdős-Sós Conjecture
Frédéric Havet, Bruce Reed, Maya Stein +1
A well-known conjecture of Erdős and Sós states that every graph with average degree exceeding contains every tree with edges as a subgraph. We propose a variant of this…
cs.CC2016★ 3 cited
On computing tree and path decompositions with metric constraints on the bags
Guillaume Ducoffe, Sylvain Legay, Nicolas Nisse
We here investigate on the complexity of computing the \emph{tree-length} and the \emph{tree-breadth} of any graph , that are respectively the best possible upper-bounds on the…
math.CO2016★ 18 cited
How to determine if a random graph with a fixed degree sequence has a giant component
Felix Joos, Guillem Perarnau, Dieter Rautenbach +1
For a fixed degree sequence , let be a uniformly chosen (simple) graph on where the vertex has degree . In this p…