14 citations · 39 across the 11 of their papers we have counts for
Showing 2015Show all
2 papers · 1 filter
cs.CC2015★ 2 cited
Average-case complexity of a branch-and-bound algorithm for maximum independent set, under the random model
N. Bourgeois, R. Catellier, T. Denat +1
We study average-case complexity of branch-and-bound for maximum independent set in random graphs under the distribution. In this model every pair of ver…
math.PR2015★ 8 cited
Rough linear transport equation with an irregular drift
Rémi Catellier
We study the linear transport equation \[ \frac{\partial}{\partial t} u ( t,x ) +b ( t,x ) \cdot \nabla u ( t,x ) + \nabla u ( t,x ) \cdot \frac{\partial}{\partial t} X ( t ) =0, \…