Pierre Aboulker

activity

20122026

most citedVertex elimination orderings for hereditary graph classes

24 citations · 100 across the 34 of their papers we have counts for

collaborators

Showing 2018Show all

2 papers · 1 filter

cs.DM2018

Extension Complexity of the Correlation Polytope

Pierre Aboulker, Samuel Fiorini, Tony Huynh +2

We prove that for every $n$ -vertex graph $G$ , the extension complexity of the correlation polytope of $G$ is $2^{O (tw (G) + l o g n)}$ , where $tw (G)$ is the treewid…

math.CO2018

Distributed coloring in sparse graphs with fewer colors

Pierre Aboulker, Marthe Bonamy, Nicolas Bousquet +1

This paper is concerned with efficiently coloring sparse graphs in the distributed setting with as few colors as possible. According to the celebrated Four Color Theorem, planar gr…